Coloring Boards

Given a board of N cells arranged in a single row, implement a function that colors the cells using K different colors such that no two adjacent cells have the same color. Your task is to count the number of valid ways to color the board. Input format: - The first line contains an integer N (1 <= N <= 20), the number of cells. - The second line contains an integer K (1 <= K <= 10), the number of colors available. Output format: - Print a single integer which is the count of valid colorings of the board. Example: Input: 3 2 Output: 6