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: text = input().strip()
  pattern = input().strip()
  
  skip_table = {}
  
  
  def make_skip_table(pattern):
      global skip_table
      for i in range(len(pattern)):
          c = pattern[-1 * (i + 1)]
          if c not in skip_table.keys():
              skip_table[c] = i
  
  
  def boyer_moore(text, pattern):
      loop_num = len(text) - len(pattern)
      pattern_length = len(pattern)
      start = 0
      while start <= loop_num:
          for i in range(pattern_length):
              pos = start + pattern_length - (i + 1)
              c = text[pos]
              if c != pattern[-(i + 1)]:
                  if c not in skip_table.keys():
                      start += pattern_length
                  else:
                      start += skip_table[c]
                  break
          print(start)
          start += 1
  
  
  make_skip_table(pattern)
  boyer_moore(text, pattern)
  
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."}]