#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;

unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

ll ll_gcd(ll a, ll b) {
    if (a < b) return ll_gcd(b, a);
    ll r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

int main() {
    ll n, m, q;
    cin >> n >> m >> q;
    vector<vector<ll>> z(n+1,vector<ll>(n+1));
    for (int i = 0; i < m; i++) {
        ll a, b;
        cin >> a >> b;
        z[a][b]++;
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            z[i][j + 1] += z[i][j];
        }
    }
    for (int i = 0; i < q; i++) {
        ll a, b;
        cin >> a >> b;
        ll ans = 0;
        for (int j = a; j < b+1; j++) {
            ans += z[j][b];
        }
        cout << ans << endl;
    }
}
//-- In The Name of God --
#include<bits/stdc++.h>
using namespace std;


#define      mod     1e9+7
#define      pai     acos(-1)
#define      ff      first
#define      ss      second
#define      ll      long long
#define      pb      push_back
#define      mp      make_pair
#define      endl    "\n"
#define      fii     freopen("input.txt","r",stdin);
#define      foo     freopen("output.txt","w",stdout);
#define      fast    ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);

const   ll   mx=1e5+100;
ll arr[600][600];
map<pair<ll,ll>,bool>visit;
int main()
{
    fast;
    ll i,j,a,b,c,d,n,m,t;
    cin>>n>>m;
    memset(arr,-1,sizeof(arr));
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            cin>>arr[i][j];
        }
    }
    vector<pair<pair<ll,ll>,pair<ll,ll> > >vec;
    ll flag=1;
    for(i=1;i<=n;i++)
    {
        if(flag==1)
        {
            for(j=1;j<m;j++)
            {
                if(arr[i][j]&1)
                {
                    if(arr[i][j+1]!=-1)
                    {
                        arr[i][j+1]+=1;
                        vec.pb(mp(mp(i,j),mp(i,j+1)));
                    }
                }
            }
            if(arr[i+1][m]!=-1 && arr[i][m]&1)
            {
                arr[i+1][m]+=1;
                vec.pb(mp(mp(i,j),mp(i+1,j)));
            }
            flag=2;
        }
        else if(flag==2)
        {
            for(j=m;j>1;j--)
            {
                if(arr[i][j]&1)
                {
                    arr[i][j-1]+=1;
                    vec.pb(mp(mp(i,j),mp(i,j-1)));
                }
            }
            if(arr[i+1][1]!=-1 && arr[i][1]&1)
            {
                arr[i+1][1]+=1;
                vec.pb(mp(mp(i,j),mp(i+1,j)));
            }
            flag=1;
        }
    }

    ll cnt=vec.size();
    cout<<cnt<<endl;
    for(auto it:vec)
    {
        a=it.first.first;
        b=it.first.second;
        c=it.second.first;
        d=it.second.second;
        cout<<a<<" "<<b<<" "<<c<<" "<<d<<endl;
    }
    return 0;

}

