#include <bits/stdc++.h>

using namespace std;

using pii = pair<int, int>;
using ll = long long;
const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];


void solve() {
	int x, y;
	scanf("%d%d%d", &n, &x, &y);
	if (x == y || x == 1 || y == 1) puts("Yes");
	else puts("No");
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) solve();
	return 0;
}