#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-12;
const int inf = 2000000000;
int MOD = 1000000007;
int MOD1 = 1000000007;
int MOD2 = 1000000009;
inline bool checkBit(long long int n, long long int i) {
  return n & (1LL << i);
}
inline long long int setBit(long long int n, long long int i) {
  return n | (1LL << i);
  ;
}
inline long long int resetBit(long long int n, long long int i) {
  return n & (~(1LL << i));
}
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long int year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long int &a) {
  a %= MOD;
  (a < 0) && (a += MOD);
}
inline long long int modMul(long long int a, long long int b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a * b) % MOD;
}
inline long long int modAdd(long long int a, long long int b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a + b) % MOD;
}
inline long long int modSub(long long int a, long long int b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long int modPow(long long int b, long long int p) {
  long long int r = 1LL;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1LL;
  }
  return r;
}
inline long long int modDiv(long long int a, long long int b) {
  return modMul(a, modPow(b, MOD - 2));
}
bool comp(const pair<long long int, pair<long long int, long long int> > &p1,
          const pair<long long int, pair<long long int, long long int> > &p2) {
  return p1.first > p2.first;
}
long long int converter(string a) {
  long long int i, mul = 1, r, t, ans = 0LL;
  if (a.length() == 0) return 0;
  for (i = a.length() - 1; i >= 0; i--) {
    t = a[i] - '0';
    r = t % 10;
    ans += (mul * r);
    mul = mul * 10;
  }
  return ans;
}
const int MAX = 100005;
long long int n, inv[MAX];
long long int fact[MAX];
int mu[MAX];
void mobius() {
  int i, j;
  mu[1] = fact[0] = fact[1] = 1;
  for (i = 1; i < MAX; i++) {
    for (j = i + i; j < MAX; j += i) {
      mu[j] -= mu[i];
    }
    fact[i] = (fact[i - 1] * i) % MOD;
  }
}
long long int stars_bars(long long int nn, long long int kk) {
  long long int cur = (inv[kk - 1] * inv[nn - kk]) % MOD;
  cur = (fact[nn - 1] * cur) % MOD;
  return cur;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int i, f, qu, div1, div2;
  mobius();
  for (i = 0; i < MAX; ++i) {
    inv[i] = modDiv(1LL, fact[i]);
  }
  cin >> qu;
  while (qu--) {
    cin >> n >> f;
    int lim = sqrt(n);
    long long int tot = 0LL;
    for (i = 1; i <= (lim); ++i) {
      if (n % i != 0) continue;
      div1 = n / i;
      div2 = i;
      if (div1 >= f) {
        tot += (mu[div2] * stars_bars(div1, f));
        if (tot >= MOD)
          tot -= MOD;
        else if (tot < 0)
          tot += MOD;
      }
      if (div1 != div2) {
        if (div2 >= f) {
          tot += (mu[div1] * stars_bars(div2, f));
          if (tot >= MOD)
            tot -= MOD;
          else if (tot < 0)
            tot += MOD;
        }
      }
    }
    cout << tot << '\n';
  }
  return 0;
}
