import java.io.*;
import java.util.*;

public class Main {
	public static void main(String[] args) throws IOException{
		Scanner sc=new Scanner(System.in);
		int t=1;//sc.nextInt();
		while(t-->0) {
			int d=sc.nextInt();
			int time=sc.nextInt();
			int s=sc.nextInt();
			if(s*time>=d) System.out.println("Yes");
			else System.out.println("No");
		}
	}
}
class Reader{
	BufferedReader reader;
	Reader(){
		reader=new BufferedReader(new InputStreamReader(System.in));
	}
	int nextInt() throws IOException{
		String in=reader.readLine().trim();
		return Integer.parseInt(in);
	}
	long nextLong() throws IOException{
		String in=reader.readLine().trim();
		return Long.parseLong(in);
	}
	String next() throws IOException{
		return reader.readLine().trim();
	}
	String[] stringArray() throws IOException{
		return reader.readLine().trim().split("\\s+");
	}
	int[] intArray() throws IOException{
		String[] inp=this.stringArray();
		int[] arr=new int[inp.length];
		int i=0;
		for(String s:inp) {
			arr[i++]=Integer.parseInt(s);
		}
		return arr;
	}
}
class Solution {
    public int maxEnvelopes(int[][] envel) {
        int n=envel.length;
        if(n==0) return 0;
        env[] arr=new env[n];
        for(int i=0;i<n;i++){
            arr[i]=new env(envel[i][0],envel[i][1]);
        }
        //[[4,5],[4,6],[6,7],[2,3],[1,1]]
        Arrays.sort(arr);
        int[] dp=new int[n];
        int size=0;
        for(int i=0;i<n;i++){
            int left = 0, right = size, middle = 0;     // right = size
            while(left < right) {
                middle = left + (right - left) / 2;
                if(dp[middle] < arr[i].w) left = middle + 1;
                else right = middle;
            }
            
            // left is the right position to 'replace' in dp array
            dp[left] = arr[i].w;
            if(left == size) size++;
        }
        return size;
    }
}
class env implements Comparable<env>{
    int l,w;
    env(int l,int w){
        this.l=l;this.w=w;
    }
    public int compareTo(env other){
        if(this.l!=other.l) return Integer.compare(this.l,other.l);
        return Integer.compare(other.w,this.w);
    }
} import java.io.*; io.* java import java.util.*; util.* java public class Main {
	public static void main(String[] args) throws IOException{
		Scanner sc=new Scanner(System.in);
		int t=1;//sc.nextInt();
		while(t-->0) {
			int d=sc.nextInt();
			int time=sc.nextInt();
			int s=sc.nextInt();
			if(s*time>=d) System.out.println("Yes");
			else System.out.println("No");
		}
	}
} Main public static void main(String[] args) throws IOException{
		Scanner sc=new Scanner(System.in);
		int t=1;//sc.nextInt();
		while(t-->0) {
			int d=sc.nextInt();
			int time=sc.nextInt();
			int s=sc.nextInt();
			if(s*time>=d) System.out.println("Yes");
			else System.out.println("No");
		}
	} main {
		Scanner sc=new Scanner(System.in);
		int t=1;//sc.nextInt();
		while(t-->0) {
			int d=sc.nextInt();
			int time=sc.nextInt();
			int s=sc.nextInt();
			if(s*time>=d) System.out.println("Yes");
			else System.out.println("No");
		}
	} Scanner sc=new Scanner(System.in); sc new Scanner(System.in) int t=1; t 1 while(t-->0) {
			int d=sc.nextInt();
			int time=sc.nextInt();
			int s=sc.nextInt();
			if(s*time>=d) System.out.println("Yes");
			else System.out.println("No");
		} t-->0 t-- t 0 {
			int d=sc.nextInt();
			int time=sc.nextInt();
			int s=sc.nextInt();
			if(s*time>=d) System.out.println("Yes");
			else System.out.println("No");
		} int d=sc.nextInt(); d sc.nextInt() sc.nextInt sc int time=sc.nextInt(); time sc.nextInt() sc.nextInt sc int s=sc.nextInt(); s sc.nextInt() sc.nextInt sc if(s*time>=d) System.out.println("Yes");
			else System.out.println("No"); s*time>=d s*time s time d System.out.println("Yes") System.out.println System.out System System.out "Yes" System.out.println("No") System.out.println System.out System System.out "No" String[] args args class Reader{
	BufferedReader reader;
	Reader(){
		reader=new BufferedReader(new InputStreamReader(System.in));
	}
	int nextInt() throws IOException{
		String in=reader.readLine().trim();
		return Integer.parseInt(in);
	}
	long nextLong() throws IOException{
		String in=reader.readLine().trim();
		return Long.parseLong(in);
	}
	String next() throws IOException{
		return reader.readLine().trim();
	}
	String[] stringArray() throws IOException{
		return reader.readLine().trim().split("\\s+");
	}
	int[] intArray() throws IOException{
		String[] inp=this.stringArray();
		int[] arr=new int[inp.length];
		int i=0;
		for(String s:inp) {
			arr[i++]=Integer.parseInt(s);
		}
		return arr;
	}
} Reader BufferedReader reader; reader Reader(){
		reader=new BufferedReader(new InputStreamReader(System.in));
	} Reader {
		reader=new BufferedReader(new InputStreamReader(System.in));
	} reader=new BufferedReader(new InputStreamReader(System.in)) reader new BufferedReader(new InputStreamReader(System.in)) int nextInt() throws IOException{
		String in=reader.readLine().trim();
		return Integer.parseInt(in);
	} nextInt {
		String in=reader.readLine().trim();
		return Integer.parseInt(in);
	} String in=reader.readLine().trim(); in reader.readLine().trim() reader.readLine().trim reader.readLine() reader.readLine reader return Integer.parseInt(in); Integer.parseInt(in) Integer.parseInt Integer in long nextLong() throws IOException{
		String in=reader.readLine().trim();
		return Long.parseLong(in);
	} nextLong {
		String in=reader.readLine().trim();
		return Long.parseLong(in);
	} String in=reader.readLine().trim(); in reader.readLine().trim() reader.readLine().trim reader.readLine() reader.readLine reader return Long.parseLong(in); Long.parseLong(in) Long.parseLong Long in String next() throws IOException{
		return reader.readLine().trim();
	} next {
		return reader.readLine().trim();
	} return reader.readLine().trim(); reader.readLine().trim() reader.readLine().trim reader.readLine() reader.readLine reader String[] stringArray() throws IOException{
		return reader.readLine().trim().split("\\s+");
	} stringArray {
		return reader.readLine().trim().split("\\s+");
	} return reader.readLine().trim().split("\\s+"); reader.readLine().trim().split("\\s+") reader.readLine().trim().split reader.readLine().trim() reader.readLine().trim reader.readLine() reader.readLine reader "\\s+" int[] intArray() throws IOException{
		String[] inp=this.stringArray();
		int[] arr=new int[inp.length];
		int i=0;
		for(String s:inp) {
			arr[i++]=Integer.parseInt(s);
		}
		return arr;
	} intArray {
		String[] inp=this.stringArray();
		int[] arr=new int[inp.length];
		int i=0;
		for(String s:inp) {
			arr[i++]=Integer.parseInt(s);
		}
		return arr;
	} String[] inp=this.stringArray(); inp this.stringArray() this.stringArray this int[] arr=new int[inp.length]; arr new int[inp.length] inp.length inp inp.length int i=0; i 0 for(String s:inp) {
			arr[i++]=Integer.parseInt(s);
		} String s inp {
			arr[i++]=Integer.parseInt(s);
		} {
			arr[i++]=Integer.parseInt(s);
		} arr[i++]=Integer.parseInt(s) arr[i++] arr i++ i Integer.parseInt(s) Integer.parseInt Integer s return arr; arr class Solution {
    public int maxEnvelopes(int[][] envel) {
        int n=envel.length;
        if(n==0) return 0;
        env[] arr=new env[n];
        for(int i=0;i<n;i++){
            arr[i]=new env(envel[i][0],envel[i][1]);
        }
        //[[4,5],[4,6],[6,7],[2,3],[1,1]]
        Arrays.sort(arr);
        int[] dp=new int[n];
        int size=0;
        for(int i=0;i<n;i++){
            int left = 0, right = size, middle = 0;     // right = size
            while(left < right) {
                middle = left + (right - left) / 2;
                if(dp[middle] < arr[i].w) left = middle + 1;
                else right = middle;
            }
            
            // left is the right position to 'replace' in dp array
            dp[left] = arr[i].w;
            if(left == size) size++;
        }
        return size;
    }
} Solution public int maxEnvelopes(int[][] envel) {
        int n=envel.length;
        if(n==0) return 0;
        env[] arr=new env[n];
        for(int i=0;i<n;i++){
            arr[i]=new env(envel[i][0],envel[i][1]);
        }
        //[[4,5],[4,6],[6,7],[2,3],[1,1]]
        Arrays.sort(arr);
        int[] dp=new int[n];
        int size=0;
        for(int i=0;i<n;i++){
            int left = 0, right = size, middle = 0;     // right = size
            while(left < right) {
                middle = left + (right - left) / 2;
                if(dp[middle] < arr[i].w) left = middle + 1;
                else right = middle;
            }
            
            // left is the right position to 'replace' in dp array
            dp[left] = arr[i].w;
            if(left == size) size++;
        }
        return size;
    } maxEnvelopes {
        int n=envel.length;
        if(n==0) return 0;
        env[] arr=new env[n];
        for(int i=0;i<n;i++){
            arr[i]=new env(envel[i][0],envel[i][1]);
        }
        //[[4,5],[4,6],[6,7],[2,3],[1,1]]
        Arrays.sort(arr);
        int[] dp=new int[n];
        int size=0;
        for(int i=0;i<n;i++){
            int left = 0, right = size, middle = 0;     // right = size
            while(left < right) {
                middle = left + (right - left) / 2;
                if(dp[middle] < arr[i].w) left = middle + 1;
                else right = middle;
            }
            
            // left is the right position to 'replace' in dp array
            dp[left] = arr[i].w;
            if(left == size) size++;
        }
        return size;
    } int n=envel.length; n envel.length envel envel.length if(n==0) return 0; n==0 n 0 return 0; 0 env[] arr=new env[n]; arr new env[n] n for(int i=0;i<n;i++){
            arr[i]=new env(envel[i][0],envel[i][1]);
        } int i=0; int i=0; i 0 i<n i n i++ i++ i {
            arr[i]=new env(envel[i][0],envel[i][1]);
        } {
            arr[i]=new env(envel[i][0],envel[i][1]);
        } arr[i]=new env(envel[i][0],envel[i][1]) arr[i] arr i new env(envel[i][0],envel[i][1]) Arrays.sort(arr) Arrays.sort Arrays arr int[] dp=new int[n]; dp new int[n] n int size=0; size 0 for(int i=0;i<n;i++){
            int left = 0, right = size, middle = 0;     // right = size
            while(left < right) {
                middle = left + (right - left) / 2;
                if(dp[middle] < arr[i].w) left = middle + 1;
                else right = middle;
            }
            
            // left is the right position to 'replace' in dp array
            dp[left] = arr[i].w;
            if(left == size) size++;
        } int i=0; int i=0; i 0 i<n i n i++ i++ i {
            int left = 0, right = size, middle = 0;     // right = size
            while(left < right) {
                middle = left + (right - left) / 2;
                if(dp[middle] < arr[i].w) left = middle + 1;
                else right = middle;
            }
            
            // left is the right position to 'replace' in dp array
            dp[left] = arr[i].w;
            if(left == size) size++;
        } {
            int left = 0, right = size, middle = 0;     // right = size
            while(left < right) {
                middle = left + (right - left) / 2;
                if(dp[middle] < arr[i].w) left = middle + 1;
                else right = middle;
            }
            
            // left is the right position to 'replace' in dp array
            dp[left] = arr[i].w;
            if(left == size) size++;
        } int left = 0 left 0 right = size right size middle = 0; middle 0 while(left < right) {
                middle = left + (right - left) / 2;
                if(dp[middle] < arr[i].w) left = middle + 1;
                else right = middle;
            } left < right left right {
                middle = left + (right - left) / 2;
                if(dp[middle] < arr[i].w) left = middle + 1;
                else right = middle;
            } middle = left + (right - left) / 2 middle left + (right - left) / 2 left (right - left) / 2 (right - left) right left 2 if(dp[middle] < arr[i].w) left = middle + 1;
                else right = middle; dp[middle] < arr[i].w dp[middle] dp middle arr[i].w arr[i] arr i arr[i].w left = middle + 1 left middle + 1 middle 1 right = middle right middle dp[left] = arr[i].w dp[left] dp left arr[i].w arr[i] arr i arr[i].w if(left == size) size++; left == size left size size++ size return size; size int[][] envel envel class env implements Comparable<env>{
    int l,w;
    env(int l,int w){
        this.l=l;this.w=w;
    }
    public int compareTo(env other){
        if(this.l!=other.l) return Integer.compare(this.l,other.l);
        return Integer.compare(other.w,this.w);
    }
} env int l l w; w env(int l,int w){
        this.l=l;this.w=w;
    } env {
        this.l=l;this.w=w;
    } this.l=l this.l this this.l l this.w=w this.w this this.w w int l l int w w public int compareTo(env other){
        if(this.l!=other.l) return Integer.compare(this.l,other.l);
        return Integer.compare(other.w,this.w);
    } compareTo {
        if(this.l!=other.l) return Integer.compare(this.l,other.l);
        return Integer.compare(other.w,this.w);
    } if(this.l!=other.l) return Integer.compare(this.l,other.l); this.l!=other.l this.l this this.l other.l other other.l return Integer.compare(this.l,other.l); Integer.compare(this.l,other.l) Integer.compare Integer this.l this this.l other.l other other.l return Integer.compare(other.w,this.w); Integer.compare(other.w,this.w) Integer.compare Integer other.w other other.w this.w this this.w env other other Comparable public class Main {
	public static void main(String[] args) throws IOException{
		Scanner sc=new Scanner(System.in);
		int t=1;//sc.nextInt();
		while(t-->0) {
			int d=sc.nextInt();
			int time=sc.nextInt();
			int s=sc.nextInt();
			if(s*time>=d) System.out.println("Yes");
			else System.out.println("No");
		}
	}
} public class Main {
	public static void main(String[] args) throws IOException{
		Scanner sc=new Scanner(System.in);
		int t=1;//sc.nextInt();
		while(t-->0) {
			int d=sc.nextInt();
			int time=sc.nextInt();
			int s=sc.nextInt();
			if(s*time>=d) System.out.println("Yes");
			else System.out.println("No");
		}
	}
} Main
import java.io.*;
import java.util.*;

public class Main {
	public static void main(String[] args) throws IOException{
		Scanner sc=new Scanner(System.in);
		int t=1;//sc.nextInt();
		while(t-->0) {
			int d=sc.nextInt();
			int time=sc.nextInt();
			int s=sc.nextInt();
			if(s*time>=d) System.out.println("Yes");
			else System.out.println("No");
		}
	}
}
class Reader{
	BufferedReader reader;
	Reader(){
		reader=new BufferedReader(new InputStreamReader(System.in));
	}
	int nextInt() throws IOException{
		String in=reader.readLine().trim();
		return Integer.parseInt(in);
	}
	long nextLong() throws IOException{
		String in=reader.readLine().trim();
		return Long.parseLong(in);
	}
	String next() throws IOException{
		return reader.readLine().trim();
	}
	String[] stringArray() throws IOException{
		return reader.readLine().trim().split("\\s+");
	}
	int[] intArray() throws IOException{
		String[] inp=this.stringArray();
		int[] arr=new int[inp.length];
		int i=0;
		for(String s:inp) {
			arr[i++]=Integer.parseInt(s);
		}
		return arr;
	}
}
class Solution {
    public int maxEnvelopes(int[][] envel) {
        int n=envel.length;
        if(n==0) return 0;
        env[] arr=new env[n];
        for(int i=0;i<n;i++){
            arr[i]=new env(envel[i][0],envel[i][1]);
        }
        //[[4,5],[4,6],[6,7],[2,3],[1,1]]
        Arrays.sort(arr);
        int[] dp=new int[n];
        int size=0;
        for(int i=0;i<n;i++){
            int left = 0, right = size, middle = 0;     // right = size
            while(left < right) {
                middle = left + (right - left) / 2;
                if(dp[middle] < arr[i].w) left = middle + 1;
                else right = middle;
            }
            
            // left is the right position to 'replace' in dp array
            dp[left] = arr[i].w;
            if(left == size) size++;
        }
        return size;
    }
}
class env implements Comparable<env>{
    int l,w;
    env(int l,int w){
        this.l=l;this.w=w;
    }
    public int compareTo(env other){
        if(this.l!=other.l) return Integer.compare(this.l,other.l);
        return Integer.compare(other.w,this.w);
    }
}
