#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

#define rep(i, r) for(int i = 0; i < (r); ++i)
#define reps(i, s, r) for(int i = (s); i < (r); ++i)
#define fore(i, m2) for(auto &i : m2)
#define vi vector<int>
#define vl vector<ll>
#define pl pair<ll, ll>
#define all(i) (i).begin(), (i).end()
#define fs first
#define sc second

template <class T> bool chmin(T &i, T b) {
    if(i > b) {
        i = b;
        return true;
    }
    return false;
}
template <class T> bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

const ll INF = LONG_LONG_MAX / 3;
const ll MOD = 1'000'000'007;
const ll MAX = 1e4 + 5;

ll modpow(ll a, ll b, ll m) {

    ll ans, p;

    ans = 1, p = a;
    rep(i, 30) {
        // AND, OR, XORはイコール系より優先順位が低いので注意
        if((b & (1 << i)) != 0) {
            ans *= p;
            ans %= m;
        }
        p *= p;
        p %= m;
    }

    return ans;
}

int main() {

    ll x, n;
    cin >> x >> n;
    vl a(n);
    ll sum = 0, tmp = 0, md = 1e6 + 3;
    rep(i, n) {
        cin >> tmp;
        tmp = modpow(x, tmp, md);
        sum = (sum + tmp) % md;
    }

    cout << sum << endl;
}