#include <iostream>
#include <cstdio>
#include <cmath>
#include <sstream>
#include <cstring>
#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 wk = 0;
		for(int i = 1;i <= n;i ++) {
			cin >> a[i];
			if(a[i] == 0) wk ++;
		}
		if(n == m) {
			cout << "Richman" << endl;
			continue;
		}
		if(wk > m) {
			cout << "Impossible" << endl;
			continue;
		}
		maxx[n] = minn[n] = a[n];
		for(int i = n - 1;i >= 1;i --)
			maxx[i] = max(maxx[i + 1] , a[i]) , minn[i] = min(minn[i + 1] , a[i]);
		int sum = 0 , num = m;
		for(int i = 1;i <= n;i ++) {
			if(num == 0) {sum += minn[i] - 1; break;}
			if(maxx[i + 1] - 1 > a[i] && num > 0)
				sum += a[i] , num --;
		}
		cout << sum << endl;
	}
	return 0;
}