#include <bits/stdc++.h> #define int long long using namespace std; const int N = 2e5 + 11; int T[N], C[N]; signed main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n, V, v; cin >> n >> V >> v; for(int i = 1; i <= n; i++){ char cc; cin >> cc >> T[i]; if(cc == '+') C[i] = 1; else C[i] = -1; } vector < int > vec; for(int i = 2; i <= n; i++){ vec.push_back(T[i] - T[i - 1]); } vec.push_back(1e10); sort(vec.begin(), vec.end()); int w = 0, ans = 0, av = 0; for(int d: vec){ int w = 0; for(int i = 1; i <= n; i++){ if(T[i] - T[i - 1] <= d) w = min(max(w + C[i], -V), 0ll); } if(w == v - V) ans = d; } if(ans == 1e10){ cout << "infinity"; return 0; } cout << ans << ' ' << V; } // subete no mono no owari wa sugu ni yattekuru