#include <stdio.h>
#include <stdlib.h>
int main()
{
  int X;
  int N;
  int *A;
  scanf("%d", &X);
  scanf("%d", &N);
  A = (int*)malloc(sizeof(int)*N);
  int i;
  for (i=0; i<N; i++) scanf("%d", &(A[i]));

  int mod = 1000003;

// 2^26 =   67108864
// A[i] <= 100000000
// 2^27 =  134217728
// 
//   A[i] =     2^26  *bit[26] +...+    2^0  *bit[0]
// X^A[i] =  X^(2^26  *bit[26])*...* X^(2^0  *bit[0])
//        = (X^(2^26))^bit[26] *...*(X^(2^0))^bit[0]

  int table_n = 27;
  long long int *table = (long long*)malloc(sizeof(long long int)*table_n);
  table[0] = (X % mod);
  for (i=1; i<table_n; i++) {
    table[i] = ((table[i-1]*table[i-1]) % mod);
  }

  int j;
  long long int total;
  long long int item;
  if (X == 1) {
    total = N;
    total %= mod;
  } else {
    total = 0;
    for (i=0; i<N; i++) {
      item = 1;
      if (A[i] != 0) {
        for (j=0; j<table_n; j++) {
          if (A[i] & (1 << j)) {
            item *= table[j];
            item %= mod;
          }
        }
      }
      total += item;
      total %= mod;
    }
  }

  printf("%d\n", total);
  return 0;
}