#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

ll mod_pow(ll x, ll n, ll mod){ // x ^ n % mod
    ll res = 1;
    while(n > 0){
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    ll x, n;
    cin >> x >> n;
    ll a[n];
    rep(i,n)cin >> a[i];
    ll ans = 0;
    ll MOD = 1e6+3;
    rep(i,n){
        ans += mod_pow(x,a[i],MOD);
        ans %= MOD;
    }
    cout << ans << endl;
    return 0;
}