#include <bits/stdc++.h>
using namespace std;
long long power(long long b, long long n) {
  if (n == 0)
    return 1;
  else if (n % 2)
    return b * power(b, n / 2) * power(b, n / 2);
  else
    return power(b, n / 2) * power(b, n / 2);
}
long double root(long long n, long long r) {
  long double dif = 0.0001;
  long double guess = n / 2.0;
  while (abs(pow(guess, r) - n) >= dif) {
    long double temp = pow(guess, r) - n;
    long double tmp = r * pow(guess, r - 1);
    guess -= temp / tmp;
  }
  return guess;
}
void fileio() {}
int solve() {
  int n;
  scanf("%d", &n);
  int pen, book;
  scanf("%d %d", &pen, &book);
  if (pen >= n && book >= n)
    printf("Yes");
  else
    printf("No");
  return 0;
}
int main() { solve(); }
