#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 ok = 0, ng = linf;

    auto f = [&](ll x) {
        int cnt = 0;
        rep(i, 0, n) {
            if (x >= a[i]) {
                x -= a[i];
                cnt += 1;
            }
        }
        return cnt;
    };

    while(abs(ok - ng) > 1) {
        ll mid = (ok + ng) / 2;
        if (f(mid) <= m) {
            ok = mid;
        }
        else {
            ng = mid;
        }
    }
    if (f(ok) == m) {
        cout << ok << endl;
    }
    else {
        cout << "Impossible" << endl;
    }

}

int main() {


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

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