#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
inline int read(){
    char ch=getchar();
    int num=0,f=1;
    while(!isdigit(ch)){
        if(ch=='-')f=-1;
        ch=getchar();
    }
    while(isdigit(ch)){
        num=num*10+ch-'0';
        ch=getchar();
    }
    return f>0?num:-num;
}
const int MAXN=100010;
int n,m;
int a[MAXN];
bool check(int val){
    int cnt=0;
    rep(i,1,n){
        if(val>=a[i]){
            cnt++;
            val-=a[i];
        }
    }
    return cnt<=m;
}
signed main(){
    //freopen("J.in","r",stdin);
    int T;
    cin>>T;
    int cnt=0;
    while(T--){
        cnt++;
        n=read(),m=read();
        int s=0;
        rep(i,1,n){
            a[i]=read();
            s+=a[i];
        }
        if(!check(0)){
            puts("Impossible");
            continue;
        }
        else if(m==n){
            puts("Richman");
            continue;
        }
        int l=0,r=s;
        int ans=s;
        while(l<=r){
            int mid=(l+r)/2;
            if(check(mid)){
                l=mid+1;
                ans=mid;
            }
            else r=mid-1;
        }
        printf("%lld\n",ans);
        
        if(cnt==12){
            cout<<n<<' '<<m<<endl;
            rep(i,1,n){
                cout<<a[i]<<' ';
            }
            cout<<endl;
        }
    }
}