Multiple solutions possible in ADASHOP2

This question asks to find a move list which covers all black squares. However, multiple such solutions are possible for any given (r_0 , c_0 ).
Does the online judge mark all possibilities as the correct output?

comment in the comment section of the problem! If your question needs further clarification then the author/ admin will reply as soon as possible.