case there are at least two lines with equivalent worth in this segment, their overall request doesn't change (such arranging calculations are called stable). You can find this conduct of arranging by section in numerous office programming for overseeing accounting pages. Petya works in one, and he has a table An opened at the present time. He needs to perform zero of
Correct answer will be upvoted else downvoted. Computer science.
case there are at least two lines with equivalent worth in this segment, their overall request doesn't change (such arranging calculations are called stable).
You can find this conduct of arranging by section in numerous office
Decide whether it is feasible to do as such, and if indeed, find an arrangement of segments to sort by. Note that you don't have to limit the number of sortings.
Input
The principal line contains two integers n and m (1≤n,m≤1500) — the measures of the tables.
Every one of the following n lines contains m integers
Every one of the following n lines contains m integers bi,j (1≤bi,j≤n), indicating the components of the table B.
Output
In case it is absurd to expect to change An into B, print −1.
In any case, first print an integer k (0≤k≤5000) — the number of sortings in your answer.
Then, at that point, print k integers c1,… ,ck (1≤ci≤m) — the segments, by which Petya needs to play out an arranging.
Step by step
Solved in 3 steps with 1 images
