#include<bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
	int n, m;
	ll ans = 0, sum = 0;
	cin >> n >> m;
	int ok = (n == m);
	std::vector<int> a(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		sum += a[i];
		m -= (a[i] == 0);
	}
	if(ok == 1) return cout << "Richman\n", void();
	if(m < 0) return cout << "Impossible\n", void();
	int pos;
	for(int i = 1; i <= n; i++) {
		if(m > 0 && a[i]) ans += a[i], -- m;
		if(m == 0) {
			pos = i + 1;
			break;
		}
	}
	ll minn = 1e18;
	for(int i = pos; i <= n; i++) {
		if(a[i])minn = min(minn, (ll)a[i] - 1);
	}
	if(pos > n) minn = a[pos] - 1;
	cout << ans + minn << '\n';
	return;
}
int main()
{
	int t = 1;
	cin >> t;
	while(t--) solve();
	return 0;
}