UVA 11805 - Bafana Bafana

#include<bits/stdc++.h>
#define i64 long long
#define mx(a,b,c) max(a,max(b,c))
#define mn(a,b,c) min(a,min(b,c))
#define eef else if
#define ff(i,s,e) for(int i=(s); i<e; i++)
#define ff2(i,s,e) for(int i=(s); i>=e; i--)
#define sf scanf
#define pf printf
#define dbug(x) cout<<"x = "<<x<<endl
#define newl cout<<"\n"
#define putcase cout<<"Case "<<++cse<<":"
#define putcase2 cout<<"Case #"<<++cse<<":"
using namespace std;
int main()
{
   int testCases;

    scanf ("%d", &testCases);

    int cases = 0;

    while ( testCases-- ) {

        int n, k, p;

        scanf ("%d %d %d", &n, &k, &p);

        while (p--) {

            k++;

            if (k > n) k = 1;

        }

        printf ("Case %d: %d\n", ++cases, k);
    }
    return 0;
}