#include <iostream> 
#include<vector>
#include<string>
#include<algorithm>
#include <cstring>
#include<ctype.h>
#include<set>
#include<map>
#include<cmath>
#include<climits>
#include<stack>
#include<list>
#include<queue>
#include<unordered_map>
#include<unordered_set>
#define IOS ios::sync_with_stdio(false);cin.tie(0); 
#define maxn 200000+5
#define ll long long
using namespace std;
#define maxn 1000000+5
#define ll long long

using namespace std;


int main() {
    int t;
    cin >> t;
    while (t--)
    {
       
        int n, m;
        cin >> n >> m;
        vector<int>a(n + 1, 0);

        int sum = 0; int cnt = 0;
        for (int i = 1; i <= n; i++)
        {
            cin >> a[i];
            if (a[i] == 0) cnt++;
        }
        if (n == m) {
            cout << "Richman"<<endl;
            continue;
        }
        if (cnt >= m&&cnt)
        {
            
            cout << "Impossible"<<endl;
            continue;
        }
        sort(a.begin() + 1, a.begin() + n + 1);
        int cnt1 = m + 1;
        sum = 0;
        for (int i = 1; i <= n; i++)
        {
            if (i == m + 1)

            {
                sum += a[i] - 1; break;
            }
            else sum += a[i];
        }
        cout << sum << endl;
        continue;
       
    }
    
}