





def        __lowercase       (				_SCREAMING_SNAKE_CASE			,						_SCREAMING_SNAKE_CASE     )			->       Any:


      '''simple docstring'''


      SCREAMING_SNAKE_CASE		=						[0 for i in range(r + 1     )]
      # nc0 = 1
      SCREAMING_SNAKE_CASE		=						1
      for i in range(1			,						n + 1     ):
            # to compute current row from previous row.
            SCREAMING_SNAKE_CASE		=						min(_SCREAMING_SNAKE_CASE			,						_SCREAMING_SNAKE_CASE     )
            while j > 0:
                  c[j] += c[j - 1]
                  j -= 1
      return c[r]



print(binomial_coefficient(n=1_0, r=5))









from itertools import permutations



def        __lowercase       (				_SCREAMING_SNAKE_CASE     )			->       bool:


      '''simple docstring'''


      if num[3] % 2 != 0:
            return False

      if (num[2] + num[3] + num[4]) % 3 != 0:
            return False

      if num[5] % 5 != 0:
            return False

      SCREAMING_SNAKE_CASE		=						[7, 11, 13, 17]
      for i, test in enumerate(_SCREAMING_SNAKE_CASE     ):
            if (num[i + 4] * 1_00 + num[i + 5] * 10 + num[i + 6]) % test != 0:
                  return False
      return True



def        __lowercase       (				_SCREAMING_SNAKE_CASE = 10     )			->       int:


      '''simple docstring'''


      return sum(
          int("""""".join(map(_SCREAMING_SNAKE_CASE			,						_SCREAMING_SNAKE_CASE     )     )     )
          for num in permutations(range(_SCREAMING_SNAKE_CASE     )     )
          if is_substring_divisible(_SCREAMING_SNAKE_CASE     )     )


if __name__ == "__main__":
      print(F'''{solution() = }''')


