import java.util.Scanner;

public class Main {

	@SuppressWarnings("resource")
	public static void main(String args[]) {
		Scanner scanner = new Scanner(System.in);
		int x=scanner.nextInt();
		int n=scanner.nextInt();
		int mod=1000003;
		long ans=0;
		for(int i=0;i<n;i++){
			int a=scanner.nextInt();
			ans+=mod_pow(x,a,mod);
			ans=ans%mod;
		}
		System.out.println(ans);
	}

	public static long mod_pow(long x, long n, int mod) {
		if(n == 0) {
			return 1;
		}
		if(n % 2  == 0) {
			return mod_pow(x * x % mod, n / 2, mod);
		}else {
			return x * mod_pow(x, n - 1, mod) % mod;
		}
	}
	
	
}