import sys import heapq input = sys.stdin.readline INF= (int)(1e8) N,M,X=map(int,input().split()) lst=[[] for _ in range(N+1)] for i in range(M): start,end,cost = map(int,input().split()) lst[start].append((end,cost)) # ์ง -> x๊น์ง ๋ค์ต์คํธ๋ผ x-> ์ง๊น์ง ๋ค์ต์คํธ๋ผ 2ํ ์ํ def dijkstra(start,): q = [] distance = [INF]*(N+1) distance[start] = 0 heapq.heappush(q,(start,0)) while q: node,dist=heapq.heappop(q) if dist..