Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Gargari and Permutations

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputGargari got bored to play with the bishops and now, after solving the problem about them, he is trying to do math homework. In a math book he have found *k* permutations. Each of them consists of numbers 1, 2, ..., *n* in some order. Now he should find the length of the longest common subsequence of these permutations. Can you help Gargari?

You can read about longest common subsequence there: https://en.wikipedia.org/wiki/Longest_common_subsequence_problem

Input

The first line contains two integers *n* and *k* (1 ≤ *n* ≤ 1000; 2 ≤ *k* ≤ 5). Each of the next *k* lines contains integers 1, 2, ..., *n* in some order — description of the current permutation.

Output

Print the length of the longest common subsequence.

Examples

Input

4 3

1 4 2 3

4 1 2 3

1 2 4 3

Output

3

Note

The answer for the first test sample is subsequence [1, 2, 3].

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/22/2021 06:27:49 (h3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|