#include <iostream>
#include <algorithm>
using namespace std;

#define HOU 1000003

int main(void) {
    int x, N;
    cin >> x >> N;
    int a[N+1];
    for (int i = 0; i < N; i++) {
        cin >> a[i];
    }
    sort(a, a+N, greater<int>());
    a[N] = -1;
    int index = 0;
    int result = 0;
    for (int i = a[0]; i >= 0; i--) {
        for (;i == a[index];) {
            result += 1;
            index++;
        }
        if (i == 0) {
            break;
        }
        result = (result * x) % HOU;
    }
    cout << (result % HOU) << endl;
    
    return 0;
}