#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
struct seg{
    pair<ll,ll> minn[400010];
    ll tag[400010];
    void pushup(int p){
        minn[p]=min(minn[p<<1],minn[p<<1|1]);
    }
    int n;
    void intt(vector<int> ve){
        n=(int)ve.size()-1;
        build(1,1,n,ve);
    }
    void spread(int p){
        minn[p<<1].first-=tag[p];
        minn[p<<1|1].first-=tag[p];
        tag[p<<1]+=tag[p],tag[p<<1|1]+=tag[p];
        tag[p]=0;
    }
    void build(int p,int l,int r,vector<int>& ve){
        tag[p]=0;minn[p]={0,0};
        if(l==r)    {minn[p]={ve[l],l};return ;}
        int mid=(l+r)>>1;
        build(p<<1,l,mid,ve);
        build(p<<1|1,mid+1,r,ve);
        pushup(p);
    }
    ll query(){
        return minn[1].second;
    }
    void modify(int p,int l,int r,int L,int R,ll nz){
        if(L<=l&&r<=R){
            tag[p]+=nz;
            minn[p].first-=nz;
            return ;
        }
        spread(p);
        int mid=(l+r)>>1;
        if(mid>=L)  modify(p<<1,l,mid,L,R,nz);
        if(mid<R)   modify(p<<1|1,mid+1,r,L,R,nz);
        pushup(p);
    }
    void modify(int l,int r,int nz){
        modify(1,1,n,l,r,nz);
    }
};
seg sg;
void solve(void) {
    int n,m;
    cin>>n>>m;
    vector<int> a(1);
    for(int i=1;i<=n;i++)   {
        int nz;
        cin>>nz;
        if(nz==0) m--;  
        else a.push_back(nz);
    }
    if(m<0) {cout<<"Impossible\n";return ;}
    int sz=(int)a.size()-1;
    if(m==sz)   {cout<<"Richman\n";return ;}
    sg.intt(a);
    ll ans=0;
    const ll mx=1e16;
    for(int i=1;i<=m+1;i++){
        int w=sg.query();
        ans+=a[w];
        sg.modify(w,w,-mx);
        if(w!=1)    sg.modify(1,w-1,a[w]);
    }
    cout<<ans-1<<'\n';

}

signed main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int _ = 1;
    cin >> _;
    while (_--) solve();
    return 0;
}
/*
4
4 2
1 2 4 8
4 0
100 99 98 97
2 2
10000 10000
5 3
0 0 0 0 0
*/
/*
1
5 5
0 0 0 0 0
*/