

"""simple docstring"""



def  _snake_case     (    UpperCAmelCase_  :					str					,   UpperCAmelCase_  :					str			):
     A__										=  len(UpperCAmelCase_			)
     A__										=  len(UpperCAmelCase_			)
     A__										=  [[False for _ in range(m + 1			)] for _ in range(n + 1			)]
     A__										=  True
     for i in range(UpperCAmelCase_			):
          for j in range(m + 1			):
               if dp[i][j]:
                    if j < m and a[i].upper() == b[j]:
                         A__										=  True
                    if a[i].islower():
                         A__										=  True
     return dp[n][m]


if __name__ == "__main__":
 import doctest

 doctest.testmod()









"""simple docstring"""



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

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






