//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
ll f[55][15];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	f[0][0]=1;
	for(int i=0;i<55;i++)
		for(int j=1;j<=10;j++)
			for(int x=0;x<=i;x++)
				f[i][j]+=f[x][j-1];
	assert(f[50][10]>1e10);
	string s;
	cin>>s;
	if(s=="Alice")
	{
		ll X;
		cin>>X;
		string res;
		int cur=50;
		for(int i=0;i<10;i++)
		{
			int choose=-1;
			for(int x=0;x<=cur;x++)
				if(f[cur-x][9-i]<=X)
					X-=f[cur-x][9-i];
				else
				{
					choose=x;
					break;
				}
			for(int j=0;j<choose;j++)
				res+=(char)('0'+i);
			cur-=choose;
		}
		cout<<res<<endl;
	}
	else if(s=="Bob")
	{
		ll ans=0;
		int cur=50;
		string s;
		cin>>s;
		for(int i=0;i<10;i++)
		{
			int cnt=0;
			for(auto ch:s) if(ch==(i+'0'))
				cnt++;
			for(int j=0;j<cnt;j++)
				ans+=f[cur-j][9-i];
			cur-=cnt;
		}
		cout<<ans<<'\n';
	}
	return 0;
}