#include <bits/stdc++.h>
using namespace std;
char s[3333], p[1111];
int del[3333];
int dp[3333][3333];
int main() {
  cin >> s >> p;
  int n = strlen(s), m = strlen(p);
  for (int i = 0; i < n; i++) {
    int k = i, j = m - 1;
    while (j >= 0 && k >= 0) {
      if (s[k] == p[j]) j--;
      k--;
    }
    if (j == -1)
      del[i + 1] = k + 1;
    else
      del[i + 1] = -1;
  }
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i <= n; i++)
    if (del[i] != -1) {
      int pre = del[i], add = i - del[i] - m;
      for (int j = 0; j <= n; j++) {
        dp[i][j + add] = max(dp[i][j + add], dp[pre][j] + 1);
        dp[i][j] = max(dp[i][j], dp[i - 1][j]);
      }
    }
  for (int i = 0; i <= n; i++) {
    cout << min((n - i) / m, dp[n][i]) << (i == n ? '\n' : ' ');
  }
}
