#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;

typedef long long ll;
//typedef pair<int,int> Pint;
//typedef pair<ll, ll> P;
//typedef pair<ll, pair<ll, ll>> P;
//typedef tuple<int,int,int> T;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define revrep(i, n) for(ll i = n-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
ll INFL = 1LL << 60;//10^18 = 2^60
int INF = 1 << 30;//10^9
ll MOD = 1e9 + 7;
//ll MOD  = 998244353;
vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  x %= MOD; x += MOD; x %= MOD;
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}
ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}
ll lcm(ll x, ll y){return x / gcd(x, y) * y % MOD;};

vector<ll> add(vector<ll> T, vector<ll> S){
  vector<ll> res(S.size(), 0);
  rep(i, S.size()) res[i] = S[i] + T[i];
  return res;
}
vector<ll> pile(vector<ll> S){
  vector<ll> res(S.size(), 0);
  rep(i, S.size()){
    if(i == 0) continue;
    res[i] = S[i-1];
  }
  return res;
}

int main(){
  while(true){
    ll N, M, T, P; cin >> N >> M >> T >> P;
    if(N == 0 && M == 0 && T == 0 && P == 0) break;
    vector<ll> d(T), c(T);
    vector<ll> x(P), y(P);
    rep(i, T) cin >> d[i] >> c[i];
    rep(i, P) cin >> x[i] >> y[i];
    vector<vector<ll>> cnt(M, vector<ll>(N, 1));
    rep(t, T){
      if(d[t] == 1){
        if(c[t] <= N - c[t]){
          vector<vector<ll>> nextcnt(M, vector<ll>(N-c[t], 0));
          rep(i, M)rep(j, N-c[t]){
            if(j < c[t]) nextcnt[i][j] = cnt[i][c[t]+j] + cnt[i][c[t]-1-j];
            else nextcnt[i][j] = cnt[i][c[t]+j];
          }
          N = N - c[t];
          cnt = nextcnt;
        }else{
          vector<vector<ll>> nextcnt(M, vector<ll>(c[t], 0));
          rep(i, M)rep(j, c[t]){
            if(j < N - c[t]) nextcnt[i][j] = cnt[i][c[t]+j] + cnt[i][c[t]-1-j];
            else nextcnt[i][j] = cnt[i][c[t]-1-j];
          }
          N = c[t];
          cnt = nextcnt;
        }
      }else{
        if(c[t] <= M - c[t]){
          vector<vector<ll>> nextcnt(M-c[t], vector<ll>(N, 0));
          rep(i, M-c[t])rep(j, N){
            if(i < c[t]) nextcnt[i][j] = cnt[c[t]-1-i][j] + cnt[c[t]+i][j];
            else nextcnt[i][j] = cnt[c[t]+i][j];
          }
          M = M-c[t];
          cnt = nextcnt;
        }else{
          vector<vector<ll>> nextcnt(c[t], vector<ll>(N, 0));
          rep(i, c[t])rep(j, N){
            if(i < M - c[t]) nextcnt[i][j] = cnt[c[t]+i][j] + cnt[c[t]-1-i][j];
            else nextcnt[i][j] = cnt[c[t]-1-i][j];
          }
          M = c[t];
          cnt = nextcnt;
        }
      }
    }
    rep(i, P){
      cout << cnt[y[i]][x[i]] << endl;
    }
  }
}



Measured memory_bytes: 3204