#include<algorithm>
#define MOD 1000003
using namespace std;
int n,m,a[100001];
void solve(){
    int i;
    long long unsigned prev,next;
    scanf("%d%d",&n,&m);
    for(i=1; i<=m; ++i)
        scanf("%d",&a[i]);
    for(i=m+1,prev=1; i<=n; prev=next,++i)
        next=(i-1)*prev;
    printf("%lld",next%MOD);}
int main(){
    freopen("grigo.in","r",stdin);
    freopen("grigo.out","w",stdout);
    solve();
    return 0;}