#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > piii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];


int a[N], b[N];
int main() {
    cin >> n >> m;
    ll sum = 0, sum2 = 0, top = 0;
    for (int i = 1; i < n + 1; i++) scanf("%d", a + i), sum ^= a[i], top = max(top, (ll)a[i]);
    for (int i = 1; i < n + 1; i++) scanf("%d", b + i), sum2 ^= b[i];
    bool flag = top == 1 ? !sum : sum;
    if (sum) {
        if (sum2 || flag) puts("First");
        else puts("Second");
    } else {
        if (!sum2 || flag) puts("First");
        else puts("Second");
    }
    return 0;
}