



def 		UpperCamelCase	(   snake_case__       :    str       ,     snake_case__       :    str	)	->     bool:
   UpperCamelCase    :  Optional[Any]							=	len(snake_case__	)
   UpperCamelCase    :  List[str]							=	len(snake_case__	)
   UpperCamelCase    :  Optional[int]							=	[[False for _ in range(m + 1	)] for _ in range(n + 1	)]
   UpperCamelCase    :  Optional[Any]							=	True
   for i in range(snake_case__	):
      for j in range(m + 1	):
         if dp[i][j]:
            if j < m and a[i].upper() == b[j]:
               UpperCamelCase    :  List[str]							=	True
            if a[i].islower():
               UpperCamelCase    :  Tuple							=	True
   return dp[n][m]


if __name__ == "__main__":
    import doctest

    doctest.testmod()







"""simple docstring"""



def   __lowerCAmelCase						(						lowercase  :  List[str]						,							lowercase  :  Union[str, Any]						,							lowercase  :  List[str]						,							lowercase  :  Tuple						,							lowercase  :  List[Any]						,							lowercase  :  int )	->						List[Any]:


    """simple docstring"""





    if index == r:
        for j in range(lowercase ):
            print(data[j]						,							end=" " )
        print(" " )
        return
    #  When no more elements are there to put in data[]
    if i >= n:
        return
    # current is included, put next at next location
    snake_case    :      Union[str, Any]      					=    arr[i]
    combination_util(lowercase						,							lowercase						,							lowercase						,							index + 1						,							lowercase						,							i + 1 )
    # current is excluded, replace it with
    # next (Note that i+1 is passed, but
    # index is not changed)
    combination_util(lowercase						,							lowercase						,							lowercase						,							lowercase						,							lowercase						,							i + 1 )
    # The main function that prints all combinations
    # of size r in arr[] of size n. This function
    # mainly uses combinationUtil()







def   __lowerCAmelCase						(						lowercase  :  Any						,							lowercase  :  Union[str, Any]						,							lowercase  :  Optional[int] )	->						List[Any]:


    """simple docstring"""





    snake_case    :      Any      					=    [0] * r
    # Print all combination using temporary array 'data[]'
    combination_util(lowercase						,							lowercase						,							lowercase						,							0						,							lowercase						,							0 )


if __name__ == "__main__":
  # Driver code to check the function above
  __snake_case   			=    [10, 20, 30, 40, 50]
  print_combination(arr, len(arr), 3)
  # This code is contributed by Ambuj sahu





