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 PYTHON3):

Solution:
class HString:
	def __init__(self, string, base=257, modulo=1000000007):
		self.__base, self.__modulo = base, modulo
		self.__prefix_hash, self.__base_pow, self.__size = [], [1], 0

		self += string
	
	def __add__(self, string):
		for ch in string:
			self.__base_pow.append((self.__base_pow[-1] * self.__base) % self.__modulo)
			if self.__size == 0: self.__prefix_hash.append(ord(ch))
			else: self.__prefix_hash.append((self.__prefix_hash[-1] * self.__base + ord(ch)) % self.__modulo)
			self.__size += 1
		return self
	
	def size(self): return self.__size

	def getModulo(self): return self.__modulo

	def getHashValue(self, st, en):
		value = self.__prefix_hash[en]
		if st > 0:
			value -= ((self.__prefix_hash[st-1] * self.__base_pow[en-st+1]) % self.__modulo)
			if value < 0: value += self.__modulo
		return value

s = input()
n, org, rev = len(s), HString(s), HString(s[::-1])
palindrome_level = [[0 for _ in range(n)] for _ in range(n)]
palindrome_level_count = [0 for _ in range(n + 1)]

for i in range(n):
	for j in range(i, n):
		if org.getHashValue(i, j) == rev.getHashValue(n-1-j, n-1-i):
			mid = (i + j) // 2 + (i + j) % 2
			if i > mid-1: palindrome_level[i][j] = 1
			else: palindrome_level[i][j] = palindrome_level[i][mid-1] + 1
			palindrome_level_count[palindrome_level[i][j]] += 1

for i in range(n-1, 0, -1): palindrome_level_count[i] += palindrome_level_count[i+1]

print(' '.join(map(str, palindrome_level_count[1:])))