#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>#define CL(a,num) memset((a),(num),sizeof(a))
#define iabs(x)  ((x) > 0 ? (x) : -(x))
#define Min(a,b) (a) > (b)? (b):(a)
#define Max(a,b) (a) > (b)? (a):(b)#define ll long long
#define inf 0x7f7f7f7f
#define MOD 1073741824
#define lc l,m,rt<<1
#define rc m + 1,r,rt<<1|1
#define pi acos(-1.0)
#define test puts("<------------------->")
#define maxn 100007
#define M 150
#define N 200007
using namespace std;
//freopen("data.in","r",stdin);int pos[27][N];
int val[27][N*4];
char str[107];
int num[27];
int lp;void pushup(int rt,int mk){val[mk][rt] = val[mk][rt<<1] + val[mk][rt<<1|1];
}
void update(int mk,int d,int sc,int l,int r,int rt){if (l == r){val[mk][rt] = sc;return ;}int m = (l + r)>>1;if (d <= m) update(mk,d,sc,lc);else update(mk,d,sc,rc);pushup(rt,mk);
}
//注意modify与update的区别，才开始搞混了。
void modify(int mk,int d,int sc,int l,int r,int rt){if (l == r){val[mk][rt] = sc;return ;}int m = (l + r)>>1;if (d <= val[mk][rt<<1]) modify(mk,d,sc,lc);else{d -= val[mk][rt<<1];modify(mk,d,sc,rc);}pushup(rt,mk);
}
int query(int mk,int d,int l,int r,int rt){if (l == r){lp = l;//记录删除的位置return pos[mk][l];//返回其坐标，
    }int m = (l + r)>>1;if (d <= val[mk][rt<<1]) return query(mk,d,lc);else{d -= val[mk][rt<<1];return query(mk,d,rc);}
}
int main(){//freopen("data.in","r",stdin);int n,i,j;int k;n = 200001;scanf("%d%s",&k,str);int len =  strlen(str);int p = 0;int no = 0;CL(val,0);  CL(num,0);for (i = 0; i < k; ++i){for (j = 0; j < len; ++j){int mk = str[j] - 'a';pos[mk][++num[mk]] = p++;//记录每个点的下标，方便用于按下标从小到大排序update(mk,num[mk],1,1,n,1);no++;}}char tp[3];int q,d;scanf("%d",&q);while (q--){scanf("%d%s",&d,tp);int mk = tp[0] - 'a';modify(mk,d,0,1,n,1);no--;}int pp;int Lp;while (no--){int MIN = inf;for (i = 0; i < 26; ++i){if (val[i][1] != 0){int tmp = query(i,1,1,n,1);if (MIN > tmp){MIN = tmp;pp = i;Lp = lp;}}}update(pp,Lp,0,1,n,1);printf("%c",pp + 'a');}printf("\n");return 0;
}

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>#define CL(a,num) memset((a),(num),sizeof(a))
#define iabs(x)  ((x) > 0 ? (x) : -(x))
#define Min(a,b) (a) > (b)? (b):(a)
#define Max(a,b) (a) > (b)? (a):(b)#define ll long long
#define inf 0x7f7f7f7f
#define MOD 1073741824
#define lc l,m,rt<<1
#define rc m + 1,r,rt<<1|1
#define pi acos(-1.0)
#define test puts("<------------------->")
#define maxn 100007
#define M 150
#define N 200007
using namespace std;
//freopen("data.in","r",stdin);
int len;
bool hash[N];
struct BIT{#define lowbit(x) ((x) & (-x));int tree[N];void init(){CL(tree,0);}inline void update(int x,int val){while (x <= len){tree[x] += val;x += lowbit(x);}}inline int query(int x){int sum = 0;while (x > 0){sum += tree[x];x -= lowbit(x);}return sum;}
}a[27];char str[105];int main(){// freopen("data.in","r",stdin);int i,j;int k;scanf("%d%s",&k,str);int L = strlen(str);len = L*k;int pos = 0;for (i = 0 ; i < 26; ++i) a[i].init();for (i = 0; i < k; ++i){for (j = 0; j < L; ++j){a[str[j] - 'a'].update(++pos,1);}}CL(hash,0);int q,d;char ask[3];scanf("%d",&q);while (q--){scanf("%d%s",&d,ask);int mk = ask[0] - 'a';int ans = 0;int l = 1, r = len;while (l <= r){int m = (l + r)>>1;int tmp = a[mk].query(m);if (tmp >= d){r = m - 1;// 注意这里要r = m - 1 是因为1 到 m里面不是每一个都满足条件的只是和等于dans = m;}else if (tmp < d){l = m + 1;}}hash[ans] = true;a[mk].update(ans,-1);}pos = 0;for (i = 0 ; i < k; ++i){for (j = 0; j < L; ++j){if (!hash[++pos]) printf("%c",str[j]);}}printf("\n");return 0;
}