Dasha decided to have a rest after solving the problem D and began to look photos from previous competitions.

Let's call photos as the matrix with the size n × m, which consists of lowercase English letters.

Some k photos especially interested her, because they can be received from photo-template by painting a rectangular area in a certain color. Let's call such photos special.

More formally the i-th special photo is received from the photo-template by replacing all characters on some rectangle with upper left corner of the cell with coordinates (a_i, b_i) and lower right corner in the cell with coordinates (c_i, d_i) to the symbol e_i.

Dasha asks you to find the special photo so that the total distance from it to all other special photos is minimum. And calculate this distance.

Determine the distance between two photos as the sum of distances between all corresponding letters. The distance between two letters is the difference module of their positions in the alphabet. For example, the distance between letters 'h' and 'm' equals |8 - 13| = 5, because the letter 'h' is the 8-th in the alphabet, the letter 'm' is the 13-th.

The first line contains three integers n, m, k (1 ≤ n, m ≤ 10³, 1 ≤ k ≤ 3·10⁵) — the number of strings in the photo-template, the number of columns and the number of special photos which are interesting for Dasha.

The next n lines contains the string with m length which consists of little Latin characters — the description of the photo-template.

Each of the next k lines contains the description of the special photo in the following format, "a_i b_i c_i d_i e_i" (1 ≤ a_i ≤ c_i ≤ n, 1 ≤ b_i ≤ d_i ≤ m), where (a_i, b_i) — is the coordinate of the upper left corner of the rectangle, (c_i, d_i) — is the description of the lower right corner, and e_i — is the little Latin letter which replaces the photo-template in the described rectangle.

In the only line print the minimum total distance from the found special photo to all other special photos.