#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 10;
int val[maxn];
int n, m;

bool check(int num) {
    int cntt = 0;
    for (int i = 1; i <= n; i++) {
        if (num >= val[i]) {
            num -= val[i];
            cntt++;
        }
    }
    if (cntt <= m) return true;
    else return false;
}

void solve() {
    cin >> n >> m;
    int sum = 0;
    for (int i = 1; i <= n; i++) {
        val[i] = 0;
    }
    int cnt = 0;
    int minn = LLONG_MAX;
    for (int i = 1; i <= n; i++) {
        cin >> val[i];
        if (val[i] == 0) cnt++;
        minn = min(val[i], minn);
        sum += val[i];
    }
    if (m == 0) {
        if (cnt == n) cout << "Impossible" << endl;
        else cout << minn - 1 << endl;
        return;
    }
    if (n == m) {
        cout << "Richman" << endl;
        return;
    }
    if (cnt > m) {
        cout << "Impossible" << endl;
        return;
    }
    int l = 0, r = sum + 1;
    while (l + 1 < r) {
        int mid = l + r >> 1;
        if (check(mid)) l = mid;
        else r = mid;
    }
    cout << l << endl;
    return;
}

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