#include <bits/stdc++.h>
#define N (200000 + 10)  /*------------------ #define ------------------*/
#define M (400000 + 10)
#define MOD (1000000000 + 7)
//#define MOD (998244353)
#define INF (0x3f3f3f3f)
#define LNF (3e18)
#define mod(a,b) (((a)%(b)+(b))%(b))
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<int,LL> PIL;
typedef pair<LL,int> PLI;
typedef pair<double,double> PDD;

int n,m;
int a[N],minv;

auto solve(){
	
	cin >> n >> m;
	minv = 2e9;
	for(int i = 1;i <= n;i ++ ) cin >> a[i],minv = min(minv,a[i]);
	if(m == 0){
		int ans = minv - 1;
		if(ans < 0) cout << "Impossible\n";
		else cout << ans << '\n';
		return;
	}
	if(m == n){
		cout << "Richman\n";
		return;
	}
	int Count0 = 0;
	for(int i = 1;i <= n;i ++ )
		Count0 += (a[i] == 0);
	
	if(Count0 > m){
		cout << "Impossible\n";
		return;
	}else if(Count0 == m){
		int v = 2e9;
		for(int i = 1;i <= n;i ++ )
			if(a[i])
				v = min(v,a[i]);
		cout << (v - 1) << '\n';
		return;
	}else{
		m -= Count0;
	}
	
	LL ans = 0;
	int t = 0,i = 1;
	while(t < m && i <= n){
		if(a[i] == 0) i ++ ;
		else{
			t ++ ;
			ans += a[i];
			i ++ ;
		}
	}
	
	minv = 2e9;
	while(i <= n){
		if(a[i]){
			minv = min(minv,a[i]);
		}
		i ++ ;
	}
	
	cout << ans + minv - 1 << '\n';
}

signed main(){
	IOS
	int T = 1;
	cin >> T;
	while(T -- ) solve();
	//while(T -- ) cout << (solve() ? "YES" : "NO") << '\n';

    return 0;
}