/*
ID: hedichehaidar
TASK: cowtour
LANG: C++11
*/
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define dte  tuple<double , double , double>
using namespace std;
const int INF = 1000*1000*1000; // 1 e 9
const int MOD = INF + 9; //998244353;
const double EPS = 0.000000001; // 1 e -9
const ll inf = (ll)1e18;

void solve(){
    int n , m; cin>>n>>m;
    vii a(n) ; vi b(m);
    for(int i = 0 ; i < n ; i++) cin>>a[i].ff;
    for(int i = 0 ; i < n ; i++) a[i].ss = i + 1;
    for(int i = 0 ; i < m ; i++) cin>>b[i];
    sort(all(a));
    int last = 0;
    vi res;
    int ans = 0;
    for(int i = 0 ; i < m ; i++){
        auto k = lower_bound(all(a) , make_pair(b[i] , 0)) - a.begin();
        if(k == n || (last == a[k].ff && k == n - 1)){
            if(last == a[0].ff){
                res.pb(a[1].ss);
                last = a[1].ff;
            }
            else{
                res.pb(a[0].ss);
                last = a[0].ff;
            }
        }
        else {
            ans++;
            if(last == a[k].ff) k++;
            last = a[k].ff;
            res.pb(a[k].ss);
        }
    }
    cout << ans << "\n";
    for(auto c : res) cout << c << " ";
    cout << "\n";
}
int main(){
    //ifstream fin ("testing.txt");
    //ofstream fout ("output.txt");
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t; cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

/*
    Think of : BS / DFS / BFS / SSSP / SCC / MSP / MAX FLOW / TOPSORT / LCA / MATRIX / DP(bitmask) / 2 POINTERS / SEG TREE / MATH / UN FIND / MO
    Read the statement CAREFULLY !!
    Make a GREADY APPROACH !!!! (start from highest / lowest)
    Make your own TESTS !!
    Be careful from CORNER CASES !
*/