// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
std::ifstream terminal("/dev/tty");
#define PP cerr<<"\033[1;30mpause...\e[0m",terminal.ignore();
#else
#define debug(x...)
#define Debug(x...)
#define PP
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x),__VA_ARGS__})
#define cmax(x,...) x=max({(x),__VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define NaN (int)(0x8b88e1d0595d51d1)
#define double long double
#define int long long
#define uint unsigned long long
#define MAXN 200010

struct node {
    int l, r;
    node *lc, *rc;
    int maxv[2] = {0, 0}, maxl[2] = {0, 0}, maxr[2] = {0, 0}, maxlr[2] = {0, 0};
    int ans() {
        return max({maxv[0], maxv[1], maxl[0], maxl[1], maxr[0], maxr[1], maxlr[0], maxlr[1]});
    }
    void pt() {
        debug(l, r)
        debug(maxv[0], maxv[1])
        debug(maxl[0], maxl[1])
        debug(maxr[0], maxr[1])
        debug(maxlr[0], maxlr[1])
    }
};
node *root;
vector<node> hp;
int total = 0;

bool full(node *x, int c) {
    return x->maxlr[c] == (x->r - x->l + 1);
}

void update(node *x) {
    for (int i = 0; i < 2; ++i) {
        x->maxv[i] = max({x->lc->maxr[i] + x->rc->maxl[i], x->lc->maxv[i], x->rc->maxv[i]});
        x->maxl[i] = max({x->lc->maxl[i], full(x->lc, i) ? x->lc->maxlr[i] + x->rc->maxl[i] : 0});
        x->maxr[i] = max({x->rc->maxr[i], full(x->rc, i) ? x->lc->maxr[i] + x->rc->maxlr[i] : 0});
        x->maxlr[i] = full(x->lc, i) && full(x->rc, i) ? x->lc->maxlr[i] + x->rc->maxlr[i] : 0;
    }
}

node *build(int l, int r, string &s) {
    node *x = &hp[total++];
    x->l = l, x->r = r;
    if (l == r) {
        if (s[l] == '0') x->maxlr[0] = 1;
        else x->maxlr[1] = 1;
        return x;
    }
    int mid = (l + r) >> 1;
    x->lc = build(l, mid, s);
    x->rc = build(mid + 1, r, s);
    update(x);
    return x;
}

void modify(node *x, int p) {
    if (x->l == x->r) {
        if (x->maxlr[0] == 1) x->maxlr[1] = 1, x->maxlr[0] = 0;
        else x->maxlr[0] = 1, x->maxlr[1] = 0;
        return;
    }
    int mid = (x->l + x->r) >> 1;
    if (p <= mid) modify(x->lc, p);
    else modify(x->rc, p);
    update(x);
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    string s; cin >> s;
    hp.resize(2*sz(s) + 10);
    root = build(0, sz(s) - 1, s);
    int n; cin >> n;
    while (n--) {
        int p; cin >> p;
        modify(root, p - 1);
        cout << root->ans() << ' ';
    }
    cout << endl;

    return 0;
}