#include <bits/stdc++.h>
using namespace std;
bool helper(vector<int>& v, int k, int p) {
  bool ans = false;
  int pred = 0;
  for (int i = 0; i < v.size() && !ans; i++) {
    if (v[i] > k) {
      pred++;
    }
    if (v[i] <= k) {
      int x = k - v[i];
      auto it = find(v.begin(), v.end(), x);
      if (it != v.end()) {
        pred++;
      } else {
        ans = ans || helper(v, k - v[i], (p + 1) % 2);
        break;
      }
    }
  }
  if (!ans) {
    if (pred == v.size()) {
      if (p == 0) {
        ans = false;
      }
      if (p == 1) {
        ans = true;
      }
    }
  }
  return ans;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, k;
    cin >> n >> k;
    vector<int> v(n);
    for (int i = 0; i < n; i++) cin >> v[i];
    sort(v.begin(), v.end());
    if (k < v[0]) {
      cout << "Second";
      return 0;
    }
    bool c = helper(v, k, 0);
    if (c == 1) {
      cout << "First";
    } else
      cout << "Second";
    cout << "\n";
  }
}
