#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std; // NOLINT

const auto MOD = int64_t(1e6) + 3;

int64_t f(int32_t x, int32_t y) {
    if (y == 0)
        return 1;
    auto z = f(x, y / 2);
    z = z * z % MOD;
    if (y % 2)
        z = z * x % MOD;
    return z;
}

int main() {
    int32_t x, n;
    cin >> x >> n;
    vector<int32_t> as(n);
    for (auto &&a : as) {
        cin >> a;
    }
    int64_t ans = 0;
    for (auto a : as) {
        auto b = f(x, a);
        ans = (ans + b) % MOD;
    }
    cout << ans << endl;
    return 0;
}