/*
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e5+9;
int n,q,child[inf];
bool star = 1;

int main(){

    cin>>n>>q;
    for(int i=1;i<n;i++){
        int a,b;
        cin>>a>>b;
        if(a != 1)
            star = 0;
    }
    while(q--){
        int cnt;
        cin>>cnt;
        while(cnt--){
            int tmp;
            cin>>tmp;
            child[tmp]++;
        }
        if(star){
            int sum = 0,ans = 0;
            for(int i=2;i<=n;i++){
                if(child[i] == 0)
                    ans++;
            else if(child[i]%2)
                ans += child[i] + 1;
            else
                ans += child[i] + 2;
            sum += (child[i] > 0?child[i]:1);
            }
            if(sum%2)
            ans = -1;
            cout<<ans<<endl;
        }
        else {
            int ans = n-1,last = 0,sum = 2;
            for(int i= 2;i<n;i++){
                if(child[i] == 0)
                    continue;
                sum += child[i];
                if( (child[i] % 2) == 0)
                    ans += child[i];
                else {
                    ans += child[i]-1;
                    if(last)
                        ans += 2 + i- last,last = 0;
                    else
                        last = i;
                }
            }
            if(sum % 2)
                ans = -1;
            cout<<ans<<endl;
        }
    }
}
*/
/*1
5 1
1 2
2 3
3 4
4 5
2 2 4
*/
/*
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll inf = 1e2+9,mod = 1e9+7,MX = 1e9+9;
ll n,m,q,cur;
pair<ll,ll> dp[inf][inf][5], store[inf][inf];
ll idx[] = {-1,-1,1,1};
ll idy[] = {1,-1,1,-1};



bool valid(ll x,ll y)
{

    return x>=1 && y>=1 && x<=n && y<=m;
}

pair<ll,ll> solve(ll i,ll j,ll dia)
{

    if(i == n && j == cur)
        return make_pair(0,1);

    pair<ll,ll> &ret = dp[i][j][dia],tmp;
    if(ret.first != -1)
        return ret;
    ret = make_pair(MX,0);
    for(ll z=0; z<4; z++)
    {
        ll x = idx[z] + i,y = idy[z] + j;
        if(!valid(x,y))
            continue;
        tmp = solve(x,y,z);
        if(z != dia)
            tmp.first++;
        if(tmp.first < ret.first)
            ret = tmp;
        else if(tmp.first == ret.first)
            ret.second += tmp.second;
        ret.second %= mod;
    }
    return ret;
}
pair<ll,ll> dp1[inf][inf], store1[inf][inf];
ll idx1[] = {-1,-1,1,1,1,-1,0,0};
ll idy1[] = {1,-1,1,-1,0,0,1,-1};


   void solve1(ll c)
{

    priority_queue<pair<ll,pair<ll,ll> > > s;
    s.push(make_pair( 0,make_pair(1,c)  ));
    for(ll i=1;i<=n;i++)
        for(ll j=1;j<=n;j++)
            dp1[i][j] = make_pair(MX,0);
    dp1[1][c] = make_pair(0,1);
    while(!s.empty()){
        pair<ll,pair<ll,ll> >p = s.top();
        s.pop();
        p.first *= -1;
        ll i = p.second.first,j = p.second.second;
        if(dp1[i][j].first != p.first)
            continue;
        for(ll z=0;z<8;z++){
            ll x = idx1[z] + i,y = idy1[z] + j;
            if(!valid(x,y))
                continue;
            if(dp1[x][y].first < dp1[i][j].first + 1)
                continue;
            if(dp1[x][y].first == dp1[i][j].first + 1)
                dp1[x][y].second = (dp1[x][y].second +dp1[i][j].second)%mod;
        else
            dp1[x][y] = dp1[i][j],dp1[x][y].first++,s.push({ -dp1[x][y].first,{x,y} } );
        }
    }
    for(int j=1;j<=m;j++)
        store1[c][j] = dp1[n][j];
}


int main()
{
    cin>>n>>m>>q;
    for(ll i=1; i<=m; i++)
    {
        memset(dp,-1,sizeof(dp));
        cur = i;
        for(ll j=1; j<=m; j++)
            store[j][i] = solve(1,j,4);
    }
    for(int i=1; i<=m; i++)
        solve1(i);

    while(q--)
    {
        char type ;
        ll i,j;
        cin>>type>>j>>i;
       if(type == 'B')
        {
            if(store[j][i].first == -1 || store[j][i].first == MX)
                cout<<"0 0\n";
            else
                cout<<store[j][i].first<<" "<<store[j][i].second<<endl;
        }
        else if(type == 'K')
        {
            if(store1[j][i].first == -1 || store1[j][i].first == MX)
                cout<<"0 0\n";
            else
                cout<<store1[j][i].first<<" "<<store1[j][i].second<<endl;
        }
    }
}
*/

/*
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+9,D = 509,MX = 1e9+9,sqr = 600;
int n,d,u,q,h[N],Counter = 0;
struct cmp
{
	bool operator()(int a,int b) const
	{
		return h[a]<h[b];
	}
};

set<int> s[N];
int Delete[N<<2];

vector<pair<int,int> > adj[N],Last[N];
vector<int> v[N];

int get(vector<int> &a,vector<int> &b){
                int ans = 1e9;

        if(a.empty() || b.empty())
            return ans;
        for(auto o:a){
            int idx = lower_bound(b.begin(),b.end(),o)-b.begin();
            if(idx != b.size())
                ans = min(ans, abs(o-b[idx]) );
            idx--;
            if(idx > -1)
                ans = min(ans,abs(o-b[idx]));
        }
        return ans;
}

void check(int idx,int day){

    if( (adj[idx].size() % sqr) == 0){
        Last[idx].push_back( make_pair(day,Counter) );
        for(auto o:s[idx])
            v[Counter].push_back(o);
    }
}
int Cnt;
vector<int> go(int idx,int day){

    vector<int> ret1,ret;
    int st = upper_bound(Last[idx].begin(),Last[idx].end(),make_pair(day,MX))-Last[idx].begin();
    st--;
    if(st < 0)
        st = 0;
    else {
        for(auto o:v[Last[idx][st].second])
            ret1.push_back(o);
        st = Last[idx][st].first+1;
    }
    st = lower_bound(adj[idx].begin(),adj[idx].end(),make_pair(st,-MX)) - adj[idx].begin();
    while(st < adj[idx].size()  && adj[idx][st].first <= day){
        int tmp = adj[idx][st].second;
        if(tmp < 0)
            Delete[ -tmp ] = Cnt;
        else
            Delete[tmp] = 0;
        ret1.push_back(abs(tmp));
        st++;
    }
    for(auto o:ret1)
        if(Delete[o] != Cnt)
            ret.push_back(h[o]);
    sort(ret.begin(),ret.end());
    return ret;
}

int main(){

    scanf("%d%d%d%d",&n,&d,&u,&q);

    for(int i=1;i<=n;i++)
        scanf("%d",h+i);

    for(int i=1;i<=u;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        a++,b++;
        if(s[a].count(b)){
            s[a].erase(b),s[b].erase(a);

        adj[a].push_back(make_pair(i,-b));
        adj[b].push_back(make_pair(i,-a));
        }
        else{
            s[a].insert(b),s[b].insert(a);

        adj[a].push_back(make_pair(i,-b));
        adj[b].push_back(make_pair(i,-a));
        }


        check(a,i);
        check(b,i);
    }

    while(q--){
            Cnt++;
        int a,b,day;
        a++,b++;
        scanf("%d%d%d",&a,&b,&day);
        vector<int> A = go(a,day);
        Cnt++;
        vector<int> B = go(b,day);
        printf("%d\n",get(A,B));
        fflush(stdout);
    }
}
*/

/*
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll inf = 1e2+9,mod = 1e9+7,MX = 1e9+9;
ll n,m,q,cur;
pair<ll,ll> dp[inf][inf][5], store[inf][inf];
ll idx[] = {-1,-1,1,1};
ll idy[] = {1,-1,1,-1};



bool valid(ll x,ll y)
{

    return x>=1 && y>=1 && x<=n && y<=m;
}

pair<ll,ll> solve(ll i,ll j,ll dia)
{

    if(i == n && j == cur)
        return make_pair(0,1);

    pair<ll,ll> &ret = dp[i][j][dia],tmp;
    if(ret.first != -1)
        return ret;
    ret = make_pair(MX,0);
    for(ll z=0; z<4; z++)
    {
        ll x = idx[z] + i,y = idy[z] + j;
        if(!valid(x,y))
            continue;
        tmp = solve(x,y,z);
        if(z != dia)
            tmp.first++;
        if(tmp.first < ret.first)
            ret = tmp;
        else if(tmp.first == ret.first)
            ret.second += tmp.second;
        ret.second %= mod;
    }
    return ret;
}
pair<ll,ll> dp1[inf][inf], store1[inf][inf];
ll idx1[] = {-1,-1,1,1,1,-1,0,0};
ll idy1[] = {1,-1,1,-1,0,0,1,-1};


   void solve1(ll c)
{

    priority_queue<pair<ll,pair<ll,ll> > > s;
    s.push(make_pair( 0,make_pair(1,c)  ));
    for(ll i=1;i<=n;i++)
        for(ll j=1;j<=n;j++)
            dp1[i][j] = make_pair(MX,0);
    dp1[1][c] = make_pair(0,1);
    while(!s.empty()){
        pair<ll,pair<ll,ll> >p = s.top();
        s.pop();
        p.first *= -1;
        ll i = p.second.first,j = p.second.second;
        if(dp1[i][j].first != p.first)
            continue;
        for(ll z=0;z<8;z++){
            ll x = idx1[z] + i,y = idy1[z] + j;
            if(!valid(x,y))
                continue;
            if(dp1[x][y].first < dp1[i][j].first + 1)
                continue;
            if(dp1[x][y].first == dp1[i][j].first + 1)
                dp1[x][y].second = (dp1[x][y].second +dp1[i][j].second)%mod;
        else
            dp1[x][y] = dp1[i][j],dp1[x][y].first++,s.push({ -dp1[x][y].first,{x,y} } );
        }
    }
    for(int j=1;j<=m;j++)
        store1[c][j] = dp1[n][j];
}


int main()
{
    cin>>n>>m>>q;
    for(ll i=1; i<=m; i++)
    {
        memset(dp,-1,sizeof(dp));
        cur = i;
        for(ll j=1; j<=m; j++)
            store[j][i] = solve(1,j,4);
    }
    for(int i=1; i<=m; i++)
        solve1(i);

    while(q--)
    {
        char type ;
        ll i,j;
        cin>>type>>j>>i;
       if(type == 'B')
        {
            if(store[j][i].first == -1 || store[j][i].first == MX)
                cout<<"0 0\n";
            else
                cout<<store[j][i].first<<" "<<store[j][i].second<<endl;
        }
        else if(type == 'K')
        {
            if(store1[j][i].first == -1 || store1[j][i].first == MX)
                cout<<"0 0\n";
            else
                cout<<store1[j][i].first<<" "<<store1[j][i].second<<endl;
        }
        else if(type == 'P'){
            if(i != j)
                cout<<"0 0\n";
            else
                cout<<"1 1\n";
        }
        else if(type == 'R'){
            if(i == j)                cout<<"1 1\n";
    else
            cout<<"2 2\n";
        }
        else {
         if(i == j)                cout<<"1 1\n";
    else
            cout<<"2 2\n";
                   }
    }
}
*/

#include <bits/stdc++.h>
using namespace std;

int main(){

    int d,t,s;
    cin>>d>>t>>s;
    if(t*s>=d)
        cout<<"Yes";
    else
        cout<<"No";
}


Measured memory_bytes: 3604