#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

const i64 N = 1e5 + 10, INF = 0x3f3f3f3f3f3f3f3f;

i64 n, m;
i64 a[N], b[N];

void solve()
{
    cin >> n >> m;
    for (i64 i = 1; i <= n; i++)
        cin >> a[i];

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

    for (i64 i = 1; i <= n; i++)
        if (a[i] == 0)
            m--;

    if (m < 0)
    {
        cout << "Impossible" << '\n';
        return;
    }

    i64 cnt = 0;
    for (i64 i = 1; i <= n; i++)
        if (a[i])
            b[++cnt] = a[i];

    n = cnt;
    i64 res = 0;
    for (i64 i = 1; i <= m; i++)
        res += b[i];

    i64 mi = INF;
    for (i64 i = m + 1; i <= n; i++)
        mi = min(mi, b[i]);

    cout << res + mi - 1 << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    i64 T = 1;
    cin >> T;
    while (T--)
        solve();

    return 0;
}