

import unittest

from transformers.image_processing_utils import get_size_dict






class 	__magic_name__				(       unittest.TestCase							):






     def   UpperCAmelCase_							(							self  )->    int:
         # Test a dict with the wrong keys raises an error
         UpperCamelCase_      =	{"wrong_key": 224}
         with self.assertRaises(_lowercase  ):
             get_size_dict(_lowercase  )

         UpperCamelCase_      =	{"height": 224}
         with self.assertRaises(_lowercase  ):
             get_size_dict(_lowercase  )

         UpperCamelCase_      =	{"width": 224, "shortest_edge": 224}
         with self.assertRaises(_lowercase  ):
             get_size_dict(_lowercase  )

         # Test a dict with the correct keys is returned as is
         UpperCamelCase_      =	{"height": 224, "width": 224}
         UpperCamelCase_      =	get_size_dict(_lowercase  )
         self.assertEqual(_lowercase		,	_lowercase  )

         UpperCamelCase_      =	{"shortest_edge": 224}
         UpperCamelCase_      =	get_size_dict(_lowercase  )
         self.assertEqual(_lowercase		,	{"shortest_edge": 224}  )

         UpperCamelCase_      =	{"longest_edge": 224, "shortest_edge": 224}
         UpperCamelCase_      =	get_size_dict(_lowercase  )
         self.assertEqual(_lowercase		,	{"longest_edge": 224, "shortest_edge": 224}  )

         # Test a single int value which  represents (size, size)
         UpperCamelCase_      =	get_size_dict(224  )
         self.assertEqual(_lowercase		,	{"height": 224, "width": 224}  )

         # Test a single int value which represents the shortest edge
         UpperCamelCase_      =	get_size_dict(224		,	default_to_square=_lowercase  )
         self.assertEqual(_lowercase		,	{"shortest_edge": 224}  )

         # Test a tuple of ints which represents (height, width)
         UpperCamelCase_      =	get_size_dict((150, 200)  )
         self.assertEqual(_lowercase		,	{"height": 150, "width": 200}  )

         # Test a tuple of ints which represents (width, height)
         UpperCamelCase_      =	get_size_dict((150, 200)		,	height_width_order=_lowercase  )
         self.assertEqual(_lowercase		,	{"height": 200, "width": 150}  )

         # Test an int representing the shortest edge and max_size which represents the longest edge
         UpperCamelCase_      =	get_size_dict(224		,	max_size=256		,	default_to_square=_lowercase  )
         self.assertEqual(_lowercase		,	{"shortest_edge": 224, "longest_edge": 256}  )

         # Test int with default_to_square=True and max_size fails
         with self.assertRaises(_lowercase  ):
             get_size_dict(224		,	max_size=256		,	default_to_square=_lowercase  )



from __future__ import annotations




def  lowerCAmelCase(			SCREAMING_SNAKE_CASE_ )->	str:



    """simple docstring"""






    global graph, reversed_graph, scc, component, visit, stack
    if visit[u]:
        return
    UpperCamelCase_      =	True
    for v in graph[u]:
        dfs(SCREAMING_SNAKE_CASE_ )
    stack.append(SCREAMING_SNAKE_CASE_ )




def  lowerCAmelCase(			SCREAMING_SNAKE_CASE_ )->	Dict:



    """simple docstring"""






    global graph, reversed_graph, scc, component, visit, stack
    if visit[u]:
        return
    UpperCamelCase_      =	True
    component.append(SCREAMING_SNAKE_CASE_ )
    for v in reversed_graph[u]:
        dfsa(SCREAMING_SNAKE_CASE_ )




def  lowerCAmelCase(			)->	Dict:



    """simple docstring"""






    global graph, reversed_graph, scc, component, visit, stack
    for i in range(SCREAMING_SNAKE_CASE_ ):
        dfs(SCREAMING_SNAKE_CASE_ )
    UpperCamelCase_      =	[False] * n
    for i in stack[::-1]:
        if visit[i]:
            continue
        UpperCamelCase_      =	[]
        dfsa(SCREAMING_SNAKE_CASE_ )
        scc.append(SCREAMING_SNAKE_CASE_ )
    return scc


if __name__ == "__main__":
 # n - no of nodes, m - no of edges
 SCREAMING_SNAKE_CASE  ,       SCREAMING_SNAKE_CASE		:str				  =    list(map(int, input().strip().split()))

 SCREAMING_SNAKE_CASE		:list[list[int]]				  =    [[] for _ in range(n)]  # graph
 SCREAMING_SNAKE_CASE		:list[list[int]]				  =    [[] for i in range(n)]  # reversed graph
 # input graph data (edges)
 for _ in range(m):
  SCREAMING_SNAKE_CASE  ,       SCREAMING_SNAKE_CASE		:str				  =    list(map(int, input().strip().split()))
  graph[u].append(v)
  reversed_graph[v].append(u)

 SCREAMING_SNAKE_CASE		:list[int]				  =    []
 SCREAMING_SNAKE_CASE		:list[bool]				  =    [False] * n
 SCREAMING_SNAKE_CASE		:list[int]				  =    []
 SCREAMING_SNAKE_CASE		:list[int]				  =    []
 print(kosaraju())
