#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cstdio>
#include <cmath>
#define int long long
using namespace std;
const int N = 1e5 + 10, M = 1e6 + 10, MOD = 1e9 + 7;
int a[N], v[N], f[N], num[N];
string op[] = {
    "Monday", "Tuesday", "Wednesday",
    "Thursday", "Friday"
};
void solve() {
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    int max1=0;
    int max2=0;
    int x = 0, y = 0;
    int xx = 0, yy = 0;
    for (int i = 0; i < n; i++) {
        if (s[i] == 'U') yy++;
        else if (s[i] == 'D') yy--;
        else if (s[i] == 'L') xx--;
        else if (s[i] == 'R') xx++;
        max1=max(max1,abs(xx)+abs(yy));
    }
    x = xx * (k - 1), y = yy * (k - 1);
    int ans = abs(x) + abs(y);
    for (int i = 0; i < n; i++) {
        if (s[i] == 'U') y++;
        else if (s[i] == 'D') y--;
        else if (s[i] == 'L') x--;
        else if (s[i] == 'R') x++;
        max2 = max(max2, abs(x) + abs(y));
    }
    cout << max(max1,max2) << '\n';
}

signed main() {

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