#include <iostream>
#include <cstdio>
#include <cmath>
#include <sstream>
#include <cstring>
#include <queue>
#define int long long
using namespace std;

const int N = 1e6 + 100;
int t;
int n , m , a[N] , maxx[N] , minn[N];
char c1[N] , c2[N];

signed main() {
	cin >> t;
	while(t --) {
		cin >> n >> m;
		
		int cnm = 0;
		for(int i = 1;i <= n;i ++) {
			cin >> a[i];
			if(a[i] == 0) cnm ++;
		}
		int l = 0 , r = 1e14 , ans = -1;
		int wcnm = r;
		while(l <= r) {
			int mid = l + r >> 1;
			int now = mid;
			int sum = 0;
			for(int i = 1;i <= n;i ++) {
				if(now >= a[i]) {
					now -= a[i];
					sum ++;
				}
			}
			if(sum == m) {
				ans = mid;
				l = mid + 1;
			} else if(sum > m) {
				r = mid - 1;
			} else if(sum < m) l = mid + 1;
		}
		if(cnm + m == n) cout << "Richman\n";else
		if(ans == -1) cout << "Impossible\n";else
		cout << ans << endl;
	}
	return 0;
}