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

ll mod_pow(ll n, ll k, ll p) {
    ll ret = 1, mul = n;
    for (ll i = 0; i < 63; i++) {
        if (k >> i & 1) {
            ret = (ret * mul) % p;
        }
        mul = (mul * mul) % p;
    }
    return ret;
}

int main() {
    int x, n;
    cin >> x >> n;
    int mod = 1000003, ans = 0;
    vector<ll> a(n);
    for (ll i = 0; i != a.size(); i++) {
        cin >> a[i];
    }

    for (ll i = 0; i != a.size(); i++) {
        ans = (ans + mod_pow(x, a[i], mod)) % mod;
    }
    cout<<ans<<endl;

    // system("pause");
}