#include <bits/stdc++.h>
using namespace std;
const int N = 2010;
const int inf = ~0U >> 1;
char s[N], p[N];
int n, m;
int pre[N];
int dp[N][N];
void init() {
  memset(pre, -1, sizeof(pre));
  for (int i = 1; i <= n; ++i) {
    int ii = m, j = i;
    while (j >= 1 && ii >= 1) {
      if (s[j] == p[ii]) ii--;
      j--;
    }
    if (ii == 0) pre[i] = j + 1;
  }
}
void DP() {
  memset(dp, -1, sizeof(dp));
  dp[0][0] = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j <= i; ++j) dp[i][j] = 0;
    if (pre[i] == -1) continue;
    int cost = (i - pre[i] + 1) - m;
    for (int j = 0; j <= i; ++j)
      if (dp[pre[i] - 1][j - cost] != -1 && j - cost >= 0)
        dp[i][j] = max(dp[i - 1][j], dp[pre[i] - 1][j - cost] + 1);
      else
        dp[i][j] = max(dp[i][j], dp[i - 1][j]);
  }
  for (int i = 0; i <= n; ++i) printf("%d ", dp[n][i]);
}
int main() {
  scanf("%s %s", s + 1, p + 1);
  n = strlen(s + 1);
  m = strlen(p + 1);
  init();
  DP();
  return 0;
}
