#include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <queue>

using namespace std;

struct BoolName : numpunct<char> {
  string t, f;
  BoolName (string t = "Yes", string f = "No") : t(t), f(f) {}
  string do_truename() const {return t;}
  string do_falsename() const {return f;}
};

struct Initializer {
  Initializer() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(15) << boolalpha;
    cout.imbue(locale(cout.getloc(), new BoolName));
  }
} initializer;

template<typename T> istream& operator>>(istream &s, vector<T> &v) {
  for (T &t : v) s >> t;
  return s;
}

template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
  for (const T &t : v) s << t << endl;
  return s;
}

void set_bool_name(string t, string f) {
  cout.imbue(locale(cout.getloc(), new BoolName(t, f)));
}

template<typename T> bool chmin(T& a, T b) {return a > b ? a = b, true : false;}

template<typename T> bool chmax(T& a, T b) {return a < b ? a = b, true : false;}

template<typename T> void sort(vector<T>& v) {sort(v.begin(), v.end());}

template<class Value> class CumulativeSum2D {
private:
  struct RangeValue {
    int i, j, y, x;
    Value v;
    RangeValue(int i, int j, int y, int x, Value v) : i(i), j(j), y(y), x(x), v(v) {}
  };

  vector<vector<Value>> val;
  vector<RangeValue> rangeValue;

public:
  CumulativeSum2D() {}

  CumulativeSum2D(int n, int m) : val(n + 1, vector<Value>(m + 1, Value(0))) {}
  
  template<typename T> CumulativeSum2D(T v) {
    int n = v.size();
    int m = v.front().size();
    for (int i = 0; i < n + 1; ++i) val.emplace_back(m + 1, Value(0));
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < m; ++j) {
        val[i + 1][j + 1] = val[i][j + 1] + val[i + 1][j] - val[i][j] + v[i][j];
      }
    }
  }

  void add(int i, int j, Value v) {
    add(i, j, i + 1, j + 1, v);
  }

  void add(int i, int j, int y, int x, Value v) {
    rangeValue.emplace_back(i, j, y, x, v);
  }

  // [(i,j), (y,x))
  Value sum(int i, int j, int y, int x) {
    if (!rangeValue.empty()) {
      int n = val.size() - 1;
      int m = val.front().size() - 1;
      for (int k = 0; k < 2; ++k) {
        for (int i = n - 1; i >= 0; --i) {
          for (int j = m - 1; j >= 0; --j) {
            val[i + 1][j + 1] -= val[i][j + 1] + val[i + 1][j] - val[i][j];
          }
        }
      }
      for (const auto& v : rangeValue) {
        val[v.i + 1][v.j + 1] += v.v;
        if (v.y < n) val[v.y + 1][v.j + 1] -= v.v;
        if (v.x < m) val[v.i + 1][v.x + 1] -= v.v;
        if (v.y < n && v.x < m) val[v.y + 1][v.x + 1] += v.v;
      }
      for (int k = 0; k < 2; ++k) {
        for (int i = 0; i < n; ++i) {
          for (int j = 0; j < m; ++j) {
            val[i + 1][j + 1] += val[i][j + 1] + val[i + 1][j] - val[i][j];
          }
        }
      }
      rangeValue.clear();
    }
    return val[y][x] - val[i][x] - val[y][j] + val[i][j];
  }

  Value value(int i, int j) {
    return sum(i, j, i + 1, j + 1);
  }
};

int main() {
  int n, m, q;
  cin >> n >> m >> q;
  CumulativeSum2D<int> sum(n, n);
  for (int i = 0; i < m; ++i) {
    int l, r;
    cin >> l >> r;
    sum.add(l - 1, r - 1, 1);
  }
  for (int i = 0; i < q; ++i) {
    int a, b;
    cin >> a >> b;
    cout << sum.sum(a - 1, 0, n, b) << endl;
  }
}



Measured memory_bytes: 7668