#include <bits/stdc++.h>

#define rep(i, l, r) for(int i = (int)l; i < (int)r; i++)
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
using namespace std;

using ll = long long;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using ld = long double;

typedef vector<ll> vl;
typedef vector<int> vi;

template<class T>
void out(const vector<T> &v) {
    for (auto x: v)cout << x << " ";
    cout << endl;
}

const ll linf = 1e15 + 10;

void solve() {
    
    int n, m; cin >> n >> m;
    vector<ll> a(n);for(auto &x: a) cin >> x;
    if (n == m) {
        cout << "Richman" << endl;
        return;
    }
    int zero = 0;
    rep(i, 0, n) if (a[i] == 0) zero++;
    if (zero > m) {
        cout << "Impossible" << endl;
        return;
    }
    
    ll x = 0;
    int r = m - zero;
    int i = 0;
    while (i < n && r) {
        if (a[i] == 0) continue;
        x += a[i];
        r--;
        i++;
    }
    ll z = linf;
    while (i < n) {
        if (a[i] != 0) {
            z = min(z, a[i]);
        }
        i++;
    }
    cout << x + z - 1 << endl;


}

int main() {


    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T; cin >> T;
    while(T--) {
        solve();
    }
    
}