1 #include <bits/stdc++.h>
 2 using namespace std;
 3 
 4 const int maxn = 100100;
 5 const int mod = 1000000007;
 6 int na, nb;
 7 char a[maxn];
 8 char b[maxn];
 9 int pre[maxn];
10 bool vis[maxn];
11 int dp[maxn];
12 
13 void getpre(char *b, int *pre) {
14     int j, k;
15     pre[0] = -1;
16     j = 0;
17     k = -1;
18     while(j < nb) {
19         if(k == -1 || b[j] == b[k]) {
20             j++;
21             k++;
22             pre[j] = k;
23             if(b[j] != b[k]) pre[j] = k;
24             else pre[j] = pre[k];
25         }
26         else k = pre[k];
27     }
28 }
29 
30 void kmp() {
31     int i = 0;
32     int j = 0;
33     getpre(b, pre);
34     while(i < na) {
35         if(j == -1 || a[i] == b[j]) {
36             i++; j++;
37         }
38         else j = pre[j];
39         if(j == nb) vis[i] = 1;
40     }
41 }
42 
43 int main() {
44     // freopen("in", "r", stdin);
45     int T, _ = 1;
46     scanf("%d", &T);
47     while(T--) {
48         printf("Case #%d: ", _++);
49         scanf("%s %s", a, b);
50         memset(vis, 0, sizeof(vis));
51         memset(dp, 0, sizeof(dp));
52         na = strlen(a); nb = strlen(b);
53         kmp(); dp[0] = 1;
54         for(int i = 1; i <= na; i++) {
55             dp[i] = dp[i-1];
56             if(vis[i]) {
57                 dp[i] += dp[i-nb];
58                 dp[i] %= mod;
59             }
60         }
61         printf("%d\n", dp[na]%mod);
62     }
63     return 0;
64 }