#include <string>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <iomanip>
#include <ctime>
#include <valarray>
#include <iostream>
#include <sstream>
#include <fstream>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MEM(a,b) memset((a),(b),sizeof(a))
const LL INF = 1e9 + 7;
const int N = 2e5 + 10;

int main()
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	int n, s, t, k;
	scanf("%d%d%d%d", &n, &s, &t, &k);
	vector<int> v(n);
	for (auto& x : v) scanf("%d", &x);
	int minv = *min_element(v.begin(), v.end());
	s = v[s - 1];
	t = v[t - 1];
	if (s + t <= k) puts("1");
	else if (s + minv <= k && t + minv <= k) puts("2");
	else puts("-1");
	return 0;
}