for(int i=1;i<=n;i++)
{
	for(int j=1;j<=m;j++)
	{
		int a1=0,b1=0,b2=0;
		int c1=0;
		a1=a[i][j];
		for(int k=i+2;k<=n;k++)
		{
			if(mp[i][j]==1||mp[i+1][j]==1||mp[k][j]==1)break;
			b1+=a[k][j];
			if(mp[k+1][j]==1||k+1>n)break;
			b2+=a[k][j];
		}
		int tt=i+3;
		while(mp[tt][j]!=1&&tt<=n)
		{
			tt++;
			c1++;
		}				
		ans1+=a1*b1;
		ans2+=a1*b2*c1;
		ans1%=mod;
		ans2%=mod;
		b1=0,b2=0,c1=0;
	}
}