






def 						a    (		lowerCamelCase_	,     lowerCamelCase_       ):






				'''simple docstring'''
				lowercase__     				=    len(lowerCamelCase_       )
				print('''The following activities are selected:'''       )

				# The first activity is always selected
				lowercase__     				=    0
				print(lowerCamelCase_	,     end=''','''       )

				# Consider rest of the activities
				for j in range(lowerCamelCase_       ):
								# If this activity has start time greater than
								# or equal to the finish time of previously
								# selected activity, then select it
								if start[j] >= finish[i]:
												print(lowerCamelCase_	,     end=''','''       )
												lowercase__     				=    j


if __name__ == "__main__":
							import doctest

							doctest.testmod()

							A__			:    str         =				[1, 3, 0, 5, 8, 5]
							A__			:    int         =				[2, 4, 6, 7, 9, 9]
							print_max_activities(start, finish)












def 						a    (		lowerCamelCase_	,     lowerCamelCase_	,     lowerCamelCase_       ):






				'''simple docstring'''

				if exponent == 1:
								return base
				if exponent % 2 == 0:
								lowercase__     				=    _modexpt(lowerCamelCase_	,     exponent // 2	,     lowerCamelCase_       ) % modulo_value
								return (x * x) % modulo_value
				else:
								return (base * _modexpt(lowerCamelCase_	,     exponent - 1	,     lowerCamelCase_       )) % modulo_value






def 						a    (		lowerCamelCase_ = 1777	,     lowerCamelCase_ = 1855	,     lowerCamelCase_ = 8       ):






				'''simple docstring'''
				lowercase__     				=    base
				for _ in range(1	,     lowerCamelCase_       ):
								lowercase__     				=    _modexpt(lowerCamelCase_	,     lowerCamelCase_	,     10**digits       )

				return result


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




