#include<bits/stdc++.h>
using namespace std;
typedef int lli;
typedef long double ld;
#define plli pair<lli,lli>
#define pb push_back
const lli mod=1e9+7;
const lli mod1=998244353;
#define fir first
#define sec second
#define pplli pair<lli,plli>
#define ppplli pair<lli,pair<plli,plli>>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);

const lli N=3010;
bool vis[N][N];
bool r[N][2],c[N][2];
lli dx[4]={-1,1,0,0};
lli dy[4]={0,0,-1,1};

bool check(lli x1,lli y1,lli f)
{
    return (r[x1][f] or c[y1][f]);
}

int main()
{
    fastio
    lli T,i,j;
    T=1;
    // cin>>T;
    while(T--)
    {
        lli n,m,k;
        cin>>n>>m>>k;
        memset(vis,false,sizeof(vis));
        memset(r,false,sizeof(r));
        memset(c,false,sizeof(c));
        for(i=0;i<k;i++)
        {
            lli x,y;
            char c1;
            cin>>x>>y>>c1;
            --x,--y;
            r[x][c1!='R']=1;
            c[y][c1!='C']=1;
        }
        queue<array<lli,3> > q;
        q.push({0,0,0});
        vis[0][0]=0;
        lli ans=mod;
        while(!q.empty())
        {
            auto [x,y,z]=q.front();
            q.pop();
            if(x==n-1 and y==m-1)
                ans=min(ans,z);
            z+=1;
            for(i=0;i<4;i++)
            {
                lli x1=x+dx[i],y1=y+dy[i];
                if(x1>=0 and x1<n and y1>=0 and y1<m and !check(x1,y1,z%2))
                { 
                    assert(x1>=0 and y1>=0 and x1<n and y1<m);
                    if(!vis[x1][y1])
                    {
                        vis[x1][y1]=1;
                        q.push({x1,y1,z});
                    }
                }
            }
        }
        if(ans==mod)
            cout<<-1<<"\n";
        else
            cout<<ans<<"\n";
    }
    return 0;
}