#include <bits/stdc++.h>
using namespace std;
using LL = long long;

#define fs first
#define sc second

const LL MOD = 1e9+7;
const double EPS = 1e-10;

template<class T>bool chmax(T &a, const T &b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>bool chmin(T &a, const T &b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a,make_vector<T>(b,ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) {
        is >> e;
    }
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    operator int() const { return to; }

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

template<typename T>
using Edges = vector<edge<T>>;
template<typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template<typename T>
using MatrixGraph = vector<vector<T>>;


using State = string::const_iterator;
class ParseError {};

string s;
vector<LL> table;

const LL INF = 1e7;

LL Num(State& begin) {
    LL ret = 0;
    while ('0' <= *begin && *begin <= '9') {
        ret *= 10;
        ret += *begin - '0';
        chmin(ret, INF);
        begin++;
    }
    return ret;
}

LL Molecules(State& begin);

LL Molecule(State& begin) {
    if ('A' <= *begin && *begin <= 'Z') {
        int id = begin - s.begin();
        begin++;
        return table[id] = 1;
    }
    else if ('0' <= *begin && *begin <= '9') {
        int id0 = begin - s.begin();
        LL n = Num(begin);
        if (*begin == '(') {
            int id1 = begin - s.begin();
            begin++;
            LL mol = Molecules(begin);
            begin++;

            table[id1] = mol;
            table[id0] = n * mol;
            chmin(table[id0], INF);
            return table[id0];
        }
        else if ('A' <= *begin && *begin <= 'Z') {
            int id1 = begin - s.begin();
            begin++;
            table[id1] = 1;
            table[id0] = n;
            chmin(table[id0], INF);
            return table[id0];
        }
    } else {
        throw ParseError();
    }
}

LL Molecules(State& begin) {
    LL total = 0;
    while (true) {
        try {
            total += Molecule(begin);
            chmin(total, INF);
        }
        catch (ParseError) {
            break;
        }
    }
    return total;
}

char Molecules(State& begin, int m);

char Molecule(State& begin, int m) {
    if ('A' <= *begin && *begin <= 'Z') {
        if (m == 0) {
            return *begin;
        }
        begin++;
    }
    else if ('0' <= *begin && *begin <= '9') {
        int id0 = begin - s.begin();
        LL n = Num(begin);
        if (*begin == '(') {
            int id1 = begin - s.begin();
            begin++;

            if (table[id0] > m) {
                return Molecules(begin, m % table[id1]);
            }
            LL mol = Molecules(begin);
            begin++;

        }
        else if ('A' <= *begin && *begin <= 'Z') {
            if (m < n) {
                return *begin;
            }
            begin++;
        }
    } else {
        throw ParseError();
    }
}

char Molecules(State& begin, int m) {
    while (true) {
        try {
            int id = begin - s.begin();
            if (table[id] > m) {
                return Molecule(begin, m);
            } else {
                Molecule(begin);
                m -= table[id];
            }
        }
        catch (ParseError) {
            break;
        }
    }
    return '0';
}

int main()
{
    while (true) {
        cin >> s;
        int n; cin >> n;
        if (s.size() == 1 && s[0] == '0' && n == 0) {
            break;
        }
        table.resize(s.size());
        State begin = s.begin();
        Molecules(begin);

        begin = s.begin();
        cout << Molecules(begin, n) << endl;
    }

    return 0;
}



Measured memory_bytes: 3148