"""simple docstring"""


from __future__ import annotations







def    UpperCAmelCase       (						UpperCAmelCase		,   UpperCAmelCase		,   UpperCAmelCase		,   UpperCAmelCase   )							-> None:
     snake_case_			,      snake_case_   			=   m - 1, 0
     while i >= 0 and j < n:
          if key == mat[i][j]:
               print(f'Key {key} found at row- {i + 1} column- {j + 1}'   )
               return
          if key < mat[i][j]:
               i -= 1
          else:
               j += 1
     print(f'Key {key} not found'   )







def    UpperCAmelCase       (						)							-> None:
     snake_case_   			=   [[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]]
     snake_case_   			=   int(input('Enter the element to be searched:'   )   )
     print(UpperCAmelCase   )
     search_in_a_sorted_matrix(UpperCAmelCase		,   len(UpperCAmelCase   )		,   len(mat[0]   )		,   UpperCAmelCase   )


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    main()


"""simple docstring"""


from math import factorial







def    UpperCAmelCase       (						UpperCAmelCase		,   UpperCAmelCase   )							-> List[str]:
     return factorial(UpperCAmelCase   ) / (factorial(UpperCAmelCase   ) * factorial(n - r   ))







def    UpperCAmelCase       (						)							-> Optional[Any]:
     snake_case_   			=   0

     for i in range(1		,   101   ):
          for j in range(1		,   i + 1   ):
               if combinations(UpperCAmelCase		,   UpperCAmelCase   ) > 1e6:
                    total += 1
     return total


if __name__ == "__main__":
    print(solution())

