#include <bits/stdc++.h>
using namespace std;
using ll = long long;

// Modular Integer
// does arithmetics (mod P) automatically
template<class T> T power(T a, ll b) { T res = 1; for (; b; b /= 2, a *= a) { if (b % 2) { res *= a; } } return res; }
int P = 1000000007; // 1000000007
struct zint {
  int x;
  // assumes -P <= x <= 2P
  int norm(int x) const { if (x < 0) { x += P; } if (x >= P) { x -= P; } return x; }
  zint(int x = 0) : x(norm(x)) {}
  zint(ll x) : x(norm((int)(x % P))) {}
  int val() const { return x; }
  zint operator-() const { return zint(norm(P - x)); }
  zint inv() const { assert(x != 0); return power(*this, P - 2); }
  zint& operator*=(const zint& rhs) { x = (int)(ll(x) * rhs.x % P); return *this; }
  zint& operator+=(const zint& rhs) { x = norm(x + rhs.x); return *this; }
  zint& operator-=(const zint& rhs) { x = norm(x - rhs.x); return *this; }
  zint& operator/=(const zint& rhs) { return *this *= rhs.inv();}
  friend zint operator*(const zint& lhs, const zint& rhs) { zint res = lhs; res *= rhs; return res; }
  friend zint operator+(const zint& lhs, const zint& rhs) { zint res = lhs; res += rhs; return res; }
  friend zint operator-(const zint& lhs, const zint& rhs) { zint res = lhs; res -= rhs; return res; }
  friend zint operator/(const zint& lhs, const zint& rhs) { zint res = lhs; res /= rhs; return res; }
  friend ostream& operator << (ostream& out, const zint& rhs) { out << rhs.val(); return out; }
  friend istream& operator >> (istream& in, zint& rhs) { ll x; in >> x; rhs = zint(x); return in; }
};

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  const int N = 1e6;
  vector<zint> facts(N+1);
  facts[0] = 1;
  for (int i=1;i<=N;i++){
    facts[i] = i*facts[i-1];
  }
  int t;
  cin >> t;
  while (t--) {
    ll n,m;
    cin >> n >> m;
    if (m > n) {
      cout << 0 << "\n";
      continue;
    }
    if (m == n) {
      cout << (facts[n-1]/2).val() << "\n";
      continue;
    }
    zint ans = 0;
    for (int i=1;i<=n-m;i++){
      if (m < i) break;
      //mint ncr = facts[m-1]/(facts[i-1]*facts[m-i]);
      ans += facts[m-1]*facts[n]/(max(n-m-i,1ll)*i*power(zint(2),i)*facts[i-1]*facts[m-i]);
    }
    cout << ans.val() << "\n";
  }

}