#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")

//booster_^^
#include<bits/stdc++.h>

#define FC(a,b,c) for(int i=a;i<b;i++)cin>>c[i]
#define Fn(n) for(int i=0;i<n;i++)
#define fin(a,n) for(int i=0;i<n;i++)cin>>a[i]
#define F(a,b) for(int i=a;i<b;i++)
#define all(a) a.begin(),a.end()
#define umap_boost(x) x.reserve(1024);x.max_load_factor(0.25);

// #define endl '\n'
#define int long long
using namespace std;

inline void cin_unlocked()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
}

template <typename T>
inline void stable_unique(vector<T>& v ){
    set<T> m(v.begin(),v.end());
    v.assign(m.begin(),m.end());
}

inline void solve(){
	int n,k;
	cin>>n>>k;

	vector<int> arr(n);
	for(int i=0;i<n;i++)cin>>arr[i];

	if(k==n){
		cout<<"Richman"<<endl;
		return;
	}

	vector<int> brr;
	for(int i=0;i<n;i++)if(arr[i])brr.push_back(arr[i]);else k--;

	if(k<0){
		cout<<"Impossible"<<endl;
		return;
	}

	int ans=0;int in=brr[k];

	for(int i=0;i<brr.size();i++){
		if(i<k){
			ans+=brr[i];
		}else{
			in=min(in,brr[i]);
		}
	}
	cout<<ans+in-1<<endl;

}
signed main(){
	cin_unlocked();
	int t;cin>>t;
	for(;t--;)solve();

	return 0;
}