UVA 11805 - Bafana Bafana : Solution

#include <stdio.h>
int main()
{
    int t, c=1,n,k,p;
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d%d%d",&n,&k,&p);
        k=k+p%n;
        if (k>n) k=k-n;
        printf("Case %d: %d\n",c++,k);
    }
    return 0;
}