#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int Maxm = 5100;
bool v[Maxm]; int n, m;
int main (){
    int i, j, k, T;
    scanf ( "%d", &T );
    while ( T -- ){
        scanf ( "%d%d", &n, &m );
        memset ( v, false, sizeof (v) );
        bool bk = false;
        int p = 0;
        v[0] = true;
        for ( i = 1; i <= n; i ++ ){
            int x;
            scanf ( "%d", &x );
            p = (p+x)%m;
            if ( v[p] == true ) bk = true;
            v[p] = true;
        }
        if ( bk == true ) printf ( "YES\n" );
        else printf ( "NO\n" );
    }
    return 0;
}