#include <iostream>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int(i)=0;(i)<(n);++(i))
typedef unsigned long long ull;
int x, N, a, MOD = 1000003;
ull res;
int binpow(ull x, ull k, int m){
    if(k==0) return 1;
    if(k%2==0) return binpow(((x%m)*(x%m))%m, k/2, m);
    else return ((x%m)*binpow(x, k-1, m)) % m;
}
int main(){
    cin >> x >> N;
    REP(i,N){ cin >> a; res += binpow(x, a, MOD); }
    cout << res%MOD << endl;
    return 0;
}