'''simple docstring'''





from __future__ import annotations
def   snake_case_       (							_a     :							list[list[int]] ,					_a     :							int ,					_a     :							int ,					_a     :							int | float			):
      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   snake_case_       (							):
      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(_a			)
      search_in_a_sorted_matrix(_a ,					len(_a			) ,					len(mat[0]			) ,					_a			)


if __name__ == "__main__":
     import doctest

     doctest.testmod()
     main()



'''simple docstring'''





from __future__ import annotations

import random



class  lowerCAmelCase__   :



  '''simple docstring'''






  _UpperCamelCase						= 6

  def __init__(self  : List[Any]    )   ->       Optional[Any]:
        snake_case_						       =							list(range(1	, Dice.NUM_SIDES + 1    )    )


  def 		_lowerCamelCase	(self  : Optional[int]    )   ->       int:
        return random.choice(self.sides    )

def   snake_case_       (							_a     :							int ,					_a     :							int = 2			):
      snake_case_						       =							[Dice() for i in range(_a			)]
      snake_case_						       =							[0] * (len(_a			) * Dice.NUM_SIDES + 1)
      for _ in range(_a			):
            count_of_sum[sum(dice.roll() for dice in dices			)] += 1
      snake_case_						       =							[round((count * 100) / num_throws ,					2			) for count in count_of_sum]
      return probability[num_dice:]  # remove probability of sums that never appear


if __name__ == "__main__":
     import doctest

     doctest.testmod()

