#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <array>
#include <map>
#include <stack>
#include <queue>
#include <set>

using namespace std;

long pow(long x, long n, long m) {
    long ans = 1;
    while (n > 0) {
        if ((n & 1) == 1) {
            ans = (ans * x) % m;
        }
        x = x * x % m;
        n = n >> 1;
    }
    return ans % m;
}

int main() {

    int x, N;
    cin >> x >> N;

    map<long, long> m;
    long modulo = 1000003;
    long a;
    long result = 0;
    for (int j = 0; j < N; ++j) {
        cin >> a;
        if (m.find(a) != m.end()) {
            result += m[a];
        } else {
            long b = pow(x, a, modulo);
            result += b;
            m[a] = b;
        }
    }

    cout << (result % modulo) << "\n";

    return 0;
}