#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>;


struct Dfa {
  int n, s, a;
  vector<vector<int>> to;
  vector<bool> ac;
  Dfa() {}
  Dfa(int n_, int s_, int a_) : n(n_), s(s_), a(a_) {
    to.assign(n, vector<int>(a, -1));
    ac.assign(n, false);
  }
  int addState() {
    const int u = n++;
    to.emplace_back(a, -1);
    ac.push_back(false);
    return u;
  }

  vector<int> ids;
  vector<vector<int>> uss;
  vector<vector<vector<int>>> revs;
  Dfa minimize() {
    for (int u = 0; u < n; ++u) for (int e = 0; e < a; ++e) {
      assert(to[u][e] != -1);
    }
    std::queue<int> que;
    ids.assign(n, -1);
    // BFS to find reachable states
    ids[s] = -2;
    que.push(s);
    for (; !que.empty(); ) {
      const int u = que.front(); que.pop();
      for (int e = 0; e < a; ++e) {
        if (ids[to[u][e]] == -1) {
          ids[to[u][e]] = -2;
          que.push(to[u][e]);
        }
      }
    }
    // partition
    revs.assign(n, vector<vector<int>>(a));
    for (int u = 0; u < n; ++u) {
      if (ids[u] != -1) {
        for (int e = 0; e < a; ++e) revs[to[u][e]][e].push_back(u);
      }
    }
    int nn = 2;
    uss.assign(n, {});
    for (int u = 0; u < n; ++u) {
      if (ids[u] == -2) uss[ids[u] = ac[u] ? 1 : 0].push_back(u);
    }
    // empty, all
    if (uss[1].empty() || uss[0].empty()) {
      Dfa dfa(1, 0, a);
      dfa.to[0].assign(a, 0);
      dfa.ac[0] = uss[0].empty();
      return dfa;
    }
    que.push((uss[1].size() <= uss[0].size()) ? 1 : 0);
    for (; !que.empty(); ) {
      const int x = que.front(); que.pop();
      std::set<int> parter(uss[x].begin(), uss[x].end());
      for (int e = 0; e < a; ++e) {
        std::set<int> apps;
        for (const int u : parter) for (const int v : revs[u][e]) {
          apps.insert(ids[v]);
        }
        for (const int y : apps) {
          vector<int> vs1, vs0;
          for (const int v : uss[y]) {
            (parter.count(to[v][e]) ? vs1 : vs0).push_back(v);
          }
          if (!vs0.empty()) {
            if (vs1.size() < vs0.size()) vs1.swap(vs0);
            for (const int v : vs0) ids[v] = nn;
            que.push(nn);
            uss[y].swap(vs1);
            uss[nn++].swap(vs0);
          }
        }
      }
    }
    uss.resize(nn);
    // 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;
  }
};

bool isIsomorphic(const Dfa &dfa0, const Dfa &dfa1) {
  if (dfa0.n != dfa1.n) return false;
  if (dfa0.a != dfa1.a) return false;
  const int n = dfa0.n, a = dfa0.a;
  vector<int> f01(n, -1), f10(n, -1);
  std::queue<int> que;
  f10[f01[dfa0.s] = dfa1.s] = dfa0.s;
  que.push(dfa0.s);
  que.push(dfa1.s);
  for (; !que.empty(); ) {
    const int u0 = que.front(); que.pop();
    const int u1 = que.front(); que.pop();
    for (int e = 0; e < a; ++e) {
      const int v0 = dfa0.to[u0][e], v1 = dfa1.to[u1][e];
      if (f01[v0] == -1 && f10[v1] == -1) {
        f10[f01[v0] = v1] = v0;
        que.push(v0);
        que.push(v1);
      } else {
        if (f01[v0] == -1 || f10[v1] == -1) return false;
        if (f10[f01[v0]] != v0 || f01[f10[v1]] != v1) return false;
      }
    }
  }
  for (int u0 = 0; u0 < n; ++u0) {
    if (f01[u0] != -1 && dfa0.ac[u0] != dfa1.ac[f01[u0]]) return false;
  }
  return true;
}

struct Nfa {
  int n, s, a;
  vector<vector<vector<int>>> to;
  vector<vector<int>> eps;
  vector<bool> ac;
  Nfa(int n_, int s_, int a_) : n(n_), s(s_), a(a_) {
    to.assign(n, vector<vector<int>>(a));
    eps.assign(n, {});
    ac.assign(n, false);
  }
  int addState() {
    const int u = n++;
    to.emplace_back(a);
    eps.emplace_back();
    ac.push_back(false);
    return u;
  }
  Dfa toDfa() const {
    std::queue<int> que;
    vector<std::set<int>> epsed(n);
    for (int u = 0; u < n; ++u) {
      epsed[u].insert(u);
      que.push(u);
      for (; !que.empty(); ) {
        const int v = que.front(); que.pop();
        for (const int w : eps[v]) if (epsed[u].insert(w).second) que.push(w);
      }
    }
    vector<std::set<int>> ps;
    std::map<std::set<int>, int> tr;
    que.push(0);
    ps.push_back(epsed[s]);
    tr[epsed[s]] = 0;
    Dfa dfa(1, 0, a);
    for (; !que.empty(); ) {
      const int x = que.front(); que.pop();
      for (int e = 0; e < a; ++e) {
        std::set<int> pp;
        for (const int u : ps[x]) for (const int v : to[u][e]) {
          for (const int w : epsed[v]) pp.insert(w);
        }
        auto it = tr.find(pp);
        if (it == tr.end()) {
          que.push(dfa.n);
          ps.push_back(pp);
          dfa.to[x][e] = tr[pp] = dfa.n;
          dfa.addState();
        } else {
          dfa.to[x][e] = it->second;
        }
      }
    }
    for (int x = 0; x < dfa.n; ++x) for (const int u : ps[x]) {
      if (ac[u]) dfa.ac[x] = true;
    }
    return dfa;
  }
};


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

Mint dp[1010][60];

int main() {
  /*
    state
    length 1: [0, 3]
    length 2: [0, 3]
    length 3: [0, 6]
  */
  Nfa nfa(4 * 4 * 7, 0, 5);
  for (int c1 = 0; c1 <= 3; ++c1) for (int c2 = 0; c2 <= 3; ++c2) for (int c3 = 0; c3 <= 6; ++c3) {
    const int u = (c1 * 4 + c2) * 7 + c3;
    nfa.ac[u] = (c1 == 0 && c2 == 0);
    for (int a = 0; a < nfa.a; ++a) {
      for (int d0 = 0; d0 <= 3; ++d0) for (int d3 = 0; d3 <= c3; ++d3) {
        const int remain = a - (d0 + c1 + c2 + d3);
        if (remain == 0 || remain >= 2) {
          if (d0 <= 3 && c1 <= 3 && c2 + d3 <= 6) {
            const int v = (d0 * 4 + c1) * 7 + (c2 + d3);
            nfa.to[u][a].push_back(v);
          }
        }
      }
    }
  }
  const Dfa dfa = nfa.toDfa().minimize();
cerr<<"dfa: n = "<<dfa.n<<", s = "<<dfa.s<<", a = "<<dfa.a<<endl;
for(int u=0;u<dfa.n;++u)cerr<<"to["<<u<<"] = "<<dfa.to[u]<<endl;
cerr<<"ac = "<<dfa.ac<<endl;
  for (int u = 0; u < dfa.n; ++u) {
    for (int a = 4; a < dfa.a; ++a) {
      assert(dfa.to[u][4] == dfa.to[u][a]);
    }
  }
  
  
  Dfa DFAs[3];
  for (K = 0; K <= 2; ++K) {
    Nfa NFA(dfa.n * (K + 1), dfa.s * (K + 1) + 0, 5);
    for (int u = 0; u < dfa.n; ++u) for (int k = 0; k <= K; ++k) {
      const int x = u * (K + 1) + k;
      NFA.ac[x] = (dfa.ac[u] && k == K);
      for (int a = 0; a < 5; ++a) {
        for (int dk = 0; k + dk <= K; ++dk) {
          const int v = dfa.to[u][min(a + dk, 4)];
          const int y = v * (K + 1) + (k + dk);
          NFA.to[x][a].push_back(y);
        }
      }
    }
    DFAs[K] = NFA.toDfa().minimize();
cerr<<"DFA["<<K<<"]: n = "<<DFAs[K].n<<", s = "<<DFAs[K].s<<", a = "<<DFAs[K].a<<endl;
// for(int u=0;u<DFAs[K].n;++u)cerr<<"to["<<u<<"] = "<<DFAs[K].to[u]<<endl;
// cerr<<"ac = "<<DFAs[K].ac<<endl;
  }
  assert(isIsomorphic(dfa, DFAs[0]));
  
  
  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;
    
    const Dfa &DFA = DFAs[K];
    
    memset(dp, 0, sizeof(dp));
    dp[0][DFA.s] = 1;
    for (int i = 0; i < N; ++i) {
      for (int u = 0; u < DFA.n; ++u) {
        for (int a = 0; a < 4; ++a) if (L[i] <= a && a <= R[i]) {
          dp[i + 1][DFA.to[u][a]] += dp[i][u];
        }
        int l = L[i], r = R[i];
        chmax(l, 4);
        if (l <= r) {
          dp[i + 1][DFA.to[u][4]] += dp[i][u] * (r - l + 1);
        }
      }
    }
    Mint ans = 0;
    for (int u = 0; u < DFA.n; ++u) if (DFA.ac[u]) {
      ans += dp[N][u];
    }
    printf("%u\n", ans.x);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}