#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>

using namespace std;


int main() {

    string S;
    cin >> S;
    int t, u;
    cin >> t >> u;

    set<int> ts;
    ts.insert(t);
    ts.insert(u);
    string res;
    for (int i = 0; i < S.size(); ++i) {
        if (ts.find(i) == ts.end()) {
            res += S[i];
        }
    }
    cout << res << endl;
    return 0;
}