#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
// 高精度正数加法
// high resolution positive number addition
string big_add(string a, string b) {
string c;
if (a.size() < b.size()) swap(a, b);
if (a[0] == '+') a = a.substr(1);
if (b[0] == '+') b = b.substr(1);
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
for (int i = 0, carry = 0; i < a.size() || i < b.size() || carry; i++) {
int sum = carry;
sum += i < a.size() ? a[i] - '0' : 0;
sum += i < b.size() ? b[i] - '0' : 0;
c += sum % 10 + '0';
carry = sum / 10;
}
std::reverse(c.begin(), c.end());
return c;
}
// 高精度整数比较
// high resolution integer compare
// if a > b return 1, a < b return -1, a == b return 0
int big_cmp(string a, string b) {
int a_sign = 1, b_sign = 1;
if (a[0] == '-') a_sign = -1, a = a.substr(1);
else if (a[0] == '+') a_sign = 1, a = a.substr(1);
if (b[0] == '-') b_sign = -1, b = b.substr(1);
else if (b[0] == '+') b_sign = 1, b = b.substr(1);
if (a_sign == 1 && b_sign == -1) return 1;
if (a_sign == -1 && b_sign == 1) return -1;
if (a_sign == b_sign && a == b) return 0;
bool all_neg = a_sign == -1 && b_sign == -1;
// precondition: a >= 0 && b >= 0 without leading `zero`
bool greater = a.size() > b.size();
if (a.size() == b.size()) greater = a > b;
return (greater ? 1 : -1) * (all_neg ? -1 : 1);
}
// 高精度正数减法
// high resolution positive number subtraction
string big_sub(string a, string b) {
string c;
int c_sign = 1;
int cmp = big_cmp(a, b);
if (cmp == 0) return "0";
if (cmp == -1) swap(a, b), c_sign = -1;
if (a[0] == '+') a = a.substr(1);
if (b[0] == '+') b = b.substr(1);
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
for (int i = 0, carry = 0; i < a.size() || i < b.size(); i++) {
int _a = i < a.size() ? a[i] - '0' : 0;
int _b = i < b.size() ? b[i] - '0' : 0;
int carry_flag = _a - _b - carry < 0;
c += _a - _b - carry + (carry_flag ? 10 : 0) + '0';
carry = carry_flag;
}
reverse(c.begin(), c.end());
// remove leading zero
if (c.size() >= 2 && c[0] == '0') {
int j = 1;
while (j < c.size() && c[j] == '0' && c[j - 1] == '0') j++;
c = string(c.begin() + j, c.end());
}
if (c_sign == -1) c = "-" + c;
return c;
}
int main() {
string a, b;
while (cin >> a >> b) {
cout << big_cmp(a, b) << endl;
}
int T;
cin >> T;
for (int CASE = 1; CASE <= T; CASE++) {
string A, B, C;
cin >> A >> B >> C;
bool a_is_neg = A[0] == '-';
bool b_is_neg = B[0] == '-';
string ab;
cout << "Case #" << CASE << ": ";
if (!a_is_neg && !b_is_neg) ab = big_add(A, B);
else if (!a_is_neg && b_is_neg) B[0] = '+', ab = big_sub(A, B);
else if (a_is_neg && !b_is_neg) A[0] = '+', ab = big_sub(B, A);
else if (a_is_neg && b_is_neg) A[0] = '+', B[0] = '+', ab = "-" + big_add(A, B);
cout << boolalpha << (big_cmp(ab, C) == 1) << endl;
}
return 0;
}