#include <bits/stdc++.h>
using ll = long long;
using std::cin;
using std::cout;
using std::vector;
using std::min;
using std::max;
int main() {
    std::ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--){
        ll n, dump;
        cin >> n >> dump >> dump;
        vector<ll> a(n);
        for (ll& x : a)
            cin >> x;
        vector<ll> ans(n), seq{0};
        for (ll idx = 1; idx < n; ++idx){
            ll safety = seq.front();
            while (!seq.empty() && a[seq.back()] > a[idx])
                seq.pop_back();
            ll prev_idx = seq.empty() ? safety : seq.back();
            ans[idx] = ans[prev_idx] + (idx - prev_idx) * max(a[prev_idx], a[idx]);
            seq.push_back(idx);
        }
        cout << ans.back() << '\n';
    }
}