Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Dima and Bacteria

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputDima took up the biology of bacteria, as a result of his experiments, he invented *k* types of bacteria. Overall, there are *n* bacteria at his laboratory right now, and the number of bacteria of type *i* equals *c*_{i}. For convenience, we will assume that all the bacteria are numbered from 1 to *n*. The bacteria of type *c*_{i} are numbered from to .

With the help of special equipment Dima can move energy from some bacteria into some other one. Of course, the use of such equipment is not free. Dima knows *m* ways to move energy from some bacteria to another one. The way with number *i* can be described with integers *u*_{i}, *v*_{i} and *x*_{i} mean that this way allows moving energy from bacteria with number *u*_{i} to bacteria with number *v*_{i} or vice versa for *x*_{i} dollars.

Dima's Chef (Inna) calls the type-distribution correct if there is a way (may be non-direct) to move energy from any bacteria of the particular type to any other bacteria of the same type (between any two bacteria of the same type) for zero cost.

As for correct type-distribution the cost of moving the energy depends only on the types of bacteria help Inna to determine is the type-distribution correct? If it is, print the matrix *d* with size *k* × *k*. Cell *d*[*i*][*j*] of this matrix must be equal to the minimal possible cost of energy-moving from bacteria with type *i* to bacteria with type *j*.

Input

The first line contains three integers *n*, *m*, *k* (1 ≤ *n* ≤ 10^{5}; 0 ≤ *m* ≤ 10^{5}; 1 ≤ *k* ≤ 500). The next line contains *k* integers *c*_{1}, *c*_{2}, ..., *c*_{k} (1 ≤ *c*_{i} ≤ *n*). Each of the next *m* lines contains three integers *u*_{i}, *v*_{i}, *x*_{i} (1 ≤ *u*_{i}, *v*_{i} ≤ 10^{5}; 0 ≤ *x*_{i} ≤ 10^{4}). It is guaranteed that .

Output

If Dima's type-distribution is correct, print string «Yes», and then *k* lines: in the *i*-th line print integers *d*[*i*][1], *d*[*i*][2], ..., *d*[*i*][*k*] (*d*[*i*][*i*] = 0). If there is no way to move energy from bacteria *i* to bacteria *j* appropriate *d*[*i*][*j*] must equal to -1. If the type-distribution isn't correct print «No».

Examples

Input

4 4 2

1 3

2 3 0

3 4 0

2 4 1

2 1 2

Output

Yes

0 2

2 0

Input

3 1 2

2 1

1 2 0

Output

Yes

0 -1

-1 0

Input

3 2 2

2 1

1 2 0

2 3 1

Output

Yes

0 1

1 0

Input

3 0 2

1 2

Output

No

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/28/2020 05:23:45 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|