/*#define _FORTIFY_SOURCE 0
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")*/
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 1e6;

#define int long long

string b[N];
pair <int, int> a[N];

signed main()
{
    ios_base::sync_with_stdio(0);
    int n, p, c;
    c--; p--;
    cin >> n >> p >> c;
    p = n - p;
    for (int i = 0; i < n; i++) {
		cin >> a[i].first;
		a[i].second = i;
    }
    sort(a, a + n);
    int i1 = 0;
    int etalon = a[p].first;
    for (int i = 0; i < n; i++) {
		if (a[i].first + c < etalon ) {
			b[a[i].second] = "Fail";
		}
		else {
			i1 = i;
			break;
		}
    }
    a[n].first = 1e17 - 1;
    etalon = a[i1].first + c;
    for (int  i = i1; i < n; i++) {
		if (etalon > a[i].first) {
			b[a[i].second] = "Short";

		}
		else {
			i1 = i;
			break;
		}
		if (i + 1 == n) {
			i1 = n;
		}
    }
    for (int i = i1; i < n; i++) {
		b[a[i].second] = "Pass";
    }
    for (int i = 0; i < n; i++) {
			cout << b[i] << "\n";
    }
}