#include<iostream>
#include<cstdio>
#define maxn 100005
#define ll long long
using namespace std;
int T,n,k,u,d,l,r; ll x=0,y=0,ans=0; char a[maxn]; ll aabs(ll x){return x<0?-x:x;}
int main(){
	scanf("%d",&T); while(T--){
		scanf("%d%d\n%s",&n,&k,a+1); u=d=l=r=0;
		x=y=0LL; ans=aabs(x)+aabs(y); for(int i=1;i<=n;i++){
			if(a[i]=='U') y++; else if(a[i]=='D') y--; else if(a[i]=='L') x--; else x++; 
			ans=max(aabs(x)+aabs(y),ans);
		} x*=(k-1); y*=(k-1); ans=max(aabs(x)+aabs(y),ans); for(int i=1;i<=n;i++){
			if(a[i]=='U') y++; else if(a[i]=='D') y--; else if(a[i]=='L') x--; else x++; 
			ans=max(aabs(x)+aabs(y),ans);
		} printf("%lld\n",ans);
	} return 0;
}