#include <iostream> #include <algorithm> #include <string> using namespace std; int main(){ string s,b; int n,t; cin>>s>>n>>b; int l=s.size(); if(l>100) cout<<100<<endl; else cout<<l<<endl; s=s.insert(n-1,b); cout<<s<<endl; reverse(s.begin(),s.end()); t=s.find("x")+1; cout<<t; return 0; }