#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1000000007;
using Mint = ModInt<MO>;


// Dfa::ac can be any int.
// Nfa::ac is cast to bool.

// n: number of states
// s: initial state
// a: alphabet size
struct Dfa {
  int n, s, a;
  vector<vector<int>> to;
  vector<int> ac;
  Dfa() : n(0), s(-1), a(0), nn(-1) {}
  Dfa(int n_, int s_, int a_) : n(n_), s(s_), a(a_), to(n, vector<int>(a, -1)), ac(n, 0), nn(-1) {}
  int addState(int acu = 0) {
    const int u = n++;
    to.emplace_back(a, -1);
    ac.push_back(acu);
    return u;
  }

  vector<vector<vector<int>>> from;
  int nn;
  vector<int> ids;
  vector<vector<int>> uss;
  Dfa minimize() {
    assert(0 <= s); assert(s < n);
    for (int u = 0; u < n; ++u) for (int e = 0; e < a; ++e) assert(~to[u][e]);
    // BFS to find reachable states
    int queLen = 0;
    vector<int> que(n);
    ids.assign(n, -1);
    ids[que[queLen++] = s] = -2;
    for (int j = 0; j < queLen; ++j) {
      const int u = que[j];
      for (int e = 0; e < a; ++e) if (!~ids[to[u][e]]) ids[que[queLen++] = to[u][e]] = -2;
    }
    // reverse transitions
    from.assign(n, vector<vector<int>>(a));
    for (int u = 0; u < n; ++u) if (~ids[u]) {
      for (int e = 0; e < a; ++e) from[to[u][e]][e].push_back(u);
    }
    // separate by ac
    vector<int> acs;
    for (int u = 0; u < n; ++u) if (~ids[u]) acs.push_back(ac[u]);
    std::sort(acs.begin(), acs.end());
    acs.erase(std::unique(acs.begin(), acs.end()), acs.end());
    nn = acs.size();
    // uss as queue
    uss.assign(n, {});
    for (int u = 0; u < n; ++u) if (~ids[u]) uss[std::lower_bound(acs.begin(), acs.end(), ac[u]) - acs.begin()].push_back(u);
    int xm = 0;
    for (int x = 1; x < nn; ++x) if (uss[xm].size() < uss[x].size()) xm = x;
    uss[0].swap(uss[xm]);
    for (int x = 0; x < nn; ++x) for (const int u : uss[x]) ids[u] = x;
    // (reused)
    vector<int> parting(n, 0), app(n, 0);
    for (int x = 1; x < nn; ++x) {
      // partition by reachability to uss[x]
      for (const int u : uss[x]) parting[u] = 1;
      for (int e = 0; e < a; ++e) {
        vector<int> ys;
        for (const int u : uss[x]) for (const int v : from[u][e]) {
          const int y = ids[v];
          if (!app[y]) {
            app[y] = 1;
            ys.push_back(y);
          }
        }
        for (const int y : ys) {
          vector<int> vss[2];
          for (const int v : uss[y]) vss[parting[to[v][e]]].push_back(v);
          if (!vss[0].empty()) {
            if (vss[0].size() < vss[1].size()) vss[0].swap(vss[1]);
            const int z = nn++;
            for (const int v : vss[1]) ids[v] = z;
            uss[y].swap(vss[0]);
            uss[z].swap(vss[1]);
          }
        }
        for (const int y : ys) app[y] = 0;
      }
      for (const int u : uss[x]) parting[u] = 0;
    }
    uss.resize(nn);
    // to make the output unique
    std::sort(uss.begin(), uss.end());
    for (int x = 0; x < nn; ++x) {
      std::sort(uss[x].begin(), uss[x].end());
      for (const int u : uss[x]) ids[u] = x;
    }
    // make new DFA
    Dfa dfa(nn, ids[s], a);
    for (int x = 0; x < nn; ++x) {
      const int u = uss[x][0];
      for (int e = 0; e < a; ++e) dfa.to[x][e] = ids[to[u][e]];
      dfa.ac[x] = ac[u];
    }
    return dfa;
  }
};

// Checks if reachable parts are isomorphic.
bool isIsomorphic(const Dfa &dfa0, const Dfa &dfa1) {
  if (dfa0.a != dfa1.a) return false;
  const int a = dfa0.a;
  vector<int> f01(dfa0.n, -1);
  vector<int> f10(dfa1.n, -1);
  int queLen = 0;
  vector<int> que0(dfa0.n);
  vector<int> que1(dfa1.n);
  f10[f01[dfa0.s] = dfa1.s] = dfa0.s;
  que0[queLen] = dfa0.s;
  que1[queLen] = dfa1.s;
  ++queLen;
  for (int j = 0; j < queLen; ++j) {
    const int u0 = que0[j];
    const int u1 = que1[j];
    for (int e = 0; e < a; ++e) {
      const int v0 = dfa0.to[u0][e];
      const int v1 = dfa1.to[u1][e];
      if (!~f01[v0] && !~f10[v1]) {
        f10[f01[v0] = v1] = v0;
        que0[queLen] = v0;
        que1[queLen] = v1;
        ++queLen;
      } else {
        if (!~f01[v0]) return false;
        if (!~f10[v1]) return false;
        if (f10[f01[v0]] != v0) return false;
        if (f01[f10[v1]] != v1) return false;
      }
    }
  }
  for (int u0 = 0; u0 < dfa0.n; ++u0) if (~f01[u0] && dfa0.ac[u0] != dfa1.ac[f01[u0]]) return false;
  return true;
}

// n: number of states
// s: initial state
// a: alphabet size
struct Nfa {
  int n, s, a;
  vector<vector<vector<int>>> to;
  vector<vector<int>> eps;
  vector<int> ac;
  Nfa() : n(0), s(-1), a(0) {}
  Nfa(int n_, int s_, int a_) : n(n_), s(s_), a(a_), to(n, vector<vector<int>>(a)), eps(n), ac(n, 0) {}
  int addState(int acu) {
    const int u = n++;
    to.emplace_back(a);
    eps.emplace_back();
    ac.push_back(acu);
    return u;
  }
  Dfa toDfa() const {
    // BFS for eps transitions
    vector<int> que(n);
    vector<int> vis(n, -1);
    vector<vector<int>> epsed(n);
    for (int u = 0; u < n; ++u) {
      int queLen = 0;
      vis[que[queLen++] = u] = u;
      for (int j = 0; j < queLen; ++j) {
        const int v = que[j];
        for (const int w : eps[v]) if (vis[w] != u) vis[que[queLen++] = w] = u;
      }
      epsed[u] = vector<int>(que.begin(), que.begin() + queLen);
      std::sort(epsed[u].begin(), epsed[u].end());
    }
    // uss as queue
    vector<vector<int>> uss;
    map<vector<int>, int> ids;
    uss.push_back(epsed[s]);
    ids[epsed[s]] = 0;
    Dfa dfa(1, 0, a);
    for (int x = 0; x < dfa.n; ++x) {
      for (int e = 0; e < a; ++e) {
        vector<int> ws;
        for (const int u : uss[x]) for (const int v : to[u][e]) ws.insert(ws.end(), epsed[v].begin(), epsed[v].end());
        std::sort(ws.begin(), ws.end());
        ws.erase(std::unique(ws.begin(), ws.end()), ws.end());
        auto it = ids.find(ws);
        if (it != ids.end()) {
          dfa.to[x][e] = it->second;
        } else {
          uss.push_back(ws);
          const int y = dfa.addState();
          ids[ws] = dfa.to[x][e] = y;
        }
      }
    }
    // cast ac to bool
    for (int x = 0; x < dfa.n; ++x) for (const int u : uss[x]) if (ac[u]) dfa.ac[x] = 1;
    return dfa;
  }
};

////////////////////////////////////////////////////////////////////////////////


int N, K;
vector<int> L, R;

Mint dp[1010][2010];

int main() {
  /*
    state
    # length 1: [0, C1)
    # length 2: [0, C2)
    # length >= 3: [0, C3)
  */
  constexpr int C1 = 3;
  constexpr int C2 = 3;
  constexpr int C3 = 6;
  constexpr int A = 14;
  Nfa nfa(C1 * C2 * C3, 0, A);
  for (int c1 = 0; c1 < C1; ++c1) for (int c2 = 0; c2 < C2; ++c2) for (int c3 = 0; c3 < C3; ++c3) {
    const int u = (c1 * C2 + c2) * C3 + c3;
    nfa.ac[u] = (c1 == 0 && c2 == 0) ? 1 : 0;
    for (int a = 0; a < nfa.a; ++a) {
      for (int d0 = 0; d0 < C1; ++d0) for (int d3 = 0; d3 <= c3; ++d3) {
        const int remain = a - (d0 + c1 + c2 + d3);
        if (remain == 0 || remain >= 2) {
          if (d0 < C1 && c1 < C2 && c2 + d3 < C3) {
            const int v = (d0 * C2 + c1) * C3 + (c2 + d3);
            nfa.to[u][a].push_back(v);
          }
        }
      }
    }
  }
  const Dfa dfa = nfa.toDfa().minimize();
cerr<<"dfa.n = "<<dfa.n<<endl;
  
  constexpr int B = 4;
  for (int u = 0; u < dfa.n; ++u) {
    for (int a = B; a < dfa.a; ++a) {
      assert(dfa.to[u][B] == dfa.to[u][a]);
    }
  }
  
  // DP: min k to add
  constexpr int MAX_K = 100;
  Dfa DFA(0, 0, B + 1);
  map<vector<int>, int> ids;
  vector<vector<int>> seqs;
  seqs.emplace_back(dfa.n, MAX_K + 1);
  seqs[0][dfa.s] = 0;
  ids[seqs[0]] = DFA.addState();
  for (int x = 0; x < DFA.n; ++x) {
    for (int a = 0; a <= B; ++a) {
      vector<int> seq(dfa.n, MAX_K + 1);
      for (int u = 0; u < dfa.n; ++u) {
        for (int dk = 0; a + dk <= B; ++dk) {
          const int v = dfa.to[u][a + dk];
          chmin(seq[v], seqs[x][u] + dk);
        }
      }
      auto it = ids.find(seq);
      if (it != ids.end()) {
        DFA.to[x][a] = it->second;
      } else {
        const int y = DFA.addState();
        DFA.to[x][a] = y;
        ids[seq] = y;
        seqs.push_back(seq);
      }
    }
  }
cerr<<"DFA.n = "<<DFA.n<<endl;
  for (int x = 0; x < DFA.n; ++x) {
    DFA.ac[x] = MAX_K + 1;
    for (int u = 0; u < dfa.n; ++u) if (dfa.ac[u]) {
      chmin(DFA.ac[x], seqs[x][u]);
    }
  }
  DFA = DFA.minimize();
cerr<<"DFA.n = "<<DFA.n<<endl;
  
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d", &N, &K);
    L.resize(N);
    R.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d%d", &L[i], &R[i]);
    }
cerr<<"N = "<<N<<", K = "<<K;
if(N<=5)cerr<<", L = "<<L<<", R = "<<R;
cerr<<endl;
    
    memset(dp, 0, sizeof(dp));
    dp[0][DFA.s] = 1;
    for (int i = 0; i < N; ++i) {
      for (int x = 0; x < DFA.n; ++x) {
        for (int a = 0; a < B; ++a) if (L[i] <= a && a <= R[i]) {
          dp[i + 1][DFA.to[x][a]] += dp[i][x];
        }
        if (B <= R[i]) {
          dp[i + 1][DFA.to[x][B]] += dp[i][x] * (R[i] - max(B, L[i]) + 1);
        }
      }
    }
    Mint ans = 0;
    for (int x = 0; x < DFA.n; ++x) if (DFA.ac[x] <= K) {
      ans += dp[N][x];
    }
    
    // bad to minimize k
    if (K == 1) {
      if ([&]() -> bool {
        for (int i = 0; i < N; ++i) if (!(L[i] <= 0 && 0 <= R[i])) return false;
        return true;
      }()) {
        ans -= 1;
      }
      if ([&]() -> bool {
        if (!(N == 3)) return false;
        for (int i = 0; i < N; ++i) if (!(L[i] <= 1 && 1 <= R[i])) return false;
        return true;
      }()) {
        ans -= 1;
      }
    }
    
    printf("%u\n", ans.x);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}