output_description: Print 26 integers in a line with spaces in between. The i-th integer should be
  the number of the occurrences of the i-th letter in the lowercase English
  alphabet from the l-th character through the r-th character of f^{10^{100}}
  (S).
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
      l r
attempt: def getSS(S):
      helfLength = int(len(S) / 2) + 1
  
      while S[: int(len(S[helfLength:]))] != S[helfLength:]:
          helfLength += 1
  
      return S[:helfLength] * 2
  
  
  result = ""
  S = input()
  SS = S
  lr = [int(i) for i in input().split()]
  
  i = 0
  while i < 10:
      SS = getSS(SS)
      i += 1
  
  cList = [chr(i) for i in range(97, 97 + 26)]
  
  for c in cList:
      result += str(SS[lr[0] - 1 : lr[1]].count(c)) + " "
  
  print(result.rstrip())
  
problem_description: Statement
  
  We will call a string that can be obtained by concatenating two equal strings
  an _even_ string. For example, `xyzxyz` and `aaaaaa` are even, while `ababab`
  and `xyzxy` are not.
  
  For a non-empty string S, we will define f(S) as the shortest even string that
  can be obtained by appending one or more characters to the end of S. For
  example, f(`abaaba`)=`abaababaab`. It can be shown that f(S) is uniquely
  determined for a non-empty string S.
  
  You are given an even string S consisting of lowercase English letters. For
  each letter in the lowercase English alphabet, find the number of its
  occurrences from the l-th character through the r-th character of f^{10^{100}}
  (S).
  
  Here, f^{10^{100}} (S) is the string f(f(f( ... f(S) ... ))) obtained by
  applying f to S 10^{100} times.
samples: [{"input": "abaaba\n    6 10", "output": "3 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n    \n\nSince f(`abaaba`)=`abaababaab`, the first ten characters in f^{10^{100}}(S) is\nalso `abaababaab`. Thus, the sixth through the tenth characters are `abaab`.\nIn this string, `a` appears three times, `b` appears twice and no other\nletters appear, and thus the output should be 3 and 2 followed by twenty-four\n0s.\n\n* * *"}, {"input": "xx\n    1 1000000000000000000", "output": "0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1000000000000000000 0 0\n    \n\n* * *"}, {"input": "vgxgpuamkvgxgvgxgpuamkvgxg\n    1 1000000000000000000", "output": "87167725689669676 0 0 0 0 0 282080685775825810 0 0 0 87167725689669676 0 87167725689669676 0 0 87167725689669676 0 0 0 0 87167725689669676 141040342887912905 0 141040342887912905 0 0"}]