// github.com/Johniel/contests // yukicoder/2508/main.cpp #include #define each(i, c) for (auto& i : c) #define each_with_index(i, e, c) for (const auto i: views::iota(0, (int)c.size())) if (auto& e = c.at(i); true) #define each_pair(p, c) for (const auto _i: views::iota(0, (int)c.size())) if (std::pair p = {_i, c[_i]}; true) #define unless(cond) if (!(cond)) // #define endl "\n" using namespace std; template ostream& operator << (ostream& os, pair p) { os << "(" << p.first << "," << p.second << ")"; return os; } template istream& operator >> (istream& is, pair& p) { is >> p.first >> p.second; return is; } template ostream& operator << (ostream& os, vector v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; } template istream& operator >> (istream& is, vector& v) { for (auto& i: v) is >> i; return is; } template ostream& operator << (ostream& os, set s) { os << "#{"; for (auto& i: s) os << i << ","; os << "}"; return os; } template ostream& operator << (ostream& os, map m) { os << "{"; for (auto& i: m) os << i << ","; os << "}"; return os; } template istream& operator >> (istream& is, array& a) { for (auto& i: a) is >> i; return is; } template ostream& operator << (ostream& os, array& a) { os << "[" << N << "]{"; for (auto& i: a) os << i << ","; os << "}"; return os; } template inline T setmax(T& a, T b) { return a = std::max(a, b); } template inline T setmin(T& a, T b) { return a = std::min(a, b); } __attribute__((constructor)) static void ___initio(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.setf(ios_base::fixed); cout.precision(15); return ; } using lli = long long int; using ull = unsigned long long; using str = string; template using vec = vector; constexpr array di({0, 1, -1, 0, 1, -1, 1, -1}); constexpr array dj({1, 0, 0, -1, 1, -1, -1, 1}); // constexpr lli mod = 1e9 + 7; constexpr lli mod = 998244353; int main(int argc, char *argv[]) { set> taboo; for (int a = -10; a <= 10; ++a) { for (int p = -10; p <= 10; ++p) { for (int q = -10; q <= 10; ++q) { int b = a * (p + q); int c = a * (-p) * (-q); if (b * b - 4 * a * c <= 0) { taboo.insert(vec({to_string(a), to_string(p), to_string(q)})); } } } } vec v(3); while (cin >> v) { cout << (!taboo.count(v) ? "Yes" : "No") << endl; } return 0; }