#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <cstdlib>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional> 
#include <iomanip>
#include <unordered_map>
#include <memory.h>
#include <unordered_set>
#include <fstream>
#include <random>

using namespace std;

const long long int MOD = 1e9 + 7;
long long int dp[3001][3001];
long long int psum[3001];
vector <int> l[3001];
vector <int> r[3001];
int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, M, K, L, R;

	cin >> N >> M >> K;

	for (int i = 0; i < M; i++)
	{
		cin >> L >> R;
		l[L].push_back(R);
		r[R].push_back(L);
	}

	dp[0][1] = 1;

	for (int i = 0; i < K; i++)
	{
		psum[1] = dp[i][1];
		for (int j = 2; j <= N; j++)
		{
			psum[j] = psum[j - 1] + dp[i][j];
			psum[j] %= MOD;
		}
		long long int val = 0;
		for (int L = 1; L <= N; L++)
		{
			for (auto R : l[L])
			{
				long long int temp = psum[R] - psum[L - 1];
				temp %= MOD;
				if (temp < 0)
				{
					temp += MOD;
				}
				val += temp;
				val %= MOD;
			}
			dp[i + 1][L] = val;
			for (auto R : r[L])
			{
				long long int temp = psum[L] - psum[R - 1];
				temp %= MOD;
				if (temp < 0)
				{
					temp += MOD;
				}
				val -= temp;
				val %= MOD;
				if (val < 0)
				{
					val += MOD;
				}
			}
		}
	}

	cout << dp[K][N] << '\n';

	return 0;
}