#include <iostream>
#include <vector>
#include <map>
#include<string>
#include<queue>
#include<math.h>
#define ll long long
#define P pair<int,int>
#define lP pait<ll,ll>
using namespace std;
int main() {
    string s;
    int t,u;
    cin>>s>>t>>u;
    if(t==u){
        s.erase(t,1);
        cout<<s<<endl;
    }
    else{
        for (int i=0;i<s.size();i++){
            if(i!=t and i!=u) cout<<s[i];
        }
        cout<<endl;
    }
    return 0;
}