//
// Created by Barichek on 22.07.2023 10:50:37
//

#include <bits/stdc++.h>

#define F first
#define S second
#define MP make_pair
#define PB push_back

#define all(a) a.begin(), a.end()
#define len(a) (int) (a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

#ifdef Energy_is_not_over
#define DEBUG for (bool ____DEBUG = true; ____DEBUG; ____DEBUG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl

template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define DEBUG while (false)
#define LOG(...)
#endif

const int max_n = -1, inf = 1000111222;

void solve()
{
    int n,m;
    cin>>n>>m;
    vector<int> a(n);
    for (int i=0;i<n;i++){
        cin>>a[i];
    }

    vector<int> new_a;
    for (auto i:a){
        if (i!=0){
            new_a.pb(i);
        }
        else{
            m--;
        }
    }
    a=new_a;
    if (m<0){
        cout<<"Impossible"<<"\n";
        return;
    }

    if (m==len(a)){
        cout<<"Richman"<<"\n";
        return;
    }

    ll ans=0;
    for (int i=0;i<m;i++){
        ans+=a[i];
    }
    int min_on_suf=inf;
    for (int i=m;i<len(a);i++){
        min_on_suf=min(min_on_suf,a[i]);
    }
    cout<<ans+min_on_suf-1<<"\n";
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int tests;
    cin>>tests;
    while (tests--){
        solve();
    }
    return 0;
}