# Paint Fence

easy

1. You are given a number n and a number k in separate lines, representing the number of fences and number of colors. 2. You are required to calculate and print the number of ways in which the fences could be painted so that not more than two consecutive fences have same colors.

## Constraints

1 <= n <= 10 1 <= k <= 10

## Format

### Input

A number n A number k

### Output

A number representing the number of ways in which the fences could be painted so that not more than two fences have same colors.

## Example

Sample Input

8
3

### Sample Output

3672

Question Video