#include <bits/stdc++.h>
using namespace std;
long long int modd(long long int val, long long int m = 1000000007) {
  val %= m;
  return (val + m) % m;
}
bool isPrime(long long int n) {
  if (n <= 1) return false;
  for (long long int i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
vector<bool> prime(1e6, true);
void sieve() {
  for (long long int i = 2; i * i <= 1e6; i++) {
    if (prime[i] == true) {
      for (long long int j = i * i; j <= 1e6; j += i) prime[j] = false;
    }
  }
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b) {
    if (b & 1) ans = modd(ans * a);
    a = modd(a * a);
    b /= 2;
  }
  return ans;
}
void solve() {
  long long int n, m, k;
  cin >> n >> m >> k;
  if (min(m, k) < n)
    cout << "NO";
  else
    cout << "YES";
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int q;
  q = 1;
  while (q--) solve();
  return 0;
}
