import java.util.*;
public class xiaowuc1 {
  public static void main(String[] args) throws Exception {
    Scanner sc = new Scanner(System.in);
    int w = sc.nextInt(), k = sc.nextInt();
    c = sc.nextInt();
    seen = new boolean[k+1][w+1];
    can = new boolean[k+1][w+1];
    if(dfs(k, w)) System.out.println("yes");
    else System.out.println("no");
  }
  static boolean[][] seen, can;
  static int c;
  private static boolean dfs(int have, int want) {
    if(have == want) return true;
    if(have > want) return false;
    if(seen[have][want]) return can[have][want];
    seen[have][want] = true;
    for(int i = 1; i <= have - c; i++) {
      if(dfs(i, want - (have - 1))) {
        can[have][want] = true;
        return true;
      }
    }
    return false;
  }
}