ccpc 2018 final G - Pastoral Life in Stardew Valley

#include <iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
#define ll long long
const int N  =;
const ll mod  = ;
ll c[N][];
void init()
{
    c[][] =1ll;
    for(int i =;i<N;i++){
        for(int j =;j<=;j++){
            if(j==||j==i)  c[i][j]=1ll;
            else c[i][j]  =  (c[i-][j-]%mod+c[i-][j]%mod)%mod;
        }
    }
}
int  t,n,m;
int  main()
{
    init();
    scanf("%d",&t);
    for(int i =;i<=t;i++)
    {
        scanf("%d%d",&n,&m);
        if(n<||m<) printf("Case %d: 0\n",i);
        else{
            ll  x = (c[n][]+c[n][])%mod;
            ll y = (c[m][]+c[m][])%mod;
            x=(x*y)%mod;
             printf("Case %d: %lld\n",i,x);
        }
    }
    return  ;
}