#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve(void) {
    int n,m;
    cin>>n>>m;
    vector<int> a(n+1);
    for(int i=1;i<=n;i++)   cin>>a[i];
    const ll maxn=1e16;
    ll lo=0,ro=1e16;
    auto check=[&](ll x)->ll {
        ll ans=0;
        for(int i=1;i<=n;i++){
            if(x>=a[i]) {ans++;x-=a[i];}
        }
        return ans;
    };
    while(lo<ro){
        ll mid=(lo+ro)/2;
        ll num=check(mid);
        if(num>m)  ro=mid;
        else lo=mid+1;
    }
    if(lo==maxn) cout<<"Richman\n";
    else if(lo==0||check(lo-1)!=m)   cout<<"Impossible\n";
    else cout<<lo-1<<'\n';   
}

signed main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);

    int _ = 1;
    cin >> _;
    while (_--) solve();

    return 0;
}
/*
 4
 4 2
 1 2 4 8
 4 0
 100 99 98 97
 2 2
 10000 10000
 5 3
 0 0 0 0 1
*/