#include <bits/stdc++.h>
using namespace std;
ifstream fin("grigo.in");
ofstream fout("grigo.out");
int vc[100001],dp[100001];
#define mod 1000003

int main()
{
    int n,m,i,a;
    fin>>n>>m;
    for(i=1;i<=m;++i){
        fin>>a;
        vc[a]=1;
    }
    dp[1]=1;
    for(i=2;i<=n;++i){
        if(vc[i]==0)
            dp[i]=(1LL*dp[i-1]*(i-1))%mod;
        else
            dp[i]=dp[i-1];
    }
    fout<<dp[n];
    return 0;
}