Problem: There are N oases on a number line. The coordinate of the i-th oases from the left is x_i.

Camel hopes to visit all these oases. Initially, the volume of the hump on his back is V. When the volume of the hump is v, water of volume at most v can be stored. Water is only supplied at oases. He can get as much water as he can store at a oasis, and the same oasis can be used any number of times.

Camel can travel on the line by either walking or jumping:

* Walking over a distance of d costs water of volume d from the hump. A walk that leads to a negative amount of stored water cannot be done.
* Let v be the amount of water stored at the moment. When v>0, Camel can jump to any point on the line of his choice. After this move, the volume of the hump becomes v/2 (rounded down to the nearest integer), and the amount of stored water becomes 0.



For each of the oases, determine whether it is possible to start from that oasis and visit all the oases.

Constraints

* 2 ≤ N,V ≤ 2 × 10^5
* -10^9 ≤ x_1 < x_2 < ... < x_N ≤ 10^9
* V and x_i are all integers.

Input

Input is given from Standard Input in the following format:


N V
x_1 x_2 ... x_{N}


Output

Print N lines. The i-th line should contain `Possible` if it is possible to start from the i-th oasis and visit all the oases, and `Impossible` otherwise.

Examples

Input

3 2
1 3 6


Output

Possible
Possible
Possible


Input

7 2
-10 -4 -2 0 2 4 10


Output

Impossible
Possible
Possible
Possible
Possible
Possible
Impossible


Input

16 19
-49 -48 -33 -30 -21 -14 0 15 19 23 44 52 80 81 82 84


Output

Possible
Possible
Possible
Possible
Possible
Possible
Possible
Possible
Possible
Possible
Possible
Possible
Impossible
Impossible
Impossible
Impossible

Solution (in CPP):

Solution:
#include<cstdio>
#include<algorithm>
#define N_ 201000
using namespace std;
int n, V, w[N_], m;
int C[20][N_], L[20], PP[30];
int BE[20][N_], ED[20][N_];
int D1[1048576], D2[1048576];
int main(){
    int i, j;
    scanf("%d%d",&n,&V);
    for(i=1;i<=n;i++)scanf("%d",&w[i]);
    L[0] = V;
    for(i=1;;i++){
        L[i]=L[i-1]/2;
        if(!L[i])break;
    }
    m = i+1;
    for(i=0;i<m;i++){
        int c = 0;
        for(j=1;j<=n;j++){
            if(j==1 || w[j]-w[j-1] > L[i])c++;
            C[i][j] = c;
        }
        for(j=1;j<=c;j++)BE[i][j]=1e9,ED[i][j]=0;
        for(j=1;j<=n;j++){
            BE[i][C[i][j]] = min(BE[i][C[i][j]],j);
            ED[i][C[i][j]] = max(ED[i][C[i][j]],j);
        }
    }
    if(C[0][n] > m){
        for(i=1;i<=n;i++)puts("Impossible");
        return 0;
    }
    for(i=0;i<(1<<m);i++)D2[i] = n+1;
    for(i=0;i<(1<<m);i++){
        for(j=0;j<m;j++){
            if(i&(1<<j))continue;
            if(D1[i]!=n)D1[i|(1<<j)] = max(D1[i|(1<<j)], ED[j][C[j][D1[i]+1]]);
            else D1[i|(1<<j)] = n;
            if(D2[i]!=1)D2[i|(1<<j)] = min(D2[i|(1<<j)], BE[j][C[j][D2[i]-1]]);
            else D2[i] = 1;
        }
    }
    for(i=1;i<=C[0][n];i++){
        int b = BE[0][i], e = ED[0][i];
        for(j=0;j<(1<<m);j++){
            if(j&1)continue;
            int t = (1<<m) - 2 - j;
            if(D1[j] + 1 >= b && D2[t] - 1 <= e)PP[i] = 1;
        }
    }
    for(i=1;i<=n;i++){
        if(PP[C[0][i]])puts("Possible");
        else puts("Impossible");
    }
}