#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;
int abss(int a){
    if(a>=0ll)return a;
    return 0ll-a;
}
pair<int,int> maxx(pair<int,int>a,pair<int,int>b){
    if(abss(a.first)+abss(a.second)>=abss(b.first)+abss(b.second))return a;
    return b;
}
void solve()
{
    int n,k;
    cin>>n>>k;
    string s;
    cin>>s;
    pair<int,int>a={0,0},b={0,0};
    for(int i=0;i<n;i++){
        if(s[i]=='U')a.second+=1;
        else if(s[i]=='D')a.second-=1;
        else if(s[i]=='L')a.first-=1;
        else if(s[i]=='R')a.first+=1;
        b=maxx(a,b);
    }
    int ans=1ll*abss(b.first)+1ll*abss(b.second);
    int res=0;
    if(a.second!=b.second||a.first!=b.first){
        res=1ll*abss(b.first)+1ll*abss(b.second);
        res-=1ll*abss(a.first)+1ll*abss(a.second);
        res*=1ll*(k-1);
    }
    else{
        res=1ll*ans*(k-1);
    }
    cout<<ans+res<<endl;
}

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