string a matches an example b if for every I from 1 to k either bi is a special case character or bi=ai. You are approached to improve the examples so that the primary example the j-th string matches is p[mtj]. You are permitted to leave the request for the examples unaltered. Would you be able to perform such an improvement? Assuming
Correct answer will be upvoted else downvoted. Computer science.
string a matches an example b if for every I from 1 to k either bi is a special case character or bi=
You are approached to improve the examples so that the primary example the j-th string matches is p[mtj]. You are permitted to leave the request for the examples unaltered.
Would you be able to perform such an improvement? Assuming you can, print any legitimate request.
Input
The primary line contains three integers n, m and k (1≤n,m≤105, 1≤k≤4) — the number of examples, the number of strings and the length of each example and string.
Every one of the following n lines contains an example — k characters that are either lowercase Latin letters or highlights. All examples are pairwise unmistakable.
Every one of the following m lines contains a string — k lowercase Latin letters, and an integer mt (1≤mt≤n) — the record of the main example the relating string should coordinate.
Output
Print "NO" in case it is basically impossible to improve the examples so that the main example that the j-th string matches is p[mtj].
In any case, print "YES" in the main line. The subsequent line ought to contain n unmistakable integers from 1 to n — the request for the examples. In case there are different replies, print any of them.
Step by step
Solved in 4 steps with 1 images
