#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, k;
    std::cin >> n >> k;
    
    i64 ans = 0;
    
    std::string s;
    std::cin >> s;
    
    std::vector<int> fx(n + 1), fy(n + 1);
    int x = 0, y = 0;
    for (int i = 0; i < n; i++) {
        if (s[i] == 'L') {
            x--;
        } else if (s[i] == 'R') {
            x++;
        } else if (s[i] == 'D') {
            y--;
        } else {
            y++;
        }
        fx[i + 1] = x;
        fy[i + 1] = y;
    }
    
    for (int i = 0; i <= n; i++) {
        ans = std::max(ans, 1LL * std::abs(fx[i]) + std::abs(fy[i]));
        i64 x = 1LL * fx[n] * (k - 1) + fx[i];
        i64 y = 1LL * fy[n] * (k - 1) + fy[i];
        ans = std::max(ans, std::abs(x) + std::abs(y));
    }
    
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}