'''simple docstring'''







import random


def    lowerCamelCase       (			UpperCAmelCase__				:  Any				,						UpperCAmelCase__				:  int				,						UpperCAmelCase__				:  Tuple = False		)			->	dict:


							'''simple docstring'''






							SCREAMING_SNAKE_CASE__     :int						    = {i: [] for i in range(SCREAMING_SNAKE_CASE_		)}

							# if probability is greater or equal than 1, then generate a complete graph
							if probability >= 1:
														return complete_graph(SCREAMING_SNAKE_CASE_		)
							# if probability is lower or equal than 0, then return a graph without edges
							if probability <= 0:
														return graph

							# for each couple of nodes, add an edge from u to v
							# if the number randomly generated is greater than probability probability
							for i in range(SCREAMING_SNAKE_CASE_		):
														for j in range(i + 1				,						SCREAMING_SNAKE_CASE_		):
																					if random.random() < probability:
																												graph[i].append(SCREAMING_SNAKE_CASE_		)
																												if not directed:
																																			# if the graph is undirected, add an edge in from j to i, either
																																			graph[j].append(SCREAMING_SNAKE_CASE_		)
							return graph


def    lowerCamelCase       (			UpperCAmelCase__				:  Union[str, Any]		)			->	dict:


							'''simple docstring'''






							return {
							    i: [j for j in range(SCREAMING_SNAKE_CASE_		) if i != j] for i in range(SCREAMING_SNAKE_CASE_		)
							}


if __name__ == "__main__":
		import doctest

		doctest.testmod()







'''simple docstring'''


def   A_      (       SCREAMING_SNAKE_CASE_						)			->bool:
  if num < 0:
    return False

  lowercase_     =       num
  lowercase_     =       0
  while num > 0:
    lowercase_     =       rev_num * 10 + (num % 10)
    num //= 10

  return num_copy == rev_num


if __name__ == "__main__":
       import doctest

       doctest.testmod()

