#include <set>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>

#define ll long long
#define ull unsigned long long
#define pii std :: pair<int, int>
#define pb push_back
#define fi first
#define se second
#define lep(i, l, r) for(int i = l; i <= r; i++)
#define rep(i, r, l) for(int i = r; i >= l; i--)
#define mset(s, t) memset(s, t, sizeof(s))
#define mcpy(s, t) memcpy(s, t, sizeof(t))

template <typename T1, typename T2> void Min(T1 &x, T2 y) {
	if (x > y) x = y;
}

template <typename T1, typename T2> void Max(T1 &x, T2 y) {
	if (x < y) x = y;
}

int read() {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= ch == '-', ch = getchar();
	while (isdigit(ch)) x = 10 * x + ch - '0', ch = getchar();
	return f ? -x : x;
}

template <typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x / 10);
	putchar(x % 10 + '0');
}
template <typename T> void Print(T x, char let) {
	print(x), putchar(let);
}

void Solve() {
  int n = read(), m = read();
  int x = n - m;
  printf("%d ", m);
  if (m == 0) puts("0");
  else if (m <= x) puts("1");
  else printf("%d\n", m / (x + 1) + (m % (x + 1) == 0 ? 0 : 1));
}

int main() {
  int T;
  scanf("%d", &T);
  while (T--) Solve();
  return 0;
}