#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const int inf = 1000000009;
const ll mod = 1000003;

ll m_pow(ll x, int a) {
    ll res = 1;
    while (a > 0) {
	if (a & 1)
	    res = (res * x) % mod;
	x = (x * x) % mod;
	a >>= 1;
    }
    return res;
}

int main() {
    ll x;
    int n;
    scanf("%lld%d", &x, &n);
    ll res = 0;
    for (int i = 0; i < n; i++) {
	int a;
	scanf("%d", &a);
	res = (res + m_pow(x, a)) % mod;
    }
    printf("%lld\n", res);
}