|시간 제한||메모리 제한||제출||정답||맞힌 사람||정답 비율|
|1 초||512 MB||3||3||3||100.000%|
Martin has n boxes labeled with positive integers from 1 to n. Each box contains a toy. The toys are also labeled with positive integers from 1 to n and in such a way that initially the toy with label i is contained in the box with label i.
From time to time, Martin calls one of his m friends to come over and hang out. Once they meet up, his friend takes the toys out of the boxes and starts having fun with them. In the meantime, Martin is more interested in the boxes. Once they become bored, his friend puts the toys back into the boxes. However, he doesn’t necessarily put every toy in the box it was taken from.
Martin has noticed that each of his m friends scrambles the toys in the same way each time. More precisely, each of his friends has his own array of n positive integers p1, ..., pn which determines the way he will put the toys back into the boxes. Every positive integer from 1 to n appears exactly once in this array. His friend scrambles the toys in such a way that at the end of their meeting the box with label i contains the toy that was in the box with label pi at the start of their meeting. Notice that, because every positive integer from 1 to n appears exactly once in the array, after all the toys are back in the boxes, each box will again have exactly one toy in it.
Martin is now interested in answering questions of the following form: he is wondering whether it is possible that the toy with label a (which is initially in box with label a) can end up in the box with label b via a sequence of meetups with his friends. A sequence of meetups means that Martin can call whichever friends he wants and in any order. He can call a friend multiple times, or not at all. Martin is interested in answering q such questions.
The first line contains positive integers n, m and q - the number of boxes (also toys), the number of Martin’s friends and the number of questions, respectively.
The k-th of the following m lines contains an array of positive integers p1, ..., pn that is used by Martin’s k-th friend for putting the toys back into the boxes. Each positive integer from 1 to n appears exactly once in the array.
Each of the following q lines contains two positive integers a and b (1 ≤ a, b ≤ n) which represent a question.
In q lines print the answer to the given qustions, in order:
DA if it is possible to get the toy in question to the desired box, and
In every subtask, it holds that 1 ≤ n, m ≤ 1000, 1 ≤ q ≤ 500 000.
m = 1
1 ≤ n, m, q ≤ 100. Additionally, for each question for which the answer is DA, there exists a sequence of at most two meetups which achieves the desired result.
1 ≤ n, m, q ≤ 100
No additional constraints.
4 1 3 1 2 4 3 1 1 1 2 3 4
DA NE DA
4 2 4 2 1 3 4 1 2 4 3 2 1 3 4 1 4 2 3
DA DA NE NE
6 2 2 2 1 4 5 3 6 3 2 4 1 5 6 1 5 6 3
Clarification of the first example:
For the first question, the toy with label 1 is already initially in the box with label 1 so the answer is immediately
For the second question, notice that however many times Martin calls his friend over, the boxes with labels 1 and 2 never change their content, so the answer is
For the third question, notice that after each meetup, the contents of boxes 3 and 4 get exchanged, so after only one meetup the toy with label 3 will find itself in box with label 4 and the answer is