#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int MAXN = 2010;
int l[MAXN], cnt[MAXN];
int dp[MAXN][MAXN];
int main() {
  string s, p;
  cin >> s >> p;
  for (int i = 0; i < s.size(); i++) {
    int ind = p.size() - 1;
    int ind_s = i;
    cnt[i + 1] = 0;
    while (ind >= 0 && ind_s >= 0) {
      if (s[ind_s] == p[ind])
        ind--;
      else
        cnt[i + 1]++;
      ind_s--;
    }
    if (ind < 0)
      l[i + 1] = ind_s + 1;
    else
      l[i + 1] = -1;
  }
  dp[0][0] = 0;
  for (int i = 1; i <= s.size(); i++) dp[0][i] = -1000000;
  for (int i = 1; i <= s.size(); i++) {
    int ii = i;
    for (int j = 0; j <= s.size(); j++) {
      dp[ii][j] = dp[ii - 1][j];
      if (j) dp[ii][j] = max(dp[ii][j], dp[ii - 1][j - 1]);
      int L = l[i];
      int Cnt = cnt[i];
      if (L >= 0 && Cnt <= j) {
        dp[ii][j] = max(dp[ii][j], dp[L][j - Cnt] + 1);
      }
    }
  }
  for (int i = 0; i <= s.size(); i++) cout << dp[s.size()][i] << " ";
  return 0;
}
