[SWEA] 그래프 경로 (Python)

T = int(input())

for test_case in range(1, T + 1):
    v, e = map(int, input().split())
    g = [[] for _ in range(v+1)]
    visited = []
    for i in range(e):
        a, b = map(int, input().split())
        g[a].append(b)
    
    start, end = map(int, input().split())
    tovisit=[start]
    
    while tovisit:
        a=tovisit.pop()
        visited.append(a)
        for i in g[a]:
            if i not in visited:
                tovisit.append(i)
    if end in visited:
        print('#{} {}'.format(test_case, 1))
        
    else:
        print('#{} {}'.format(test_case, 0))