#include<iostream>

 #include<algorithm>

 #include<string>

 #include<cstring>

 using namespace std;

 const int maxnode =  *  + ;

 const int sigma_size = ;

 const int maxn =  + ;

 char str[maxn],s[+];

 int n, dp[maxn];

 struct Trie

 {

     int ch[maxnode][sigma_size];

     int val[maxnode];

     int sz;

     void init()

     {

         sz = ;

         memset(ch[], , sizeof(ch[]));

     }

     void insert(char *s, int v)

     {

         int u = , len = strlen(s);

         for (int i = ; i < len; i++)

         {

             int c = s[i] - 'a';

             if (!ch[u][c])

             {

                 memset(ch[sz], , sizeof(ch[sz]));

                 val[sz] = ;

                 ch[u][c] = sz++;

             }

             u = ch[u][c];

         }

         val[u] = v;

     }

     int find(char *s, int pos)

     {

         int len = strlen(s), u = , ans = ;

         for (int i = pos; i < len; i++)

         {

             int c = s[i] - 'a';

             if (ch[u][c] == )  break;

             u = ch[u][c];

             if (val[u] == )

                 ans = (ans + dp[i + ]) % ;

         }

         return ans;

     }

 }T;

 int main()

 {

     //freopen("D:\\txt.txt", "r", stdin);

     int kase = ;

     while (~scanf("%s", str))

     {

         scanf("%d", &n);

         T.init();

         for (int i = ; i < n; i++)

         {

             scanf("%s", s);

             T.insert(s, );

         }

         int len = strlen(str);

         dp[len] = ;

         for (int i = len - ; i >= ; i--)

             dp[i] = T.find(str, i);

         printf("Case %d: %d\n", ++kase, dp[]);

     }

     return ;

 }