#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 998244353;
const long long int N = 1000001;
long long int memo[100005][2], n;
vector<long long int> a;
bool solve(long long int k, bool turn) {
  long long int i = 0;
  if (memo[k][turn] != -1) return memo[k][turn];
  if (!turn) {
    bool res = 0;
    for (; i < n; ++i) {
      res = 0;
      if (k - a[i] >= 0) {
        res = res or (solve(k - a[i], !turn));
      } else {
        break;
      }
      if (res == 0) return (memo[k][turn] = 0);
    }
    return (memo[k][turn] = 1);
  } else {
    bool res = 1;
    for (; i < n; ++i) {
      res = 1;
      if (k - a[i] >= 0) {
        res = res and (solve(k - a[i], !turn));
      } else {
        break;
      }
      if (res == 1) return (memo[k][turn] = 1);
    }
    return (memo[k][turn] = 0);
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    long long int k;
    cin >> n >> k;
    a.resize(n);
    for (long long int i = 0; i < n; ++i) cin >> a[i];
    memset(memo, -1, sizeof(memo));
    sort(a.begin(), a.end());
    (solve(k, 0) ? puts("Second") : puts("First"));
  }
  return 0;
}
