#include <bits/stdc++.h>
using namespace std;
int bexpo(int x, int n) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return bexpo(x * x, n / 2);
  else
    return x * bexpo(x * x, (n - 1) / 2);
}
bool isPrime(long long int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int n, k;
bool check(int mid, int a[], int ind) {
  int cnt = 0, i;
  for (i = 0; i < n; i++) {
    if (mid >= a[i] && cnt % 2 == ind)
      cnt++;
    else if (cnt % 2 != ind)
      cnt++;
  }
  return cnt >= k;
}
int main() {
  int t, i;
  cin >> t;
  while (t--) {
    long long int a, b;
    cin >> a >> b;
    long long int ans = min(a, b);
    ans = min(ans, (a + b) / 3);
    cout << ans << endl;
  }
}
