#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#ifdef _DEBUG_
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl
#else
#define dump(val)
#endif

using namespace std;

typedef long long int ll;

template<typename T>
vector<T> make_v(size_t a, T b) {
    return vector<T>(a, b);
}

template<typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

template<ll MOD = 1000000007>
class ModInt {
    ll n;
    static ModInt pow(ModInt x, ll p) {
        if (p == 0) {
            return 1;
        } else if (p % 2) {
            return x * pow(x, p - 1);
        } else {
            auto t = ModInt::pow(x, p / 2);
            return t * t;
        }
    }
    ModInt reverse() {
        return ModInt::pow(*this, MOD - 2);
    }

public:
    ModInt()
        : n(0) {}
    ModInt(ll _n)
        : n(_n % MOD) {}
    ModInt operator+=(const ModInt &m) {
        n += m.n;
        if (n >= MOD) {
            n -= MOD;
        }
        return *this;
    }
    ModInt operator-=(const ModInt &m) {
        n -= m.n;
        if (n < 0) {
            n += MOD;
        }
        return *this;
    }
    ModInt operator*=(const ModInt &m) {
        n *= m.n;
        if (n >= MOD) {
            n %= MOD;
        }
        return *this;
    }
    ModInt operator/=(const ModInt &m) {
        return n *= reverse(m);
    }

    ModInt operator+=(const ll l) {
        return (*this) += ModInt(l);
    }
    ModInt operator-=(const ll l) {
        return (*this) -= ModInt(l);
    }
    ModInt operator*=(const ll l) {
        return (*this) *= ModInt(l);
    }
    ModInt operator/=(const ll l) {
        return (*this) /= ModInt(l);
    }
    ModInt operator+(const ModInt &m) {
        auto t = *this;
        return t += m;
    }
    ModInt operator-(const ModInt &m) {
        auto t = *this;
        return t -= m;
    }
    ModInt operator*(const ModInt &m) {
        auto t = *this;
        return t *= m;
    }
    ModInt operator/(const ModInt &m) {
        auto t = *this;
        return t /= m;
    }
    ModInt operator+(const ll l) {
        auto t = *this;
        return t += l;
    }
    ModInt operator-(const ll l) {
        auto t = *this;
        return t -= l;
    }
    ModInt operator*(const ll l) {
        auto t = *this;
        return t *= l;
    }
    ModInt operator/(const ll l) {
        auto t = *this;
        return t /= l;
    }
    ModInt operator=(const ll l) {
        n = l % MOD;
        if (n < 0) {
            n += MOD;
        }
        return *this;
    }
    friend ostream &operator<<(ostream &out, const ModInt &m) {
        out << m.n;
        return out;
    }
    friend istream &operator>>(istream &in, ModInt &m) {
        ll l;
        in >> l;
        m = l;
        return in;
    }
};

using MOD = ModInt<>;

class SegmentTree {
    vector<MOD> data;
    int N;

public:
    SegmentTree(int n) {
        N = 1;
        while (N < n) N *= 2;
        data.resize(2 * N - 1, MOD(0));
    }
    void add(int l, int r, MOD val) {
        add(l, r, 0, N, 0, val);
    }
    void add(int l, int r, int a, int b, int x, MOD val) {
        if (b <= l || r <= a) return;
        if (l <= a && b <= r) {
            data[x] += val;
            return;
        }
        int mid = (a + b) / 2;
        add(l, r, a, mid, 2 * x + 1, val);
        add(l, r, mid, b, 2 * x + 2, val);
    }
    MOD get(int pos) {
        pos += N - 1;
        MOD ans = data[pos];
        while (pos > 0) {
            pos = (pos - 1) / 2;
            ans += data[pos];
        }
        return ans;
    }
};

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> L(m), R(m);
    REP(i, 0, m) {
        cin >> L[i] >> R[i];
    }
    auto dp = make_v(k + 1, n, MOD(0));
    dp[0][0] = 1;
    REP (i, 0, k) {
        SegmentTree segtree(n);
        vector<MOD> sum(n + 1, MOD(0));
        REP (j, 0, n) {
            sum[j + 1] += sum[j] + dp[i][j];
        }
        REP (j, 0, m) {
            MOD a = sum[R[j]] - sum[L[j] - 1];
            segtree.add(L[j] - 1, R[j], a);
        }
        REP (j, 0, n) {
            dp[i + 1][j] = segtree.get(j);
        }
    }
    cout << dp[k][n - 1] << endl;
    return 0;
}