#include using namespace std; typedef pair PII; typedef long long LL; typedef unsigned long long ULL; template inline bool amax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template inline bool amin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; } template ostream& operator << (ostream &os, const vector &v) { os << "["; for (typename vector::const_iterator it = v.begin(); it != v.end(); it++) { os << (it != v.begin() ? ", " : "") << *it; } os << "]"; return os; } template ostream& operator << (ostream &os, const set &s) { os << "["; for (typename set::const_iterator it = s.begin(); it != s.end(); it++) { os << (it != s.begin() ? ", " : "") << *it; } os << "]"; return os; } template ostream& operator << (ostream &os, const map &m) { os << "{"; for (typename map::const_iterator it = m.begin(); it != m.end(); it++) { os << (it != m.begin() ? ", " : "") << it->first << ":" << it->second; } os << "}"; return os; } template ostream& operator << (ostream &os, const pair &p) { os << "(" << p.first << ", " << p.second << ")"; return os; } template istream& operator >> (istream &is, vector &v) { for (size_t i = 0; i < v.size(); i++) is >> v[i]; return is; } template inline Target lexical_cast (const Source &s) { Target t; stringstream ss; ss << s; ss >> t; return t; } //> v < ^ (clock wise) int dx[] = {1,0,-1,0}; int dy[] = {0,1,0,-1}; const int INFI = 1<<28; const long long int INFL = 1LL<<60; const double INFD = 1e+300; const float INFF = 1e+100; const double EPS = 1e-8; const long long int MOD = 1000000007; int solve (); int main () { cout.setf(ios::fixed); cout.precision(10); ios_base::sync_with_stdio(false); solve(); return 0; } int solve () { int n1, n2; string s, t; cin >> n1 >> n2 >> s >> t; int dp[1011][1011] = {0}; for (int i = 0; i < s.size(); i++) { for (int j = 0; j < t.size(); j++) { if (s[i] == t[j]) dp[i+1][j+1] = max(dp[i+1][j+1], dp[i][j]+1); else { dp[i+1][j] = max(dp[i+1][j], dp[i][j]); dp[i][j+1] = max(dp[i][j+1], dp[i][j]); } } } int ans = t.size(); for (int i = 0; i < s.size(); i++) { for (int j = 0; j < t.size(); j++) { if (s[i] == t[j]) { int a = dp[i+1][j+1]; ans = min(ans, int(max(i-a, j-a)+max(s.size()-i, t.size()-j))); } } } cout << ans << endl; return 0; }