Updates_Queries.cpp

///link of problem : https://codeforces.com/contest/1986/problem/C

#include<bits/stdc++.h>
#include<iostream>                     ///* code by Ahmed Elnemr *///
using namespace std;
///template<typename type1,typename type2>
///#define b 10   --> const int b= 10;

#define  int  long long
#define  ll  long long
#define f first
#define sec second
#define endl "\n"
#define lp(n) for(ll i=0;i<n;i++)
#define lp2(n) for(ll j=0;j<n;j++)
#define sp(n) fixed<<setprecision(n)
#define iset set<int>
#define llset set<ll>
#define ivec vector<int>
#define llvec vector<ll>
#define iimap map<int,int>
#define chimap map<char,int>
#define chchmap map<char,char>
#define all(x) x.begin(),x.end()
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl

void fast_run()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}




signed main() {
    fast_run();
    int t=1;
    cin>>t;
    while(t--) {
       int n,m; cin>>n>>m;
       string s,c,ss; cin>>s;
       ivec arr(m);
        iimap mp;
       lp(m) {
        cin>>arr[i];
        arr[i]--;
        mp[arr[i]]++;
       }
        sort(all(arr));
       cin>>c;
       sort(all(c));

        int i=0,j=m-1,k=0;
        while(k<m) {
            if(mp[arr[k]]>1) {
                s[arr[k]]=c[j];
                j--;
                mp[arr[k]]--;
            }
            else if (mp[arr[k]]==1) {
                s[arr[k]]=c[i];
                i++;
            }

            k++;
        }












       cout<<s<<endl;








    }

    return 0;

}