#include<iostream>
#include<algorithm>
#define int long long
using namespace std;
const int N = 1e5 + 9, INF = 2e18;
int a[N];
int n, m;

int judge(int x) {
	int cnt = 0;
	for (int i = 1; i <= n; i++) {
		if (a[i] <= x) {
			x -= a[i];
			cnt++;
		}
		if (cnt > m) {
			return 1;
		}
	}
	if (cnt < m) {
		return -1;
	}
	return 0;
}

void solve() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	int left = 0, right = INF, ans = 0;
	while (left <= right) {
		int mid = (left + right) >> 1;
		int x = judge(mid);
		if (x == 1) {
			right = mid - 1;
		}
		else if(x == 0){
			ans = mid;
			left = mid + 1;
		}
		else {
			left = mid + 1;
		}
	}
	int num = 0, tmp = ans;
	for (int i = 1; i <= n; i++) {
		if (a[i] <= tmp) {
			tmp -= a[i];
			num++;
		}
	}
	if (num != m) {
		cout << "Impossible\n";
	}
	else if (num == n) {
		cout << "Richman\n";
	}
	else {
		cout << ans << '\n';
	}
}

signed main() {
	ios::sync_with_stdio(0), cin.tie(0), cin.tie(0), cout.tie(0);
	int t = 0;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}