#include <bits/stdc++.h>
using namespace std;
const int N = 2007;
const int inf = 1e9 + 7;
string s, t;
int n, m;
int dp[N][N];
int find(int i) {
  int j = m;
  while (j > 0 && i > 0) {
    if (s[i - 1] == t[j - 1]) j--;
    i--;
  }
  if (j > 0) return -1;
  return i;
}
int main() {
  getline(cin, s);
  getline(cin, t);
  n = s.size();
  m = t.size();
  for (int i = 1; i <= n; i++) {
    int t = find(i);
    if (t >= 0 && i - t == m)
      dp[i][0] = max(dp[i - 1][0], dp[t][0] + 1);
    else
      dp[i][0] = dp[i - 1][0];
    for (int j = 1; j < i; j++) {
      dp[i][j] = max(dp[i - 1][j - 1], dp[i - 1][j]);
      int tmp = i - t - m;
      if (t >= 0 && t >= j - tmp && j >= tmp)
        dp[i][j] = max(dp[i][j], dp[t][j - tmp] + 1);
    }
    dp[i][i] = 0;
  }
  for (int i = 0; i <= n; i++) cout << dp[n][i] << " ";
}
