#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000005;

int a[N];

void solve(){
    int n,m = 0,k;
    cin >> n >> k;
    for(int w,i = 1;i <= n;i ++){
        cin >> w;
        if(!w) k --;
        else a[++ m] = w;
    }
    if(k < 0) return (void)(cout << "Impossible\n");
    if(k == m) return (void)(cout << "Richman\n");
    int mi = a[m]; ll sum = 0;
    for(int i = 1;i <= k;i ++) sum += a[i];
    for(int i = k + 1;i <= m;i ++) mi = min(mi,a[i]);
    cout << sum + mi - 1 << '\n';
}

int main(){
    ios::sync_with_stdio(false);
    int TC;
    cin >> TC;
    while(TC --){
        solve();
    }
    return 0;
}