There is a simple graph with 65 edges containing vertices of degree 2,3 and 4. In which vertices with degree 3 are twice the number of vertices with degree 4 and there are 10 vertices with degree 2. Number of vertices containing degree 3 and 4 are ___ and __ .