#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<queue>
#include<utility>
#include<set>
#include<map>
#include<cctype>
#include<cmath>
#include<algorithm>
using namespace std;

#define RALL(x) (x).rbegin(),(x).rend()
#define ALL(x) (x).begin(),(x).end()
#define repp(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define EACH(itr,c) for(__typeof((c).begin()) itr=(c).begin(); itr!=(c).end(); itr++)
#define clr(a) memset((a), 0 ,sizeof(a))

typedef pair<int,int> P;
typedef vector<pair<int,int> > pii;
typedef map<int,int> mi;



// a1, b6.5, c10.0


int main(){
	int n,m,c;
	cin >> n >> m >> c;
	if(n>m)swap(n,m);
	if(n==1){
		if(m==2)
			cout << "YES";
		else
			cout << "NO";
	}
	else if((n*m)%2==0)
		cout << "YES";
	else
		cout << "NO";
	cout << endl;
	return 0;
}