#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define mor > muu & operator<<(
#define ris return *this
#define eni(r) sim> typename enable_if <1 r sizeof(dud<c>(0)),muu&>::type operator<<(c g) {
sim> struct rge {c b,e ;};
sim> rge<c> range(c i, c j) {return rge<c>{i, j};}
sim> auto dud(c *r)-> decltype(cerr << *r);
sim> char dud(...);
struct muu {
	#ifdef LOCAL
	stringstream a;
	~muu() {cerr << a.str() << endl;}
	eni(<) a << boolalpha << g; ris;}
	eni(==) ris << range(begin(g), end(g));}
	sim, class m mor pair<m,c> r) {ris << "(" << r.first << ", " << r.second << ")";}
	sim mor rge<c> u) {
		a << "[";
		for (c i = u.b; i != u.e; ++i)
			*this << ", " + 2 * (i == u.b) << *i;
		ris << "]";
	}
	#else
	sim mor const c&) {ris;}
	#endif
	muu & operator()(){ris;}
};
#define debug (muu() << __FUNCTION__ << "#" << __LINE__ << ": ")
#define imie(r) "[" #r ": " << (r) << "] "
#define imask(r) "[" #r ": " << bitset<8 * sizeof(r)>(r) << "] "
#define arr(a, i) "[" #a imie(i) ": " << a[i] << "] "
#define arr2(a, i, j) "[" #a imie(i) imie(j) ": " << a[i][j] << "] "

using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
const int nax=3007;
const int inf=1e9;

int n, m, k;

int sta;
char fig;

vi graf[nax];

int lis[nax];

int dp[nax][nax];

int t;

int num(int a, int b)
{
	return a*m+b;
}

int kwa(int v)
{
	return v*v;
}

int main()
{
	scanf("%d%d", &n, &m);
	int p1, p2;
	cerr << "a" << endl;
	scanf("%d%d %c", &p1, &p2, &fig);
	p1--;
	p2--;
	cerr << "b" << endl;
	sta=num(p1, p2);
	scanf("%d", &t);
	for (int i=0; i<t; i++)
	{
		scanf("%d%d", &p1, &p2);
		p1--;
		p2--;
		lis[i]=num(p1, p2);
	}
	cerr << "c" << endl;
	k=n*m;
	for (int i=0; i<n; i++)
	{
		for (int j=0; j<m; j++)
		{
			for (int a=0; a<n; a++)
			{
				for (int b=0; b<m; b++)
				{
					if (i==a && j==b)
						continue;
					if ((i==a || j==b) && (fig=='R' || fig=='Q'))
						graf[num(i, j)].push_back(num(a, b));
					if ((i+j==a+b || i-j==a-b) && (fig=='B' || fig=='Q'))
						graf[num(i, j)].push_back(num(a, b));
					if (kwa(i-a)+kwa(j-b)==5 && (fig=='N'))
						graf[num(i, j)].push_back(num(a, b));
					if (kwa(i-a)+kwa(j-b)<=2 && (fig=='K'))
						graf[num(i, j)].push_back(num(a, b));
				}
			}
		}
	}
	cerr << "d" << endl;
	for (int i=0; i<k; i++)
		for (int j=0; j<(1<<t); j++)
			dp[i][j]=inf*(j>0);
	for (int i=0; i<t; i++)
		dp[lis[i]][1<<i]=0;
	for (int i=1; i<(1<<t); i++)
	{
		for (int j=0; j<k; j++)
		{
			int w=i;
			while(w)
			{
				w=(w-1)&i;
				dp[j][i]=min(dp[j][i], dp[j][w]+dp[j][i^w]);
			}
		}
		priority_queue <pii> kol;
		for (int j=0; j<k; j++)
		{
			kol.push({-dp[j][i], j});
			dp[j][i]=-1;
		}
		while(!kol.empty())
		{
			int v=kol.top().second;
			int w=-kol.top().first;
			kol.pop();
			if (dp[v][i]!=-1)
				continue;
			dp[v][i]=w;
			for (int j : graf[v])
				kol.push({-(w+1), j});
		}
		for (int j=0; j<k; j++)
			debug() << j << " " << i << " " << dp[j][i];
	}
	cerr << "e" << endl;
	
	
	
	int wyn=dp[sta][(1<<t)-1];
	if (wyn==inf)
		wyn=-1;
	printf("%d\n", wyn);
	return 0;
}