#include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <string>
#include <stdio.h>

using namespace std;

long long dp[100000005] = {}, MOD = 1000003;

long long pow(long long x, long long n) {
	if (n == 0) return 1;
	long long ret;
	ret = pow(x * x % MOD, n / 2) % MOD;
	if (n % 2 != 0) ret = ret * x % MOD;
	return ret;
}

int main() {

	long long x, N, a[105], ans = 0;
	cin >> x >> N;
	for (int i = 0; i < N; i++) {
		cin >> a[i];
	}

	/*
	sort(a,a+N);
	long long cnt = 1;

	for (int j = 0; j < a[0]; j++) {
		cnt = cnt * x % MOD;
	}
	ans = cnt;
	//cout << 0 << ": " << cnt << endl;

	for (int i = 1; i < N; i++) {
		for (int j = a[i-1]; j < a[i]; j++) {
			cnt = cnt * x % MOD;
		}
		//cout <<i<< ": " << cnt << endl;
		ans = (ans + cnt) % MOD;
	}
	*/

	for (int i = 0; i < N; i++) {
		ans = ( ans + pow(x, a[i])) % MOD;
	}

	cout << ans << endl;

	return 0;
}