Problem: Better things, cheaper. There is a fierce battle at the time sale held in some supermarkets today. "LL-do" here in Aizu is one such supermarket, and we are holding a slightly unusual time sale to compete with other chain stores. In a general time sale, multiple products are cheaper at the same time, but at LL-do, the time to start the time sale is set differently depending on the target product.

The Sakai family is one of the households that often use LL-do. Under the leadership of his wife, the Sakai family will hold a strategy meeting for the time sale to be held next Sunday, and analyze in what order the shopping will maximize the discount. .. The Sakai family, who are familiar with the inside of the store, drew a floor plan of the sales floor and succeeded in grasping where the desired items are, how much the discount is, and the time until they are sold out. The Sakai family was perfect so far, but no one could analyze it. So you got to know the Sakai family and decided to write a program. The simulation is performed assuming that one person moves.

There are 10 types of products, which are distinguished by the single-digit product number g. The time sale information includes the item number g, the discount amount d, the start time s of the time sale, and the sold-out time e.

The inside of the store is represented by a two-dimensional grid consisting of squares X in width and Y in height, and either a passage or a product shelf is assigned to each square. There is one type of product on a shelf, which is distinguished by item number g. You can buy any item, but you must not buy more than one item with the same item number. From the product shelves, you can pick up products in any direction as long as they are in the aisle squares that are adjacent to each other.

You can pick up items from the time when the time sale starts, but you cannot pick up items from the time when they are sold out. Also, the time starts from 0 when you enter the store.

You can move from the current square to the adjacent aisle squares on the top, bottom, left, and right, but you cannot move to the squares on the product shelves. You can't even go outside the store represented by the grid. One unit time elapses for each move. Also, do not consider the time to pick up the product.

Please create a program that outputs the maximum value of the total discount amount of the products that you could get by inputting the floor plan of the store, the initial position of the shopper and the time sale information of the product.



input

Given multiple datasets. The end of the input is indicated by two lines of zeros. Each dataset is given in the following format:


X Y
m1,1 m2,1 ... mX,1
m1,2 m2,2 ... mX,2
::
m1, Y m2, Y ... mX, Y
n
g1 d1 s1 e1
g2 d2 s2 e2
::
gn dn sn en


The first line gives the store sizes X, Y (3 ≤ X, Y ≤ 20). In the following Y row, the store information mi, j in the i-th column and j-th row is given with the following contents.
. (Period): Aisle square
Number: Product number
P: The initial position of the shopper


The following line is given the number of timesale information n (1 ≤ n ≤ 8). The next n lines are given the i-th time sale information gi di si ei (0 ≤ gi ≤ 9, 1 ≤ di ≤ 10000, 0 ≤ si, ei ≤ 100).

The number of datasets does not exceed 50.

output

For each data set, the maximum value of the total discount amount of the products that can be taken is output on one line.

Example

Input

6 5
1 1 . 0 0 4
1 . . . . .
. . 2 2 . .
. . 2 2 3 3
P . . . . .
5
0 50 5 10
1 20 0 10
2 10 5 15
3 150 3 5
4 100 8 9
0 0


Output

180

Solution (in CPP):

Solution:
#include <iostream>
#include <cstdio>
#include <cassert>

using namespace std;

struct Info {
  int d, s, e;
  Info(int d, int s, int e) : d(d), s(s), e(e) {}
  Info() {}
};

char field[22][22];
int dp[101][1 << 8][22][22];
int good[22][22];
Info info[10];
int X, Y, N, SX, SY, E;
int mp[10];

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

void init() {
  E = 0;
  for (int i = 0; i < 10; i++) {
    mp[i] = -1;
  }
  for (int i = 0; i < 22; i++) {
    for (int j = 0; j < 22; j++) {
      field[i][j] = '*';
    }
  }
  for (int i = 0; i < 22; i++) {
    for (int j = 0; j < 22; j++) {
      good[i][j] = 0;
    }
  }
  
  for (int i = 0; i < 101; i++) {
    for (int j = 0; j < (1 << 8); j++) {
      for (int k = 0; k < 22; k++) {
        for (int l = 0; l < 22; l++) {
          dp[i][j][k][l] = -1;
        }
      }
    }
  }
}

void solve() {
  {
    int t = 0;
    int s = 0;
    for (int g = 0; g < N; g++) {
      if ((good[SY][SX] & (1 << g)) &&
          info[g].s <= 0 &&
          0 < info[g].e ) {
        t += info[g].d;
        s |= (1 << g);
      }
    }
    dp[0][s][SY][SX] = t;
  }
  for (int time = 0; time < E; time++) {
    for (int y = 1; y <= Y; y++) {
      for (int x = 1; x <= X; x++) {
        for (int state = 0; state < (1 << N); state++) {
          int v = dp[time][state][y][x];
          if (v < 0) {
            continue;
          }
          for (int i = 0; i < 5; i++) {
            int nx = x + dx[i];
            int ny = y + dy[i];
            if (field[ny][nx] != '.') {continue;}
            dp[time + 1][state][ny][nx] =
              max(dp[time + 1][state][ny][nx], v);

            if (good[ny][nx] != 0) {
              int t = 0;
              int s = 0;
              for (int g = 0; g < N; g++) {
                if ((good[ny][nx] & (1 << g)) &&
                    !(state & (1 << g)) &&
                    info[g].s <= time + 1 &&
                    time + 1 < info[g].e) {
                  t += info[g].d;
                  s |= (1 << g);
                }
              }
              assert(!(state & s));
              if (t != 0) {
                dp[time + 1][state | s][ny][nx] =
                  max(dp[time + 1][state | s][ny][nx], v + t);
              }
            }
          }
        }
      }
    }
  }
  int mx = 0;
  for (int y = 1; y <= Y; y++) {
    for (int x = 1; x <= X; x++) {
      for (int s = 0; s < (1 << N); s++) {
        mx = max(mx, dp[E][s][y][x]);
      }
    }
  }
  cout << mx << endl;
}

void print() {
  for (int i = 1; i <= Y; i++) {
    for (int j = 1; j <= X; j++) {
      printf("%d ", good[i][j]);
    }
    printf("\n");
  }
  for (int i = 1; i <= Y; i++) {
    for (int j = 1; j <= X; j++) {
      printf("%c ", field[i][j]);
    }
    printf("\n");
  }
}

int main() {
  while (true) {
    cin >> X >> Y;
    if (X == 0 && Y == 0) {
      return 0;
    }
    init();
    int cur = 0;
    for (int i = 1; i <= Y; i++) {
      for (int j = 1; j <= X; j++) {
        cin >> field[i][j];
        if (field[i][j] == 'P') {
          SX = j;
          SY = i;
          field[i][j] = '.';
        }
        else if (field[i][j] != '.') {
          int num = field[i][j] - '0';
          if (mp[num] == -1) {
            mp[num] = cur++;
          }
          field[i][j] = mp[num] + '0';
          for (int k = 0; k < 4; k++) {
            int nx = dx[k] + j;
            int ny = dy[k] + i;
            good[ny][nx] |= (1 << (mp[num]));
          }
        }

      }
    }
    //print();
    cin >> N;
    for (int i = 0; i < N; i++) {
      int g, d, s, e;
      cin >> g >> d >> s >> e;
      info[mp[g]] = Info(d, s, e);
      E = max(e, E);
    }
    assert(N == cur);
    solve();
  }
}