// luogu-judger-enable-o2
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<set>
#include<queue>
#define rep(i,a,n) for(int i = a;i <= n;i++)
#define per(i,n,a) for(int i = n;i >= a;i--)
#define enter putchar('\n')using namespace std;
typedef long long ll;
const int M = 10005;
const int INF = 1000000009;int read()
{int ans = 0,op = 1;char ch = getchar();while(ch < '0' || ch > '9'){if(ch == '-') op = -1;ch = getchar();}while(ch >= '0' && ch <= '9'){ans *= 10;ans += ch - '0';ch = getchar();}return ans * op;
}struct line
{int l,r,dir;
}a[205];struct node
{int val,pos;
}q[205];int n,m,sx,sy,k,dp[205][205],g[205][205],head,tail,ans;
int dx[5] = {0,-1,1,0,0},dy[5] = {0,0,0,-1,1};
char s[205];void solve(int x,int y,int len,int dir,int t)
{head = 1,tail = 0;int cnt = 0;while(++cnt){if(x < 1 || x > n || y < 1 || y > m) break;if(g[x][y]) head = 1,tail = 0;else{while(head <= tail && q[tail].val + cnt - q[tail].pos <= dp[x][y]) tail--;q[++tail].val = dp[x][y],q[tail].pos = cnt;while(head <= tail && q[head].pos < cnt - len) head++;dp[x][y] = max(dp[x][y],q[head].val + cnt - q[head].pos);}x += dx[dir],y += dy[dir];}
}int main()
{n = read(),m = read(),sx = read(),sy = read(),k = read();rep(i,1,n){scanf("%s",s+1);rep(j,1,m) if(s[j] == 'x') g[i][j] = 1;}rep(i,1,k) a[i].l = read(),a[i].r = read(),a[i].dir = read();memset(dp,-0x3f,sizeof(dp));dp[sx][sy] = 0;rep(p,1,k){int len = a[p].r - a[p].l + 1;if(a[p].dir == 1) rep(i,1,m) solve(n,i,len,a[p].dir,p);if(a[p].dir == 2) rep(i,1,m) solve(1,i,len,a[p].dir,p);if(a[p].dir == 3) rep(i,1,n) solve(i,m,len,a[p].dir,p);if(a[p].dir == 4) rep(i,1,n) solve(i,1,len,a[p].dir,p);}rep(i,1,n)rep(j,1,m) ans = max(ans,dp[i][j]);printf("%d\n",ans);return 0;
}