#include // {{{ // https://codeforces.com/blog/entry/96344 #pragma GCC optimize("O2,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") using namespace std; template constexpr T MIN = std::numeric_limits::min(); template constexpr T MAX = std::numeric_limits::max(); template [[nodiscard]] static T sc(auto &&x) { return static_cast(x); } template [[nodiscard]] static T sz(auto &&x) { return static_cast(x.size()); } template void pr(std::format_string fmt, Args &&...args) { std::print(fmt, std::forward(args)...); } template void pr(std::format_string fmt) { std::print(fmt); } template void prln(std::format_string fmt, Args &&...args) { std::println(fmt, std::forward(args)...); } template void prln(std::format_string fmt) { std::println(fmt); } void prln() { std::println(); } void prln(auto const &t) { std::println("{}", t); } using ll = long long; using ld = long double; template using vec = std::vector; #define ff first #define ss second #define eb emplace_back #define pb push_back #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() // }}} auto lcm = [](int a, int b) { return a * b; }; void solve() { int p, q, s; cin >> p >> q >> s; auto lcm = [](int a, int b) { return a * b / __gcd(a, b); }; if (lcm(p, q) <= s) prln("yes"); else prln("no"); prln(); } int main() { // {{{ cin.tie(nullptr)->sync_with_stdio(false); int t = 1; while (t--) { solve(); } return 0; } // }}}