
    Design an algorithm for a smart parking management system that determines the number of valid ways to assign status indicators to consecutive parking spaces, where no more than 2 adjacent spaces can display the same status color, given n sequential parking spaces and k different status indicators. The solution should optimize the visual distinction of parking space statuses while maintaining operational efficiency in the parking facility.
    

    
def count_no_of_ways(n, k):
    """
    Design an algorithm for a smart parking management system that determines the number of valid ways to assign status indicators to consecutive parking spaces, where no more than 2 adjacent spaces can display the same status color, given n sequential parking spaces and k different status indicators. The solution should optimize the visual distinction of parking space statuses while maintaining operational efficiency in the parking facility.
    

    """
def count_no_of_ways(n, k):
    """
    Design an algorithm for a smart parking management system that determines the number of valid ways to assign status indicators to consecutive parking spaces, where no more than 2 adjacent spaces can display the same status color, given n sequential parking spaces and k different status indicators. The solution should optimize the visual distinction of parking space statuses while maintaining operational efficiency in the parking facility.
    

    """
    dp = [0] * (n + 1)
    total = k
    mod = 1000000007
    dp[1] = k
    dp[2] = k * k
    for i in range(3, n + 1):
        dp[i] = (k - 1) * (dp[i - 1] + dp[i - 2]) % mod
    return dp[n]