#include<bits/stdc++.h>
#define f1(i, n) for(ll i=1;i<=n;++i)
#define f0(i, n) for(ll i=0;i<n;++i)
#define ull unsigned long long
#define ll long long
#define rev(a) reverse(a.begin(),a.end())
#define all(x) x.begin(),x.end()
#define so(A, n) sort(A+1, A+n+1)
using namespace std;
const int maxn = 2e5 + 1;
// ll A[maxn];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s;
int n, pos;
cin >> s >> n >> pos;
int cnt = 0;
for (int i = 0; i < s.size() && cnt < pos; ++i) {
if (s[i] == '1') {
cnt++;
}
else {
int luythua = 1, motcaigiday = s[i] - 48;
while (cnt + motcaigiday < pos && luythua <= n) {
motcaigiday = pow(s[i] - 48, luythua);
++luythua;
}
if (cnt + motcaigiday >= pos) {
cout << s[i];
return 0;
}
else {
cnt += motcaigiday;
}
}
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KI2RlZmluZSBmMShpLCBuKSBmb3IobGwgaT0xO2k8PW47KytpKQojZGVmaW5lIGYwKGksIG4pIGZvcihsbCBpPTA7aTxuOysraSkKI2RlZmluZSB1bGwgdW5zaWduZWQgbG9uZyBsb25nCiNkZWZpbmUgbGwgbG9uZyBsb25nCiNkZWZpbmUgcmV2KGEpIHJldmVyc2UoYS5iZWdpbigpLGEuZW5kKCkpCiNkZWZpbmUgYWxsKHgpIHguYmVnaW4oKSx4LmVuZCgpCiNkZWZpbmUgc28oQSwgbikgc29ydChBKzEsIEErbisxKQp1c2luZyBuYW1lc3BhY2Ugc3RkOwpjb25zdCBpbnQgbWF4biA9IDJlNSArIDE7Ci8vIGxsIEFbbWF4bl07CmludCBtYWluKCkKewoJaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbygwKTsgY2luLnRpZSgwKTsgY291dC50aWUoMCk7CglzdHJpbmcgczsKCWludCBuLCBwb3M7CgljaW4gPj4gcyA+PiBuID4+IHBvczsKCWludCBjbnQgPSAwOwoJZm9yIChpbnQgaSA9IDA7IGkgPCBzLnNpemUoKSAmJiBjbnQgPCBwb3M7ICsraSkgewoJCWlmIChzW2ldID09ICcxJykgewoJCQljbnQrKzsKCQl9CgkJZWxzZSB7CgkJCWludCBsdXl0aHVhID0gMSwgbW90Y2FpZ2lkYXkgPSBzW2ldIC0gNDg7CgkJCXdoaWxlIChjbnQgKyBtb3RjYWlnaWRheSA8IHBvcyAmJiBsdXl0aHVhIDw9IG4pIHsKCQkJCW1vdGNhaWdpZGF5ID0gcG93KHNbaV0gLSA0OCwgbHV5dGh1YSk7CgkJCQkrK2x1eXRodWE7CgkJCX0KCQkJaWYgKGNudCArIG1vdGNhaWdpZGF5ID49IHBvcykgewoJCQkJY291dCA8PCBzW2ldOwoJCQkJcmV0dXJuIDA7CgkJCX0KCQkJZWxzZSB7CgkJCQljbnQgKz0gbW90Y2FpZ2lkYXk7CgkJCX0KCQl9Cgl9CgoKCXJldHVybiAwOwp9Cgo=