#include <iostream>
#include <cstdio>
#include <string.h>
#include <queue>
#include <algorithm>
#include <math.h>
using namespace std;
int dp[320][50005];
int main()
{
    int tcase,t=1;
    scanf("%d",&tcase);
    while(tcase--){
        int n,m;
        scanf("%d%d",&n,&m);
        int k = 0;
        while(k*(k+1)<=2*n) k++;
        memset(dp,0,sizeof(dp));
        dp[0][0] = 1;
        for(int i=1;i<=k;i++){
            for(int j=i;j<=n;j++){
                dp[i][j] = (dp[i][j-i]+dp[i-1][j-i])%m;
            }
        }
        int ans = 0;
        for(int i=1;i<=k;i++){
            ans = (ans+dp[i][n])%m;
        }
        printf("Case #%d: %d\n",t++,ans);
    }
    return 0;
}