#include <bits/stdc++.h>
using namespace std;
long long int max(long long int a, long long int b) {
  if (a > b) {
    return a;
  }
  return b;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
long long int min(long long int a, long long int b) {
  if (a < b) {
    return a;
  }
  return b;
}
long long int power(long long int x, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n % 2 == 1) {
      res = (res * x);
    }
    x = (x * x);
    n = n / 2;
  }
  return res;
}
long long int factorialNumInverse[1000001];
long long int naturalNumInverse[1000001];
long long int fact[1000001];
void InverseofNumber(long long int n, long long int p) {
  naturalNumInverse[0] = naturalNumInverse[1] = 1;
  for (long long int i = 2; i <= n; i++)
    naturalNumInverse[i] = naturalNumInverse[p % i] * (p - p / i) % p;
}
void InverseofFactorial(long long int n, long long int p) {
  factorialNumInverse[0] = factorialNumInverse[1] = 1;
  for (long long int i = 2; i <= n; i++)
    factorialNumInverse[i] =
        (naturalNumInverse[i] * factorialNumInverse[i - 1]) % p;
}
void factorial(long long int n, long long int p) {
  fact[0] = 1;
  for (long long int i = 1; i <= n; i++) {
    fact[i] = (fact[i - 1] * i) % p;
  }
}
long long int nCrModp(long long int n, long long int r, long long int p) {
  long long int ans =
      ((fact[n] * factorialNumInverse[r]) % p * factorialNumInverse[n - r]) % p;
  return ans;
}
long long int n, k, t, m;
void solve(long long int pre[], long long int minval, long long int maxval,
           long long int preIndex) {
  if (preIndex >= n) return;
  if (pre[preIndex] < minval || pre[preIndex] > maxval) {
    return;
  }
  int val = pre[preIndex];
  preIndex++;
  solve(pre, minval, val, preIndex);
  solve(pre, val, maxval, preIndex);
  cout << val << " ";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  factorial(200005, 1000000007);
  InverseofNumber(200005, 1000000007);
  InverseofFactorial(200005, 1000000007);
  cin >> n >> k >> m >> t;
  vector<long long int> v;
  long long int pos = k;
  long long int len = n;
  cout << "\n";
  for (int i = 0; i < t; i++) {
    int ty;
    cin >> ty;
    if (ty == 1) {
      int ind;
      cin >> ind;
      if (ind <= pos) {
        pos++;
      }
      -len++;
    } else {
      int ind;
      cin >> ind;
      if (ind < pos) {
        pos = pos - ind;
        len = len - ind;
      } else {
        len = ind;
      }
    }
    cout << len << " " << pos << "\n";
  }
  return 0;
}
