#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)

ll powmod(ll x, ll n, ll mod){
    ll res = 1LL;
    while(n){
        if(n & 1LL) res = res * x % mod;
        x = x * x % mod;
        n >>= 1LL;
    }
    return res;
}

int main(){
    ll x; int N;
    cin >> x >> N;
    vector<ll> a(N);
    for(ll &aa : a) cin >> aa;

    const ll mod = 1000003LL;
    ll ans = 0LL;
    rep(i, 0, N){
        ans = (ans + powmod(x, a[i], mod)) % mod;
    }

    cout << ans << endl;
    return 0;
}