#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > v;
vector<int> pot;
int n, m;
int fun(int pos, int oc) {
  if (v[pos][oc] != -1) return v[pos][oc];
  if (pos == n) {
    if (oc == 0)
      return v[pos][oc] = 0;
    else
      return v[pos][oc] = -2000000;
  }
  v[pos][oc] = fun(pos + 1, oc);
  if (oc) v[pos][oc] = max(v[pos][oc], fun(pos + 1, oc - 1));
  if (pot[pos] != -1 && oc >= pot[pos] - m - pos)
    v[pos][oc] = max(v[pos][oc], fun(pot[pos], oc - (pot[pos] - pos - m)) + 1);
  return v[pos][oc];
}
int main() {
  ios_base::sync_with_stdio(false);
  string s, p;
  cin >> s >> p;
  n = s.size();
  m = p.size();
  v = vector<vector<int> >(n + 1, vector<int>(n + 1, -1));
  pot = vector<int>(n + 1, -1);
  for (int i = 0; i < s.size(); i++) {
    if (i + p.size() > s.size())
      pot[i] = -1;
    else {
      int ii = i;
      for (int j = 0; j < p.size(); j++) {
        while (ii < s.size() and s[ii] != p[j]) ++ii;
        if (j + 1 == p.size() and ii < s.size()) pot[i] = ii + 1;
        ++ii;
      }
    }
  }
  for (int i = 0; i < s.size() + 1; i++) {
    if (i) cout << ' ';
    cout << fun(0, i);
  }
  cout << '\n';
}
