#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>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

//改造
typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//ここから編集する
class Solve {
public:
    int n, m;
    vector<vector<int>> state;

    void left(int x) {
        vector<vector<int>> tmp(n, vector<int>(m));
        vector<vector<int>> tmp2(n, vector<int>(m));
        for (int i = 0; i < n; ++i) {
            if (i < x) {
                for (int j = 0; j < m; ++j) {
                    tmp[x - i - 1][j] = state[i][j];
                }
            } else {
                for (int j = 0; j < m; ++j) {
                    tmp2[i - x][j] = state[i][j];
                }
            }
        }
        state.assign(n, vector<int>(m, 0));
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                state[i][j] = tmp[i][j] + tmp2[i][j];
            }
        }
    }

    void down(int x) {
        vector<vector<int>> tmp(n, vector<int>(m));
        vector<vector<int>> tmp2(n, vector<int>(m));
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                if (j < x) {
                    tmp[i][x - 1 - j] = state[i][j];
                } else {
                    tmp2[i][j - x] = state[i][j];
                }

            }
        }

        state.assign(n, vector<int>(m, 0));
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                state[i][j] = tmp[i][j] + tmp2[i][j];
            }
        }
    }

    bool solve() {
        int t, p;
        cin >> n >> m >> t >> p;
        if (n == 0)return false;
        state.resize(n, vector<int>(m, 1));

        for (int i = 0; i < t; ++i) {
            int d, c;
            cin >> d >> c;
            if (d == 1) {
                left(c);
            } else {
                down(c);
            }
        }
        for (int i = 0; i < p; ++i) {
            int x, y;
            cin >> x >> y;
//            x--, y--;
            cout << state[x][y] << endl;
        }

        return true;
    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    while (Solve().solve());

    return 0;
}



Measured memory_bytes: 3124