#蓝桥杯---清理水域

import java.util.Scanner; 

// 1:无需package

// 2: 类名必须Main, 不可修改

public class Main {

public static void main(String[] args) {

Scanner scan = new Scanner(System.in);

//在此输入您的代码...

int n = scan.nextInt();

int m = scan.nextInt();

int k = scan.nextInt();

boolean loop[][] = new boolean[n+10][m+10]; //里面的值默认是false;

int count1 = 0;

for(int i=1;i<=k;i++ ){

int x1 = scan.nextInt();

int y1 = scan.nextInt();

int x2 = scan.nextInt();

int y2 = scan.nextInt();

DFS(x1,y1,x2,y2,loop); } //前缀和或者用DFS遍历没有访问过的

for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){

if(!loop[i][j]){

//没有清理的区域 count1++;

} } }

System.out.println(count1);

scan.close();

}

public static void DFS(int x1,int y1,int x2,int y2,boolean loop[][] ){

for(int i=x1;i<=x2;i++){

for(int j=y1;j<=y2;j++){

loop[i][j] = true; //是否需要处理重复清理的现象 }

} } }