import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;


public class Main {

    static void solve() {
        Scanner scan = new Scanner(System.in);

        int d = scan.nextInt();
        int t = scan.nextInt();
        int s = scan.nextInt();

        int tt = 0;
        if(d%s == 0) {
            tt = d/s;
        } else {
            tt = d/s + 1;
        }
        if(tt <= t) {
            System.out.println("Yes");
        } else{
            System.out.println("No");
        }


//        int t = scan.nextInt();
//        for (int i = 0; i < t; i++) {
////            solveCase();
//        }


//        long t = scan.nextLong();

//        for (int i = 0; i < t; i++) {
//            int n = scan.nextInt();
////            scase(n);
//        }
    }


    static void solveCase(int zero1, int one1, int two1, int zero2, int one2, int two2) {

    }

    static void scase(int[] arr1, int[] arr2) {
    }


    public static void main(String[] args) {

        solve();
    }


    static class LoggerNode {
        String message;
        int ts;
    }


    static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    }

    static class ListNode {
        int val;
        ListNode next;

        ListNode() {
        }

        ListNode(int val) {
            this.val = val;
        }

        ListNode(int val, ListNode next) {
            this.val = val;
            this.next = next;
        }
    }
} import java.util.Arrays; Arrays java.util import java.util.Comparator; Comparator java.util import java.util.Scanner; Scanner java.util public class Main {

    static void solve() {
        Scanner scan = new Scanner(System.in);

        int d = scan.nextInt();
        int t = scan.nextInt();
        int s = scan.nextInt();

        int tt = 0;
        if(d%s == 0) {
            tt = d/s;
        } else {
            tt = d/s + 1;
        }
        if(tt <= t) {
            System.out.println("Yes");
        } else{
            System.out.println("No");
        }


//        int t = scan.nextInt();
//        for (int i = 0; i < t; i++) {
////            solveCase();
//        }


//        long t = scan.nextLong();

//        for (int i = 0; i < t; i++) {
//            int n = scan.nextInt();
////            scase(n);
//        }
    }


    static void solveCase(int zero1, int one1, int two1, int zero2, int one2, int two2) {

    }

    static void scase(int[] arr1, int[] arr2) {
    }


    public static void main(String[] args) {

        solve();
    }


    static class LoggerNode {
        String message;
        int ts;
    }


    static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    }

    static class ListNode {
        int val;
        ListNode next;

        ListNode() {
        }

        ListNode(int val) {
            this.val = val;
        }

        ListNode(int val, ListNode next) {
            this.val = val;
            this.next = next;
        }
    }
} Main static void solve() {
        Scanner scan = new Scanner(System.in);

        int d = scan.nextInt();
        int t = scan.nextInt();
        int s = scan.nextInt();

        int tt = 0;
        if(d%s == 0) {
            tt = d/s;
        } else {
            tt = d/s + 1;
        }
        if(tt <= t) {
            System.out.println("Yes");
        } else{
            System.out.println("No");
        }


//        int t = scan.nextInt();
//        for (int i = 0; i < t; i++) {
////            solveCase();
//        }


//        long t = scan.nextLong();

//        for (int i = 0; i < t; i++) {
//            int n = scan.nextInt();
////            scase(n);
//        }
    } solve {
        Scanner scan = new Scanner(System.in);

        int d = scan.nextInt();
        int t = scan.nextInt();
        int s = scan.nextInt();

        int tt = 0;
        if(d%s == 0) {
            tt = d/s;
        } else {
            tt = d/s + 1;
        }
        if(tt <= t) {
            System.out.println("Yes");
        } else{
            System.out.println("No");
        }


//        int t = scan.nextInt();
//        for (int i = 0; i < t; i++) {
////            solveCase();
//        }


//        long t = scan.nextLong();

//        for (int i = 0; i < t; i++) {
//            int n = scan.nextInt();
////            scase(n);
//        }
    } Scanner scan = new Scanner(System.in); scan new Scanner(System.in) int d = scan.nextInt(); d scan.nextInt() scan.nextInt scan int t = scan.nextInt(); t scan.nextInt() scan.nextInt scan int s = scan.nextInt(); s scan.nextInt() scan.nextInt scan int tt = 0; tt 0 if(d%s == 0) {
            tt = d/s;
        } else {
            tt = d/s + 1;
        } d%s == 0 d%s d s 0 {
            tt = d/s;
        } tt = d/s tt d/s d s {
            tt = d/s + 1;
        } tt = d/s + 1 tt d/s + 1 d/s d s 1 if(tt <= t) {
            System.out.println("Yes");
        } else{
            System.out.println("No");
        } tt <= t tt t {
            System.out.println("Yes");
        } System.out.println("Yes") System.out.println System.out System System.out "Yes" {
            System.out.println("No");
        } System.out.println("No") System.out.println System.out System System.out "No" static void solveCase(int zero1, int one1, int two1, int zero2, int one2, int two2) {

    } solveCase {

    } int zero1 zero1 int one1 one1 int two1 two1 int zero2 zero2 int one2 one2 int two2 two2 static void scase(int[] arr1, int[] arr2) {
    } scase {
    } int[] arr1 arr1 int[] arr2 arr2 public static void main(String[] args) {

        solve();
    } main {

        solve();
    } solve() solve String[] args args static class LoggerNode {
        String message;
        int ts;
    } LoggerNode String message; message int ts; ts static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    } TreeNode int val; val TreeNode left; left TreeNode right; right TreeNode(int x) {
            val = x;
        } TreeNode {
            val = x;
        } val = x val x int x x static class ListNode {
        int val;
        ListNode next;

        ListNode() {
        }

        ListNode(int val) {
            this.val = val;
        }

        ListNode(int val, ListNode next) {
            this.val = val;
            this.next = next;
        }
    } ListNode int val; val ListNode next; next ListNode() {
        } ListNode {
        } ListNode(int val) {
            this.val = val;
        } ListNode {
            this.val = val;
        } this.val = val this.val this this.val val int val val ListNode(int val, ListNode next) {
            this.val = val;
            this.next = next;
        } ListNode {
            this.val = val;
            this.next = next;
        } this.val = val this.val this this.val val this.next = next this.next this this.next next int val val ListNode next next public class Main {

    static void solve() {
        Scanner scan = new Scanner(System.in);

        int d = scan.nextInt();
        int t = scan.nextInt();
        int s = scan.nextInt();

        int tt = 0;
        if(d%s == 0) {
            tt = d/s;
        } else {
            tt = d/s + 1;
        }
        if(tt <= t) {
            System.out.println("Yes");
        } else{
            System.out.println("No");
        }


//        int t = scan.nextInt();
//        for (int i = 0; i < t; i++) {
////            solveCase();
//        }


//        long t = scan.nextLong();

//        for (int i = 0; i < t; i++) {
//            int n = scan.nextInt();
////            scase(n);
//        }
    }


    static void solveCase(int zero1, int one1, int two1, int zero2, int one2, int two2) {

    }

    static void scase(int[] arr1, int[] arr2) {
    }


    public static void main(String[] args) {

        solve();
    }


    static class LoggerNode {
        String message;
        int ts;
    }


    static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    }

    static class ListNode {
        int val;
        ListNode next;

        ListNode() {
        }

        ListNode(int val) {
            this.val = val;
        }

        ListNode(int val, ListNode next) {
            this.val = val;
            this.next = next;
        }
    }
} public class Main {

    static void solve() {
        Scanner scan = new Scanner(System.in);

        int d = scan.nextInt();
        int t = scan.nextInt();
        int s = scan.nextInt();

        int tt = 0;
        if(d%s == 0) {
            tt = d/s;
        } else {
            tt = d/s + 1;
        }
        if(tt <= t) {
            System.out.println("Yes");
        } else{
            System.out.println("No");
        }


//        int t = scan.nextInt();
//        for (int i = 0; i < t; i++) {
////            solveCase();
//        }


//        long t = scan.nextLong();

//        for (int i = 0; i < t; i++) {
//            int n = scan.nextInt();
////            scase(n);
//        }
    }


    static void solveCase(int zero1, int one1, int two1, int zero2, int one2, int two2) {

    }

    static void scase(int[] arr1, int[] arr2) {
    }


    public static void main(String[] args) {

        solve();
    }


    static class LoggerNode {
        String message;
        int ts;
    }


    static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    }

    static class ListNode {
        int val;
        ListNode next;

        ListNode() {
        }

        ListNode(int val) {
            this.val = val;
        }

        ListNode(int val, ListNode next) {
            this.val = val;
            this.next = next;
        }
    }
} Main
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;


public class Main {

    static void solve() {
        Scanner scan = new Scanner(System.in);

        int d = scan.nextInt();
        int t = scan.nextInt();
        int s = scan.nextInt();

        int tt = 0;
        if(d%s == 0) {
            tt = d/s;
        } else {
            tt = d/s + 1;
        }
        if(tt <= t) {
            System.out.println("Yes");
        } else{
            System.out.println("No");
        }


//        int t = scan.nextInt();
//        for (int i = 0; i < t; i++) {
////            solveCase();
//        }


//        long t = scan.nextLong();

//        for (int i = 0; i < t; i++) {
//            int n = scan.nextInt();
////            scase(n);
//        }
    }


    static void solveCase(int zero1, int one1, int two1, int zero2, int one2, int two2) {

    }

    static void scase(int[] arr1, int[] arr2) {
    }


    public static void main(String[] args) {

        solve();
    }


    static class LoggerNode {
        String message;
        int ts;
    }


    static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    }

    static class ListNode {
        int val;
        ListNode next;

        ListNode() {
        }

        ListNode(int val) {
            this.val = val;
        }

        ListNode(int val, ListNode next) {
            this.val = val;
            this.next = next;
        }
    }
}