#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int fx[] = {+1, -1, +0, +0, +1, +1, -1, -1, +0};
int fy[] = {+0, +0, +1, -1, +1, -1, +1, -1, +0};
template <typename T>
inline T GCD(T a, T b) {
  a = abs(a);
  b = abs(b);
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
template <typename T>
inline T LCM(T x, T y) {
  T tp = GCD(x, y);
  if ((x / tp) * 1. * y > 9e18) return 9e18;
  return (x / tp) * y;
}
template <typename T>
inline T BigMod(T A, T B, T M) {
  T ret = 1;
  while (B) {
    if (B & 1) ret = (ret * A) % M;
    A = (A * A) % M;
    B = B >> 1;
  }
  return ret;
}
template <typename T>
inline T InvMod(T A, T M) {
  return BigMod(A, M - 2, M);
}
template <typename T>
bool scani(T &n) {
  n = 0;
  bool got = false;
  bool negative = false;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') negative = true;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    got = true;
    n = n * 10 + c - 48;
    c = getchar();
  }
  if (negative) n = ~(n - 1);
  return got;
}
template <typename T>
void write(T n, int type = true) {
  if (n < 0) {
    putchar('-');
    n = -n;
  }
  if (!n) {
    putchar('0');
    if (type == 32)
      putchar(' ');
    else if (type)
      putchar('\n');
    return;
  }
  char buff[22];
  int len = 0;
  while (n) buff[len++] = n % 10 + 48, n /= 10;
  for (int i = len - 1; i >= 0; i--) putchar(buff[i]);
  if (type == 32)
    putchar(' ');
  else if (type)
    putchar('\n');
}
int scans(char *a) {
  int i = 0;
  char c = 0;
  while (c < 33) c = getchar();
  while (c > 33) {
    a[i++] = c;
    c = getchar();
  }
  a[i] = 0;
  return i;
}
char in[111];
char ans[111 * 2000];
vector<int> vv[26];
int BIT[26][111 * 2000];
inline void add(int x, int y, int n, int val) {
  while (y <= n) {
    BIT[x][y] += val;
    y += y & (-y);
  }
}
inline int query(int x, int y) {
  int ret = 0;
  while (y) {
    ret += BIT[x][y];
    y -= y & (-y);
  }
  return ret;
}
int main() {
  int k;
  scani(k);
  int len = scans(in);
  for (int i = 0; i < k * len; i++) {
    char x = in[i % len];
    ans[i + 1] = x;
    vv[x - 'a'].push_back(i + 1);
  }
  for (int i = 0; i < 26; i++) {
    int siz = vv[i].size();
    for (int j = 1; j <= siz; j++) add(i, j, siz, 1);
  }
  int qr;
  scani(qr);
  while (qr--) {
    int x;
    char ch;
    scani(x);
    scanf(" %c", &ch);
    ch = ch - 'a';
    int low, high, mid, LB;
    low = 0;
    high = vv[ch].size();
    while (low <= high) {
      mid = (low + high) >> 1;
      int tp = query(ch, mid);
      if (tp < x)
        low = mid + 1;
      else {
        LB = mid;
        high = mid - 1;
      }
    }
    add(ch, LB, vv[ch].size(), -1);
    ans[vv[ch][LB - 1]] = 0;
  }
  for (int i = 0; i < k * len; i++) {
    if (ans[i + 1]) printf("%c", ans[i + 1]);
  }
  return 0;
}
