import java.util.*;

public class Main {
    static final int MOD = 1000000007;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int k = sc.nextInt();
        int[] lArr = new int[m];
        int[] rArr = new int[m];
        for (int i = 0; i < m; i++) {
            lArr[i] = sc.nextInt();
            rArr[i] = sc.nextInt();
        }
        long[][] dp = new long[k + 1][n + 2];
        Arrays.fill(dp[0], 1);
        dp[0][0] = 0;
        dp[0][n + 1] = 0;
        for (int i = 1; i <= k; i++) {
            for (int j = 0; j < m; j++) {
                long amount = (dp[i - 1][rArr[j]] - dp[i - 1][lArr[j] - 1] + MOD) % MOD;
                dp[i][lArr[j]] += amount;
                dp[i][lArr[j]] %= MOD;
                dp[i][rArr[j] + 1] += MOD - amount;
                dp[i][rArr[j] + 1] %= MOD;
            }
            for (int j = 1; j <= n + 1; j++) {
                dp[i][j] += dp[i][j - 1];
                dp[i][j] %= MOD;
            }
            for (int j = 1; j <= n + 1; j++) {
                dp[i][j] += dp[i][j - 1];
                dp[i][j] %= MOD;
            }
        }
        long ans = (dp[k][n] - dp[k][n - 1] + MOD) % MOD;
        System.out.println(ans);
    }
}