#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int AL = 26;


const int mod = 1'000'003;

void updAdd(int& a, int b)
{
	a += b;
	if (a >= mod)
		a -= mod;
}

struct Node
{
	int p;
	int c;
	int g[AL];
	int nxt[AL];
	int link;
	
	Node(int _c, int _p)
	{
		c = _c;
		p = _p;
		fill(g, g + AL, -1);
		fill(nxt, nxt + AL, -1);
		link = -1;
	}
};

struct AC
{
	vector<Node> a;
	void init(int n)
	{
		a.reserve(n);
		a.PB(Node(-1, -1));
	}
	
	int addStr(const string& s)
	{
		int v = 0;
		FOR (i, 0, SZ(s))
		{
			int c = s[i] - 'a';
			if (a[v].nxt[c] == -1)
			{
				a[v].nxt[c] = SZ(a);
				a.PB(Node(c, v));
			}
			v = a[v].nxt[c];
		}
		return v;
	}
	int go(int v, int c)
	{
		if (c < 0 || c >= AL)
			return 0;
			
		if (a[v].g[c] != -1)
			return a[v].g[c];
		if (a[v].nxt[c] != -1)
			a[v].g[c] = a[v].nxt[c];
		else if (v != 0)
			a[v].g[c] = go(getLink(v), c);
		else
			a[v].g[c] = 0;
			
		return a[v].g[c];
	}
	int getLink(int v)
	{
		if (a[v].link != -1)
			return a[v].link;
		if (v == 0 || a[v].p == 0)
			return 0;
		return a[v].link = go(getLink(a[v].p), a[v].c);
	}
	
} a;


const int N = 1047;
const int len = 25;

int dp[len][2][2][2][N];

bool islower(char c)
{
	return 'a' <= c && c <= 'z';
}
bool isupper(char c)
{
	return 'A' <= c && c <= 'Z';
}
bool isdig(char c)
{
	return '0' <= c && c <= '9';
}

bool was[N];
bool bad[N];
set<int> bd;

bool dfs(int v)
{
	if (was[v])
		return bad[v];
	was[v] = 1;
	bad[v] = bd.count(v);
	int to = a.getLink(v);
	bad[v] |= dfs(to);
	return bad[v];
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int A, B;
	cin >> A >> B;
	int n;
	cin >> n;
	a.init(N);
	FOR (i, 0, n)
	{
		string s;
		cin >> s;
		int v = a.addStr(s);
		bd.insert(v);
	}
	string alph = "";
	map<char, char> m;
	FOR (i, 0, 26)
	{
		alph += char('a' + i);
		alph += char('A' + i);
		m['a' + i] = 'a' + i;
		m['A' + i] = 'a' + i;
	}
	FOR (i, 0, 10)
	{
		alph += char('0' + i);
		m['0' + i] = '0' + i;
	}
	m['0'] = 'o';
	m['1'] = 'i';
	m['3'] = 'e';
	m['5'] = 's';
	m['7'] = 't';
	
	int sz = SZ(a.a);
	FOR (i, 0, sz)
	{
		if (!was[i])
			dfs(i);
	}
	
	dp[0][0][0][0][0] = 1;
	FOR (i, 0, len - 1)
	{
		FOR (isl, 0, 2)
		{
			FOR (isu, 0, 2)
			{
				FOR (isd, 0, 2)
				{
					FOR (v, 0, sz)
					{
						if (dp[i][isl][isu][isd][v] == 0 || bad[v])
							continue;
						for (auto c : alph)
						{
							int to = a.go(v, m[c] - 'a');
							updAdd(dp[i + 1][isl | islower(c)][isu | isupper(c)][isd | isdig(c)][to], dp[i][isl][isu][isd][v]);
						}
					}
				}
			}
		}
	}
	int ans = 0;
	FOR (i, A, B + 1)
	{
		FOR (v, 0, sz)
		{
			if (bad[v])
				continue;
			updAdd(ans, dp[i][1][1][1][v]);
		}
	}
	cout << ans << '\n';
	
	return 0;
	
}