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

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdi = pair<double, int>;
using pdd = pair<double, double>;
using ull = unsigned long long;
using LL = __int128_t;

#define ppc(x) __builtin_popcount(x)
#define clz(x) __builtin_clz(x)

bool Mbe;

constexpr int mod = 1e9 + 7;
void addt(int &x, int y) {
  x += y, x >= mod && (x -= mod);
}
int add(int x, int y) {
  return x += y, x >= mod && (x -= mod), x;
}

// ---------- templates above ----------

constexpr int N = 1e5 + 5;

int n, m, a[N];

void solve() {
  cin >> n >> m;
  ll ans = 0;
  for(int i = 1; i <= n; i++) {
    cin >> a[i];
    if(!a[i]) m--;
  }
  if(m < 0) {
    cout << "Impossible\n";
    return;
  }
  int mn = 1e9 + 7;
  for(int i = 1; i <= n; i++) {
    if(!a[i]) continue;
    if(m) ans += a[i], m--;
    else mn = min(mn, a[i]);
  }
  if(mn <= 1e9) cout << ans + mn - 1 << "\n";
  else cout << "Richman\n";
}

bool Med;
signed main() {
  fprintf(stderr, "%.3lf MB\n", (&Mbe - &Med) / 1048576.0);
  // ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  #ifdef ALEX_WEI
    FILE* IN = freopen("1.in", "r", stdin);
    FILE* OUT = freopen("1.out", "w", stdout);
  #endif
  int T = 1;
  cin >> T;
  while(T--) solve();
  fprintf(stderr, "%.3lf ms\n", 1e3 * clock() / CLOCKS_PER_SEC);
  return 0;
}

/*
g++ a.cpp -o a -std=c++14 -O2 -DALEX_WEI
*/