#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define inf 1000000000000000LL
#define mod 1000000007LL
#define FOR(i,a,b) for(ll i = a; i < b; i++)

void solve() {
    ll n,k;
    cin >> n >> k;
    vector <ll> l1(n); FOR(i,0,n) cin >> l1[i];
    vector <ll> pos(k+1, inf);
    for (int i = 0; i < n; i++){
        if (pos[l1[i]] == inf) pos[l1[i]] = i;
    }
    for (int i = k - 1; i >= 0; i--){
        pos[i] = min(pos[i], pos[i+1]);
    }
    ll dp[k+1][k+1];
    FOR(i,0,k+1)FOR(j,0,k+1) dp[i][j] = -inf;
    dp[0][0] = 0;
    for (ll i = 0; i <= k; i++){
        if (pos[i] == inf) continue;
        for (ll j = i - 1; j >= 0; j--){
            if (pos[j] == inf) continue;
            for (ll cost = k; cost >= i; cost--){
                dp[i][cost] = max(dp[i][cost], dp[j][cost - i] + j * (pos[i] - pos[j]));
            }
        }
    }
    ll answ = 0;
    FOR(i,0,k+1){
        if (pos[i] == inf) continue;
        FOR(j,0,k+1){
            answ = max(answ, dp[i][j] + i * (n - pos[i]));
        }
    }
    cout << answ << "\n";
}

int main() {
    // ios::sync_with_stdio(false);
    // cin.tie(nullptr);

    ll t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}