#include<bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
#define lowbit(i) ((i)&(-i))
#define pii pair<int,int>
#define endl '\n'
#define mk(x,y) make_pair(x,y)
#define popcount(x) __builtin_popcount(x)
const double pi=3.14159265358979323846;
const double eps=1e-9;
const int inf=1e9;
const long long INF=4e18;
const int mod=998244353;
using namespace std;
const int N=110;
int qpow(int a,int b)
{
    int ans=1;
    while(b)
    {
        if(b&1)ans=(long long)ans*a%mod;
        b>>=1;
        a=(long long)a*a%mod;
    }
    return ans;
}
int fact[N],infact[N];
void init()
{
    fact[0]=infact[0]=1;
    for(int i=1;i<N;i++)
    {
        fact[i]=(long long)fact[i-1]*i%mod;
        infact[i]=(long long)infact[i-1]*qpow(i,mod-2)%mod;
    }
}
int C(int a,int b)
{
    if(a<0||b<0||a<b) return 0;
    return (long long)fact[a]*infact[b]%mod*infact[a-b]%mod;// fact[a]:a!  infact[a]:1/(a!)
}
void solve()
{
	int n,m,k;
	cin>>n>>k>>m;
	string s,t;
	cin>>s>>t;
	int cnt=0;
	for(int i=0;i<n;i++){
		cnt+=s[i]!=t[i];
	}
	vector<vector<ll>>dp(k+1,vector<ll>(n+1,0));
	dp[0][cnt]=1;
	for(int i=0;i<k;i++){
		for(int j=0;j<=n;j++){
			for(int x=0;x<=j&&x<=m;x++){
				if(n-j>=m-x)dp[i+1][j-x+m-x]=(dp[i+1][j-x+m-x]
					+1ll*dp[i][j]*C(j,x)%mod*C(n-j,m-x))%mod;
			}
		}
	}
	cout<<dp[k][0]<<endl;
	// cout<<C(5,3)<<endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    init();
    int T=1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}