#include <bits/stdc++.h>
using namespace std;

using ll = long long;

// 繰り返し自乗法(x^nをmで割った余り) O(logn)
ll power(ll x, ll n, ll m) {
  ll res = 1;
  if (n > 0) {
    res = power(x, n / 2, m);
    if (n % 2 == 0) res = (res * res) % m;
    else res = ((res * res % m) * x) % m;
  }
  return res;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  
  ll x, n;
  cin >> x >> n;
  
  ll ans = 0;
  for (int i = 0; i < n; i++) {
    ll a;
    cin >> a;
    ans += power(x, a, 1000003);
  }
  
  cout << ans % 1000003 << '\n';
}