1 #include<cstdio>
 2 #include<algorithm>
 3 #define rep(i,l,r) for (int i=l; i<=r; i++)
 4 using namespace std;
 5
 6 const int N=400100,mod=1005060097,g=5;
 7 int n,m,x,rev[N],tmp[N],a[N],b[N],c[N],ic[N],lg[N];
 8
 9 int ksm(int a,int b){
10     int res;
11     for (res=1; b; a=1ll*a*a%mod,b>>=1)
12         if (b & 1) res=1ll*res*a%mod;
13     return res;
14 }
15
16 void DFT(int a[],int n,int f){
17     for (int i=0; i<n; i++) if (i<rev[i]) swap(a[i],a[rev[i]]);
18     for (int i=1; i<n; i<<=1){
19         int wn=ksm(g,(f==1) ? (mod-1)/(i<<1) : (mod-1)-(mod-1)/(i<<1));
20         for (int p=i<<1,j=0; j<n; j+=p){
21             int w=1;
22             for (int k=0; k<i; k++,w=1ll*w*wn%mod){
23                 int x=a[j+k],y=1ll*w*a[i+j+k]%mod; a[j+k]=(x+y)%mod; a[i+j+k]=(x-y+mod)%mod;
24             }
25         }
26     }
27     if (f==1) return;
28     int inv=ksm(n,mod-2);
29     for (int i=0; i<n; i++) a[i]=1ll*a[i]*inv%mod;
30 }
31
32 void get(int a[],int b[],int l){
33     if (l==1){ b[0]=ksm(a[0],mod-2); return; }
34     get(a,b,l>>1); int n=l<<1;
35     for (int i=0; i<l; i++) tmp[i]=a[i],tmp[i+l]=0;
36     for (int i=0; i<n; i++) rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg[n]-1));
37     DFT(tmp,n,1); DFT(b,n,1);
38     for (int i=0; i<n; i++) tmp[i]=1ll*b[i]*(2-1ll*tmp[i]*b[i]%mod+mod)%mod;
39     DFT(tmp,n,-1);
40     for (int i=0; i<l; i++) b[i]=tmp[i],b[i+l]=0;
41 }
42
43 int main(){
44     freopen("polypeptide.in","r",stdin);
45     freopen("polypeptide.out","w",stdout);
46     scanf("%d%d",&n,&m); c[0]=1;
47     rep(i,2,n<<2) lg[i]=lg[i>>1]+1;
48     rep(i,1,m) scanf("%d",&x),c[x]++;
49     rep(i,1,n) c[i]=mod-c[i];
50     for (m=1; m<=n; m<<=1); get(c,ic,m);
51     printf("%d\n",ic[n]);
52     return 0;
53 }