#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define fo(x,a,b) for(int x=a;x<=b;x++)
#define of(x,a,b) for(int x=a;x>=b;x--)
#define close(); std::ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
#define PI acos(-1)
#define pb push_back
#define INF 0x3f3f3f3f
#define lowbit(a) ((a)&-(a))
#define lbit(a) (__builtin_ffsll(a))
#define ubit(a) (64-__builtin_clzll(a))
#define fi first
#define se second
bool isprime(ll x){
    if(x==1)return false;
    for(ll i=2;i<=x/i;i++){
        if(x%i==0)return false;
    }
    return true;
}
ll popcnt(ll x){
    ll cnt=0;
    while(x){
        if(x&1)cnt++;
        x>>=1;
    }
    return cnt;
}
ll qmi(ll a,ll b,ll p){
    a%=p;
    ll res=1;
    while(b){
        if(b&1)res=res*a%p;
        a=a*a%p;
        b>>=1;
    }
    return res;
}
ll exgcd(ll a,ll b,ll &x,ll &y){
    if(!b){
        x=1,y=0;
        return a;
    }
    ll d=exgcd(b,a%b,y,x);
    y-=a/b*x;
    return d;
}
const int N=2e5+10;
const int mod=1e9+7;
ll fact[N],in_fact[N];
ll C(ll n,ll m) {
    if (n < m || m < 0)return 0;
    return fact[n] * qmi(fact[m] * fact[n - m] % mod, mod - 2, mod) % mod;
}
//ll C(ll n,ll m){
//    if (n < m || m < 0)return 0;
//    return fact[n]%mod*in_fact[m]%mod*in_fact[n-m]%mod;
//}

void sol(){
    ll n,m;cin>>n>>m;
    ll cnt=0,z=0;
    ll minn=1e9;
    fo(i,1,n){
        ll x;cin>>x;
        if(x==0) z++;
        minn=min(minn,x);
        if(i<=m+1){
            cnt+=x;
        }
    }
    //cout<<n<<' '<<m<<endl;
    if(m<z){
        cout<<"Impossible"<<endl;
    }
    else if(n==m){
        cout<<"Richman"<<endl;
    }
    else if(m==0){
        cout<<minn-1<<endl;
    }
    else{
        cout<<cnt-1<<endl;
    }
    return;
}

int main(){
    close();
    int t=1;
    cin>>t;
    while(t--){
        sol();
    }
}