#!/bin/python

import sys
import math

def comb(n,r):
    f = math.factorial
    return f(n)/f(r)/f(n-r)

def countArray(n, k, x):
    # Return the number of ways to fill in the array.
    all = 1
    for i in range(n-1):
        all*=(k-1)
    return 3

if __name__ == "__main__":
    n, k, x = raw_input().strip().split(' ')
    n, k, x = [int(n), int(k), int(x)]
    answer = countArray(n, k, x)
    print answer