#include<bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int sg[maxn];
int grundy(int n, int m) {
if(sg[n] != -1) {
return sg[n];
}
if(n < m) {
return sg[n] = 0;
}
int g = 0;
bool vis[maxn];
memset(vis, 0, sizeof(vis));
for(int i = 0; i <= n - m; i++) {
vis[grundy(n - m - i, m) ^ grundy(i, m)] = 1;
}
while(vis[g]) {
++g;
}
return sg[n] = g;
}
int main() {
int t, n, m, kase = 0;
scanf("%d", &t);
while(t--) {
scanf("%d%d", &n, &m);
if(n < m) {
printf("Case #%d: ", ++kase);
printf("abcdxyzk\n");
continue;
}
memset(sg, -1, sizeof(sg));
grundy(n - m, m);
printf("Case #%d: ", ++kase);
printf("%s\n", sg[n - m] ? "abcdxyzk" : "aekdycoin");
}
return 0;
}