D. Gargari and Permutationstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard 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_problemInputThe 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.OutputPrint the length of the longest common subsequence.ExamplesInput4 31 4 2 34 1 2 31 2 4 3Output3NoteThe answer for the first test sample is subsequence [1, 2, 3].
Input4 31 4 2 34 1 2 31 2 4 3
Output3
['dfs and similar', 'dp', 'graphs', 'implementation', '*1900']