#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=110005;
int n,k;
int a[N],minl[N];
void solve(){
	cin>>n>>k;
	int p=0;
	for(int i=1,x;i<=n;i++){
		cin>>x;
		if(x)a[++p]=x;
		else k--;
	}
	int ans=0;
	minl[p+1]=1e9+5;
	for(int i=p;i>=1;i--){
		minl[i]=min(minl[i+1],a[i]);
	}
	
	for(int i=1;i<=k;i++){
		ans+=a[i];
	}
		if(p==k){
			cout<<"Richman"<<endl;
			return;
		}
		else {
			if(minl[k+1]==0){
				cout<<"Impossible"<<endl;	
				return;
			}
			ans+=minl[k+1]-1;
			cout<<ans<<endl;
		}

	return;
}
signed main() {
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	int t=1;
	cin>>t;
	while(t--){
		solve();
	}
    return 0;
}