#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2222;
char s[MAXN], p[MAXN];
int last[MAXN];
int f[MAXN][MAXN];
void Init() {
  assert(scanf(" %s", s + 1) == 1);
  assert(scanf(" %s", p + 1) == 1);
}
void Work() {
  int n, m;
  n = strlen(s + 1);
  m = strlen(p + 1);
  for (int i = 1; i <= n; ++i) {
    last[i] = -1;
    for (int j = i, t = m; j >= 0; --j) {
      if (!t) {
        last[i] = j;
        break;
      }
      if (s[j] == p[t]) --t;
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j <= i; ++j) {
      f[i][j] = f[i - 1][j];
      if (last[i] != -1) {
        int k = j - (i - last[i] - m);
        if (0 <= k && k <= last[i])
          if (f[i][j] < f[last[i]][k] + 1) f[i][j] = f[last[i]][k] + 1;
      }
    }
  }
  for (int i = 0; i <= n; ++i) {
    printf("%d ", f[n][i]);
  }
  printf("\n");
}
int main() {
  Init();
  Work();
  return 0;
}
