#include <bits/stdc++.h>
using namespace std;
const int N = 2000;
string s, p;
int ns, np, leastTill[N + 1], dp[N + 1][N + 1];
int main(int argc, char const *argv[]) {
  cin >> s >> p;
  ns = s.size();
  np = p.size();
  for (int i = 0; i < ns; i++) {
    int ptr = 0, till = -1;
    for (int j = i; j < ns; j++) {
      if (p[ptr] == s[j]) {
        ptr++;
        if (ptr == np) {
          till = j;
          break;
        }
      }
    }
    leastTill[i] = till;
  }
  dp[0][0] = (np == 1 && p[0] == s[0] ? 1 : 0);
  dp[0][1] = 0;
  if (leastTill[0] != -1) {
    int del = (leastTill[0] + 1) - np;
    dp[leastTill[0]][del] = max(dp[leastTill[0]][del], 1);
  }
  for (int i = 0; i < ns - 1; i++) {
    for (int j = 0; j <= i + 1; j++) {
      dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j]);
      if (leastTill[i + 1] != -1) {
        int del = (leastTill[i + 1] - (i + 1) + 1) - np;
        dp[leastTill[i + 1]][j + del] =
            max(dp[leastTill[i + 1]][j + del], 1 + dp[i][j]);
      }
      dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
    }
  }
  for (int j = 0; j <= ns; j++) {
    printf("%d ", dp[ns - 1][j]);
  }
  return 0;
}
