#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cstdlib>
#include<iomanip>
#include<string>
#include<algorithm>

using namespace std;

unsigned long long k,n,step=1,start=1;

unsigned long long a[1001],j=1;

int main()
{
	//freopen("sequence.in","r",stdin);
	//freopen("sequence.out","w",stdout);
	cin>>k>>n;
	a[1]=1;
	while(start<=n)
	{
		j*=k;
		a[++start]=j;
		step=start;
		int flag=start+step-2;
		while(start<=flag&&start<=n)
			a[++start]=a[start-step]+j;	
	}
	cout<<a[n]<<endl;
	return 0;
}

官方数据90分，求大佬指教