uva1401

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;

const int maxn = 3 * 1e5 + 7, TSTART = 1, MOD = 20071027;
string input;
long long int n, dp[maxn],cnt = 1;

struct Node{
	int next[26];
	int flag;
}tree[maxn];

void Init(){
	memset(tree, 0, sizeof(tree));
	memset(dp, 0, sizeof(dp));
	cnt = TSTART;
}

void Insert(string &input){
	int cur = TSTART;
	for (int i = 0; i < input.size(); i++){
		int index = input[i] - 'a';
		if (tree[cur].next[index] == 0) tree[cur].next[index] = ++cnt;
		cur = tree[cur].next[index];
	}
	tree[cur].flag = 1;
}

int main()
{
	string str;
	int kCase = 0;
	while (cin >> input){
		cin >> n;
		Init();
		for (int i = 0; i < n; i++){
			cin >> str;
			Insert(str);
		}
		int len = input.size();
		dp[len] = 1;
		for (int i = len - 1; i >= 0; i--){
			int cur = TSTART;
			for (int j = i; j < len; j++){
				int index = input[j] - 'a';
				if (tree[cur].next[index] != 0) {
					cur = tree[cur].next[index];
					if (tree[cur].flag == 1)  
						dp[i] = (dp[i] + dp[j + 1]) % MOD;
				}
				else break;
				
			}
		}
		cout << "Case "<<++kCase << ": "<< dp[0] << endl;
	}
	return 0;
}