约瑟夫问题

#include <iostream>
using namespace std;
int arr[1000];
char getchar_T(void)
{
    #define BufferMax 1024
    static char buffer[BufferMax];
    static int idx = BufferMax;
    if(idx==BufferMax)
        fread(buffer,1,sizeof(buffer),stdin),idx=0;
    return buffer[idx++];
    #undef BufferMax
}
int getint(void)
{
    char ch;
    int num=0;
    while(ch=getchar_T(),!isdigit(ch))
        continue;
    num=ch-'0';
    while(ch=getchar_T(),isdigit(ch))
        num=num*10+(ch-'0');
    return num;
}
int main(void)
{
    int N=getint();
    while(N--)
    {
        int n=getint(),m=getint();
        for(int i=0;i!=m;++i)
            arr[i]=getint();
        int ans=0;
        for(int i=2;i<=n;++i)
            ans=(ans+arr[(n-i)%m])%i;
        cout<<ans<<endl;
    }
    return 0;
}