#include <bits/stdc++.h>
using namespace std;
char alphz[27] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
                  'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
                  's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
float Euclidean(long long x1, long long x2, long long y1, long long y2) {
  return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
}
long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }
long long LCM(long long a, long long b) { return (a * b) / gcd(a, b); }
void PrimeFactor(long long n) {
  while (n % 2 == 0) {
    n /= 2;
  }
  for (int i = 3; i <= sqrt(n); i += 2) {
    if (n % i == 0) {
      n /= i;
    }
  }
  if (n > 2) {
  };
}
bool is_square(long long x) {
  long long l = 0, r = x;
  while (l <= r) {
    long long mid = l + (r - l) / 2;
    if (mid * mid == x) return true;
    if (mid * mid > x)
      r = mid - 1;
    else
      l = mid + 1;
  }
  return false;
}
long long power(long long x, long long y) {
  long long temp;
  if (y == 0) return 1;
  temp = power(x, y / 2);
  if (y % 2 == 0)
    return temp * temp;
  else
    return x * temp * temp;
}
bool is_Prime(int x) {
  if (x == 2)
    return 1;
  else if (x % 2 == 0 || x < 2)
    return 0;
  for (int i = 3; i * i <= x; i += 2)
    if (x % i == 0) return 0;
  return 1;
}
const int N = 2e5 + 5;
int pre[N], suf[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s, t;
  cin >> s >> t;
  int Tle = (int)t.size(), Sle = (int)s.size();
  int Tidx = 0;
  for (int i = 0; i < Sle && Tidx < Tle; i++) {
    if (s[i] == t[Tidx]) pre[Tidx] = i, Tidx++;
  }
  Tidx = Tle - 1;
  for (int i = Sle - 1; i >= 0 && Tidx >= 0; i--) {
    if (s[i] == t[Tidx]) suf[Tidx] = i, Tidx--;
  }
  int ans = max(suf[0], Sle - 1 - pre[Tle - 1]);
  for (int i = 0; i < Tle - 1; i++) ans = max(ans, suf[i + 1] - pre[i] - 1);
  cout << ans << '\n';
  return 0;
}
