为何RE？

#include<bits/stdc++.h>
#define ll long long
using namespace std;
	int n,m,T,sx,sy,fx,fy,a[10][10];ll ans,path[150][3];
ll read(){
	char ch=getchar();
	ll s=0,w=1;
	while(ch<'0'||ch>'9'){
		if(ch=='-')w=-1;
		ch=getchar();
	}while(ch>='0'&&ch<='9'){
		s=s*10+ch-'0';
		ch=getchar();
	}return s*w;
}
int dfs(int x,int y,int k){
	path[k][1]=x;
	path[k][2]=y;
	a[x][y]=1;
	if(x==fx&&y==fy){
		ans++;
	}if(a[x][y-1]<1&&y>0)dfs(x,y-1,k+1);
	if(a[x-1][y]<1&&x>0)dfs(x-1,y,k+1);
	if(a[x][y+1]<1&&y<=m)dfs(x,y+1,k+1);
	if(a[x+1][y]<1&&x<=n)dfs(x+1,y,k+1);
}
int main(){
	n=read();m=read();T=read();sx=read();sy=read();fx=read();fy=read();
	for(int i=0;i<T;i++){
		int a1=read(),a2=read();
		a[a1][a2]=2;
	}dfs(sx,sy,1);
//	freopen("P1605.in","r",stdin);
//	freopen("P1605.out","w",stdout);
	cout<<ans;
	return 0;}