#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

const long long INF_L = 1e17+7;
const long long INF_I = 1e9+7;
const long long MOD = 1e9+7;
const double EPS = 1e-8;
const double PI=acos(-1);

using namespace std;

int main(){	
	
	double p,q;
	cin >> p >> q;
	double p1 = (1-p)*q;
	//cout << p1 << endl;
	double p2 = p*(1-q)*q;
	//cout << p2 << endl;
	cout << (p1<p2 ? "YES" : "NO");
	
	return 0;
}