7
576460752303423487 2
82 9
101 104
10 21
31 10
0 1
10 30
 1
128817972817282999 327672410994637530
 66
7 0
5 7
1 3
3 2
3 5
0 6
1 2
0 7
4 5
4 7
5 1
2 0
4 0
0 5
3 6
7 3
6 0
5 2
6 6
1 7
5 6
2 2
3 4
2 1
5 3
4 6
6 2
3 3
100000000000 1000000000000000000
0 1
4 1
2 6
5 5
4 3
0 3
3 7
3 1
1 0
4 4
1000000000000000000 100000000000
7 6
4 2
7 5
1 6
6 1
2 7
7 7
6 7
2 4
0 2
2 5
7 2
0 0
5 0
5 4
7 4
6 4
0 4
1 1
6 5
1 4
2 3
1 5
7 1
6 3
3 0
 1
100000000000 100000000001
 1
23917 1000000000000000000

First
Second
Second
First
Second
Second
First
 First
 Second
Second
First
Second
First
Second
First
Second
Second
First
First
Second
Second
Second
First
First
Second
First
First
First
Second
First
Second
First
First
Second
First
First
First
Second
First
First
First
Second
Second
First
First
Second
First
First
Second
First
Second
First
First
First
First
Second
First
Second
First
First
Second
Second
Second
First
Second
Second
First
Second
First
Second
First
First
First
Second
 Second
 Second

import java.io.*;
import java.util.*;


public class C {
    static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n % r); }
    static int gcdd(int n, int r) { return r == 0 ? 0 : 1 + gcdd(r, n % r); }
    static int[][] memo = new int[201][201];
    static boolean g(long i, long j) {
        if(i > j) { long t = i; i = j; j = t; }
        if(i == 0) { return false; }
        if(i<0) return true;
        if(!g(i, j%i)) return true;
        for(long x = i; x <= j; x *= i) {
            if(x*i>j&&(!g(i, j-x)||i!=x&&!g(i, j-x/i))) {
                return true;
            }
        }
        return false;
    }
    static boolean f(int i, int j) {
        if(i > j) { int t = i; i = j; j = t; }
        if(i == 0) { return false; }
        if(memo[i][j] != 0) return memo[i][j] == 1;
        memo[i][j] = 1;
        if(!f(i, j%i)) return true;
        for(int x = i; x <= j; x *= i) {
            if(!f(i, j-x)) {
                return true;
            }
        }
        memo[i][j] = -1;
        return false;
    }
    
    public static void run() throws IOException {
        IOFast.out.println(g(IOFast.nextLong(), IOFast.nextLong()) ? "First" : "Second");
        /*
        for(int i = 1; i < 200; i++)
            for(int j = 1; j < 200; j++)
                if(f(i,j)!=g(i,j))
                IOFast.out.println(i + " " + j + " " + gcdd(i, j) + " " + f(i, j) + " " + g(i, j));
        //*/
    }
    
    public static void main(String[] args) throws IOException {
        run();
        IOFast.out.flush();
    }
    

    static public class IOFast {
        private static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        private static PrintWriter out = new PrintWriter(System.out);

//      private static final int BUFFER_SIZE = 50 * 200000;
        private static final StringBuilder buf = new StringBuilder();
        private static boolean[] isDigit = new boolean[256];
        private static boolean[] isSpace = new boolean[256];

        static {
            for(int i = 0; i < 10; i++) {
                isDigit['0' + i] = true;
            }
            isDigit['-'] = true;
            isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
        }
        
        static boolean endInput;

        private static int nextInt() throws IOException {
            boolean plus = false;
            int ret = 0;
            while(true) {
                final int c = in.read();
                
                if(c == -1) {
                    endInput = true;
                    return Integer.MIN_VALUE;
                }
                
                if(isDigit[c]) {
                    if(c != '-') {
                        plus = true;
                        ret = c - '0';
                    }
                    break;
                }
            }
            
            while(true) {
                final int c = in.read();
                if(c == -1 || !isDigit[c]) {
                    break;
                }
                ret = ret * 10 + c - '0';
            }
            
            return plus ? ret : -ret;
        }
        
        private static long nextLong() throws IOException {
            boolean plus = false;
            long ret = 0;
            while(true) {
                final int c = in.read();
                
                if(c == -1) {
                    endInput = true;
                    return Integer.MIN_VALUE;
                }
                
                if(isDigit[c]) {
                    if(c != '-') {
                        plus = true;
                        ret = c - '0';
                    }
                    break;
                }
            }
            
            while(true) {
                final int c = in.read();
                if(c == -1 || !isDigit[c]) {
                    break;
                }
                ret = ret * 10 + c - '0';
            }
            
            return plus ? ret : -ret;
        }



        private static String next() throws IOException {
            buf.setLength(0);

            while(true) {
                final int c = in.read();
                
                if(c == -1) {
                    endInput = true;
                    return "-1";
                }
                
                if(!isSpace[c]) {
                    buf.append((char)c);
                    break;
                }
            }
            
            while(true) {
                final int c = in.read();
                
                if(c == -1 || isSpace[c]) {
                    break;
                }
                buf.append((char)c);
            }

            return buf.toString();
        }

        private static double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

    }

}
