Problem Statement

Isolate the Infected Room Given an undirected graph and infected room S, print the minimum number of tunnels to break so that S has no remaining connection. Input Format The first line contains N and M. The next M lines contain tunnel endpoints. The final line contains S. Output Format Print the answer. Constraints - 1 <= N,M <= 200000