#include <iostream>
#include <sstream>
#include <math.h>
#include <stack>
#include <set>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <vector>
using namespace std;

#define INF (1 << 30)
#define INFLL (1LL << 60)

int main() {
	string name;
	int s,t;
	cin >> name >> s >> t;
	if(s == t){
		name.erase(name.begin() + s);
	}else{
		name.erase(name.begin() + max(s,t));
		name.erase(name.begin() + min(s,t));
	}
	cout << name << endl;
	return 0;
}