//#include #include #include #include #include #include #include #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower using namespace std; //using namespace atcoder; using ll = long long; #define all(A) A.begin(),A.end() using vll = vector; #define rep(i, n) for (long long i = 0; i < (long long)(n); i++) using Graph = vector>>; #define mp(A,B) make_pair(A,B) bool OK(ll N) { ll k = 0; for (ll i = 2; i * i <= N; i++) { while(N % i == 0) { k++; N /= i; } } if (N == 1)k--; return (k > 1); } set AN; void dfs(string S, string nowS) { ll N = S.size(); if (N == 1) { AN.insert(nowS + S); return; } else{ dfs(S.substr(0, N - 1), nowS + S[N - 1]); dfs(S.substr(1, N - 1), nowS + S[0]); } } int main() { string S; ll T, U; cin >> S>>T>>U; rep(i, S.size()) { if (i != T && i != U) { cout <