#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const long long LLINF = 9223372036854775807LL;
int ABS(int x) { return x * ((x > 0) - (x < 0)); }
int main() {
  int n, m, x1, y1, x2, y2;
  scanf("%d%d%d%d%d%d", &n, &m, &x1, &y1, &x2, &y2);
  int diff1 = ABS(x1 - x2);
  int diff2 = ABS(y1 - y2);
  bool ok = false;
  for (int iter = 0; iter < 2; ++iter) {
    int d1 = diff1;
    int d2 = diff2;
    if (iter) {
      d1 = max(d1 - 1, 0);
    } else
      d2 = max(d2 - 1, 0);
    int mx = max(d1, d2);
    if (d1 == d2 && d1 == 3) continue;
    ok |= mx <= 3;
  }
  printf(ok ? "First\n" : "Second\n");
  return 0;
}
