// Thunder tigr #include <bits/stdc++.h> #define ll long long #define YES cout<<"YES\n" #define NO cout<<"NO\n" #define rt return #define co continue #define nl endl #define F first #define S second #define str string #define all(x) x.begin(), x.end() #define allr(x) x.rbegin(), x.rend() #define sz size() #define pb push_back using namespace std; const ll N=1e6+9,inf=1e18,mod=1e9+7; ll a[N],pref[N]; char c[N]; ll n,m,k; vector <pair<int,char>> v; void Yel_abi(){ cin>>n>>m>>k; ll cntadd=0,cntmin=0; for(int i=0;i<n;i++){ cin>>c[i]>>a[i]; if(c[i]=='+'){ cntadd++; } else { cntmin++; } } sort(v.begin(), v.end()); if(cntadd==n and k>=n){ cout<<"infinity"; rt; } if(cntmin==n and k<=m-n){ cout<<"infinity"; rt; } if(m-cntmin+cntadd==k){ cout<<"infinity"; rt; } if(m-cntmin+cntadd<k){ ll cnt1=k-(m-cntmin+cntadd); for(int i=n-1;i>=0;i--){ if(v[i].S=='+'){ cnt1++; } else cnt1--; if(cnt1==k){ cout<<v[i].F-1<<" "<<0; } } cout<<0<<" "<<k; } else { ll cnt1=(m-cntmin+cntadd)-k; for(int i=n-1;i>=0;i--){ if(v[i].S=='+'){ cnt1++; } else cnt1--; if(cnt1==m-cntmin+cntadd){ cout<<v[i].F-1<<" "<<0; } } cout<<0<<" "<<k; } } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); int tt=1; while(tt--)Yel_abi(); }