{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n section pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n {left: \u0027\\\\[\u0027, right: \u0027\\\\]\u0027, display: true}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"Problem Statement","value":{"format":"HTML","content":"\r\n\u003csection\u003e\r\n\u003cp\u003eWe have a simple directed graph \u003cvar\u003e\\(G\\)\u003c/var\u003e with \u003cvar\u003e\\(N\\)\u003c/var\u003e vertices and \u003cvar\u003e\\(M\\)\u003c/var\u003e edges. The vertices are labeled as Vertex \u003cvar\u003e\\(1\\)\u003c/var\u003e, Vertex \u003cvar\u003e\\(2\\)\u003c/var\u003e, \u003cvar\u003e\\(\\ldots\\)\u003c/var\u003e, Vertex \u003cvar\u003e\\(N\\)\u003c/var\u003e.\r\nThe \u003cvar\u003e\\(i\\)\u003c/var\u003e-th edge \u003cvar\u003e\\((1\\leq i\\leq M)\\)\u003c/var\u003e goes from Vertex \u003cvar\u003e\\(U_i\\)\u003c/var\u003e to Vertex \u003cvar\u003e\\(V_i\\)\u003c/var\u003e.\u003c/p\u003e\r\n\u003cp\u003eTakahashi will start at a vertex and repeatedly travel on \u003cvar\u003e\\(G\\)\u003c/var\u003e from one vertex to another along a directed edge.\r\nHow many vertices of \u003cvar\u003e\\(G\\)\u003c/var\u003e have the following condition: Takahashi can start at that vertex and continue traveling indefinitely by carefully choosing the path? \u003c/p\u003e\r\n\u003c/section\u003e\r\n"}},{"title":"Constraints","value":{"format":"HTML","content":"\r\n\u003csection\u003e\r\n\u003cul\u003e\r\n\u003cli\u003e\u003cvar\u003e\\(1 \\leq N \\leq 2\\times 10^5\\)\u003c/var\u003e\u003c/li\u003e\r\n\u003cli\u003e\u003cvar\u003e\\(0 \\leq M \\leq \\min(N(N-1), 2\\times 10^5)\\)\u003c/var\u003e\u003c/li\u003e\r\n\u003cli\u003e\u003cvar\u003e\\(1 \\leq U_i,V_i\\leq N\\)\u003c/var\u003e\u003c/li\u003e\r\n\u003cli\u003e\u003cvar\u003e\\(U_i\\neq V_i\\)\u003c/var\u003e\u003c/li\u003e\r\n\u003cli\u003e\u003cvar\u003e\\((U_i,V_i)\\neq (U_j,V_j)\\)\u003c/var\u003e if \u003cvar\u003e\\(i\\neq j\\)\u003c/var\u003e.\u003c/li\u003e\r\n\u003cli\u003eAll values in input are integers.\u003c/li\u003e\r\n\u003c/ul\u003e\r\n\u003c/section\u003e\r\n"}},{"title":"Input","value":{"format":"HTML","content":"\r\n\u003csection\u003e\r\n\u003cp\u003eInput is given from Standard Input in the following format:\u003c/p\u003e\r\n\u003cpre\u003e\u003cvar\u003e\\(N\\)\u003c/var\u003e \u003cvar\u003e\\(M\\)\u003c/var\u003e\r\n\u003cvar\u003e\\(U_1\\)\u003c/var\u003e \u003cvar\u003e\\(V_1\\)\u003c/var\u003e\r\n\u003cvar\u003e\\(U_2\\)\u003c/var\u003e \u003cvar\u003e\\(V_2\\)\u003c/var\u003e\r\n\u003cvar\u003e\\(\\vdots\\)\u003c/var\u003e\r\n\u003cvar\u003e\\(U_M\\)\u003c/var\u003e \u003cvar\u003e\\(V_M\\)\u003c/var\u003e\r\n\u003c/pre\u003e\r\n\u003c/section\u003e\r\n"}},{"title":"Output","value":{"format":"HTML","content":"\r\n\u003csection\u003e\r\n\u003cp\u003ePrint the answer.\u003c/p\u003e\r\n\u003c/section\u003e\r\n"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5 5\r\n1 2\r\n2 3\r\n3 4\r\n4 2\r\n4 5\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e4\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\r\n\u003csection\u003e\r\n\r\n\u003c/section\u003e\r\n\r\n\u003csection\u003e\r\n\r\n\u003cp\u003eWhen starting at Vertex \u003cvar\u003e\\(2\\)\u003c/var\u003e, Takahashi can continue traveling indefinitely: \u003cvar\u003e\\(2\\)\u003c/var\u003e \u003cvar\u003e\\(\\to\\)\u003c/var\u003e \u003cvar\u003e\\(3\\)\u003c/var\u003e \u003cvar\u003e\\(\\to\\)\u003c/var\u003e \u003cvar\u003e\\(4\\)\u003c/var\u003e \u003cvar\u003e\\(\\to\\)\u003c/var\u003e \u003cvar\u003e\\(2\\)\u003c/var\u003e \u003cvar\u003e\\(\\to\\)\u003c/var\u003e \u003cvar\u003e\\(3\\)\u003c/var\u003e \u003cvar\u003e\\(\\to\\)\u003c/var\u003e \u003cvar\u003e\\(\\cdots\\)\u003c/var\u003e\r\nThe same goes when starting at Vertex \u003cvar\u003e\\(3\\)\u003c/var\u003e or Vertex \u003cvar\u003e\\(4\\)\u003c/var\u003e.\r\nFrom Vertex \u003cvar\u003e\\(1\\)\u003c/var\u003e, he can first go to Vertex \u003cvar\u003e\\(2\\)\u003c/var\u003e and then continue traveling indefinitely again.\u003cbr\u003e\r\nOn the other hand, from Vertex \u003cvar\u003e\\(5\\)\u003c/var\u003e, he cannot move at all.\u003c/p\u003e\r\n\u003cp\u003eThus, four vertices ―Vertex \u003cvar\u003e\\(1\\)\u003c/var\u003e, \u003cvar\u003e\\(2\\)\u003c/var\u003e, \u003cvar\u003e\\(3\\)\u003c/var\u003e, and \u003cvar\u003e\\(4\\)\u003c/var\u003e― satisfy the conditions, so \u003cvar\u003e\\(4\\)\u003c/var\u003e should be printed.\u003c/p\u003e\r\n\u003c/section\u003e\r\n"}},{"title":"Sample 2","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3 2\r\n1 2\r\n2 1\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\r\n\u003csection\u003e\r\n\r\n\u003c/section\u003e\r\n\r\n\u003csection\u003e\r\n\r\n\u003cp\u003eNote that, in a simple directed graph, there may be two edges in opposite directions between the same pair of vertices.\r\nAdditionally, \u003cvar\u003e\\(G\\)\u003c/var\u003e may not be connected.\u003c/p\u003e\u003c/section\u003e\r\n"}}]}