#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>

using namespace std;

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define ALL(v) (v).begin(), (v).end()
#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))
#define AFILL(a, b) fill((int*)a, (int*)(a + LENGTHOF(a)), b)
#define SQ(x) ((x)*(x))
#define Mod(x, mod) (((x)+(mod)%(mod))
#define MP make_pair
#define PB push_back
#define Fi first
#define Se second
#define INF (1<<29)
#define EPS 1e-10
#define MOD 1000000007

typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef pair<pi, pi>pipi;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;

int W, H, N, T;
int G[300000][4];

int dir(char c)
{
  if(c=='U') return 0;
  if(c=='D') return 0;
  if(c=='L') return 2;
  return 2;
}

int redir(char c)
{
  if(c=='U') return 1;
  if(c=='D') return 1;
  if(c=='L') return 3;
  return 3;
}

int dire(char c)
{
  if(c=='U') return 3;
  if(c=='D') return 2;
  if(c=='R') return 0;
  return 1;
}


int dy(char c)
{
  if(c=='U') return -1;
  if(c=='D') return 1;
  return 0;
}
int dx(char c)
{
  if(c=='R') return 1;
  if(c=='L') return -1;
  return 0;
}
int check(int x, int y){
  if(x < 0 || x >= W || y < 0 || y >= H) return 0;
  return 1;
}

pi src(pi p, char c)
{
  if(c=='L' || c=='U') return p;
  if(c=='R') return pi(p.first+1, p.second);
  return pi(p.first, p.second+1);
}

pi dest(pi p, char c)
{
  if(c=='R' || c=='D') return pi(p.first+1, p.second+1);
  if(c=='L') return pi(p.first, p.second+1);
  return pi(p.first+1, p.second);
}

int dijkstra(int s, int g){
  int d[300000];
  //  cout << s % (H+1) << " " << s / (H+1) << endl;
  rep(i, 300000) d[i] = INF;
  priority_queue<pi, vector<pi>, greater<pi> >q;
  q.push(pi(0, s));
  while(!q.empty()){
    pi p = q.top(); q.pop();
    int dist = p.first;
    //    cout << p.second % (W+1) << " " << p.second / ( W+1) << " " << dist<< endl;
    if(g == p.second) return dist;
    if(d[p.second] <= dist) continue;
    d[p.second] = dist;
    int x = p.second % (W+1), y = p.second / (W+1);
    //    cout << x << " " << y << endl;
    for(auto s: string("UDRL")){
      int nx=x+dx(s), ny=y+dy(s);
      if(nx < 0 || nx > W || ny < 0 || ny > H) continue;
      //      cout << x << " " << y << " " << dir(s) << " " << G[y*(W+1)+x][dir(s)] <<endl;
      q.push(pi(dist+G[y*(W+1)+x][dire(s)], ny*(W+1)+nx));
    }
  }
  return -1;
}


int main()
{
  cin >> W >> H >> N;
  memset(G, 0, sizeof(G));

  int sx, sy, gx, gy;
  cin >> sx >> sy >> gx >> gy;
  rep(i, N){
    int x, y, t;
    string S;
    cin >> x >> y >> t >> S;
    while(t--){
      for(auto s: S){

	//	cout << x << " " << y << endl;
	int nx = x+dx(s), ny=y+dy(s);
	if(!check(nx, ny)) continue;
	pi p1 = src(pi(x, y), s), p2=  dest(pi(x, y), s);
	//	cout << p1.first << " " << p1.second << " " << p2.first << " " << p2.second << endl;
	//	cout << p1.second*(W+1)+p1.first << endl;
	G[p1.second*(W+1)+p1.first][dir(s)]++;
	G[p2.second*(W+1)+p2.first][redir(s)]++;
	x = nx, y = ny;
      }
    }
    //    cout << x <<  " " << y << endl;
  }

  //  cout << endl;
  /*  rep(i, (W+1)*(H+1)){
    cout << i % (W+1) << " " << i/(W+1) << endl;
    rep(j, 4){
      cout << G[i][j] << " " ;
    }cout << endl;
    }*/
  //  cout << "ok\n";
  cout << dijkstra(sy*(W+1)+sx, gy*(W+1)+gx) << endl;
  return 0;
}

Measured memory_bytes: 17084