void
band_den_bin(int *n, int *nb, double *d, double *x, int *cnt)
{
int i, j, ii, jj, iij, nn = *n;
double xmin, xmax, rang, dd;
for (i = 0; i < *nb; i++) cnt[i] = 0;
xmin = xmax = x[0];
for (i = 1; i < nn; i++) {
xmin = min(xmin, x[i]);
xmax = max(xmax, x[i]);
}
rang = (xmax - xmin) * 1.01;
*d = dd = rang / (*nb);
for (i = 1; i < nn; i++) {
ii = x[i] / dd;
for (j = 0; j < i; j++) {
jj = x[j] / dd;
iij = abs9((ii - jj));
cnt[iij]++;
}
}
}
int main() {
int pos, out, n, i, z;
pos = 1000;
scanf("%d%d", &n, &out);
out += 1000;
for (i=0; i<n; ++i) {
scanf("%d", &z);
L[z+1000] = true;
}
i = right(pos, out);
if (i == out)
printf("%d ", abs9(pos-out));
else {
int j = left(i-1, out);
if (j == out)
printf("%d ", abs9(pos-i)+abs9(i-out));
else {
printf("Impossible\n");
return 0;
}
}
i = left(pos, out);
if (i == out)
printf("%d\n", abs9(pos-i));
else {
int j = right(i+1, out);
if (j == out)
printf("%d\n", abs9(pos-i)+abs9(i-j));
else {
printf("Impossible\n");
return 0;
}
}
return 0;
}
