#include <iostream>
#include <algorithm>
#include <vector>
#include <string>

using namespace std;

struct value{
    int vale; // long_max
    int num; // cnt 갯수
};

void reconstruct(int start, int skip, vector<int>& lis, int *A, int n, int *long_max, int *cnt, int llong) {
    vector <value> *B = new vector <value>[llong+1];
    value a;

    for(int i=0; i<n; i++){
        a.vale = A[i];
        a.num = cnt[i];

        B[long_max[i]].push_back(a);
    }

    int *poin = new int[llong+1];

    for(int i=1; i<llong+1; i++){
        poin[i] = B[i].size()-1;
    }

    a.num = 0;
    a.vale = 0;
    int index = llong;
    while(index != 0){
        if(a.vale > B[index][poin[index]].vale){
            poin[index]--;
            continue;
        }

        a = B[index][poin[index]];
        if(a.num < skip){
            while(skip > a.num){

                skip = skip - a.num;
                poin[index]--;
                a = B[index][poin[index]];
            }
        }

        lis.push_back(a.vale);
        index--;
    }       

}

int main(){
    int num;
    cin >> num;

    for(int i=0; i<num; i++){
        int n, K;

        cin >> n >> K;

        int *A = new int[n];
        int *long_max = new int[n];
        int *cnt = new int[n]; // index번호에서 시작되는 단조함수의 갯수
        int llong = 0;

        for(int j=0; j<n; j++){
            cin >> A[j];
            long_max[j] = 1;
        }

        for(int j=n-1; j>=0; j--){
            for(int k=n-1; k>=j; k--){
                if(A[j] < A[k] && long_max[k] >= long_max[j]){
                    long_max[j] = long_max[k] + 1; // 4 4 3 3 2 2 1 1 로 생김
                }

                if(llong < long_max[j])
                    llong = long_max[j];
            }
        }

        for(int j= n-1; j>=0; j--){
            if(long_max[j] == 1){
                cnt[j] = 1;
                continue;
            }

            vector <int> qp;

            int num = 1;
            int last = 0;

            for(int k=j+1; k<n; k++){
                if(long_max[j] <= long_max[k])
                    continue;

                if(last == long_max[k]){
                    num++;
                }
                else{
                    qp.push_back(num);
                    last = long_max[k];
                    num = 1;
                }   
            }

            qp.push_back(num);
            cnt[j] = 1;
            while(!qp.empty()){
                int np = qp.back();
                cnt[j] = cnt[j] * np;
                qp.pop_back();
            }

        }


        vector<int> kth;
        reconstruct(0, K, kth, A, n, long_max, cnt, llong);
        cout << kth.size() << endl;
        for(int i = 0; i < kth.size(); i++) {
            if(i) cout << ' ';
            cout << kth[i];
        }
        cout << endl;


    }

    return 0;
}