import java.util.LinkedList;
import java.util.List;

public class Graph2 {
    private static int nNodes;
    private static int nEdges;
    private List <Integer> [] outEdges;
    private int [] nPrecedences;

    public Graph2(int nNodes, int nEdges){
        this.nNodes = nNodes;
        this.nEdges = nEdges;
        outEdges = new List[nNodes];
        nPrecedences = new int[nNodes];
    }

    public void addEdge(int start, int end){
        if(outEdges[start] == null)
            outEdges[start] = new LinkedList <Integer>();
        outEdges[start].add(end);
         nPrecedences[end]++;
    }

    public List<Integer> getEdge(int index){
        return outEdges[index];
    }
    public int getNodes(){
        return nNodes;
    }
    public int getEdges(){
        return nEdges;
    }
    public int getNDegree(int index){
        return nPrecedences[index];
    }
    public int getNPrecedences(){
        return nPrecedences.length;
    }
    public int getPrecedence(int index){
        return nPrecedences[index];
    }


}