import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


immutable INF = 10^^9;

int M, N;
string S, T;

void main() {
  try {
    for (; ; ) {
      M = readInt();
      N = readInt();
      S = readToken();
      T = readToken();
      auto dp = new int[][](M + 1, N + 1);
      foreach (i; 0 .. M + 1) foreach (j; 0 .. N + 1) {
        dp[i][j] = INF;
      }
      dp[0][0] = 0;
      foreach (i; 0 .. M + 1) foreach (j; 0 .. N + 1) {
        if (i < M && j < N) {
          chmin(dp[i + 1][j + 1], dp[i][j] + ((S[i] != T[j]) ? 1 : 0));
        }
        if (i < M) {
          chmin(dp[i + 1][j], dp[i][j] + 1);
        }
        if (j < N) {
          chmin(dp[i][j + 1], dp[i][j] + 1);
        }
      }
      writeln(dp[M][N]);
    }
  } catch (EOFException e) {
  }
}