#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  for(int i=0;i<(n);i++)
#define FORq(i, m, n) for(int i = (m);i <= (n);++i)
#define SCD(n) scanf("%d",&n)
#define SCD2(m,n) scanf("%d%d",&m,&n)
#define SCD3(m,n,k) scanf("%d%d%d",&m,&n,&k)
#define PB push_back
#define MP make_pair
#define ARSCD(A,N) REP(i,N){SCD(A[i]);}
#define ARSCD1(A,N) FORq(i,1,N){SCD(A[i]);}
#define PRINTD(n) printf("%d\n",n)
#define PRINTLLD(n) printf("%lld\n",n)
#define DEBUG printf("%s\n","debug")
#define fst first
#define snd second
using namespace std;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef long long ll;
//////////////////////////////////////////////////////
const ll p = 1000003;
map<int,ll>dic;

ll ppow(ll x,ll n){
	if (dic[n] != 0) return dic[n];
	
	if (n % 2 == 0){
		dic[n] = (ppow(x,n/2) * ppow(x,n/2)) % p; 
		return dic[n];
	}else{
		dic[n] = (x * ppow(x,n/2) * ppow(x,n/2) % p) % p;
		return dic[n];
	}

}

int main(){
	ll ans = 0;
	ll x,N; scanf("%lld%lld",&x,&N);
	ll a[101];

	REP(i,N){
		ll z; scanf("%lld",&z);
		a[i] = z;
	}
	
	dic[0] = 1;
	
	REP(i,N){
		ans = (ppow(x,a[i]) + ans) % p;
	}
	
	PRINTLLD(ans);
	return 0;
}