#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cstdio>
#include <bitset>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <functional>
#include <stack>
#include <cmath>
#include <string>
#include <complex>
#include <cassert>
using namespace std;

typedef long long ll;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const int INF = (1<<30)-1;
//const int MOD = 1e9+7;
const int MOD = 1000003;
const ll LINF = (1ll<<62)-1;

#define REP(i,n) for(int i=0;i<(n);++i)
#define COUT(x) cout<<(x)<<"\n"
#define COUT16(x) cout << fixed << setprecision(16) << (x) << "\n";

/**
 *繰り返し二乗法
 *時間計算量:O(logn)
 *空間計算量:O(1)
**/
long long powpow(long long x,long long n){///通常のpow
    long long ret = 1;
    while(n>0){
        if(n&1)ret *= x;
        x *= x;
        n >>= 1; //nを1bit右にずらす
    }
    return ret;
}

long long powmod(long long x,long long n){//MODを取る時
    long long ret = 1;
    while(n>0){
        if(n&1)ret = ret * x % MOD;
        x = x*x % MOD;
        n >>= 1; //nを1bit右にずらす
    }
    return ret;
}

int main(){
    ll x,n,a;cin >> x >> n;
    ll ans = 0;
    REP(i,n){
        cin >> a;
        ans += powmod(x,a);
        ans %= MOD;
    }
    COUT(ans);
}