#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
 
using namespace std;
 
#if __GNUC__
#include <tr1/unordered_map>
#include <tr1/unordered_set>
using namespace tr1;
#else
#include <unordered_map>
#include <unordered_set>
#endif
 
#ifdef __GNUC__
template <class T> int popcount(T n);
template <> int popcount(unsigned int n) { return __builtin_popcount(n); }
template <> int popcount(int n) { return __builtin_popcount(n); }
template <> int popcount(unsigned long long n) { return __builtin_popcountll(n); }
template <> int popcount(long long n) { return __builtin_popcountll(n); }
#else
#define __typeof__ decltype
template <class T> int popcount(T n) { return n ? 1 + popcount(n & (n - 1)) : 0; }
#endif
 
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define COPY(dest, src) memcpy(dest, src, sizeof(src))
 
template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }
 
typedef long long ll;
typedef pair<int, int> pint;
 
template <class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p) { os << "( " << p.first << ", " << p.second << " )"; return os;  }
 
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
 
 
const int mod = 1000000007;
const double PI = acos(-1.0);
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
bool valid_pos(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
 
template <class T> void print(T a, int n, int br = 1, const string& deli = ", ") { cout << "{ "; for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } cout << " }"; while (br--) cout << endl; }
template <class T> void print(const vector<T>& v, int br = 1, const string& deli = ", ") { print(v, v.size(), br, deli); }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) {	if (width != -1) cout.width(width); cout << a[i][j] << ' ';	} cout << endl; } while (br--) cout << endl; }
 
template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T, class U> void input(T& a, U& b, int n) { for (int i = 0; i < n; ++i) cin >> a[i] >> b[i]; }
 

 

struct P
{
	int x, y, t, S;
	P(int x, int y, int t, int S)
		: x(x), y(y), S(S) { }
};
int main()
{
	ios::sync_with_stdio(false);

	int h, w;
	while (cin >> w >> h, w)
	{
		int sx, sy;
		char c[32][32];
		for (int y = 0; y < h; ++y)
		{
			for (int x = 0; x < w; ++x)
			{
				cin >> c[y][x];
				if (c[y][x] == 'P')
					sx = x, sy = y, c[y][x] = '.';
			}
		}

		int info[16][128];	// item, time
		int g[16], d[16];
		CL(info, 0);
		int m;
		cin >> m;
		int last_e = -1;
		for (int i = 0; i < m; ++i)
		{
			int s, e;
			cin >> g[i] >> d[i] >> s >> e;
			max_swap(last_e, e);
			for (int t = s; t < e; ++t)
				info[g[i]][t] |= 1 << i;
		}

		static bool dp[101][20][20][1 << 8];
		for (int i = 0; i <= last_e; ++i)
			for (int y = 0; y < h; ++y)
				for (int x = 0; x < w; ++x)
					for (int s = 0; s < 1 << m; ++s)
						dp[i][y][x][s] = false;

		const int dx[] = { 0, 1, 0, -1, 0 };
		const int dy[] = { 1, 0, -1, 0, 0 };

		dp[0][sy][sx][0] = true;
		for (int t = 0; t < last_e; ++t)
		{
			for (int y = 0; y < h; ++y)
			{
				for (int x = 0; x < w; ++x)
				{
					int add_S = 0;
					for (int i = 0; i < 4; ++i)
					{
						int tx = x + dx[i], ty = y + dy[i];
						if (valid_pos(tx, ty, w, h) && isdigit(c[ty][tx]))
							add_S |= info[c[ty][tx] - '0'][t];
					}

					for (int i = 0; i < 5; ++i)
					{
						int nx = x + dx[i], ny = y + dy[i];
						if (valid_pos(nx, ny, w, h) && !isdigit(c[ny][nx]))
						{
							for (int S = 0; S < 1 << m; ++S)
								dp[t + 1][ny][nx][S | add_S] |= dp[t][y][x][S];
						}
					}
				}
			}
		}

		int res = 0;
		for (int y = 0; y < h; ++y)
		{
			for (int x = 0; x < w; ++x)
			{
				for (int S = 0; S < 1 << m; ++S)
				{
					if (dp[last_e][y][x][S])
					{
						int dis[16];
						CL(dis, 0);
						for (int i = 0; i < m; ++i)
							if (S >> i & 1)
								max_swap(dis[g[i]], d[i]);

						max_swap(res, accumulate(dis, dis + 16, 0));
					}
				}
			}
		}
		cout << res << endl;
	}
}

Measured memory_bytes: 10000