#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
char s[2001], p[501];
int main() {
  scanf("%s", s);
  scanf("%s", p);
  int S = strlen(s), P = strlen(p);
  vector<vector<int> > dp(S + 1, vector<int>(S + 1, -INF));
  dp[S][0] = 0;
  for (int i = (S)-1; i >= 0; i--) {
    for (int j = (0); j <= (S); j++) {
      dp[i][j] = dp[i + 1][j];
    }
    for (int j = 0; j < (S); j++)
      dp[i][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
    int pp = 0, ss = i;
    while (pp < P) {
      while (ss < S && s[ss] != p[pp]) {
        ss++;
      }
      if (ss == S) {
        break;
      }
      ss++;
      pp++;
    }
    if (pp == P) {
      for (int j = (ss - i - P); j <= (S); j++)
        dp[i][j] = max(dp[i][j], 1 + dp[ss][j - (ss - i - P)]);
    }
  }
  for (int i = (0); i <= (S); i++) {
    if (i < S)
      printf("%d ", dp[0][i]);
    else
      printf("%d\n", dp[0][i]);
  }
  return 0;
}
