#include <bits/stdc++.h>
#define bug cout << "***************" << endl
#define fuck(x) cout << #x << " -> " << x << endl
#define rep(i, num, e) for (int i = (num); i <= (e); i++)
#define dep(i, num, e) for (int i = (num); i >= (e); i--)
#define endl '\n'
#define int long long
using namespace std;
constexpr int N = 1e6 + 10, inf = 0x3f3f3f3f;
char a[N], b[N];
int dp[3000][3000]; // 的含义,a字符串前i个字母 和 b字符串前j个字母的最长公共子序列
void solve()
{
int n, m;
cin >> n >> m;
cin >> a + 1 >> b + 1;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
// 这种情况一定存在:
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
// 只有相等时候,dp[i][j]才可以更新:因为这个状态表示,这个字符在两个数组都出现过;
if (a[i] == b[j])
{
dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 1); // 没有i和j的状态+1;
}
}
}
cout << dp[n][m];
}
signed main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int T = 1;
while (T--)
{
solve();
}
return 0;
}