#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;
    for(int i=1;i<=n;i++)
    val[i]=0;
    int cnt=0,cntt=0,pos=0,ans=0;
    int minn=0x3f3f3f3f;
    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) {cout<<minn-1<<endl;return;}
    if(n==m) {cout<<"Richman"<<endl;return;}
    if(cnt>m) {cout<<"Impossible"<<endl;return;}
    for(int i=1;i<=n;i++)
    {
        if(cntt==m)
        {
            sort(val+1+i,val+1+n);
            pos=i;
            break;
        }
        cntt++;
        ans+=val[i];
    }
    ans+=val[pos]-1;
    return ;

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