记住迭代关系 
f[n] = f[n-1] + Ak.//（k对应人数n时 所选）n代表当前人数 

static int DP(int[]a, int n, int m, int k){
    if(n==1) return 0;
    return (DP(a, n-1, m, (k+1)%m) + a[k])%n; 
}

public static void main(String[] args)throws Exception{

    int T = nextInt();
    int n, m;

    while(T--!=0){
        n = nextInt(); m = nextInt();
        int []a = new int[m];
        for(int i=0; i<m; i++) a[i] = nextInt();
        int f = 0;
        int start = (n - 2) % m;
        for(int i=0; i<n-1; i++){
            f += a[(n-2-i)%m];
            f %= (i+2);
        }
       // out.println(DP(a, n, m, 0));
    }
    out.close();

}