void DFS(int vert, vector<int> &color, vector<vector<int>> &Graph, int &count, vector<int> &result) {
    color[vert] = 1;
    int child = 0;
    for (int i = 0; i < Graph[vert].size() ; i++){
        child = Graph[vert][i];
        if (color[child] == 1) {
            count++;
            return;
        }
        if (color[child] == 0)
            DFS(child, color, Graph, count, result);
    }
    if (count > 0){
        return;
    }
    color[vert] = 2;
    result.push_back(vert + 1);
}