#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
int sosuu(int a) {
	int bobo = 1;
	for (int i = 2; i <= sqrt(a); ++i) {
		if (a % i == 0) {
			bobo--;
			break;
		}
	}
	return bobo;
}
int main() {
#define int long long
	long long x, y;
	cin >> x >> y;
	vector<int> goa;
	goa.push_back(x);
	goa.push_back(y);
	int boa = 0;
	for (int i = 0; i < goa.size(); ++i) {
		for (int q = goa[i] + 1; q >= 0; ++q) {
			int hoge = 0;
			for (int j = 2; j <= sqrt(q); ++j) {
				if (q % j == 0) {
					hoge = 1;
					break;
				}
			}
			if (hoge == 0) {
				boa += q - 1 - goa[i];
				break;
			}
		}
	}
	if (boa % 2 == 0 || (sosuu(x) == 1 && sosuu(y) == 1)) {
		cout << "Second" << endl;
	}
	else {
		cout << "First" << endl;
	}
	return 0;
}