#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define MULT_TEST 1
using namespace std;
typedef long double ldb;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
inline int read() {
    int w = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        w = (w << 1) + (w << 3) + ch - 48;
        ch = getchar();
    }
    return w * f;
}
inline void Solve() {
    int n, m, ans = 0, cnt = 0, mn = INF;
    n = read(); m = read();
    vector<int> E;
    for (int i = 1; i <= n; i++) {
        int x = read();
        if (x > 0) E.push_back(x);
        else cnt++;
    }
    if (m == n) return printf("Richman\n"), void();
    if (cnt > m) return printf("Impossible\n"), void();
    for (int i = 1; i <= m - cnt; i++) ans += E[i - 1];
    for (int i = m - cnt + 1; i <= n - cnt; i++) mn = min(mn, E[i - 1]);
    ans += mn - 1;
    printf("%lld\n", ans);
}
signed main() {
    int _ = 1;
#if MULT_TEST
    _ = read();
#endif 
    while (_--) Solve();
    return 0;
}