/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.11 18:36:18
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

constexpr int MOD = 1e9 + 7;
struct mint {
private:
    long long x;
public:
    mint(long long x = 0) : x((MOD + x) % MOD) {}
    mint(std::string &s) {
        long long z = 0;
        for (int i = 0; i < s.size(); i++) {
            z *= 10;
            z += s[i] - '0';
            z %= MOD;
        }
        this->x = z;
    }
    mint &operator+=(const mint &a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint &operator-=(const mint &a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint &operator*=(const mint &a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint &operator/=(const mint &a) {
        long long n = MOD - 2;
        mint u = 1, b = a;
        while (n > 0) {
            if (n & 1) {
                u *= b;
            }
            b *= b;
            n >>= 1;
        }
        return *this *= u;
    }
    mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint &a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint &a) const {
        mint res(*this);
        return res *= a;
    }
    mint operator/(const mint &a) const {
        mint res(*this);
        return res /= a;
    }
    friend std::ostream &operator<<(std::ostream &os, const mint &n) {
        return os << n.x;
    }
    bool operator==(const mint &a) const {
        return this->x == a.x;
    }
};
int main() {
    int n, m, k;
    cin >> n >> m >> k;
    vector< mint > dp(n, 0);
    vector< mint > sum(n + 1, 1);
    vector< pair< int, int > > ele(m);
    dp[0] = 1;
    sum[0] = 0;
    for (int i = 0; i < m; i++) {
        cin >> ele[i].first >> ele[i].second;
        ele[i].first--;
        ele[i].second--;
    }
    sort(ele.begin(), ele.end());
    for (int i = 0; i < k; i++) {
        multiset< pair< int, int > > st;
        mint total = 0;
        int now = 0;
        for (int j = 0; j < n; j++) {
            while (!st.empty() && (*st.begin()).first < j) {
                pair<int,int> p = *st.begin();
                st.erase(st.begin());
                total -= sum[p.first + 1] - sum[p.second];
            }
            while (now < m && ele[now].first <= j) {
                st.insert({ele[now].second,ele[now].first});
                total += sum[ele[now].second + 1] - sum[ele[now].first];
                now++;
            }
            dp[j] = total;
        }
        for (int j = 0; j < n; j++) {
            sum[j+1] = sum[j] + dp[j];
        }
    }
    cout << dp[n-1] << endl;
    return 0;
}