#include <iostream>
#include <cstdio>
#include <cmath>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long ll;
const int N=1e6+5;
int a[N],n,m;
void solve(){
    scanf("%d%d",&n,&m);
    rep(i,1,n) scanf("%d",a+i);
    if(m>=n){
        puts("Richman");
        return ;
    }
    int c=0; ll ans=0;
    rep(i,1,n) if(a[i]==0) c++;
    if(c>m){
        puts("impossible");
        return ;
    }
    m-=c;
    int p=1,Min=1e9+7;
    while(m>0){
        if(a[p]!=0) ans+=a[p],m--;
        p++;
    }
    rep(i,p,n){
        Min=min(Min,a[i]);
    }
    ans+=Min-1;
    printf("%lld\n",ans);
}
int main(){
    int T; scanf("%d",&T);
    while(T--) solve();
    return 0;
}