#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 1000003;

ll modpow(ll a, ll e, ll m){
    ll r = 1;
    while (e){
        if (e&1) r = r*a%m;
        a = a*a%m;
        e >>= 1;
    }
    return r;
}

int main(){
    int X, N;
    cin >> X >> N;

    ll ans = 0;
    for (int i = 0; i < N; i++){
        int a;
        cin >> a;
        ans = (ans+modpow(X, a, MOD))%MOD;
    }

    cout << ans << endl;
}