#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr int MOD = 1e9 + 7, N = 2e5 + 7, maxK = 11;

int dp[N], suf[N], pw2[N], F[maxK];

void rec(int n, int k, int s, int d) {
    if (n == k) {
        F[s] = (F[s] + d) % MOD;
    } else {
        rec(n + 1, k, s + 1, d * 1LL * (s + 1) % MOD);
        if (s) {
            for (int i = 0; i < s; ++i) {
                rec(n + 1, k, s, d);
            }
        }
    }
}

namespace SegmentTree {
    vector<int> t, tag;
    int sz = 1;

    void pull(int x) {
        t[x] = t[x << 1] + t[x << 1 | 1];
        if (t[x] >= MOD) {
            t[x] -= MOD;
        }
    }

    void apply(int x, int tg) {
        t[x] = 1LL * t[x] * tg % MOD;
        tag[x] = 1LL * tag[x] * tg % MOD;
    }

    void push(int x) {
        if (tag[x] != 1) {
            apply(x << 1, tag[x]);
            apply(x << 1 | 1, tag[x]);
            tag[x] = 1;
        }
    }

    void init(int n) {
        sz = 1 << __lg(n) + !!(n & (n - 1));
        t.assign(sz << 1, 0), tag.assign(sz << 1, 1);
        for (int i = 0; i < n; ++i) {
            t[i + sz] = dp[i];
        }
        for (int i = sz - 1; i > 0; --i) {
            pull(i);
        }
    }

    int rangeSum(int l, int r, int x = 1, int lx = 0, int rx = sz) {
        if (l >= rx || lx >= r) {
            return 0;
        }
        if (l <= lx && rx <= r) {
            return t[x];
        }
        push(x);
        int mid = lx + rx >> 1;
        int ans = rangeSum(l, r, x << 1, lx, mid) + rangeSum(l, r, x << 1 | 1, mid, rx);
        return ans < MOD ? ans : ans - MOD;
    }

    void rangeApply(int l, int r, int tg, int x = 1, int lx = 0, int rx = sz) {
        if (l >= rx || lx >= r) {
            return;
        }
        if (l <= lx && rx <= r) {
            return apply(x, tg);
        }
        int mid = lx + rx >> 1;
        push(x);
        rangeApply(l, r, tg, x << 1, lx, mid), rangeApply(l, r, tg, x << 1 | 1, mid, rx);
        pull(x);
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    freopen("help.in", "r", stdin);
    freopen("help.out", "w", stdout);
    
    int n, k;
    cin >> n >> k;

    vector<pair<int, int>> seg(n);
    vector<int> s, h(n);

    for (auto &[l, r] : seg) {
        cin >> l >> r;
        l -= 1, r -= 1;
        suf[l] += 1;
        s.push_back(r);
    }

    sort(s.begin(), s.end());
    sort(seg.begin(), seg.end(), [&](auto &x, auto &y) { return x.second < y.second; });

    for (int i = 0; i < n; ++i) {
        h[i] = lower_bound(s.begin(), s.end(), seg[i].first) - s.begin();
    }

    for (int i = 2 * n - 1; i >= 0; --i) {
        suf[i] += suf[i + 1];
    }

    pw2[0] = 1;

    for (int i = 1; i <= n; ++i) {
        pw2[i] = pw2[i - 1] * 2;
        if (pw2[i] >= MOD) {
            pw2[i] -= MOD;
        }
    }

    rec(0, k, 0, 1);

    int ans = 0;

    for (int cnt = 1; cnt <= k; ++cnt) {
        if (cnt > 1) {
            SegmentTree::init(n);
        }

        for (int i = 0; i < n; ++i) {
            auto [l, r] = seg[i];
            dp[i] = cnt == 1 ? pw2[i] : SegmentTree::rangeSum(0, h[i]);
            ans = (ans + 1LL * dp[i] * F[cnt] % MOD * pw2[suf[r]]) % MOD;
            if (cnt > 1) {
                SegmentTree::rangeApply(0, h[i], 2);
            }
        }
    }

    cout << ans << '\n';

    return 0;
}