# include <bits/stdc++.h>
# define ll long long
# define ld double
# define fi first
# define se second
# define pii pair<int, int>
# define pll pair<ll, ll>
# pragma GCC optimize("O3")
using namespace std;

const ll MOD = 998244353;
ll C[101][101];

void build() {
	for(int i=0;i<=100;i++) {
		for(int k=0;k<=100;k++) {
			if(i == k) C[i][k] = 1ll;
			else if(i < k) C[i][k] = 0ll;
			else if(k == 0) C[i][k] = 1ll;
			else C[i][k] = (C[i - 1][k] + C[i - 1][k - 1]) % MOD;
		}
	}
}

ll dp[101][101];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	build();
	
	int cases;
	cin>>cases;
	while(cases--) {
		int N, K, M;
		cin>>N>>K>>M;
		
		string S, T;
		cin>>S>>T;
		
		int num = 0;
		for(int c=0;c<N;c++) {
			if(S[c] != T[c]) num++;
		}
		
		for(int k=0;k<=N;k++) {
			dp[0][k] = 0ll;
		}
		dp[0][num] = 1ll;
		
	//	cout<<num<<endl;
		
		for(int k=1;k<=K;k++) {
			for(int c=0;c<=N;c++) dp[k][c] = 0ll;
			
			for(int c=0;c<=N;c++) {
				for(int d=0;d<=c && d <= M;d++) {
					if((M - d) > (N - c)) continue;
					if(dp[k - 1][c] == 0) continue;
					
					ll mul = (dp[k - 1][c] * C[c][d]) % MOD;
					mul *= C[N - c][M - d];
					mul %= MOD;
					
				//	cout<<"mul : "<<mul<<" "<<dp[k - 1][c]<<" "<<c<<" "<<d<<" "<<C[c][d]<<endl;
					
					dp[k][(c - d) + (M - d)] += mul;
					dp[k][(c - d) + (M - d)] %= MOD;
				}
			}
		}
		
		printf("%lld\n", dp[K][0]);
	}
}