#include <bits/stdc++.h>
using namespace std;
unordered_map<int, int> mp;
const long long mod = (1e9) + 7;
char str1[2005], str2[2005];
int dp[2005][2005];
int len1, len2;
int getd(int x) {
  if (x < len2) return 2005;
  int L1 = x, L2 = len2, ans = 0;
  while (L1 && L2) {
    if (str1[L1] == str2[L2]) {
      L1--;
      L2--;
    } else {
      ans++;
      L1--;
    }
  }
  if (!L2) {
    return ans;
  } else
    return 2005;
}
int main() {
  scanf("%s%s", str1 + 1, str2 + 1);
  len1 = strlen(str1 + 1);
  len2 = strlen(str2 + 1);
  for (int i = 0; i <= len1; i++)
    for (int j = 0; j <= len1; j++)
      if (j > i) dp[i][j] = -3000;
  for (int i = 1; i <= len1; i++) {
    int dln = getd(i);
    for (int j = 0; j <= i; j++) {
      dp[i][j] = max(dp[i][j], dp[i - 1][j]);
    }
    for (int j = 0; j <= i; j++) {
      if (j >= dln) dp[i][j] = max(dp[i][j], dp[i - dln - len2][j - dln] + 1);
    }
  }
  for (int i = 0; i <= len1; i++) {
    printf("%d%c", dp[len1][i], i == len1 ? '\n' : ' ');
  }
  return 0;
}
