#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2010;
int dp[MAXN][MAXN], x[MAXN];
int main() {
  string s, p, rs;
  int n;
  cin >> s >> p;
  n = s.size();
  rs = p;
  reverse(rs.begin(), rs.end());
  for (int i = 0; i < n; i++) {
    int pnt = 0;
    if (s[i] != rs[0])
      x[i] = -1;
    else
      for (int j = i; j >= 0; j--) {
        if (s[j] == rs[pnt]) {
          pnt++;
          if (pnt == p.size()) {
            x[i] = j;
            break;
          }
        }
      }
    if (pnt != p.size()) x[i] = -1;
  }
  for (int i = 1; i <= n; i++)
    for (int j = 0; j <= i; j++) {
      dp[i][j] = dp[i - 1][j];
      if (j > 0) dp[i][j] = max(dp[i][j], dp[i - 1][j - 1]);
      if (x[i - 1] != -1 && j - (i - x[i - 1] - p.size()) <= x[i - 1]) {
        dp[i][j] =
            max(dp[i][j], dp[x[i - 1]][j - (i - x[i - 1] - p.size())] + 1);
      }
    }
  for (int j = 0; j <= n; j++) cout << dp[n][j] << " ";
}
