#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <sstream>
#include <functional>
#include <ctime>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n)  FOR(i,0,n)
#define CLEAR(d) memset((d), 0, (sizeof((d))))
#define ALL(c) (c).begin(), (c).end()
#define ABS(x) ((x < 0) ? -(x) : (x))
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).begin(), (x).end(), greater<int>() )
#define SIZE(a) ((int)((a).size()))
#define MOD 1000003
#define EPS 1e-7
#define PI  (acos(-1))
#define INF 10000000
struct edge { int to; int cost; };
//===================================================

int leastSquaresMethod(ll x, int n)
{
    if (n == 0) return 1;
    if (n % 2) {
        return (leastSquaresMethod((x * x) % MOD, n / 2) % MOD) * x % MOD;
    }
    return leastSquaresMethod((x * x) % MOD, n / 2) % MOD;
}

int main()
{
    int x, a, N, sum = 0;
    cin >> x >> N;
    REP(i, N) {
        cin >> a;
        sum += leastSquaresMethod(x, a);
        sum %= MOD;
    }
    cout << sum << endl;
    return 0;
}