#### Registered Users Only

Please login to view and utilize this feature.

## Background

Many problems in Computer Science involve maximizing some measure according to constraints.

Consider a history exam in which students are asked to put several historical events into chronological order. Students who order all the events correctly will receive full credit, but how should partial credit be awarded to students who incorrectly rank one or more of the historical events?

Some possibilities for partial credit include:

- 1 point for each event whose rank matches its correct rank
- 1 point for each event in the longest (not necessarily contiguous) sequence of events which are in the correct order relative to each other.

For example, if four events are correctly ordered 1 2 3 4 then the order 1 3 2 4 would receive a score of 2 using the first method (events 1 and 4 are correctly ranked) and a score of 3 using the second method (event sequences 1 2 4 and 1 3 4 are both in the correct order relative to each other).

In this problem you are asked to write a program to score such questions using the second method.

## The Problem

Given the correct chronological order of *n* events 1, 2, 3 ... *n* as
c_{1}, c_{2}, ... r_{n} where 1 ≤ c_{i} ≤ *n* denotes the ranking of
event *i* in the correct chronological order and a sequence of student
responses r_{1}, r_{2} ... r_{n} where 1 ≤ r_{i} ≤ *n* denotes the
chronological rank given by the student to event *i*; determine the
__ length __ of the longest (not necessarily contiguous) sequence
of events in the student responses that are in the correct chronological
order relative to each other.

## The Input

The first line of the input will consist of one integer *n* indicating
the number of events, this number will not be more than 20. It will also contain *s*, indicating the number of students. The second line will
contain *n* integers, indicating the correct chronological order of *n*
events. The following *s* lines will each consist of *n* integers with each
line representing a student's chronological ordering of the n events.
All lines will contain *n* numbers in the range 1 to *n* , with each number
appearing exactly once per line, and with each number separated from
other numbers on the same line by one or more spaces.

## The Output

For each student ranking of events your program should print the score for that ranking. There should be one line of output for each student ranking.

## Sample Input 1

4 3 4 2 3 1 1 3 2 4 3 2 1 4 2 3 4 1

## Sample Output 1

1 2 3

## Sample Input 2

10 4 3 1 2 4 9 5 10 6 8 7 1 2 3 4 5 6 7 8 9 10 4 7 2 3 10 6 9 1 5 8 3 1 2 4 9 5 10 6 8 7 2 10 1 3 8 4 9 5 7 6

## Sample Output 2

6 4 10 5

### Tags

### Subtasks and Limits

Subtask | Score | #TC | Time | Memory | Scoring |
---|---|---|---|---|---|

1 | 0 | 12 | 1s | 32MB | Average |

2 | 100 | 10 | 1s | 32MB | Average |

### Judge Compile Command

g++ ans.cpp -o history -Wall -static -O2 -lm -m64 -s -w -std=gnu++14 -fmax-errors=512