#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=100+5,M=N*4+5,K=31650,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,k,m;char s[N],t[N];
ll C[N][N],f[N],g[N];
void Solve(){
	int i,j;
	scanf("%d%d%d",&n,&k,&m);
	scanf("%s",s+1);
	scanf("%s",t+1);
	for(i=0;i<=n;i++) for(C[i][0]=j=1;j<=i;j++) C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
	int Ct=0;
	for(i=1;i<=n;i++) Ct+=(s[i]!=t[i]);
	Me(f,0);f[Ct]=1;
	while(k--){
		Mc(g,f);Me(f,0);
		for(i=0;i<=n;i++){
			for(j=0;j<=min(i,m);j++) f[i-j+m-j]=(f[i-j+m-j]+g[i]*C[i][j]%mod*C[n-i][m-j])%mod;
		}
	}
	printf("%lld\n",f[0]);
}
int main(){
	int t;scanf("%d",&t);while(t--) Solve();
}