代码：

//
// Created by 徐志远 on 2019-09-28.
//

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;

int n,m;
#define MAXN 1010
int a[MAXN];
int f[MAXN][MAXN];

int main(){
    cin>>n>>m;
    if(n>m){
        printf("YES\n");
        return 0;
    }
    for(int i=1;i<=n;i++){
        cin>>a[i];
        a[i]%=m;
        f[i][a[i]] = 1;
        for(int j = 0;j<=m;j++){
            f[i][j] += f[i-1][j];
            f[i][(j+a[i])%m] += f[i-1][j];
            if(f[i][0]) {
                printf("YES\n"); return 0;
            }
        }
    }
    printf("NO\n");


    return 0;
}