#include <bits/stdc++.h>
using namespace std;
char s[2005], p[505];
int n, m;
vector<vector<int> > dp[2005];
int go(int idx, int made, int p_idx) {
  if (made == 0) return 0;
  int &ret = dp[idx][made][p_idx];
  if (ret != -1) return ret;
  ret = 10000;
  if (idx == n) return ret = 10000;
  if (p_idx == 0) ret = min(ret, go(idx + 1, made, p_idx));
  if (s[idx] == p[p_idx]) {
    if (p_idx == m - 1)
      ret = min(ret, go(idx + 1, made - 1, 0));
    else
      ret = min(ret, go(idx + 1, made, p_idx + 1));
  }
  ret = min(ret, 1 + go(idx + 1, made, p_idx));
  return ret;
}
int main() {
  scanf("%s%s", s, p);
  n = strlen(s), m = strlen(p);
  for (int i = 0; i <= n + 1; ++i) {
    dp[i] = vector<vector<int> >(n / m + 5, vector<int>(m + 5, -1));
  }
  for (int x = 0; x <= n; ++x) {
    int ans = 0;
    for (int made = 0; made <= n / m; ++made) {
      int r = go(0, made, 0);
      if (r > x) continue;
      int rest = n - r - made * m;
      int erase = max(0, x - r - rest);
      ans = max(ans, made - (erase + m - 1) / m);
    }
    printf("%d ", ans);
  }
}
