# "Saw"
# Import lib
import string, time
from itertools import product
# Calcularize
def calc(n, k):
    count = 0
    result = 0
    s = set()
    for saw in product(string.digits[1:k + 1], repeat = n):
        if saw not in s:
            for i in range(n):
                mn = i - 1
                mx = i + 1
                if mn < 0:
                    if saw[i] > saw[mx] or saw[i] < saw[mx]:
                        result += 1
                elif mx > n - 1:
                    if saw[i] > saw[mn] or saw[i] < saw[mn]:
                        result += 1
                elif saw[mn] > saw[i] < saw[mx] or saw[mn] < saw[i] > saw[mx]:
                        result += 1
            if result < n:
                result = 0
            elif result == n:
                result = 0
                count += 1
        s.add(saw)                   
    return count
    
# Input var's
n = int(input('N '))
k = int(input('K '))
# Output
t1 = time.time()
print(calc(n, k))
t2 = time.time()
print(t2 - t1)

# "Saw"
# Import lib
import string, time
from itertools import product
# Calcularize
def calc(n, k):
    list = []
    count = 0
    result = 0
    for saw in product(string.digits[1:k + 1], repeat = n):
        for i in range(n):
            mn = i - 1
            mx = i + 1
            if mn < 0:
                if saw[i] > saw[mx] or saw[i] < saw[mx]:
                    result += 1
            elif mx > n - 1:
                if saw[i] > saw[mn] or saw[i] < saw[mn]:
                    result += 1
            elif saw[mn] > saw[i] < saw[mx] or saw[mn] < saw[i] > saw[mx]:
                    result += 1
        if result < n:
            result = 0
        elif result == n:
            result = 0
            count += 1
    return count
    
# Input var's
n = int(input('N '))
k = int(input('K '))
# Output
t1 = time.time()
print(calc(n, k))
t2 = time.time()
print(t2 - t1)

def f(k,n):
    d_up = {i : tuple(range(i+1,k)) for i in range(0,k-1)}
    d_down = {i : tuple(range(i)) for i in range(1,k)}
    
    up = [0]*k 
    dn = [0]*k
    for i in range(k):
        for j in range(i):
            dn[j] += 1
        for j in range(i+1,k):
            up[j] += 1
                
    for i in range(n-2):
        n_up = [0]*k 
        n_dn = [0]*k
        
        for key in d_up:
            for e in d_up[key]:
                n_up[e] += dn[key]
                
        for key in d_down:
            for e in d_down[key]:
                n_dn[e] += up[key]
                
        up, dn = n_up, n_dn
    return sum(dn)*2