1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vpi = vector<pii>;
using vi = vector<int>;
using vll = vector<long long>;
using mpii = map<int, int>;
using mpll = map<ll, ll>;
using db = long double;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define lb lower_bound
#define ub upper_bound
#define make_unique(x) \
sort(all((x))); \
(x).resize(unique(all((x))) - (x).begin())
#define ceil(a, b) ((a) + (b)-1) / (b)
const int MOD = (int)1e9 + 7;
const db PI = acos((db)-1);
const int dx[4]{1, 0, -1, 0};
const int dy[4]{0, 1, 0, -1};
template <typename K, typename V>
ostream &operator<<(ostream &os, const pair<K, V> &p);
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec);
template <typename K, typename V>
ostream &operator<<(ostream &os, const map<K, V> &m);
template <typename K, typename V>
ostream &operator<<(ostream &os, const unordered_map<K, V> &m);
template <typename T> ostream &operator<<(ostream &os, const set<T> &s);
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &s);
template <typename K, typename V>
ostream &operator<<(ostream &os, const pair<K, V> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{";
for (size_t i = 0; i < vec.size(); ++i) {
if (i > 0)
os << ", ";
os << vec[i];
}
os << "}";
return os;
}
template <typename K, typename V>
ostream &operator<<(ostream &os, const map<K, V> &m) {
os << "{";
for (const auto &p : m) {
os << p.first << ": " << p.second << ", ";
}
os << "}";
return os;
}
template <typename K, typename V>
ostream &operator<<(ostream &os, const unordered_map<K, V> &m) {
os << "{";
for (const auto &p : m) {
os << p.first << ": " << p.second << ", ";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &s) {
int i = 0;
os << "{";
for (const auto &e : s) {
if (i > 0)
os << ", ";
os << e;
i++;
}
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &s) {
int i = 0;
os << "{";
for (const auto &e : s) {
if (i > 0)
os << ", ";
os << e;
i++;
}
os << "}";
return os;
}
void dbg() { cerr << "\n"; }
template <typename T, typename... TS> void dbg(T val, TS... vals) {
cerr << val << " ";
dbg(vals...);
}
/* stuff you should look for:
---------------------------
* special cases (n=1?)
* int overflow, array bounds
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/
// 1 2 3 F
// 1 2 2 S
// 1 2 1 F
// 1 2 0 S
//
void solve() {
int a, b, c;
cin >> a >> b >> c;
if (c % 2 == 0) { // Anna's turn
if (a == b) {
if ((a + b) % 2 == 0) {
cout << "Second\n";
} else {
cout << "First\n";
}
} else {
cout << (a > b ? "First\n" : "Second\n");
}
} else {
if (a == b) {
if ((a + b) % 2 == 0) {
cout << "First\n";
} else {
cout << "Second\n";
}
} else {
cout << (a > b ? "First\n" : "Second\n");
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tt;
cin >> tt;
while (tt--) {
solve();
}
}
|
