#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000003
#define INF 1000000000
#define LLINF 2000000000000000000LL

#define LOG2 27
#define SIZE 100

int main(){
    int x,N;
    ll N_2[LOG2],ans=0;
    int a[SIZE];
    
    scanf("%d%d",&x,&N);
    
    for(int i=0;i<N;i++){
        scanf("%d",&a[i]);
    }
    
    N_2[0]=(ll)x;
    
    for(int i=0;i<LOG2-1;i++){
        N_2[i+1]=(N_2[i]*N_2[i])%mod;
    }
    
    for(int i=0;i<N;i++){
        int b = 1;
        
        for(int j=0;a[i]>0;j++){
            if(a[i]%2){
                b=(b*N_2[j])%mod;
            }
            a[i]/=2;
        }
        
        ans=(ans+b)%mod;
    }
    
    printf("%d\n",(int)ans);
    return 0;
}