output_description: Print an index of T where P found in a line. Print the indices in ascending
  order.
input_description: In the first line, a text T is given. In the second line, a string P is given.
attempt: def atoi(a):
      return ord(a) + (1 << 31)
  
  
  S = input()
  T = input()
  ns = len(S)
  nt = len(T)
  
  if ns < nt:
      exit()
  
  mod = (1 << 61) - 1
  b = 10**9 + 7
  bn = pow(b, nt, mod)
  
  hs = 0
  ht = 0
  
  for s, t in zip(S, T):
      hs = (hs * b + atoi(s)) % mod
      ht = (ht * b + atoi(t)) % mod
  
  for i in range(ns - nt + 1):
      if hs == ht:
          print(i)
      if ns - nt <= i:
          break
      hs = (hs * b + atoi(S[i + nt]) - bn * atoi(S[i])) % mod
  
problem_description: String Search
  
  Find places where a string P is found within a text T. Print all indices of T
  where P found. The indices of T start with 0.
samples: [{"input": "aabaaa\n    aa", "output": "0\n    3\n    4"}, {"input": "xyzz\n    yz", "output": "1"}, {"input": "abc\n    xyz", "output": "The output should be empty."}]