#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long

int dp[3010][3010];
int sum[3010][3010];

int N, M;
typedef vector<int> vec;
typedef vector<vec> mat;

mat mul(mat &A, mat &B) {
    mat C(A.size(), vec(B[0].size()));
    for (int i = 0; i < A.size(); i++) {
        for (int k = 0; k < B.size(); k++) {
            for (int j = 0; j < C.size(); j++) {
                C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % mod;
            }
        }
    }
    return C;
}

mat pow(mat A, int n) {
    mat B(A.size(), vec(A.size()));
    for (int i = 0; i < A.size(); i++) {
        B[i][i] = 1;
    }
    while(n > 0) {
        if (n & 1) B = mul(B, A);
        A = mul(A, A);
        n >>= 1;
    }
    return B;
}
void solve(int N, int K) {
    mat A(N, vec(N));
    rep(i, N) rep(j, N) A[i][j] = sum[i + 1][j + 1];
    // rep(i, N) {
    //     rep(j, N) cout << A[i][j];
    //     cout << endl;
    // }
    // cout << endl;
    A = pow(A, K);
    // rep(i, N) {
    //     rep(j, N) cout << A[i][j] << " ";
    //     cout << endl;
    // }
    cout << A[N - 1][0] << endl;
}


signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M, K;
    cin >> N >> M >> K;
    int L[3010], R[3010];
    rep(i, M) cin >> L[i] >> R[i];
    rep(i, M) {
        REP(j, L[i], R[i]) sum[j][j]++;
        REP(j, L[i], R[i]) sum[j][R[i] + 1]--;
    }
    rep(i, N + 1) for(int j = i; j <= N; j++) sum[i][j + 1] += sum[i][j];
    REP(i, 1, N) REP(j, 1, N) sum[i][j] = max(sum[i][j], sum[j][i]);
    // rep(i, N + 2) {
    //     rep(j, N + 2) {
    //         cout << sum[i][j] << " ";
    //     }
    //     cout << endl;
    // }
    // cout << endl;
    dp[0][1] = 1;
    rep(i, K) {
        REP(j, 1, N) {
            REP(k, 1, N) {
                dp[i + 1][j] += dp[i][k] * sum[k][j]; 
                //cout << "dp[" << i + 1 << "][" << j << "] = " << "dp[" << i << "][" << k << "] * " << sum[j][k] << " = " << dp[i + 1][j] << endl;
                dp[i + 1][j] %= mod;
            }
        }
    }
    // rep(i, K + 1) {
    //     rep(j, N) {
    //         cout << dp[i][j + 1] << " ";
    //     }
    //     cout << endl;
    // }
    solve(N, K);
    //cout << dp[K][N] << endl;

    return 0;
}