#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l, int r) { return l + rng() % (r - l + 1); }
const int N = 5555;
int n, m;
int f[N][N];
string a, b;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  ;
  cin >> a;
  n = a.size();
  a = " " + a;
  cin >> b;
  m = b.size();
  b = " " + b;
  for (int i = 1, _c = n; i <= _c; ++i) f[0][i] = -n - n;
  for (int i = 0, _c = n - 1; i <= _c; ++i) {
    int j = i + 1, t = m;
    while (j && t) {
      if (a[j] == b[t]) t--;
      j--;
    }
    if (!t) {
      for (int k = 0, _c = i + 1; k <= _c; ++k) {
        if (j >= k - i + j - 1 + m && k - i + j - 1 + m >= 0) {
          f[i + 1][k] = max(f[i + 1][k], f[j][k - i + j - 1 + m] + 1);
        }
      }
    }
    for (int k = 0, _c = i + 1; k <= _c; ++k)
      f[i + 1][k] = max(f[i + 1][k], f[i][k]);
  }
  for (int i = 0, _c = n; i <= _c; ++i) {
    cout << f[n][i] << " ";
  }
}
