find this conduct of arranging by segment in numerous office programming for overseeing bookkeeping pages. Petya works in one, and he has a table AA opened at this moment. He needs to perform zero of more sortings by
Correct answer Will be upvoted else downvoted.
You can find this conduct of arranging by segment in numerous office
Decide whether it is feasible to do as such, and if indeed, find a grouping of sections to sort by. Note that you don't have to limit the quantity of sortings.
Input
The principal line contains two integers nn and mm (1≤n,m≤15001≤n,m≤1500) — the measures of the tables.
Each of the following nn lines contains mm integers
Each of the following nn lines contains mm integers bi,jbi,j (1≤bi,j≤n1≤bi,j≤n), indicating the components of the table BB.
Output
In case it is preposterous to expect to change AA into BB, print −1−1.
In any case, first print an integer kk (0≤k≤50000≤k≤5000) — the quantity of sortings in your answer.
Then, at that point, print kk integers c1,… ,ckc1,… ,ck (1≤ci≤m1≤ci≤m) — the sections, by which Petya needs to play out an arranging.
Step by step
Solved in 3 steps with 1 images
