#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pi pair<int,ll>
#define fi first
#define se second
#define pb push_back
#pragma GCC optimize("O3")
#pragma GCC target("avx2")


int main(){
    int t;cin>>t;
    while(t--){
        int n,m;cin>>n>>m;
        vector<ll>v;
        ll mn=1e10;
        int cntz=0;
        int lstz=0;
        ll kk=0;
        for(int i=0;i<n;i++){
            ll a;cin>>a;
            mn=min(mn,a);
            if(i>=m&&a==0)cntz++;
            if(i<m&&a==0)lstz=i;
            if(i<m)kk+=a;
            v.push_back(a);
        }
        ll ans=0;
        for(int i=0;i<m;i++){
            ans+=v[i];
        }
        if(m==0){
            if(mn==0){
                cout<<"Impossible"<<endl;
            }else{
                cout<<mn-1<<endl;
            }
            continue;
        }
        if(n==m){
            cout<<"Richman"<<endl;
        }else if(cntz){
            int k=m-1;
            int notz=0;
            while(cntz && k){
                if(v[k]){
                    ans-=v[k];
                    cntz--;
                    if(v[k])notz=v[k];
                    if(cntz==0){
                        ans+=notz-1;
                    }
                }
                k--;
            }
            if(cntz){
                cout<<"Impossible"<<endl;
            }else{
                cout<<ans<<endl;
            }
        }else{
            cout<<ans+v[m]-1<<endl;
        }
    }
}