Number of hanging vertices 2#5088
Given a simple undirected unweighted graph. Count the number of hanging vertices in it. The vertex is hanging, if its degree is .
The first line contains two numbers and (1 \leq n, m \leq 1000) - the number of vertices and the number of edges. Next lines contain a list of edges.
Print the number of hanging vertices in a graph.
Example 1
Example 2