#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
bool f[5100];
int a[100100];
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        memset(f, 0, sizeof(f));
        int n, m, pre = 0;
        scanf("%d%d", &n, &m);
        f[pre] = 1;
        for (int i = 0; i < n; ++i) {
            scanf("%d", &a[i]);
        }
        for (int i = 0; i < n; ++i) {
            pre += a[i];
            while (pre >= m)
                pre -= m;
            if (f[pre]) {
                printf("YES\n");
                goto label;
            }
            f[pre] = 1;
        }
        printf("NO\n");
    label:
        continue;
    }
    return 0;
}