/*
#include <stdlib.h>
int main()
{
printf("Hello world!\n");
return 0;
}
*/
/*
#include <stdio.h>
long long int f(long long int n,long long int k)
{
if(k==0) return 1;
long long int t = f(n,k/2);
if(k%2!=0)
return n*t*t;
else if(k%2==0)S
u
p
e
r
S
u
m
(
k
,
n
)
=
S
u
p
e
r
S
u
m
(
k
−
1
,
1
)
+
S
u
p
e
r
S
u
m
(
k
−
1
,
2
)
+
.
.
.
+
S
u
p
e
r
S
u
m
(
k
−
1
,
n
)
return t*t;
https://codeup.kr/upload/201312/image/pascal.jpg
https://codeup.kr/upload/201312/image/pascal.jpghttps://codeup.kr/upload/201312/image/pascal.jpg
int main()
{
long long int n,k;
scanf("%lld %lld",&n,&k);
printf("%lld",f(n,k));
return 0;
}
*/
#include <stdio.h>
int memo[15][15]={0};
int f(int k,int n)
{
int t;
if(n==1) return 1;
f(k,n-1)-1=memo[k][n];
return memo[k][n]
}
int main()
{
int n,k;
while( scanf("%d %d", &k, &n) != EOF )
printf("%d\n", f(k, n));
return 0;
}