#include <bits/stdc++.h>
using namespace std;
const long long N = 2100;
long long dp[N][N], nxt[N];
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  string s, p;
  cin >> s >> p;
  long long n = s.size(), m = p.size();
  for (long long i = 0; i < n; i++) {
    long long id = 0, j;
    for (j = i; j < n; j++)
      if (s[j] == p[id]) {
        id++;
        if (id == m) break;
      }
    if (id == m)
      nxt[i] = j;
    else
      nxt[i] = -1;
  }
  for (long long i = 0; i <= n; i++) {
    for (long long j = 0; j <= i; j++) {
      if (i != 0) dp[i][j] = max(dp[i][j], dp[i - 1][j]);
      if (j != 0 && i != 0) dp[i][j] = max(dp[i][j], dp[i - 1][j - 1]);
      if (nxt[i] != -1 && i != n)
        dp[nxt[i] + 1][j + nxt[i] - i + 1 - m] =
            max(dp[nxt[i] + 1][j + nxt[i] - i + 1 - m], dp[i][j] + 1);
    }
  }
  for (long long i = 0; i <= n; i++) cout << dp[n][i] << ' ';
  cout << '\n';
  return 0;
}
