#include <bits/stdc++.h>
using namespace std;
const long long int inf = 1e9 + 7;
const long long int inf2 = inf * inf;
priority_queue<long long int, vector<long long int>, greater<long long int>>
    mnheap;
priority_queue<long long int> mxheap;
long long int gcd(long long int x, long long int y) {
  if (x == 0) return y;
  return gcd(y % x, x);
}
int is_prime(long long int x) {
  if (x < 2) return 0;
  for (long long int i = 2; i * i <= x; i++) {
    if (x % i == 0) return 0;
  }
  return 1;
}
inline long long int modpw(long long int x, long long int y, long long int z) {
  long long int res = 1;
  x = x % z;
  while (y) {
    if (y & 1) res = (res * x) % z;
    x = (x * x) % z;
    y /= 2;
  }
  return res;
}
inline long long int modinv(long long int x, long long int z) {
  return modpw(x, z - 2, z);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    long long int n, x;
    cin >> n >> x;
    int flag = 0;
    int arr[n];
    for (int i = 0; i < n; i++) {
      cin >> arr[i];
      if (arr[i] == x) flag = 1;
    }
    if (flag == 1) {
      cout << 1 << endl;
      continue;
    }
    sort(arr, arr + n);
    if (arr[n - 1] > x) {
      cout << 2 << endl;
    } else {
      cout << (x + arr[n - 1] - 1) / arr[n - 1] << endl;
    }
  }
}
