#include <bits/stdc++.h>
typedef long long ll;

const int N = 1e5 + 10;
int n, m;
ll a[N];

bool check(ll x) {
	ll now = x;
	ll s = 0;
	for (int i = 1; i <= n; i++) {
		if (a[i] <= now) {
			s += 1;
			now -= a[i];
		}
	}
	if (s <= m) return true;
	else return false;
}

void solve() {
	std::cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		std::cin >> a[i];
	}
	ll l = -1, r = 1e18;
	while (l < r) {
		ll mid = (l + r + 1) / 2;
		if (check(mid)) {
			l = mid;
		} else {
			r = mid - 1;
		}
	}
	if (l == 1e18) {
		printf("Richman\n");
	} else if (l == -1) {
		printf("Impossible\n");
	} else {
		printf("%lld\n", l);
	}
}


int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	std::cout.tie(0);
	int t;
	std::cin >> t;
	while (t--) {
		solve();
	}
}