#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define ll long long
#define MOD 4207849484LL

int len, M;
ll dp[1200];
char in[1200];

int main(){
  int i,j,k;
  int size, count = 0;
  ll res;

  scanf("%d",&size);
  while(size--){
    scanf("%d%s",&M,in);
    len = strlen(in);

    rep(i,len+1) dp[i] = 0;
    dp[0] = 1;

    rep(i,len) if(in[i] != '0'){
      k = 0;
      REP(j,1,5) if(i+j <= len){
        k = k*10 + (in[i+j-1]-'0');
        if(k <= M) dp[i+j] = (dp[i+j]+dp[i])%MOD;
      }
    }

    res = dp[len];
    printf("Case #%d: %lld\n",++count,res);
  }

  return 0;
}