#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#ifdef LOCAL
template <class T, size_t size = std::tuple_size<T>::value>
std::string to_debug(T, std::string s = "")
    requires(not std::ranges::range<T>);
std::string to_debug(auto x)
    requires requires(std::ostream& os) { os << x; }
{
    return static_cast<std::ostringstream>(std::ostringstream() << x).str();
}
std::string to_debug(std::ranges::range auto x, std::string s = "")
    requires(not std::is_same_v<decltype(x), std::string>)
{
    for (auto xi : x) {
        s += ", " + to_debug(xi);
    }
    return "[" + s.substr(s.empty() ? 0 : 2) + "]";
}
template <class T, size_t size>
std::string to_debug(T x, std::string s)
    requires(not std::ranges::range<T>)
{
    [&]<size_t... I>(std::index_sequence<I...>) { ((s += ", " + to_debug(get<I>(x))), ...); }(std::make_index_sequence<size>());
    return "(" + s.substr(s.empty() ? 0 : 2) + ")";
}
#define debug(...) std::cerr << __LINE__ << ": (" #__VA_ARGS__ ") = " << to_debug(std::tuple(__VA_ARGS__)) << "\n"
#else
#define debug(x...)
#endif

using i64 = long long;
#define int long long

void solve()
{
#define tests
    int n, nk; std::cin >> n >> nk;
    std::string str; std::cin >> str;
    int dtx {}, dty {};

	auto chmax = [&](auto& a, auto b) {a = a > b ? a : b;};

	int ans{};

    for (int i = 0; i < n; i++) {
        if (str[i] == 'U') {
            dtx -= 1;
        } else if (str[i] == 'D') {
            dtx += 1;
        } else if (str[i] == 'L') {
            dty -= 1;
        } else if (str[i] == 'R') {
            dty += 1;
        }
		// chmax(ans, std::abs(dtx) + std::abs(dty));
    }
    int lstx {dtx * (nk - 1)};
	int lsty {dty * (nk - 1)};
	chmax(ans, std::abs(lstx) + std::abs(lsty));
	for(int i = 0 ; i < n ; i++){
		if (str[i] == 'U') {
            lstx -= 1;
        } else if (str[i] == 'D') {
            lstx += 1;
        } else if (str[i] == 'L') {
            lsty -= 1;
        } else if (str[i] == 'R') {
            lsty += 1;
        }
		chmax(ans, std::abs(lstx) + std::abs(lsty));
	}

	std::cout << ans << "\n";
}

signed main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    int _ { 1 };
#ifdef tests
    std::cin >> _;
#endif
    while (_--)
        solve();
    return 0;
}