#include <bits/stdc++.h>
using namespace std;
inline int Readint() {
  int ret = 0;
  int f = 1;
  char ch;
  do {
    ch = getchar();
    if (ch == '-') f *= -1;
  } while (ch >= 0 && (ch < '0' || ch > '9'));
  while ('0' <= ch && ch <= '9') {
    ret = ret * 10 + ch - '0';
    ch = getchar();
  }
  return ret * f;
}
void open() {
  freopen("E.in", "r", stdin);
  freopen("E.out", "w", stdout);
}
void close() {
  fclose(stdin);
  fclose(stdout);
}
const int MAXN = 3E6 + 10;
int st[MAXN << 2] = {0};
char str[MAXN] = {0};
char ans[MAXN] = {0};
int L[MAXN] = {0};
int R[MAXN] = {0};
int F[MAXN] = {0};
int m;
int n;
void buildtree(int p, int l, int r) {
  st[p] = r - l + 1;
  if (l < r) {
    buildtree((p + p), l, (l + r) / 2);
    buildtree((p + p + 1), (l + r) / 2 + 1, r);
  }
}
void del(int p, int l, int r, int aim) {
  st[p]--;
  if (l == r) return;
  int mid = (l + r) / 2;
  if (aim <= mid)
    del((p + p), l, mid, aim);
  else
    del((p + p + 1), mid + 1, r, aim);
}
int find(int p, int l, int r, int k) {
  if (l == r) return r;
  int mid = (l + r) / 2;
  if (st[(p + p)] >= k)
    return find((p + p), l, mid, k);
  else
    return find((p + p + 1), mid + 1, r, k - st[(p + p)]);
}
void init() {
  scanf("%s", str);
  m = Readint();
  buildtree(1, 1, m);
  n = Readint();
  for (int i = 1, _END_ = n; i <= _END_; i++)
    L[i] = Readint(), R[i] = Readint();
  int now, len;
  for (int i = n, _END_ = 1; i >= _END_; i--)
    if (R[i] < st[1]) {
      len = R[i] - L[i] + 1;
      now = L[i] + 1;
      if (now > R[i]) now = L[i];
      for (register int j = 1; j <= len && R[i] < st[1]; j++) {
        int k = find(1, 1, m, R[i] + 1);
        del(1, 1, m, k);
        F[k] = find(1, 1, m, now);
        now += 2;
        if (now > R[i]) now = L[i];
      }
    }
}
void solve() {
  int j = 0;
  for (int i = 1, _END_ = m; i <= _END_; i++)
    if (F[i])
      ans[i] = ans[F[i]];
    else
      ans[i] = str[j++];
  printf("%s\n", ans + 1);
}
int main() {
  int _ = 0;
  init();
  solve();
  close();
  return 0;
}
