#include<bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define lowbit(i) ((i)&(-i))
#define pii pair<int,int>
#define endl '\n'
#define mk(x,y) make_pair(x,y)
#define popcount(x) __builtin_popcount(x)
const double pi=3.14159265358979323846;
const double eps=1e-9;
const int inf=1e9;
const long long INF=4e18;
const int mod=1e9+7;
using namespace std;
const int N=1e5+10;
void solve()
{
    int n,k;
    cin>>n>>k;
    string s;
    cin>>s;
    int x=0,y=0;
    for(int i=0;i<n;i++){
        if(s[i]=='U')y+=1;
        else if(s[i]=='D')y-=1;
        else if(s[i]=='L')x-=1;
        else if(s[i]=='R')x+=1;
    }
    int xx=0,yy=0;
    int ans=0;
    for(int i=0;i<n;i++){
        if(s[i]=='U')yy+=1;
        else if(s[i]=='D')yy-=1;
        else if(s[i]=='L')xx-=1;
        else if(s[i]=='R')xx+=1;
        ans = max({
            ans,abs(xx)+abs(yy),abs((k-1)*x+xx)+abs((k-1)*y+yy)
        });
    }
    cout<<ans<<endl;
}

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