#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int n, m;
string s, p;
vector<vector<int> > f, g;
int main() {
  cin >> s >> p;
  n = s.size();
  m = p.size();
  f.resize(n + 1, vector<int>(m + 1, INF));
  f[n][m] = n;
  for (int i = n - 1; i >= 0; --i) {
    f[i][m] = i;
    for (int j = 0; j < m; ++j) {
      if (s[i] == p[j])
        f[i][j] = f[i + 1][j + 1];
      else
        f[i][j] = f[i + 1][j];
    }
  }
  g.resize(n + 1, vector<int>(n + 1, -INF));
  g[n][0] = 0;
  for (int i = n - 1; i >= 0; --i) {
    for (int j = 0; j <= n - i; ++j) {
      g[i][j] = max(0, g[i + 1][j]);
      if (f[i][0] - i - m <= j)
        g[i][j] = max(g[i][j], g[f[i][0]][j - (f[i][0] - i - m)] + 1);
    }
  }
  for (int i = 0; i <= n; ++i) printf("%d%c", g[0][i], " \n"[i == n]);
  return 0;
}
