1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cstdlib>
 5 #include <vector>
 6 #include <climits>
 7 #include <algorithm>
 8 #include <cmath>
 9 #define LL long long
10 using namespace std;
11 int a[200],b[200],dp[200][200];
12 int main(){
13     int n,m,i,j,ans;
14     while(~scanf("%d %d",&n,&m)){
15        for(i = 1; i <= n; i++)
16             scanf("%d",a+i);
17         for(j = 1; j <= m; j++)
18             scanf("%d",b+j);
19         memset(dp,0,sizeof(dp));
20         for(ans = 0,i = 1; i <= n; i++){
21             for(j = 1; j <= m; j++){
22                 if(a[i] == b[j]){
23                     dp[i][j] = dp[i-1][j-1]+1;
24                 }
25                 if(dp[i][j] > ans) ans = dp[i][j];
26             }
27         }
28         printf("%d\n",ans);
29     }
30     return 0;
31 }