#include<bits/stdc++.h>
using namespace std;
int ans;
int n , m,t;
int chart[101][101];
int start_x,start_y,exit_x,exit_y;
void way_searching(int start_x,int start_y){
	if(chart[start_x[start_y]==1){
		return;
	}
	if(start_x==0||start_y==0){
		return;
	}
	if(start_x==exit_x&&start_y==exit_y){
		ans++;
		return;
	}
	chart[start_x][start_y]=1;
	way_searching(start_x+1,start_y);
	way_searching(start_x-1,start_y);
	way_searching(start_x,start_y+1);
	way_searching(start_x,start_y-1);
	chart[start_x][start_y]=0;
	return;
}

int main(){
	cin >> n >> m >> t;
	cin >> start_x >> start_y >> exit_x >> exit_y;
	for(int i = 1;i<=t;i++){
		int x,y;
		cin >> x >> y;
		chart[x][y]=1;
	}
	way_searching(start_x,start_y);
	cout << ans;
	return 0;
}