import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod,comb  # python3.8用(notpypy)
# from bisect import bisect_left,bisect_right
# from functools import lru_cache,reduce
# from heapq import heappush,heappop,heapify,heappushpop,heapreplace
# import numpy as np
# import networkx as nx
# from networkx.utils import UnionFind
# from numba import njit, b1, i1, i4, i8, f8
# from scipy.sparse import csr_matrix
# from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)


def check(a):
    return a[0] != a[1] and a[1] != a[2] and a[2]!=a[0] and a[1] in [max(a), min(a)]


def check2(a):
    return all(check((x, y, z)) for x, y, z in zip(a, a[1:], a[2:]))


def main():
    mod = 10**9+7
    mod2 = 998244353
    n, k = map(int, input().split())
    ans=0
    ans2=0
    assert k**n <= 10**8
    for retu in product(range(k), repeat=n):
        if check2(list(retu)):
            #print(retu)
            ans+=1
            ans2+=sum(retu)
    print(ans,ans2)

if __name__ == '__main__':
    main()