#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
//cout << fixed <<setprecision(2) << ans;
//inline ll read() {
//	ll ans=0,f=1;
//	char c=getchar();
//	while(c<'0' || c>'9') {
//		if(c=='-') f=-1;
//		c=getchar();
//	}
//	while(c>='0' && c<='9') {
//		ans=(ans<<1)+(ans<<3)+(c^48);
//		c=getchar();
//	}
//	return ans*f;
//}
//char F[200];
//inline void out(I_int x) {
//    if (x == 0) return (void) (putchar('0'));
//    I_int tmp = x > 0 ? x : -x;
//    if (x < 0) putchar('-');
//    int cnt = 0;
//    while (tmp > 0) {
//        F[cnt++] = tmp % 10 + '0';
//        tmp /= 10;
//    }
//    while (cnt > 0) putchar(F[--cnt]);
//    //cout<<" ";
//}
#define endl '\n'
const ll N = 1e5 + 5, mod = 998244353;
ll n, m;
string s, st;
ll dp[205][205];
ll fac[2 * N], invfac[2 * N];

ll quick_pow(ll a, ll b) {
    if (a == 0)return 0;
    ll ans = 1;
    while (b) {
        if (b & 1)ans = ans * a % mod;
        a = a * a % mod;
        b = b >> 1;
    }
    return ans;
}

ll inv(ll x) {
    return quick_pow(x, mod - 2);
}

void init() {
    fac[0] = invfac[0] = 1;
    for (int i = 1; i < N; i++) {
        fac[i] = fac[i - 1] * i % mod;
    }
    invfac[N - 1] = inv(fac[N - 1]);
    for (int i = N - 2; i >= 1; i--) {
        invfac[i] = invfac[i + 1] * (i + 1) % mod;
    }
}

ll C(ll a, ll b) {
    if (b < a)return 0;
    return fac[b] * invfac[b - a] % mod * invfac[a] % mod;
}

void solve() {
    ll k;
    cin >> n >> m >> k;
    cin >> s;
    cin >> st;
    ll cnt = 0;
    for (int i = 0; i < n; i++) {
        if (s[i] != st[i])cnt++;
    }
    for (int i = 0; i <= m; i++) {
        for (int j = 0; j <= n; j++) {
            dp[i][j] = 0;
        }
    }
    dp[0][0] = 1;
    for (int i = 1; i <= m; i++) {
        for (int j = 0; j <= n; j++) {
            for (int u = 0; u <= j; u++) {
                if (k - u > n - j)continue;
                if (j + k - 2 * u < 0 || j + k - 2 * u > n)continue;
                dp[i][j + k - 2 * u] += dp[i - 1][j] * C(u, j) % mod * C(k - u, n - j) % mod;
                dp[i][j + k - 2 * u] %= mod;
            }
        }
    }
    cout << dp[m][cnt] * inv(C(cnt, n) % mod) % mod << endl;
    return;
}

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