UVA_11805_Bafana_Bafana

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define LL unsigned long long
using namespace std;

int main() {
    int t,n,k,p;
    scanf("%d",&t);int cont=1;
    while(t--){
        scanf("%d %d %d",&n,&k,&p);
        int f=(k+p)%n;
        if(f==0) printf("Case %d: %d\n",cont,n);
        else printf("Case %d: %d\n",cont,f);
        cont++;
    }

    return 0;
}