We will save ( m - 1 ) th node and later make it point to ( n - k + 1 ) th node
if ( count == m - 1 ) { pre = c ; link = c -> next ; } if ( count == n - k ) { if ( m == 1 ) { end = c ; A = c -> next ; } else { end = c ;