output_description: Print the number of non-empty (contiguous) substrings of S that are divisible
  by P when regarded as an integer written in base ten.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N P
      S
attempt: a, b = [int(c) for c in input().split(" ")]
  S = input()
  count = 0
  for i in range(1, a):
      for j in range(0, a):
          if j + i <= a + 1:
              subStr = S[j : j + i]
              print(subStr)
              if len(subStr) == i:
                  if int(subStr) % b == 0:
                      count += 1
  if int(S) % b == 0:
      count += 1
  print(count)
  
problem_description: Statement
  
  Takahashi has a string S of length N consisting of digits from `0` through
  `9`.
  
  He loves the prime number P. He wants to know how many non-empty (contiguous)
  substrings of S \- there are N \times (N + 1) / 2 of them - are divisible by P
  when regarded as integers written in base ten.
  
  Here substrings starting with a `0` also count, and substrings originated from
  different positions in S are distinguished, even if they are equal as strings
  or integers.
  
  Compute this count to help Takahashi.
samples: [{"input": "4 3\n    3543", "output": "6\n    \n\nHere S = `3543`. There are ten non-empty (contiguous) substrings of S:\n\n  * `3`: divisible by 3.\n\n  * `35`: not divisible by 3.\n\n  * `354`: divisible by 3.\n\n  * `3543`: divisible by 3.\n\n  * `5`: not divisible by 3.\n\n  * `54`: divisible by 3.\n\n  * `543`: divisible by 3.\n\n  * `4`: not divisible by 3.\n\n  * `43`: not divisible by 3.\n\n  * `3`: divisible by 3.\n\nSix of these are divisible by 3, so print 6.\n\n* * *"}, {"input": "4 2\n    2020", "output": "10\n    \n\nHere S = `2020`. There are ten non-empty (contiguous) substrings of S, all of\nwhich are divisible by 2, so print 10.\n\nNote that substrings beginning with a `0` also count.\n\n* * *"}, {"input": "20 11\n    33883322005544116655", "output": "68"}]