#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define ll long long
#define endl '\n'
#define pb push_back
const int N = 1e6 + 10,M=210;
const ll inf=0x3f3f3f3f,mod=1e9+7;
int dx[]={0,0,-1,1},dy[]={-1,1,0,0};
void solve()
{
    int n,k;
    cin>>n>>k;
    string s;
    cin>>s;
    int x=0,y=0;
    for(int i=0;i<s.size();i++)
    {
        int op;
        if(s[i]=='D')op=0;
        else if(s[i]=='U')op=1;
        else if(s[i]=='L')op=2;
        else if(s[i]=='R')op=3;
        x+=dx[op];
        y+=dy[op];
    }
    int fx=(k-1)*x,fy=(k-1)*y;
    int maxx=abs(fx)+abs(fy);
    for(int i=0;i<s.size();i++)
    {
        int op;
        if(s[i]=='D')op=0;
        else if(s[i]=='U')op=1;
        else if(s[i]=='L')op=2;
        else if(s[i]=='R')op=3;
        fx+=dx[op];
        fy+=dy[op];
        maxx=max(maxx,abs(fx)+abs(fy));
    }
    cout<<maxx<<endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T=1;
    cin>>T;
    while(T--)
    {
    solve();
    }
return 0;
}