#include <bits/stdc++.h>
#include <boost/algorithm/string/join.hpp>
#include <boost/range/irange.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using boost::irange;
using boost::algorithm::join;

typedef long long ll;
typedef unsigned long long ull;
//typedef long double ld;

typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<double,double> pdd;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<int> vi;
typedef vector<pair<int, int > > vii;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vll> vvll;

constexpr ll MOD = 1e9+7;
template<typename T>constexpr auto inf=numeric_limits<T>::max()/4;
constexpr int INF=inf<int>;
constexpr ll LINF=inf<ll>;

#define Sort(x) sort(begin(x),end(x))
#define Reverse(x) reverse(begin(x),end(x))
#define ABS(a,b) ((a)<(b)?(b)-(a):(a)-(b))
#define nbit(n) (1ull<<(n))
#define _ol3(_1,_2,_3,name,...)name
#define _rep(i,n)_repi(i,0,n)
#define _repi(i,a,b)for(int i=a,i##_l=(b);i<i##_l;++i)
#define REP(...) _ol3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)
#define REPR(i,n) for(int i=n-1;i>=0;--i)
#define REPA(i,v) REP(i,(v).size())

// sort(begin(x), end(x), greater<ll>());
// lower_bound(a.begin(), a.end(), val): a[i] ≥ valである最左の位置
// upper_bound(a.begin(), a.end(), val): a[i] > valである最左の位置

// Returns minimum of a and b.
// If a is less b, a is set to b.
template<typename T>
T chmin(T& a, T b) {
  if (a > b) {
    a = b;
  }
  return a;
}

// Returns maximum of a and b.
// If a is less b, a is set to b.
template<typename T>
T chmax(T& a, T b) {
  if (a < b) {
    a = b;
  }
  return a;
}

template <typename T>
void dumpContents(const T& v, const string& msg)
{
  cerr << "### " << msg << " ###\n";
  for (const auto& x : v) {
    cerr << x << " ";
  }
  cerr << endl;
}

struct before_main_function {
  before_main_function() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<setprecision(20)<<fixed;
    #define endl "\n"
  }
} before_main_function;

// ========== end of template ==========
constexpr int N_MAX=500;
int N, M, Q;
vii edges;

int main(int argc, char** argv) {
  cin >> N >> M >> Q;
  edges.reserve(M);
  REP(i, M) {
    int L, R;
    cin >> L >> R;
    L--; R--;
    edges.emplace_back(L,R);
  }
  Sort(edges);

  // 累積和: sumedges[i] := [0,i]を始点とする路線の総数
  vi sumedges(N);
  {
    for (auto e : edges) {
      sumedges[e.first]++;
    }

    for (int i=1; i<N; i++) {
      sumedges[i] += sumedges[i-1];
    }
  }

  // 残り距離別のボーダー超え本数
  // escapes[i][j] (i-1,i)の境界を超える路線で、iからの距離がjである路線の本数
  vvi escapes(N+1, vi(N_MAX));
  vi cur(N_MAX);
  escapes[0] = cur;

  int j = 0;
  REP(i, N) {
    for (int k=1; k<N_MAX; k++) {
      cur[k-1] = cur[k];
    }
    cur[N_MAX-1] = 0;
    escapes[i] = cur;

    while (j<M) {
      if (edges[j].first != i) break;

      int length = edges[j].second - edges[j].first;
      cur[length]++;
      j++;
    }
  }

//dumpContents(sumedges, "sumedges");

  // escapesの累和
  vvi sumescapes(N+1, vi(N_MAX));
  REP(i, N+1) {
    sumescapes[i] = escapes[i];
    for (int j=1; j<N_MAX; j++) {
      sumescapes[i][j] += sumescapes[i][j-1];
    }
  }

//REP(i, N+1) {
//  cerr << "i " << i << endl;
//  REP(j, N) {
//    cerr << escapes[i][j] << " ";
//  }
//  cerr<< endl;
//  REP(j, N) {
//    cerr << sumescapes[i][j] << " ";
//  }
//  cerr<< endl;
//}


  REP(i, Q) {
    int p, q;
    cin >> p >> q;
    p--; q--;

    int d = q-p;
    // (p-1,p)の境界にて、pから見た長さがd+1以上の個数
    int overs = sumescapes[p][N_MAX-1] - sumescapes[p][d];

    // [p,q]間を始点とする路線の総数
    int count = sumedges[q] - (p==0 ? 0 : sumedges[p-1]);
    int ret = count - (sumescapes[q+1][N_MAX-1] - overs);

//cerr << "d " << d << endl;
//cerr << "count " << count << endl;
//cerr << "overs " << overs << "sumescapes[p][N_MAX-1] " << sumescapes[p][N_MAX-1] << ", sumescapes[p][d-1] " << (d==0?0:sumescapes[p][d-1]) << endl;;
//cerr << "escape from q " << sumescapes[q+1][N_MAX-1]<< endl;

    cout << ret << endl;
  }

  return 0;
}


Measured memory_bytes: 4480