#include 
//#include 
#include 
#include 
#include 
#include 
using namespace std;
vectorgraph[500000];
vectorvsuma[100005];
int niza[100005];
int najmal=2e9;
vectorrev_graph[500000];
int suma[100005];
bool visited[500000];
int brojac1=0;
stacks;

void dfs(int node){
visited[node]=true;
for(int i=0; i>a;
vectorv;
for(int i=0; i>suma[i];
}

cin>>b;
memset(visited, false, sizeof visited);
for(int i=0; i>k>>k1;
    k1--;
    k--;
    graph[k].push_back(k1);
    rev_graph[k1].push_back(k);
}
for(int i=0; i