#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using vec = vector<T>;
template <typename T>
using vec2 = vec<vec<T>>;
template <typename T>
using vec3 = vec<vec2<T>>;
template <typename T>
using vec4 = vec<vec3<T>>;
typedef long long ll;
typedef vec<ll> vi;
typedef vec2<ll> vvi;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vec<ii> vii;
typedef vec<string> vs;
typedef vec<bool> vb;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define FOR(i, a) for (auto &i : a)
#define ch(f, x, y) x = f(x, y)
#define GET5(_1, _2, _3, _4, _5, F, ...) F
#define GET6(_1, _2, _3, _4, _5, _6, F, ...) F
#define vec1(T, n1) vec<T>(n1)
#define vec2(T, n1, n2) vec2<T>(n1, vec1(T, n2))
#define vec3(T, n1, n2, n3) vec3<T>(n1, vec2(T, n2, n3))
#define vec4(T, n1, n2, n3, n4) vec4<T>(n1, vec3(T, n2, n3, n4))
#define vec(...)                              \
    GET5(__VA_ARGS__, vec4, vec3, vec2, vec1) \
    (__VA_ARGS__)
#define vec1v(T, n1, v) vec<T>(n1, v)
#define vec2v(T, n1, n2, v) vec2<T>(n1, vec1v(T, n2, v))
#define vec3v(T, n1, n2, n3, v) vec3<T>(n1, vec2v(T, n2, n3, v))
#define vec4v(T, n1, n2, n3, n4, v) vec4<T>(n1, vec3v(T, n2, n3, n4, v))
#define vecv(...)                                 \
    GET6(__VA_ARGS__, vec4v, vec3v, vec2v, vec1v) \
    (__VA_ARGS__)
#define IN1(T, a) \
    T a;          \
    cin >> a;
#define IN2(T, a, b) \
    T a, b;          \
    cin >> a >> b;
#define IN3(T, a, b, c) \
    T a, b, c;          \
    cin >> a >> b >> c;
#define IN4(T, a, b, c, d) \
    T a, b, c, d;          \
    cin >> a >> b >> c >> d;
#define in(...)                           \
    GET5(__VA_ARGS__, IN4, IN3, IN2, IN1) \
    (__VA_ARGS__)
#define ll(...) in(ll, __VA_ARGS__)
#define STR(...) in(string, __VA_ARGS__)
#define AIN1(T, a, n) \
    vec<T> a(n);      \
    FOR(i, a)         \
    cin >> i;
#define AIN2(T, a, b, n) \
    vec<T> a(n), b(n);   \
    rep(i, n) cin >> a[i] >> b[i];
#define AIN3(T, a, b, c, n)  \
    vec<T> a(n), b(n), c(n); \
    rep(i, n) cin >> a[i] >> b[i] >> c[i];
#define AIN4(T, a, b, c, d, n)     \
    vec<T> a(n), b(n), c(n), d(n); \
    rep(i, n) cin >> a[i] >> b[i] >> c[i] >> d[i];
#define ain(...)                              \
    GET6(__VA_ARGS__, AIN4, AIN3, AIN2, AIN1) \
    (__VA_ARGS__)
#define lls(...) ain(ll, __VA_ARGS__)
#define OUT(x) cout << (x) << endl;
#define FOUT(x) cout << fixed << setprecision(15) << (x) << endl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
    SORT(a);     \
    reverse(ALL(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define DUMPA(a)          \
    cout << #a << " = {"; \
    JOUT(ALL(a), ", ", cout) << "}" << endl;

template <typename T>
ostream &JOUT(T s, T e, string sep = " ", ostream &os = cout)
{
    if (s != e)
    {
        os << *s;
        ++s;
    }
    while (s != e)
    {
        os << sep << *s;
        ++s;
    }
    return os;
}

ostream &YES(bool cond, string yes = "Yes", string no = "No", ostream &os = cout)
{
    if (cond)
    {
        os << yes << endl;
    }
    else
    {
        os << no << endl;
    }
    return os;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
    os << '(' << p.first << ", " << p.second << ')';
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    os << '[';
    JOUT(ALL(v), ", ", os) << ']';
    return os;
}

const ll INF = 1e18;
const ll MOD = 1e9 + 7;

int main() {
  ll(D, T, S);
  YES(S * T >= D);
}


Measured memory_bytes: 3644