#include <iostream>
using namespace std;
const long long M = 1e6 + 3;
int or_pow(int n, int m)
{
    if(m <= 0) return 1;
    if(m == 1) return n;
    int k = or_pow(n, m/2);
    int l = ((k % M) * (k % M)) % M;
    if(m % 2 == 0) return l;
    else return (l * (n % M)) % M;
}
int main()
{
    int x, n, a, ans = 0;
    cin >> x >> n;
    for(int i = 0; i < n; i++){
        cin >> a;
        ans = (ans + or_pow(x, a)) % M;
    }
    cout << ans << endl;
    return 0;
}