#include <bits/stdc++.h>

#define inf 0x3f3f3f3f

#define MAX 1e3

#define FRE() freopen("in.txt","r",stdin)

#define FRO() freopen("out.txt","w",stdout)

using namespace std;

typedef long long ll;

typedef pair<int, int> P;

const int maxn = ;

int a[maxn],vis[maxn];

int n,m,k;

void init(){

    memset(vis,,sizeof(vis));

    a[] = ,a[] = ,a[] = ;

    for(int i=; i<=n; i++){

        a[i] = (a[i-]+a[i-]+a[i-])%m+;

    }

}

int main(){

   // FRE();

    int kase=,T;

    scanf("%d",&T);

    while(T--){

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

        init();

        if(k > m || k>n){

            printf("Case %d: sequence nai\n",++kase);

            continue;

        }

        int ans = ;

        int st=,en=,tot=;

        while(en <= n){

            int t = a[en++];

            vis[t]++;

            if(t<=k && vis[t]==) tot++;//标记区间个数get！！

            while(st<en && tot==k){

                ans = min(ans, en-st);

                t = a[st++];

                vis[t]--;

                if(t<=k && vis[t]==) tot--;//标记区间个数

            }

            //cout<<"en: "<<en<<"  st:  "<<st<<endl;

        }

        if(ans>n){

            printf("Case %d: sequence nai\n",++kase);

        }else{

            printf("Case %d: %d\n",++kase,ans);

        }

    }

    return ;

}