package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)
var wr = bufio.NewWriter(os.Stdout)

func out(x ...interface{}) {
	fmt.Fprintln(wr, x...)
}

func getI() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getF() float64 {
	sc.Scan()
	i, e := strconv.ParseFloat(sc.Text(), 64)
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getI()
	}
	return ret
}

func getS() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

const mod = int(1e9 + 7)

func main() {
	defer wr.Flush()
	sc.Split(bufio.ScanWords)
	sc.Buffer([]byte{}, 1000000)
	// this template is new version.
	// use getI(), getS(), getInts(), getF()
	N, M, K := getI(), getI(), getI()
	l := make([]int, M)
	r := make([]int, M)
	for i := 0; i < M; i++ {
		l[i], r[i] = getI()-1, getI()
	}

	// f[i][j] <- i階からj階につながるエレベータの数
	f := make([][]int, N)
	for i := 0; i < N; i++ {
		f[i] = make([]int, N)
	}
	for i := 0; i < N; i++ {
		t := make([]int, N+1)
		for j := 0; j < M; j++ {
			if l[j] <= i && i < r[j] {
				t[l[j]]++
				t[r[j]]--
			}
		}
		for j := 1; j <= N; j++ {
			t[j] += t[j-1]
		}
		for j := 0; j < N; j++ {
			f[i][j] = t[j]
		}
	}

	// for i := 0; i < N; i++ {
	// 	out(i+1, f[i])
	// }

	dp := make([][]int, K+1)
	for i := 0; i < K+1; i++ {
		dp[i] = make([]int, N)
	}
	dp[0][0] = 1
	for k := 1; k <= K; k++ {
		for i := 0; i < N; i++ {
			for j := 0; j < N; j++ {
				dp[k][i] += dp[k-1][j] * f[i][j] % mod
				dp[k][i] %= mod
			}
		}
	}
	// out(dp, K)
	out(dp[K][N-1])
}