#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2050;
int ecnt[MAXN], go[MAXN], dp[MAXN][MAXN];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  string s, p;
  cin >> s >> p;
  int n = (int)s.size(), k = (int)p.size();
  memset(go, -1, sizeof go);
  for (int i = 0; i < n; i++) {
    int cnt = 0, si = i, pi = 0;
    while (si < n && pi < k) {
      if (s[si] == p[pi])
        si++, pi++;
      else
        si++, cnt++;
    }
    if (pi == k) {
      ecnt[i] = cnt;
      go[i] = si;
    }
  }
  for (int i = 0; i < MAXN; i++)
    for (int j = 0; j < MAXN; j++) dp[i][j] = -987654321;
  dp[n][0] = 0;
  for (int m = n - 1; m >= 0; m--) {
    dp[m][0] = dp[m + 1][0];
    for (int x = 1; x <= n - m; x++)
      dp[m][x] = max(dp[m + 1][x], dp[m + 1][x - 1]);
    if (go[m] != -1) {
      for (int x = ecnt[m]; x <= n - m; x++)
        dp[m][x] = max(dp[m][x], dp[go[m]][x - ecnt[m]] + 1);
    }
  }
  for (int x = 0; x <= n; x++) {
    int mx = 0;
    for (int i = 0; i < n; i++) mx = max(mx, dp[i][x]);
    cout << mx << " ";
  }
}
