#include <iostream>
#include <vector>

using namespace std;

template <class T>
vector<T> Vec(size_t l, T v) { return vector<T>(l, v); }

template <class T, class... Ts>
auto Vec(size_t l, Ts... ts) {
    return vector<decltype(Vec<T>(ts...))>(l, Vec<T>(ts...));
}

class ModInt {
    using ll = long long;

public:
    int value;
    static int MOD;

    ModInt(ll value = 0) {
        this->value = value % MOD;
        if (this->value < 0) this->value += MOD;
    }

    operator int() const noexcept { return this->value; }

    ModInt& operator=(const ModInt& x) {
        if (this != &x) { this->value = x.value; }
        return *this;
    }

    bool operator==(const ModInt& x) const { return this->value == x.value; }
    bool operator!=(const ModInt& x) const { return !(*this == x); }

    ModInt operator+() const { return value; }
    ModInt operator-() const { return MOD - value; }
    ModInt operator~() const { return (*this) ^ ModInt(MOD - 2); }

    ModInt operator++() { return *this += 1; }
    ModInt operator--() { return *this -= 1; }

    ModInt operator++(int) {
        ModInt before = *this;
        ++(*this);
        return before;
    }
    ModInt operator--(int) {
        ModInt before = *this;
        --(*this);
        return before;
    }

    template <class T>
    ModInt operator+=(const T& x) {
        int sum = this->value + int(x);
        return *this = (sum < MOD ? sum : sum - MOD);
    }
    template <class T>
    ModInt operator-=(const T& x) {
        int diff = this->value - int(x);
        return *this = (diff >= 0 ? diff : diff + MOD);
    }
    template <class T>
    ModInt operator*=(const T& x) { return *this = ll(this->value) * ll(int(x)) % MOD; }
    template <class T>
    ModInt operator/=(const T& x) { return *this = (this->value % int(x) == 0 ? ModInt(this->value / int(x)) : *this * ~x); }

    template <class T>
    ModInt operator^=(const T& x) {
        int n = int(x);
        if (n == 0) return ModInt(1);
        if (n & 1) {
            return (*this) = ((*this) ^ ModInt(n - 1)) * (*this);
        } else {
            return (*this) = ((*this) * (*this)) ^ ModInt(n / 2);
        }
    }

    template <class T>
    ModInt operator+(const T& b) const { return ModInt(*this) += b; }
    template <class T>
    ModInt operator-(const T& b) const { return ModInt(*this) -= b; }
    template <class T>
    ModInt operator*(const T& b) const { return ModInt(*this) *= b; }
    template <class T>
    ModInt operator/(const T& b) const { return ModInt(*this) /= b; }
    template <class T>
    ModInt operator^(const T& b) const { return ModInt(*this) ^= b; }
};

int ModInt::MOD = 1000000007;

ostream& operator<<(ostream& os, const ModInt& x) { return os << x.value; }
istream& operator>>(istream& is, ModInt& x) { return is >> x.value; }

int main() {
    int N, M, K;
    cin >> N >> M >> K;

    vector<int> L(M), R(M);
    for (int i = 0; i < M; ++i) cin >> L[i] >> R[i];

    // dp[i][j] = i回移動した時点で、j階にいるようなパターン数
    auto dp = Vec<ModInt>(K + 1, N + 2, ModInt(0));
    dp[0][1] = 1;

    for (int i = 0; i < K; ++i) {
        // 累積和
        for (int j = 1; j <= N; ++j) {
            dp[i][j] += dp[i][j - 1];
        }

        for (int k = 0; k < M; ++k) {
            ModInt add = dp[i][R[k]] - dp[i][L[k] - 1];
            dp[i + 1][L[k]] += add;
            dp[i + 1][R[k] + 1] -= add;
        }

        // imos法の精算
        for (int j = 1; j <= N; ++j) {
            dp[i + 1][j] += dp[i + 1][j - 1];
        }
    }

    cout << dp[K][N] << endl;
    return 0;
}