B"There are n cities in the kingdom X , numbered from 1 through n . People travel between cities by some one-way roads. As a passenger, JATC finds it weird that from any city u , he can't start a trip in it and then return back to it using the roads of the kingdom. That is, the kingdom can be viewed as an acyclic graph. Being annoyed by the traveling system, JATC decides to meet the king and ask him to do something. In response, the king says that he will upgrade some cities to make it easier to travel. Because of the budget, the king will only upgrade those cities that are important or semi-important. A city u is called important if for every city v neq u , there is either a path from u to v or a path from v to u . A city u is called semi-important if it is not important and we can destroy exactly one city v neq u so that u becomes important. The king will start to act as soon as he finds out all those cities. Please help him to speed up the process. The first line of the input contains two integers n and m ( 2 <= n <= 300 ,000 , 1 <= m <= 300 ,000 ) -- the number of cities and the number of one-way roads. Next m lines describe the road system of the kingdom. Each of them contains two integers u_i and v_i ( 1 <= u_i, v_i <= n , u_i neq v_i ), denoting one-way road from u_i to v_i . It is guaranteed, that the kingdoms' roads make an acyclic graph, which doesn't contain multiple edges and self-loops. Print a single integer -- the number of cities that the king has to upgrade. In the first example: In the second example, the important cities are 1 and 4 . The semi-important cities are 2 and 3 . "...