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

int64_t mod_pow(int64_t x, int64_t n, int m) {
    int64_t res = 1;
    x %= m;
    while (n > 0) {
        if (n & 1) (res *= x) %= m;
        (x *= x) %= m;
        n >>= 1;
    }
    return res;
}

int main() {
    int x, N;
    cin >> x >> N;
    vector<int> a(N);
    for (int i = 0; i < N; ++i) {
        cin >> a[i];
    }
    const int MOD = 1'000'003;
    int ans = 0;
    for (auto aa : a) {
        (ans += mod_pow(x, aa, MOD)) %= MOD;
    }
    cout << ans << endl;

    return 0;
}