彻底怒了

#include<bits/stdc++.h>
#define ll long long
#define int ll
#define L x<<1
#define R x<<1|1
#define mid ((l+r)>>1)
#define lc L,l,mid
#define rc R,mid+1,r
#define Root 1,1,n
#define OK Ll<=l&&r<=Rr
#define rep(x,y,z) for(int x=(y);x<=(z);x++)
#define per(x,y,z) for(int x=(y);x>=(z);x--)
#define repn(x) rep(x,1,n)
#define repm(x) rep(x,1,m)
#define pb push_back
#define e(x) for(int i=h[x],y=to[i];i;i=nxt[i],y=to[i])
#define E(x) for(auto y:p[x])
#define Pi pair<int,int>
#define ui unsigned ll
inline int read(){int s=0,w=1;char c=getchar();while(c<48||c>57) {if(c=='-') w=-1;c=getchar();}while(c>=48&&c<=57)s=(s<<1)+(s<<3)+c-48,c=getchar();return s*w;}
inline void pf(ll x){if(x<0) putchar('-'),x=-x;if(x>9)pf(x/10);putchar(x%10+48);}
using namespace std;
const int N=6e5+5,M=1e6+5,inf=(1LL<<29)-1,mod=998244853;
const ll llf=1e18;
inline void add(int &a,int b){((a+=b)>=mod) and (a-=mod);}
inline int Add(int a,int b){return add(a,b),a;}
inline int mul(int a,int b){return 1LL*a*b%mod;}
inline void Mul(int &a,int b){a=mul(a,b);}
inline void red(int &a,int b){add(a,mod-b);}
inline int Red(int a,int b){return red(a,b),a;}
inline int qp(int a,ll b){if(!b)return 1;int c=qp(a,b>>1LL);Mul(c,c);if(b&1)Mul(c,a);return c;}
inline int INV(int x){return qp(x,mod-2);}
int n,m,k,ans;
string s,t,A="CDNL";
int a[N],b[N];
inline int get(int l,int r){
	l=max(l,1LL);
	r=min(r,n);
	if(l>r)return 0;
	return a[r]-a[l-1];
}
inline int getb(int l,int r){
	l=max(l,1LL);
	r=min(r,n);
	if(l>r)return 0;
	return b[l]-b[r+1];
}
int Maxa[5],Maxb[5];
inline void Main(){
	n=read(),m=read(),k=read(),ans=0;
	cin>>s>>t,s='#'+s,t='#'+t;
	repn(i){
		a[i]=a[i-1];
		if(i>=4)a[i]+=s.substr(i-3,4)==A;
	}
	b[n+1]=0;
	rep(i,0,3)Maxa[i]=Maxb[i]=-inf;
	per(i,n,1){
		b[i]=b[i+1];
		if(i+3<=n)b[i]+=t.substr(i,4)==A;
	}
	repn(i){
		int now=0;
		rep(t,1,min(i,3LL)){
			bool fl=1;
			rep(x,0,t-1)if(A[t-x]!=s[i-x])fl=0;
			if(!fl)continue;
			now=t;
		}
//		cerr<<now<<"?\n";
		Maxa[now]=max(Maxa[now],get(i-m+4,i));
	}
	repn(i){
		int now=0;
		rep(tt,1,min(n-i+1,3LL)){
			int g=4-tt;
			bool fl=1;
			rep(x,0,tt-1)if(A[g+x]!=t[i+x])fl=0;
			if(!fl)continue;
			now=tt;
		}
		Maxb[now]=max(Maxb[now],getb(i,i+k-4));
	}
//	rep(i,0,3)cerr<<Maxa[i]<<' '<<Maxb[i]<<"!\n"; 
	rep(i,0,3)rep(j,0,3)ans=max(ans,Maxa[i]+Maxb[j]+(i+j==4));
	cout <<ans<<'\n';
}
signed main(){
	int T=read();
	while(T--)Main();
	return 0;
}