#include <bits/stdc++.h>
using namespace std;

const uint64_t M = 1'000'000'007;

uint64_t mpow(uint64_t x, int y){
    if(y==0) return 1;
    if(y==1) return x%M;
    if(y%2 == 0) return mpow(x*x%M, y/2);
    return mpow(x*x%M, y/2)*x%M;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout.precision(12);
    cout.setf(ios_base::fixed, ios_base::floatfield);
    
    int n, m, k;
    cin >> n >> m >> k;

    int l[3000], r[3000];
    for(int i=0;i<m;i++){
        cin >> l[i] >> r[i];
        l[i]--;
        r[i]--;
    }

    static uint64_t dp[3001][3000], inc[3000][3001];
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(l[j]<=i && i<=r[j]){
                inc[i][l[j]]++;
                inc[i][r[j]+1]--;
            }
        }
        for(int j=1;j<=n;j++) inc[i][j] += inc[i][j-1];
    }

    dp[0][0] = 1;
    for(int i=1;i<=k;i++){
        for(int pos=0;pos<n;pos++){
            for(int from=0;from<n;from++){
                dp[i][pos] += dp[i-1][from]*inc[from][pos];
                dp[i][pos] %= M;
            }
        }
    }

    cout << dp[k][n-1] << endl;
    return 0;
}