#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t int128;
typedef pair<int, int> pii;
#define iofast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define lowbit(x) (x&(-x))
#define inv(x) qpow(x,mod-2)
#define debug(x) cout << (#x) << " = " << x << endl
#define range(x) (x).begin(), (x).end()

const int iINF = 0x3f3f3f3f;
const ll llINF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 998244353;

/*---------------------------------------*/

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int>v;
    int cnt = 0;
    for (int i = 1;i <= n;i++) {
        int x;
        cin >> x;
        cnt += bool(!x);
        if (x)
            v.push_back(x);
    }
    if (n == m)
        cout << "Richman\n";
    else if (cnt > m)
        cout << "Impossible\n";
    else {
        n -= cnt;
        m -= cnt;
        ll ans = 0;
        for (int i = 0;i < m;++i)
            ans += v[i];
        int mi = iINF;
        for (int i = m;i < n;++i)
            mi = min(mi, v[i]);
        ans += mi - 1;
        cout << ans << '\n';
    }
}

/*---------------------------------------*/

int main()
{
    iofast;
    int t = 1;
    cin >> t;
    while (t--)
        solve();

    return 0;
}