#include using namespace std; #define rep(i,n) REP(i,0,n) #define REP(i,s,e) for(int i=(s); i<(int)(e); i++) #define pb push_back #define all(r) r.begin(),r.end() #define rall(r) r.rbegin(),r.rend() #define fi first #define se second typedef long long ll; typedef vector vi; typedef vector vl; typedef pair pii; typedef pair pll; const int INF = 1e9; const ll MOD = 1e9 + 7; double EPS = 1e-8; int main(){ int x, y, n; cin >> x >> y >> n; vi a(n); rep(i, n) cin >> a[i]; if(n == 1) { cout << "YES" << endl; return 0; } rep(i, n-1) { if((ll)a[i] * y > (ll)a[i+1] * x) { cout <<"NO" << endl; return 0; } } cout << "NO" << endl; //cout << ((ll)a[n-2] * y> (ll)(a[n-1]) * x? "NO" : "YES") << endl; }