#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

struct Trie{
	using MP = unordered_map<char, int>;
	vector<MP> to;
	vector<int> cnt;
	vector<set<int>> list;
	Trie(int l) : to(1), cnt(1) {
		list.resize(l + 1);
		list[0].insert(0);
	}
	int add(const string& s) {
		int v = 0;
		int level = 0;
		for(char c : s){
			if(!to[v].count(c)){
				to[v][c] = to.size();
				to.push_back(MP());
				cnt.push_back(0);
			}
			v = to[v][c];
			cnt[v]++;
			level++;
			list[level].insert(v);
		}
		return v;
	}
	int find(const string& s){
		int v = 0;
		for(char c : s){
			if(!to[v].count(c)) return 0;
			v = to[v][c];
		}
		return cnt[v];
	}
	void dfs(int a1, int b1){
		for(auto [c, a2] : to[a1]){
			if(!to[b1].count(c)){
				to[b1][c] = to.size();
				to.push_back(MP());
				cnt.push_back(0);
			}
			int b2 = to[b1][c];
			dfs(a2, b2);
		}
		cnt[b1] += cnt[a1];
		cnt[a1] = 0;
	};
	void merge(int k, char c, char d){
		for(int v : list[k]){
			if(!to[v].count(c)) continue;
			if(to[v].count(c) && !to[v].count(d)){
				to[v][d] = to[v][c];
				to[v].erase(c);
				continue;
			}
			if(to[v].count(c) && to[v].count(d)){
				// merge naively
				// TODO: merge-tech
				int a = to[v][c];
				int b = to[v][d];
				if(cnt[a] <= cnt[b]){
					dfs(a, b);
					to[v].erase(c);
				}else{
					dfs(b, a);
					to[v][d] = to[v][c];
					to[v].erase(c);
				}
				continue;
			}
		}
	}
};

int main(){
	int n, l, q;
	cin >> n >> l >> q;
	vector<string> s(n);
	cin >> s;
	Trie trie(l);
	rep(i, n) trie.add(s[i]);
	rep(_, q){
		int t;
		cin >> t;
		if(t == 1){
			int k;
			char c, d;
			cin >> k >> c >> d;
			trie.merge(k - 1, c, d);
		}
		if(t == 2){
			string t;
			cin >> t;
			cout << trie.find(t) << "\n";
		}
	}
	return 0;
}