






def      __A					(     _lowercase					,			_lowercase ):

					'''simple docstring'''







					_A								= len(_lowercase )
					print('''The following activities are selected:''' )

					# The first activity is always selected
					_A								= 0
					print(_lowercase					,			end=''',''' )

					# Consider rest of the activities
					for j in range(_lowercase ):
										# 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(_lowercase					,			end=''',''' )
															_A								= j


if __name__ == "__main__":
				import doctest

				doctest.testmod()

				__A      =				[1, 3, 0, 5, 8, 5]
				__A      =				[2, 4, 6, 7, 9, 9]
				print_max_activities(start, finish)











import math




def      __A					(     _lowercase ):

					'''simple docstring'''







					_A								= []
					_A								= 2
					_A								= int(math.sqrt(_lowercase ) )  # Size of every segment
					_A								= [True] * (end + 1)
					_A								= []

					while start <= end:
										if temp[start] is True:
															in_prime.append(_lowercase )
															for i in range(start * start					,			end + 1					,			_lowercase ):
																				_A								= False
										start += 1
					prime += in_prime

					_A								= end + 1
					_A								= min(2 * end					,			_lowercase )

					while low <= n:
										_A								= [True] * (high - low + 1)
										for each in in_prime:
															_A								= math.floor(low / each ) * each
															if t < low:
																				t += each

															for j in range(_lowercase					,			high + 1					,			_lowercase ):
																				_A								= False

										for j in range(len(_lowercase ) ):
															if temp[j] is True:
																				prime.append(j + low )

										_A								= high + 1
										_A								= min(high + end					,			_lowercase )

					return prime


print(sieve(10**6))



