#include <bits/stdc++.h>
using namespace std;

#define int long long
#define f(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

const int MOD = (1LL<<32)-1;
const int SZ = 50;

struct matrix
{
    int a[SZ][SZ];

    matrix()
    {
        memset(a,0,sizeof(a));
    }

    void iden()
    {
        f(i,SZ) a[i][i] = 1;
    }

    matrix operator*(matrix & o)
    {
        matrix res;

        f(i,SZ) f(j,SZ) f(k,SZ)
            res.a[i][j]+=(a[i][k]*o.a[k][j])&MOD;

        f(i,SZ) f(j,SZ) res.a[i][j]&=MOD;

        return res;
    }

};

matrix pow(matrix a,int b)
{
   matrix res;
   res.iden();

    while(b > 0)
    {
        if(b&1) res = (res*a);
        a = (a*a);
        b>>=1;
    }

    return res;
}

vector<int> prefix_function(string s)
{
    int n = (int)s.length();
    vector<int> pi(n);

    for (int i = 1; i < n; i++)
    {
        int j = pi[i-1];
        while (j > 0 && s[i] != s[j])  j = pi[j-1];
        if (s[i] == s[j])  j++;
        pi[i] = j;
    }

    return pi;
}

bool occur[50][26];

void solve()
{
   int n;
    cin >> n;

   string s,t;

   cin >> t >> s;

   f(i,s.length())
   {
       occur[i][s[i]-'a'] = 1;

       if(i > 0)
           f(j,26) occur[i][j]|=occur[i-1][j];
   }

   vector<int> kmp = prefix_function(s);

   matrix trans;

  for(int i=0;i<t.length();i++)
   {
      for(int k=0;k<s.length();k++)
      {
          if(occur[k][t[i]-'a'] == 0)
          {
              trans.a[0][k]++;
          }
          else if(t[i] == s[k])
          {
              if(k+1 != s.length()) trans.a[k+1][k]++;
          }
          else if(k == 0) trans.a[k][k]++;
          else
          {
                int j = kmp[k-1];
                while (j > 0 && t[i] != s[j])  j = kmp[j-1];
                if (t[i] == s[j])  j++;
                if(j != s.length()) trans.a[j][k]++;
          }
      }

   }

   trans = pow(trans,n);

   int res = 0;

   f(i,SZ) res = ( res + trans.a[i][0]);
   res&=MOD;

   cout << res << '\n';
}

signed main()
{
    fast;

    int t = 1;

    cin >> t;

    for(int i=1;i<=t;i++)
    {
     cout <<"Case "<<i<<": ";
        solve();
    }
}