#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)    
#define seg_size 524288
#define int long long
int sosuu(int a) {
	int bobo = 1;
	for (int i = 2; i <= sqrt(a); ++i) {
		if (a % i == 0) {
			bobo--;
			break;
		}
	}
	return bobo;
}
map<pair<int, int>,int> hoges;
int hogea(int a, int b) {
	if (hoges[make_pair(a, b)]) return hoges[make_pair(a, b)];
	if (sosuu(a) == 1 || sosuu(b) == 1) return hoges[make_pair(a,b)] = 2;
	if (hogea(a + 1, b) == 1) return hoges[make_pair(a,b)] = 2;
	if (hogea(a, b + 1) == 1) return hoges[make_pair(a,b)] = 2;
	return hoges[make_pair(a,b)] = 1;
}
#undef int
int main() {
#define int long long
	long long x, y;
	cin >> x >> y;
	if (hogea(x,y) == 2) {
		cout << "First" << endl;
	}
	else {
		cout << "Second" << endl;
	}
	return 0;
}