/**
 * author: said_v15
**/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <__msvc_all_public_headers.hpp>
 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
 
typedef long long  ll;

#define press_F_to_pay_respect ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn for(int i=0;i<n;i++) 
#define fore(i,a,b) for(int i = a; i < (b); i++)
#define pb push_back 
#define pob pop_back()
#define mp make_pair 
#define sc second 
#define f first 
#define th third
#define ld long double
#define kek cout<<"\n"; 
#define rep(i,a,b) for(int i=a;i<b;i++)
#define all(v) ((v).begin()), ((v).end()) 
#define halt {cout<<"NO"; return 0;}


const ll MOD = 1e9 + 7;
const ll MOD1 = 998244353;
const int MAXN = 2000100;
const int INF = 1e8;
const ll LL_INF=1e18;
const double pi=3.1415926535;
using namespace std;
int divide(int a, int b)
{
          return (a+b-1)/b;
}

int main()
{
    #if defined(_DEBUG)
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
    #endif
 press_F_to_pay_respect;
 // cout << fixed << setprecision(12) << ans;
 // string al = "abcdefghijklmnopqrstuvwxyz";
 int questions=1;
 // cin>>questions;
 while(questions--)
 {
   /* int n,m;
    cin>>n>>m;
    vector<ll> v(n+1);
    for(int i=1;i<=n;i++) cin>>v[i];
    ll dp[n+1][n+1][m+1];
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) for(int k=1;k<=m;k++) dp[i][j][k]=0;
    dp[1][1][1]=v[1];
    for(int t=1;t<=n;t++)
    {
              for(int k=1;k<=m;k++)
              {
                        if(t<k) break;
                        ll sum=0;
                        for(int l=t;l>=0;l--)
                        {
                                  sum+=v[l];
                                  for(int j=l-1;j>=0;j--)
                                  {
                                            
                                            if(j<k-1) break;
                                            if(j==0) dp[l][t][k]=max(dp[l][t][k], sum);
                                            else dp[l][t][k]=max(dp[l][t][k],dp[j][l-1][k-1] & sum);
                                  }
                        }
              }
    }
    ll ans=0;
    for(int i=n;i>0;i--) ans=max(ans, dp[i][n][m]);
    cout<<ans<<endl;
    for(int i=n;i>0;i--)
    {
              if(ans==dp[i][n][m]) 
              {
                        cout<<i<<" ";
                        return 0;
              }
    }*/
    
    // 2**50 == 1125899906842624
    
  // Generator 
 /* int n,m;
    cin>>n>>m;
    vector<ll> v(n+1);
    for(int i=1;i<=n;i++) cin>>v[i];
    ll ans1=0;
    ll cnt1=0,cnt2=0,cnt3=0,cnt4=0;
    for(int i=1;i<=n;i++)
    {
        cnt1+=v[i];
        cnt2=0;
        cnt3=0;
        cnt4=0;
        for(int j=i+1;j<=n;j++)
        {
            cnt2+=v[j];
            cnt3=0;
            cnt4=0;
            for(int l=j+1;l<=n;l++) 
            {
                cnt3+=v[l];
                cnt4=0;
                for(int k=l+1;k<=n;k++)
                {
                    cnt4+=v[k];
                }
                ll cnt=cnt1&cnt2;
                    cnt&=cnt3;
                    cnt&=cnt4;
                    ans1=max(ans1, cnt);
            }
        }
    }
    cout<<ans1<<endl;
    cnt1=0;
    for(int i=1;i<=n;i++)
    {
        cnt1+=v[i];
        cnt2=0;
        cnt3=0;
        cnt4=0;
        for(int j=i+1;j<=n;j++)
        {
            cnt2+=v[j];
            cnt3=0;
            cnt4=0;
            for(int l=j+1;l<=n;l++) 
            {
                cnt3+=v[l];
                cnt4=0;
                for(int k=l+1;k<=n;k++)
                {
                    cnt4+=v[k];
                    
                }
                   ll cnt=cnt1&cnt2;
                    cnt&=cnt3;
                    cnt&=cnt4;
                    if(cnt==ans1)
                    {
                              cout<<i<<" "<<j<<" "<<l;
                              return 0;
                    }
            }
        }
    }*/
    
  /*  11 4
123125212 123 4589 7895 4563 1256 7529 7822 48895 56985 452

11 4
1232 123 4589 7895 4563 1256 7529 7822 48895 56985 452

11 4
1232 123 4589 7895 4563 1256 7529 722 4895 565 45

11 4
122 123 489 785 456 126 7529 722 895 55 455
    */
    double a,b,c;
    cin>>a>>b>>c;
    double n=a/c;
    if(n>b) puts("No");
    else puts("Yes");
  
  
          
 }
 
 
 // !!! LOOK AT NUMBER OF QUESTIONS IN A PROBLEM !!! (cin>>questions)
 
 
 
  // cout <<"Runtime is:"<<clock() * 1.0 / CLOCKS_PER_SEC <<endl;
   return 0;
   
   
 
}

Measured memory_bytes: 3756