#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2010, MAXM = 510, INF = 1e9;
int dp[MAXN][MAXN];
string s, p;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> s >> p;
  int n = s.size(), m = p.size();
  for (int i = 0; i < n; ++i) {
    int t = m, k = i + 1;
    while (t && k--)
      if (s[k] == p[t - 1]) --t;
    --k;
    for (int j = 0; j <= i; ++j) {
      if (i) dp[i][j] = max(dp[i][j], dp[i - 1][j]);
      if (i && j) dp[i][j] = max(dp[i][j], dp[i - 1][j - 1]);
      if (!t && j >= i - k - m && k - (j - (i - k - m)) + 1 >= 0) {
        if (k >= 0)
          dp[i][j] = max(dp[i][j], dp[k][j - (i - k - m)] + 1);
        else
          dp[i][j] = max(dp[i][j], 1);
      }
    }
    for (int j = i + 2; j <= n; ++j) dp[i][j] = -INF;
  }
  for (int i = 0; i <= n; ++i) cout << dp[n - 1][i] << ' ';
  return 0;
}
