Problem: Palindromic characteristics of string s with length |s| is a sequence of |s| integers, where k-th number is the total number of non-empty substrings of s which are k-palindromes.

A string is 1-palindrome if and only if it reads the same backward as forward.

A string is k-palindrome (k > 1) if and only if: 

  1. Its left half equals to its right half. 
  2. Its left and right halfs are non-empty (k - 1)-palindromes. 



The left half of string t is its prefix of length ⌊|t| / 2⌋, and right half — the suffix of the same length. ⌊|t| / 2⌋ denotes the length of string t divided by 2, rounded down.

Note that each substring is counted as many times as it appears in the string. For example, in the string "aaa" the substring "a" appears 3 times.

Input

The first line contains the string s (1 ≤ |s| ≤ 5000) consisting of lowercase English letters.

Output

Print |s| integers — palindromic characteristics of string s.

Examples

Input

abba


Output

6 1 0 0 


Input

abacaba


Output

12 4 1 0 0 0 0 

Note

In the first example 1-palindromes are substring «a», «b», «b», «a», «bb», «abba», the substring «bb» is 2-palindrome. There are no 3- and 4-palindromes here.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class CF835D {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		char[] cc = br.readLine().toCharArray();
		int n = cc.length;
		int[][] dp = new int[n][n];
		int[] kk = new int[n + 1];
		for (int i = 0; i < n; i++)
			dp[i][i] = 1;
		kk[1] = n;
		for (int l = 2; l <= n; l++)
			for (int i = 0, j; (j = i + l - 1) < n; i++)
				if ((l == 2 || dp[i + 1][j - 1] > 0) && cc[i] == cc[j]) {
					int k = dp[(i + j) / 2 + 1][j] + 1;
					dp[i][j] = k;
					kk[k]++;
				}
		for (int k = n - 1; k >= 1; k--)
			kk[k] += kk[k + 1];
		StringBuilder sb = new StringBuilder();
		for (int k = 1; k <= n; k++)
			sb.append(kk[k] + " ");
		System.out.println(sb);
	}
}