def count_no_of_ways(n, k):
    if n <= 0 or k <= 0:
        return 0
    if n == 1:
        return k
    if n == 2:
        return k * k

    same = k
    different = k * (k - 1)

    for _ in range(3, n + 1):
        new_same = different
        new_different = (same + different) * (k - 1)
        same = new_same
        different = new_different

    return same + different