#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
struct Edge {
    int to, cost;
    Edge(int to, int cost): to(to), cost(cost) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;

const int INF = 100000000;
int n, m, t, p;
int main() {
    //cout << fixed << setprecision(15);

    while(cin >> n >> m >> t >> p){
        if(n==0 && m == 0 && t == 0 && p == 0) break;

        int grid[510][510]={0}; // y  x
        REP(i, n) REP(j, m) grid[i][j]=1;

        int subw=0, subh=0;

        //nが幅, mが高さ

        //  左上を(x, y) = (subh, subw)で表現する
        REP(i, t){
            int d = readInt(), c = readInt();
            if(d == 1){
                

                if(n>=2*c){
                    n-=c;
                }else{
                    n -= n-c;
                }
                for(int j=0; j<c; ++j){
                    for(int k=0; k<m; ++k){
                        grid[subw+c+j][k+subh] += grid[subw+c-j-1][k+subh];
                    }
                }
                subw += c;
            }else {
                

                if(m>=2*c){
                    m-=c;
                }else{
                    m -= m-c;
                }
                for(int j=0; j<c; ++j){
                    for(int k=0; k<n; ++k){
                        grid[k+subw][subh+c+j] += grid[k+subw][subh+c-j-1];
                    }
                }subh += c;
            }
            
            
        }
        REP(i, p){
            int x = readInt(), y = readInt();
            cout << grid[subw+x][subh+y] << endl;
        }
        
        
    }

    return 0;
}


Measured memory_bytes: 4176