




'''simple docstring'''




from __future__ import annotations

def    _UpperCamelCase      (				SCREAMING_SNAKE_CASE__			:      Union[str, Any]       ):
 '''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    _UpperCamelCase      (				SCREAMING_SNAKE_CASE__			:      str       ):
 '''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    _UpperCamelCase      (				):
 '''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
    UpperCAmelCase_				,		UpperCAmelCase_       				=      list(map(int, input().strip().split()))

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

    UpperCAmelCase_       				=      []
    UpperCAmelCase_       				=      [False] * n
    UpperCAmelCase_       				=      []
    UpperCAmelCase_       				=      []
    print(kosaraju())






'''simple docstring'''




from __future__ import annotations

import random
import string

class 						lowerCAmelCase_   :







  '''simple docstring'''







  def __init__(						self    :	int						,		_UpperCAmelCase    :	str | None = None ):






   """simple docstring"""






   UpperCAmelCase__										=    passcode or self.__passcode_creator()
   UpperCAmelCase__										=    self.__make_key_list()
   UpperCAmelCase__										=    self.__make_shift_key()


  def __str__(						self    :	int ):






   """simple docstring"""






   return "".join(self.__passcode )


  def 							SCREAMING_SNAKE_CASE__			(						self    :	List[str]						,		_UpperCAmelCase    :	list[int] ):






   """simple docstring"""






   for i in range(1						,		len(_UpperCAmelCase )						,		2 ):
    iterlist[i] *= -1
   return iterlist


  def 							SCREAMING_SNAKE_CASE__			(						self    :	int ):






   """simple docstring"""






   UpperCAmelCase__										=    string.ascii_letters + string.digits
   UpperCAmelCase__										=    [random.choice(_UpperCAmelCase ) for _ in range(random.randint(10						,		20 ) )]
   return password


  def 							SCREAMING_SNAKE_CASE__			(						self    :	Tuple ):






   """simple docstring"""






   UpperCAmelCase__										=    (
       string.ascii_letters + string.digits + string.punctuation + """ \t\n"""
   )

   UpperCAmelCase__										=    []

   # creates points known as breakpoints to break the key_list_options at those
   # points and pivot each substring
   UpperCAmelCase__										=    sorted(set(self.__passcode ) )
   UpperCAmelCase__										=    []

   # algorithm for creating a new shuffled list, keys_l, out of key_list_options
   for i in key_list_options:
    temp_list.extend(_UpperCAmelCase )

    # checking breakpoints at which to pivot temporary sublist and add it into
    # keys_l
    if i in breakpoints or i == key_list_options[-1]:
     keys_l.extend(temp_list[::-1] )
     temp_list.clear()

        # returning a shuffled keys_l to prevent brute force guessing of shift key
   return keys_l


  def 							SCREAMING_SNAKE_CASE__			(						self    :	Tuple ):






   """simple docstring"""






   UpperCAmelCase__										=    sum(self.__neg_pos([ord(_UpperCAmelCase ) for x in self.__passcode] ) )
   return num if num > 0 else len(self.__passcode )


  def 							SCREAMING_SNAKE_CASE__			(						self    :	Optional[Any]						,		_UpperCAmelCase    :	str ):






   """simple docstring"""






   UpperCAmelCase__										=    """"""

   # decoding shift like Caesar cipher algorithm implementing negative shift or
   # reverse shift or left shift
   for i in encoded_message:
    UpperCAmelCase__										=    self.__key_list.index(_UpperCAmelCase )
    decoded_message += self.__key_list[
        (position - self.__shift_key) % -len(self.__key_list )
    ]

   return decoded_message



  def 							SCREAMING_SNAKE_CASE__			(						self    :	List[str]						,		_UpperCAmelCase    :	str ):






   """simple docstring"""






   UpperCAmelCase__										=    """"""

   # encoding shift like Caesar cipher algorithm implementing positive shift or
   # forward shift or right shift
   for i in plaintext:
    UpperCAmelCase__										=    self.__key_list.index(_UpperCAmelCase )
    encoded_message += self.__key_list[
        (position + self.__shift_key) % len(self.__key_list )
    ]

   return encoded_message

def    _UpperCamelCase      (				SCREAMING_SNAKE_CASE__			:      str = "Hello, this is a modified Caesar cipher"       ):
 '''simple docstring'''





 UpperCAmelCase__										=    ShuffledShiftCipher()
 return cipa.decrypt(cipa.encrypt(SCREAMING_SNAKE_CASE__       )       )


if __name__ == "__main__":
    import doctest

    doctest.testmod()
