#include <algorithm>
#include <cstdio>
#include <iostream>

const int N = 1e6;
#define int long long
int a[N + 2];
void solve() {
    int n, m;
    std::cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        std::cin >> a[i];
    }
    if (m == n) {
        std::cout << "Richman\n";
        return;
    }
    int ans = 0;
    for (int i = 1; i <= m; i++) {
        ans += a[i];
    }
    int mm = 1e10;
    for (int i = m + 1; i <= n; i++) {
        mm = std::min(mm, a[i]);
    }
    if (mm == 0)
        std::cout << "Impossible\n";
    else {
        ans += mm - 1;
        std::cout << ans << std::endl;
    }
}
signed main() {
    int times;
    std::cin >> times;
    while (times--) {
        solve();
    }
    return 0;
}