#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(ll i=0;i> N >> S >> T >> K; vector a(N); REP(i,N) cin >> a[i]; ll p=a[S-1],q=a[T-1]; sort(a.begin(),a.end()); if(p+q<=K) cout << 1 << endl; if(a[0]+p<=K && a[0]+q<=K) cout << 2 << endl; else cout << -1 << endl; return 0; }