


'''simple docstring'''






from __future__ import annotations







def 				UpperCamelCase_			(    A__					:   dict							,    A__					:   str					):
  '''simple docstring'''





  lowerCAmelCase_,							lowerCAmelCase_			:      Tuple			=   set(A__					), [start]

  while stack:
    lowerCAmelCase_			:      str			=   stack.pop()
    explored.add(A__					)
    # 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(A__					)
  return explored


__A					:  Dict											=      {
    "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_			(    A__					:   int = 10_00					):
  '''simple docstring'''





  lowerCAmelCase_			:      Optional[Any]			=   3
  lowerCAmelCase_			:      Dict			=   0
  while a < n:
    if a % 3 == 0 or a % 5 == 0:
      result += a
    elif a % 15 == 0:
      result -= a
    a += 1
  return result


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



