




'''simple docstring'''





from __future__ import annotations


def 					UpperCamelCase_(     snake_case							:	int							,    snake_case							:	Any					):

							'''simple docstring'''






							snake_case_ ,				snake_case_      =				set(lowerCAmelCase__					), [start]

							while stack:
														snake_case_      =				stack.pop()
														explored.add(lowerCAmelCase__					)
														# Differences from BFS:
														# 1) pop last element instead of first one
														# 2) add adjacent elements to stack without exploring them
														for adj in reversed(graph[v]					):
																					if adj not in explored:
																												stack.append(lowerCAmelCase__					)
							return explored


_SCREAMING_SNAKE_CASE							:       List[str]						=			{
    "A": ["B", "C", "D"],
    "B": ["A", "D", "E"],
    "C": ["A", "F"],
    "D": ["B", "D"],
    "E": ["B", "F"],
    "F": ["C", "E", "G"],
    "G": ["F"],
}

if __name__ == "__main__":
	import doctest

	doctest.testmod()
	print(depth_first_search(G, "A"))










'''simple docstring'''





def 					UpperCamelCase_(     snake_case							:	int = 1_0_0_0					):

							'''simple docstring'''






							snake_case_      =				3
							snake_case_      =				0
							while a < n:
														if a % 3 == 0 or a % 5 == 0:
																					result += a
														elif a % 1_5 == 0:
																					result -= a
														a += 1
							return result


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




