





'''simple docstring'''



def  lowercase__(		_UpperCamelCase  : int = 1000				)->   int:






					"""simple docstring"""

					_UpperCamelCase											=   0
					_UpperCamelCase											=   0
					while 1:
										num += 3
										if num >= n:
															break
										total += num
										num += 2
										if num >= n:
															break
										total += num
										num += 1
										if num >= n:
															break
										total += num
										num += 3
										if num >= n:
															break
										total += num
										num += 1
										if num >= n:
															break
										total += num
										num += 2
										if num >= n:
															break
										total += num
										num += 3
										if num >= n:
															break
										total += num
					return total


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










'''simple docstring'''



from __future__ import annotations



def  lowercase__(		_UpperCamelCase  : list[list[int]] ,   _UpperCamelCase  : int ,   _UpperCamelCase  : int ,   _UpperCamelCase  : int | float				)->   None:






					"""simple docstring"""

					_UpperCamelCase				,	_UpperCamelCase											=   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  lowercase__(		)->   None:






					"""simple docstring"""

					_UpperCamelCase											=   [[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]]
					_UpperCamelCase											=   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()



