#include <bits/stdc++.h>
using namespace std;
int ans[2010][2010];
int main() {
  std::ios_base::sync_with_stdio(false);
  string str, pat;
  int i, j, k, l;
  cin >> str >> pat;
  l = str.length();
  int req[l + 2];
  for (i = 0; i < l + 2; i++) req[i] = -1;
  for (i = 0; i < l; i++) {
    for (j = 0, k = i; j < pat.length() && k < l; j++) {
      while (k < l && str[k] != pat[j]) k++;
      if (k < l)
        k++;
      else
        break;
    }
    if (j == pat.length()) req[i] = (k - i);
  }
  for (i = 0; i < l; i++) {
    for (j = 0; j <= i; j++) {
      ans[i + 1][j] = max(ans[i][j], ans[i + 1][j]);
      ans[i + 1][j + 1] = max(ans[i][j], ans[i + 1][j + 1]);
      if (req[i] >= 0)
        ans[i + req[i]][j + req[i] - pat.length()] =
            max(ans[i + req[i]][j + req[i] - pat.length()], ans[i][j] + 1);
    }
  }
  for (i = 0; i <= l; i++) {
    cout << ans[l][i] << " ";
  }
  return 0;
}
