Выбрать соревнование | Задачи | Послать решение | Результаты проверки | Статистика по задачам | Вопросы и ответы | Результаты соревнования | Состояние сервера | Изменить данные | Управление командой | Помощь |

Олимпиадные задачи на английском языке

04/02/2008 | Тренировка (задачи CTU Open Contest 2007) (c) |

04/02/2008 | Зима 2008 дорешивание (1c) |

*Ограничения: время – 4s/8s, память – 64MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод*

Послать решение Blockly Посылки Темы Где Обсудить (0)

Marketing people are very creative and must regularly attend many creative meetings. In the
past, the meetings used to repeat every week. Now, there are so many of them, that the period
must have been changed to one month.

The monthly schedule of ACM now contains one meeting for each of the first N days in every
month (including weekends). Meetings are identified by non-negative integer numbers. Recently,
ACM found out that the schedule must be reorganized and the order of meetings changed. The
new order has already been chosen. The only problem is that the meeting-planning department
has very limited privileges and must follow many directives that are in effect.

It fact, the only change that the department is allowed to do, is to issue a request to reverse the
order of meetings in the first `D` days of the month (`D` may be selected arbitrarily). For example,
if the current schedule is "`1 2 3 4 5`" and the department issues a request to reverse the first 3
days, the new schedule will be "`3 2 1 4 5`".

Another limitation is that the department is allowed to issue only one request per week. Since
they need the whole reorganization to finish in one year, the number of requests may not exceed
52. As you can see, their situation is not easy. Will you help?

The input contains a sequence of several reorganizations, the last one followed by a line with
zero.

Each reorganization consists of three lines: the first line contains a positive integer `N` – the
number of days in month that are considered, `1\ ≤\ N\ ≤\ 30`. The second line describes the
old schedule and the third line the new schedule, each of them contains `N` meeting identifiers,
separated with spaces. Some meetings may appear more than once.

For each reorganization, output a single line containing at most 52 positive integer numbers `D_1,\ D_2,\ …,\ D_k` separated by a space (`1\ ≤\ D_i\ ≤\ N`). The numbers must form a valid sequence of
requests that will be issued to transform the old schedule to the new one.

You are guaranteed that such a sequence will exist. If there are more valid sequences, feel free
to output any of them.

Sample Input

5 1 4 8 9 10 4 8 9 10 1 0

Sample Output

5 4