#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

const int MAXN = 111;
const ll MOD = 1000003;
ll x, a[MAXN];
int N;

ll mod_pow(ll x, ll p) {
    if (p == 0) return 1;
    if (p == 1) return x;
    if (p%2) return (x*mod_pow(x, p-1))%MOD;
    else {
        ll tmp = mod_pow(x, p/2);
        return (tmp*tmp)%MOD;
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> x >> N;
    for (int i = 0; i < N; i++) cin >> a[i];
    ll ans = 0;
    for (int i = 0; i < N; i++) {
        (ans += mod_pow(x, a[i])) %= MOD;
    }
    cout << ans << endl;
    return 0;
}