#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define R(i, x, y) for (int i = (x); i >= (y); i--)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
bool Mbe;

const int K = 20;
const int N = 1e5 + 5;
const int P = 1e9 + 7;

int n, k, m;
int C[K][K], ans[N][K], pw[N][K];

struct BIT {
	
	int o;
	int t[N];
	
	void c(int _o) {
		o = _o;
		F (i, 1, n + 1) {
			t[i] = 0;
		}
	}
	
	int lb(int x) {
		return x & -x;
	}
	
	void u(int x, int y) {
		for (int i = x; i && i <= n + 1; i += o * lb(i)) {
			(t[i] += y) %= P;
		}
	}
	
	int q(int x) {
		int res = 0;
		for (int i = x; i && i <= n + 1; i -= o * lb(i)) {
			(res += t[i]) %= P;
		}
		return res;
	}
	
} T1, T2, T3, T4;


struct Q {
	
	int l, i, o;
	
	Q () { }
	Q (int _l, int _i, int _o) : l(_l), i(_i), o(_o) { }
	
};

vector<Q> q1[N], q2[N], q3[N], q4[N];
vector<int> s[N];

void solve() {
	cin >> n >> k >> m;
	C[0][0] = 1;
	F (i, 1, k) {
		C[i][0] = 1;
		F (j, 1, i) {
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % P;
		}
	}	
	F (i, 1, n + 1) {
		pw[i][0] = 1;
		F (j, 1, k) {
			pw[i][j] = 1ll * pw[i][j - 1] * i % P;
		}
	}
	F (i, 1, n) {
		int l, r;
		cin >> l >> r, r++;
		s[r].eb(l);
	}
	F (i, 1, m) {
		int l, r;
		cin >> l >> r, r++;
		q1[r].eb(Q(l, i, 1));
		q2[r].eb(Q(l + 1, i, 1));
		q2[r].eb(Q(r + 1, i, P - 1));
		q3[r - 1].eb(Q(l, i, 1));
		q3[l - 1].eb(Q(l, i, P - 1));
		q4[r - 1].eb(Q(l + 1, i, 1));
	}
	F (i, 0, k) {
		T1.c(1), T2.c(-1), T3.c(1), T4.c(-1);
		R (r, n + 1, 1) {
			for (int l : s[r]) {
				T1.u(l, 1);
				T2.u(l, pw[l][k - i]);
			}
			for (Q j : q1[r]) {
				(ans[j.i][i] += 1ll * j.o * pw[r][i] % P * pw[j.l][k - i] % P * T1.q(j.l) % P) %= P;
			}
			for (Q j : q2[r]) {
				(ans[j.i][i] += 1ll * j.o * pw[r][i] % P * T2.q(j.l) % P) %= P;
			}
		}
		F (r, 1, n + 1) {
			for (int l : s[r]) {
				T3.u(l, pw[r][i]);
				T4.u(l, 1ll * pw[l][k - i] * pw[r][i] % P);
			}
			for (Q j : q3[r]) {
				(ans[j.i][i] += 1ll * j.o * pw[j.l][k - i] % P * T3.q(j.l) % P) %= P;
			}
			for (Q j : q4[r]) {
				(ans[j.i][i] += 1ll * j.o * T4.q(j.l) % P) %= P;
			}
		}
	}
	F (i, 1, m) {
		int res = 0;
		F (j, 0, k) {
			(res += 1ll * C[k][j] * (((k - j) & 1) ? (P - 1) : 1) % P * ans[i][j] % P) %= P;
		}
		cout << res << '\n';
	}
}

bool Med;
int main() {
	// FIO("");
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}