A graph G has order n=3k+3 for some positive integers k. Every vertex of G has degree k+1,k+2 or k+3.Prove that G has at least k+3 vertices of degree k+1 or at least k+1 vertices of degree k+2 or at least k+2 vertices of degree k+3.