#include<bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define pb push_back #define inf 1e18+1e9 #define F first #define S second #define int long long #define mod (int)(1e9+7) #define maxn 1000100 #define pii pair<int,int> #define mod2 998244353 const long double eps=1e-9; ld dist(ld x1,ld y1,ld x2,ld y2) { return sqrt(abs(x1-x2)*abs(x1-x2)+abs(y1-y2)*abs(y1-y2)); } pair<char,int> a[maxn]; int c[maxn],d[maxn]; int n; int get(int t,int v1) { int pre=0; for (int i=1;i<=n;i++) { if (a[i].S-pre<t) { if (a[i].F=='-')v1--; else v1++; } pre=a[i].S; } return v1; } void solve () { int vm,v2; cin>>n>>vm>>v2; for (int i=1;i<=n;i++) cin>>a[i].F>>a[i].S; int mx=0,ans=0; for (int t=0;t<=a[n].S;t++) { int x=get(t,v2); // cout<<t<<" "<<x<<"\n"; if (mx>x) { mx=x; ans=t; } } if (mx==v2) { cout<<"infinity"; return; } cout<<ans<<" "<<mx; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); int t=1; // cin>>t; for (int ii=1;ii<=t;ii++) { solve(); // asd(); if (ii<t)cout<<"\n"; } }