#include <bits/stdc++.h>
using namespace std;
const int N = 2000 + 100;
const int lg = 20;
const long long int mod = 1e9 + 7;
const long long int inf = 2e9 + 100;
int dp[N][N], pr[N];
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  string second, p;
  cin >> second >> p;
  int n = second.size(), m = p.size();
  for (int i = 0; i < n; i++) {
    pr[i + 1] = -1;
    int x = m - 1;
    for (int j = i; j >= 0; j--) {
      x -= (p[x] == second[j]);
      if (x == -1) {
        pr[i + 1] = j;
        break;
      }
    }
  }
  for (int j = 1; j <= n; j++) dp[0][j] = -inf;
  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]);
      int x = i - pr[i] - m;
      if (pr[i] != -1 && j >= x) dp[i][j] = max(dp[i][j], 1 + dp[pr[i]][j - x]);
    }
    for (int j = i + 1; j <= n; j++) dp[i][j] = -inf;
  }
  for (int i = 0; i <= n; i++) cout << dp[n][i] << ' ';
  cout << endl;
  return 0;
}
