#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int n,m,k;
P el[3010];
ll dp[3010][3010];

void solve(){
  cin >> n >> m >> k;
  rep(i,m){
    cin >> el[i].first >> el[i].second;
  }
  dp[0][1]=1;
  rep(i,k){
    rep(j,n){
      dp[i][j+1]+=dp[i][j];
      dp[i][j+1]%=mod;
    }
    rep(j,m){
      int l=el[j].first,r=el[j].second;
      dp[i+1][l]+=(dp[i][r]-dp[i][l-1]+mod)%mod;
      dp[i+1][r+1]+=(-dp[i][r]+dp[i][l-1]+mod)%mod;
    }
    rep(j,n){
      dp[i+1][j+1]+=dp[i+1][j];
      dp[i+1][j+1]%=mod;
      //cout << dp[i+1][k] << " ";
    }
    //cout << "" << endl;
  }
  cout << dp[k][n] << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}