#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX 404
#define MK 11
#define MP(X,Y) ((X)*M+Y)
struct ST{
    int g[MX][MX],d[MX][1<<MK],N,s[MK],L;
    void CLR(int n){N=n,L=0;F(n)FF(n)g[i][j]=INF;}
    void ade(int a,int b,int c){g[a][b]=g[b][a]=min(c,g[a][b]);}
    void AC(int a){s[L++]=a;}
    void GO(){
        FT(0,N)F(N)FF(N)g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
        F(N)FF(1<<L)d[i][j]=INF;
        F(L)d[s[i]][1<<i]=0;
        F(1<<L)if(i){
            FF(N)for(int k=(i-1)&i;k;k=(k-1)&i)d[j][i]=min(d[j][i],d[j][k]+d[j][i-k]);
            FF(N)FT(0,N)d[j][i]=min(d[j][i],d[k][i]+g[j][k]);
        }
    }
    int VL(int b){return d[s[__builtin_ffs(b)-1]][b];}
}T;
#define ADD(x,y,X,Y) T.ade(MP((x-1),(y-1)),MP((X-1),(Y-1)),1)
int N,M,a,b,KX[]={-1,0,1,-1,1,-1,0,1},KY[]={1,1,1,0,0,-1,-1,-1}
    ,RX[]={1,-1,0,0},RY[]={0,0,1,-1},BX[]={1,1,-1,-1},BY[]={1,-1,1,-1},
    NX[]={-2,-2,-1,-1,1,1,2,2},NY[]={1,-1,2,-2,2,-2,1,-1};
char c;
#define in(X,Y) (X>0&&X<=N&&Y>0&&Y<=M)
void kill(int x,int y,int *sx,int *sy,int n=4){
    F(n)for(int X=x+sx[i],Y=y+sy[i];in(X,Y);X+=sx[i],Y+=sy[i])ADD(x,y,X,Y);
}
void rnd(int x,int y,int *sx,int *sy){
    F(8)if(in(x+sx[i],y+sy[i]))ADD(x,y,x+sx[i],y+sy[i]);
}
void uns(int x,int y,char t){
    if(t==75)return rnd(x,y,KX,KY);
    if(t==81)return kill(x,y,KX,KY,8);
    if(t==82)return kill(x,y,RX,RY);
    if(t==66)return kill(x,y,BX,BY);
    rnd(x,y,NX,NY);
}
int main(void){
    scanf("%d%d",&N,&M),T.CLR(N*M);
    scanf("%d%d %c",&a,&b,&c),T.AC(MP(a-1,b-1));
    IN(_)F(_)scanf("%d%d",&a,&b),T.AC(MP(a-1,b-1));
    F(N)FF(M)uns(i+1,j+1,c);
    T.GO();
    a=T.VL((1<<++_)-1);
    printf("%d\n",a<INF?a:-1);
    return 0;
}