#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int,int> P;
const LL mod=998244353;
const int INF=0x3f3f3f3f;
const int N=1e5+10;
LL a[N];
int n,m;

void solve()
{
    cin>>n>>m;
    
    LL zero=0,miv=INF;
    
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        
        miv=min(miv,a[i]);
        if(!a[i]) zero++;
    }
    
    if(n==m) cout<<"Richman"<<endl;
    else if(!m) cout<<miv-1<<endl;
    else if(zero>m) cout<<"Impossible"<<endl;
    else
    {
        m-=zero;
        LL ans=0;
        int id=-1;
        LL miv=INF;
        
        for(int i=1;i<=n&&m;i++)
            if(a[i]) ans+=a[i],m--,id=i;
            
        for(int i=id+1;i<=n;i++) miv=min(miv,a[i]);
            
        cout<<ans+max(0LL,miv-1)<<endl;
    }
    
    
}

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