#include<bits/stdc++.h>
#define AC return 0;
#define int long long 
#define pii pair<int,int>
#define all(tar) tar.begian(),tar.end()
const int maxx=2e5+5;
const int mod=998244353; 
using namespace std;

void Solve()
{
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    s = ' ' + s;
    int x, y;
    x = y = 0;
    int res = 0;
    for (int i = 1; i <= n; i++)
    {
        if (s[i] == 'U') y++;
        if (s[i] == 'D') y--;
        if (s[i] == 'L') x--;
        if (s[i] == 'R') x++;
        res = max(res, abs(x) + abs(y));
    }
    
    x = (k - 1) * x;
    y = (k - 1) * y;
    res = max(res, abs(x) + abs(y)); 

    for (int i = 1; i <= n; i++)
    {
        if (s[i] == 'U') y++;
        if (s[i] == 'D') y--;
        if (s[i] == 'L') x--;
        if (s[i] == 'R') x++;
        res = max(res, abs(x) + abs(y));
    }

    cout << res << "\n";
}

signed main(){
   ios::sync_with_stdio(false);
   cin.tie(0);
   cout.tie(0);
   


   int T;
   cin >> T;
   while (T--)
   {
    Solve();
   }
   
   AC
}