#include<bits/stdc++.h>

#define rep(i,a,b) for(int i=a;i<=b;i++)

using namespace std;

const int maxn=;

const int inf=1e9+;

int dp[maxn][maxn][],ans;

char c[maxn][maxn];

int X[]={,-,,,},Y[]={,,,-,};

int q[maxn][],head,tail,N,M,now;

int update(int x,int y,int tp,int tk)

{

    int res=dp[q[tp][]][q[tp][]][(tk^)&]+now-q[tp][];

    dp[x][y][tk&]=max(dp[x][y][tk&],res);

    return res;

}

int get(int tp,int tk)

{

    int res=dp[q[tp][]][q[tp][]][(tk^)&]+now-q[tp][];

    return res;

}

void work(int x,int y,int tK,int len,int opt)

{

    head=,tail=; now=;

    while(x>=&&x<=N&&y>=&&y<=M) {

        dp[x][y][tK&]=dp[x][y][(tK^)&];

        if(c[x][y]=='x') head=,tail=;

        while(tail>=head&&now-q[head][]>len) head++;

        while(tail>=head&&get(tail,tK)<dp[x][y][(tK^)&]) tail--;

        if(tail>=head)

            update(x,y,head,tK);

        ans=max(ans,dp[x][y][tK&]);

        tail++; q[tail][]=x; q[tail][]=y; q[tail][]=now++;

        x+=X[opt]; y+=Y[opt];

    }

}

int main()

{

    int K,x,y,L,R,opt;

    scanf("%d%d%d%d%d",&N,&M,&x,&y,&K);

    rep(i,,N) scanf("%s",c[i]+);

    rep(i,,N) rep(j,,M) rep(k,,K) dp[i][j][k]=-inf;

    dp[x][y][]=;

    rep(i,,K){

        scanf("%d%d%d",&L,&R,&opt);

        if(opt==) rep(j,,M) work(N,j,i,R-L+,opt);

        if(opt==) rep(j,,M) work(,j,i,R-L+,opt);

        if(opt==) rep(j,,N) work(j,M,i,R-L+,opt);

        if(opt==) rep(j,,N) work(j,,i,R-L+,opt);

    }

    printf("%d\n",ans);

    return ;

}