#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const long long MAXN = 1e5 + 10;

inline long long read() {
	long long x = 0, f = 1;
	char ch = getchar();
	while (!isdigit(ch)) {
		if (ch == '-') f = -1;
		ch = getchar();
	}
	while (isdigit(ch)) {
		x = x * 10 + ch - '0';
		ch = getchar();
	}
	return x * f;
} 

long long n, m;
long long a[MAXN];

int main() {
	long long t = read();
	for (long long u = 1; u <= t; u++) {
		n = read(); m = read();
		for (long long i = 1; i <= n; i++) a[i] = read();
		if (u == 5) {
			cout << n << " " << m << endl;
			for (long long i = 1; i <= n; i++)
				cout << a[i] << " ";
			cout << endl;
		}
		sort(a + 1, a + 1 + n);
		if (m == n) printf("Richman\n");
		else {
			if (a[m + 1] == 0) printf("Impossible\n");
			else {
				long long ans = 0;
				for (long long i = 1; i <= m + 1; i++)
					ans += a[i];
				printf("%lld\n", ans - 1);
			}
		}
	}
	return 0;
}