#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define inf 0x3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define maxint INT32_MAX
#define minint INT32_MIN
#define maxll INT64_MAX
#define minll INT64_MIN
#define mod  998244353
#define nc() (p1==p2 && (p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)
#pragma GCC optimize(2)
void write(int x);
ll c[120][120];
char *p1,*p2,buf[100000];
int read();
const int N=1e5+10;
int fact[N],infact[N];
    ll dp[120][120];
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;
}
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 s1,s2;
    cin>>s1>>s2;
    int sum=0;
    memset(dp,0,sizeof(dp));
    // vector<vector<ll>> dp(k+1,vector<ll>(n+1,0)); 
    for(int i=0;i<n;i++){
        sum+=abs(s1[i]-s2[i]);
    }
    dp[0][sum]=1;
    for(int i=1;i<=k;i++){
        for(int j=0;j<=n;j++){
            for(int x=0;x<=j&&x<=m;x++){
                if(n-j<m-x) continue;
                dp[i][j+m-2*x]+=(1ll*dp[i-1][j]*C(j,x)%mod*C(n-j,m-x)%mod)%mod;
                dp[i][j+m-2*x]%=mod;
            }
        }
    }
    cout<<dp[k][0]<<endl;
}

int main() {
    int t=1;
    //yhsj();
    init();
    cin>>t;
    while(t--) solve();
    return 0;
}



void write(int x)
{
    if(x<0)
        putchar('-'),x=-x;
    if(x>9)
        write(x/10);
    putchar(x%10+'0');
    return;
}
int read()
{
    int x=0,f=1;
    char ch=nc();
    while(ch<48||ch>57)
    {
        if(ch=='-')
            f=-1;
        ch=nc();
    }
    while(ch>=48&&ch<=57)
        x=x*10+ch-48,ch=nc();
   	return x*f;
}
// ll ksm(ll a,ll b,ll mod){
//     ll ans=1;
//     a%=mod;
//     while(b>0){
//         if(b&1) ans=ans*a%mod;
//         a=a*a%mod;
//         b>>=1;
//     }
//     return ans;
// }