#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[100][100];
string ans;
void dfs(int x, int y, ll rest) {
	if (x == 0) return;
	if (dp[x - 1][y] >= rest) {
		ans += '0';
		dfs(x - 1, y, rest);
	}
	else {
		rest -= dp[x - 1][y];
		ans += '1';
		dfs(x - 1, y - 1, rest);
	}
}
int main() {
	for (int i = 0; i <= 60; i++) {
		dp[i][0] = 1;
		for (int j = 1; j <= i; j++) dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1];
	}
	string tag;
	cin >> tag;
	if (tag == "Alice") {
		ll x;
		cin >> x;
		dfs(59, 9, x + 1);
		int cur = '0';
		string out;
		for (auto i : ans) {
			if (i == '0') out += cur;
			else cur++;
		}
		cout << out << endl;
	}
	else {
		string s;
		cin >> s;
		int cnt[10] = {0};
		for (auto i : s) cnt[i - '0']++;
		s = "";
		for (int i = 0; i < 10; i++) {
			while (cnt[i]--) s += '0';
			s += '1';
		}
		s.pop_back();
		int x = 59, y = 9;
		ll ans = 0;
		for (auto i : s) {
			x--;
			if (i == '1') {
				ans += dp[x][y];
				y--;
			}
		}
		cout << ans << endl;
	}
}