For this Question: You are given two positive integers A and B.
Print "First", if A<sup>B</sup> > B<sup>A</sup>.
Print "Second", if A<sup>B</sup> < B<sup>A</sup>.
Otherwise, print "Equal".The only line contains two space-separated integers A and B.

<b>Constraints:</b>
1 ≤ A, B ≤ 4Print a single word – the answer to the problem.Sample Input 1:
1 3

Sample Output 1:
Second

Sample Explanation 1:
As 1<sup>3</sup> < 3<sup>1</sup>, we print "Second".

Sample Input 2:
2 2

Sample Output 2:
Equal

Sample Explanation 2:
As 2<sup>2</sup> = 2<sup>2</sup>, we print "Equal". , I have written this Solution Code: 

// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
#define ll long long
#define ld long double
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());


long long powm(long long a, long long b,long long mod) {
long long res = 1;
while (b > 0) {
    if (b & 1)
        res = res * a %mod;
    a = a * a %mod;
    b >>= 1;
}

return res;
}

ll gcd(ll a, ll b)
{
if (b == 0)
    return a;
return gcd(b, a % b);      
}






signed main()
{

ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);


#ifndef ONLINE_JUDGE
if(fopen("input.txt","r"))
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
}
#endif
    
    
    int a,b;
    cin>>a>>b;

    int ans1=1;
    for(int i=0;i<b;i++)
        ans1*=a;
    
    int ans2=1;
    for(int i=0;i<a;i++)
        ans2*=b;

    if(ans1>ans2)
        cout<<"First";
    else if(ans1<ans2)
        cout<<"Second";
    else
        cout<<"Equal";


    
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?