// No.16 累乗の加算
#include <iostream>
using namespace std;
const int MOD = 1'000'003;
typedef long long ll;

int mod_pow(ll a, ll b, int mod = MOD) {
    ll res = 1;
    while (b) {
        if (b & 1) {
            res *= a;
            res %= mod;
        }
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return res;
}

int main() {
    int x, N;
    cin >> x >> N;
    ll res = 0;
    for (int i = 0; i < N; ++i) {
        int a;
        cin >> a;
        res += mod_pow(x, a);
        res %= MOD;
    }
    cout << res << endl;
}