#include <bits/stdc++.h>
using namespace std;
int f[2005][2005], a[2005];
string s, p;
int main() {
  cin >> s;
  cin >> p;
  int l = p.length();
  memset(f, 0, sizeof(f));
  for (int i = 0; i < s.length(); i++) {
    int now = 0, x;
    for (int j = i; j < s.length(); j++) {
      if (s[j] == p[now]) now++;
      if (now == l) {
        x = j;
        break;
      }
    }
    if (now == l)
      f[x][x - l + 1] = 1, a[i] = x;
    else
      a[i] = -1;
  }
  for (int i = 0; i < s.length(); i++)
    for (int j = 0; j <= i + 1; j++) {
      f[i + 1][j] = max(f[i + 1][j], f[i][j]);
      f[i + 1][j + 1] = max(f[i + 1][j + 1], f[i][j]);
      if (i != s.length() - 1 && a[i + 1] != -1)
        f[a[i + 1]][j + a[i + 1] - i - l] =
            max(f[a[i + 1]][j + a[i + 1] - i - l], f[i][j] + 1);
    }
  for (int i = 0; i <= s.length(); i++) printf("%d ", f[s.length() - 1][i]);
  printf("\n");
  return 0;
}
