import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.PriorityQueue;
import java.util.StringTokenizer;


class Main{

static final PrintWriter out=new PrintWriter(System.out);
static final int INF=Integer.MAX_VALUE/2;
static int[] dx={-1,0,1,0};
static int[] dy={0,-1,0,1};

public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String line="";
while((line=br.readLine())!=null&&!line.isEmpty()){
StringTokenizer st=new StringTokenizer(line);
int n=Integer.parseInt(st.nextToken());
int m=Integer.parseInt(st.nextToken());
int c=Integer.parseInt(st.nextToken());
boolean[][] visited=new boolean[n][m];
if(dfs(c%m==0?c/m-1:c/m,c%m,visited,c,n,m)) out.println("YES");
else out.println("NO");
out.flush();
}
}

private static boolean dfs(int a,int b,boolean[][] visited,int c,int n,int m){
if(visited[a][b]&&m*a+b+1==c&&check(visited,n,m)) return true;
visited[a][b]=true;
for(int i=0;i<4;i++){
int na=a+dx[i];
int nb=b+dy[i];
if(na>=0&&nb>=0&&na<n&&nb<m&&!visited[na][nb]){
if(dfs(na,nb,visited,c,n,m)) return true;
}
}
return false;
}

private static boolean check(boolean[][] visited,int n,int m){
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(!visited[i][j]) return false;
}
}
return true;
}

static class Pair{
int x;
int y;
Pair(int x,int y){
this.x=x; this.y=y;
}
}

static class Edge{
int from;
int to;
int cost;
Edge(int from,int to,int cost){
this.from=from; this.to=to; this.cost=cost;
}
Edge(int to,int cost){
this.to=to; this.cost=cost;
}
}

static class Node{
int d;
int v;
Node(int d,int v){
this.d=d; this.v=v;
}
final static Comparator<Node> DISTANCE_ORDER=new DistanceOrderComparator();
static class DistanceOrderComparator implements Comparator<Node>{
public int compare(Node n1,Node n2){
return (n1.d>n2.d)?1:(n1.d<n2.d)?-1:0;
}
}
}
}