#include <cstdio>

 typedef long long LL;

 const int maxn =  + ;

 const LL M = ;

 LL c[maxn][maxn], d[maxn];

 inline LL mul(LL a, LL b) { return (a * b) % M; }

 void init()

 {

     for(int i = ; i < maxn; i++) c[i][] = c[i][i] = ;

     for(int i = ; i < maxn; i++)

         for(int j = ; j < i; j++)

             c[i][j] = (c[i-][j] + c[i-][j-]) % M;

     d[] = ; d[] = ; d[] = ;

     for(int i = ; i < maxn; i++) d[i] = mul(i-, (d[i-] + d[i-]) % M);

 }

 int main()

 {

     //freopen("in.txt", "r", stdin);

     init();

     int T; scanf("%d", &T);

     for(int kase = ; kase <= T; kase++)

     {

         int n, m, k;

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

         LL ans = ;

         for(int i = ; i <= n - m; i++)

             ans = (ans + mul(c[n-m][i], d[n-k-i])) % M;

         ans = (ans * c[m][k]) % M;

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

     }

     return ;

 }