#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100005;
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
int n,m,a[N];
bool check(ll x){
	int k=m;
	For(i,1,n){
		//if(x==0)cout<<i<<" "<<k<<" fjz"<<endl;
		if(!k){
			if(x>=a[i])return 0;
		}else{
			if(a[i]>=x)return 1;
			x-=a[i]; k--;
		}
	}
	return 1;
	assert(0);
}
int get(ll x){
	int k=0;
	For(i,1,n){
		if(x>=a[i]){x-=a[i]; k++;}
	}
	return k;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int T;
	cin>>T;
	while(T--){
		cin>>n>>m;
		For(i,1,n)cin>>a[i];
		if(m==n){
			cout<<"Richman\n"; continue;
		}
		//cout<<check(0)<<endl;
		ll l=0,r=1e18;
		while(l<r){
			ll mid=(l+r)>>1; mid++;
			if(check(mid))l=mid; else r=mid-1;
		}
		
		if(get(l)==m)cout<<l<<endl;
		else cout<<"Impossible\n";
	}
}