#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int maxn = 1e5;
int n, m;
ll a[maxn + 10];

void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    if (n == m)
    {
        cout << "Richman\n";
        return;
    }
    int cnt0 = 0;
    for (int i = 1; i <= n; i++)
    {
        if (a[i] == 0)
            cnt0++;
    }
    if (cnt0 > m)
    {
        cout << "Impossible\n";
        return;
    }
    m -= cnt0;
    ll ans = 0;
    int pos = 1;
    int cnt = 0;
    while(cnt < m){
        if(a[pos] == 0){
            pos++;
            continue;
        }
        ans += a[pos];
        cnt++;
        pos++;
    }
    ll mi = 0x3f3f3f3f;
    for (int i = pos; i <= n; i++)
    {
        if (a[i] == 0)
            continue;
        mi = min(mi, a[i]);
    }
    ans += mi - 1;
    cout << ans << "\n";
}

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