#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

int n,m,t,p;

void solve(){
    vector<vector<int>> table(n,vector<int>(m,1));

    rep(i,t){
        int d,c; cin >> d >> c;
        if(d==1){
            int H = table[0].size();
            int W1 = table.size();
            int W2 = max(c,W1-c);
            vvi cpy(W2,vi(H,0));
            for(int i=0;i<W1-c;i++){
                for(int j=0;j<H;j++){
                    cpy[i][j] = table[i+c][j];
                }
            }
            for(int i=0;i<c;i++){
                for(int j=0;j<H;j++){
                    cpy[i][j] += table[c-1-i][j];
                }
            }
            table = cpy;
        }else{
            int W = table.size();
            int H1 = table[0].size();
            int H2 = max(c,H1-c);
            vvi cpy(W,vi(H2,0));
            for(int i=0;i<W;i++){
                for(int j=0;j<H1-c;j++){
                    cpy[i][j] = table[i][j+c];
                }
            }
            for(int i=0;i<W;i++){
                for(int j=0;j<c;j++){
                    cpy[i][j] += table[i][c-1-j];
                }
            }
            table = cpy;
        }
    }

    rep(i,p){
        int x,y; cin >> x >> y;
        cout << table[x][y] << endl;
    }
}

int main(){
    while(1){
        cin >> n >> m >> t >> p;
        if(n==0 and m==0 and t==0 and p==0) break;
        solve();
    }
}

