import java.util.Arrays;
import java.util.Scanner;

public class N016 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long x=sc.nextLong(),n=sc.nextLong();
		long[] a=new long[(int)n];
		for(long i=0;i<n;i++){
			a[(int)i]=sc.nextLong();
		}
		Arrays.sort(a);
		long mem=1;
		long cnt=0;
		long ans=0;
		long beki=(long)Math.pow(10, 6)+3;
		long buf=(long)Math.pow(x, 9)%beki;
		long buf1=(long)Math.pow(x, 60)%beki;
		for(int i=0;i<n;i++){
			long dif=a[i]-cnt;
			if(dif>=9){
				while(dif>=9){
					dif-=9;
					mem=(mem*buf)%beki;
				}
				mem=(mem*((long)Math.pow(x, dif)%beki))%beki;
			}else{
				mem*=((long)Math.pow(x, dif)%beki);
			}
			ans=(ans+mem)%beki;
			cnt+=(a[i]-cnt);
		}
		System.out.println(ans);
	}
}