// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}

int l[3001], r[3001];
ll dp[3001][3001];
vector<int> L[3001], R[3001];
ll sum[2][3001];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  rep(i, m)cin >> l[i] >> r[i];
  rep(i, m){
    L[l[i]].pb(r[i]);
    R[r[i]].pb(l[i]);
  }
  dp[0][1] = 1;
  for(int i = 1; i <= n; i++)sum[0][i] = 1;
  for(int i = 1; i <= k; i++){
    ll s = 0;
    sum[1][0] = 0;
    for(int j = 1; j <= n; j++){
      for(auto c: L[j]){
        s = (s + sum[0][c] - sum[0][j-1]) % mod;
        if(s < 0)s += mod;
      }
      dp[i][j] = s;
      sum[1][j] = (sum[1][j-1] + dp[i][j]) % mod;
      for(auto c: R[j]){
        s = (s - sum[0][j] + sum[0][c-1]) % mod;
        if(s < 0)s += mod;
      }
    }
    swap(sum[0], sum[1]);
  }
  cout << dp[k][n] << endl;
	return 0;
}