#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e5+5,M=N*4+5,K=31650,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,k,X[N],Y[N];
char s[N];
void Solve(){
	int i,j;scanf("%d%d",&n,&k);
	scanf("%s",s+1);
	for(i=1;i<=n;i++) {
		X[i]=X[i-1];Y[i]=Y[i-1];
		if(s[i]=='L') X[i]--;
		if(s[i]=='R') X[i]++;
		if(s[i]=='U') Y[i]--;
		if(s[i]=='D') Y[i]++;
	}
	ll ans=0;
	for(i=1;i<=n;i++) {
		ans=max(ans,1ll*abs(X[i])+1ll*abs(Y[i]));
		ans=max(ans,abs(X[i]+1ll*(k-1)*X[n])+abs(Y[i]+1ll*(k-1)*Y[n]));
	}
	printf("%lld\n",ans);
}
int main(){
	int t;scanf("%d",&t);while(t--) Solve();
}