#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;

const int N = 1e6 + 5;

int a[N];

void solve() {
    int n, m;
    cin >> n >> m;
    int zero = 0;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        zero += a[i] == 0;
    }
    if (n == m) {
        cout << "Richman" << endl;
        return;
    }
    if (zero > m) {
        cout << "Impossible" << endl;
        return;
    }
    m -= zero;
    int t = 0;
    for (int i = 1; i <= n; i++) {
        if (a[i] != 0)
            a[++t] = a[i];
    }
    n = t;
    int sum = accumulate(a + 1, a + m + 1, 0ll) + (*min_element(a + m + 1, a + n + 1) - 1);
    cout << sum << endl;
}

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