#include<iostream>
using namespace std;
const int N = 1010;
char a[N], b[N];
int n, m;
int h[N][N];
int main()
{
cin>>n>>m;
scanf("%s%s", a + 1, b + 1);
for(int i = 1; i <= n; i ++ ){
for(int j = 1; j <= m; j ++ ){
h[i][j] = max(h[i - 1][j], h[i][j - 1]);
if(a[i] == b[j]) h[i][j] = h[i - 1][j - 1] + 1;
}
}
cout<<h[n][m]<<endl;
return 0;
}
09-01
336
02-07
832
01-21
2174
04-17
1058