#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=1e5+10;
int val[maxn];
int n,m;
void solve()
{
    cin>>n>>m;
    int sum=0;
    int cnt=0, ans=0;
    int minn=0x3f3f3f3f;
    for(int i=1;i<=n;i++)
    {
        cin>>val[i];
        if(val[i]==0) cnt++;
        if(val[i]!=0) minn=min(val[i],minn);
        sum+=val[i];
    }
    if(m==0) {cout<<minn-1<<endl;return;}
    if(n==m) {cout<<"Richman"<<endl;return;}
    if(cnt>m) {cout<<"Impossible"<<endl;return;}
    m -= cnt;
    vector<int> nonZeroVals;
    for(int i=1;i<=n;i++)
    {
        if(val[i]!=0) nonZeroVals.push_back(val[i]);
    }
    sort(nonZeroVals.begin(), nonZeroVals.end());
    for(int i=0; i<m; i++)
    {
        ans += nonZeroVals[i];
    }
    cout << ans + nonZeroVals[m] - 1 << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int t;
    cin>>t;
    while(t--)
        solve();
    return 0;
}