If K is odd then print the path directly by choosing node 1 and 2 repeatedly
if ( K & 1 ) { cout << " YES " << endl ; for ( int i = 1 ; i <= K + 1 ; i ++ ) { cout << ( i & 1 ) + 1 << " ▁ " ; } return ; }