#include <bits/stdc++.h>
using namespace std;
bool debug = 1;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
long long ln, lk, lm;
string s, p;
int a[2105];
int dfs(int i) {
  while (i < n && s[i] != p[0]) i++;
  if (i == n) return -1;
  int st = i;
  i++;
  int j = 1;
  while (j < m) {
    while (i < n && s[i] != p[j]) i++;
    if (i == n) return -1;
    j++;
    i++;
  }
  return i - 1;
}
int dp[2105][2105];
int main() {
  cin >> s >> p;
  n = s.size();
  m = p.size();
  for (int i = 0; i < n; i++) a[i] = dfs(i);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= i; j++) {
      dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
      dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j]);
      if (a[i] != -1) {
        dp[a[i] + 1][j + (a[i] - i + 1 - m)] =
            max(dp[i][j] + 1, dp[a[i] + 1][j + (a[i] - i + 1 - m)]);
      }
    }
  }
  for (int i = 0; i <= n; i++) printf("%d ", dp[n][i]);
  return 0;
}
