CF219C Color Stripe

A colored stripe is represented by a horizontal row of $ n $ square cells, each cell is pained one of $ k $ colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color from 1 to $ k $ to repaint the cells.

The first input line contains two integers $ n $ and $ k $ ( $ 1

Print a single integer — the required minimum number of repaintings. In the second line print any possible variant of the repainted stripe.