Submission #7909220

---

Source Code Expand

#include<bits/stdc++.h>
typedef long long ll;
ll gi(){
	ll x=0,f=1;
	char ch=getchar();
	while(!isdigit(ch))f^=ch=='-',ch=getchar();
	while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
	return f?x:-x;
}
int A[100010];
int main(){
#ifdef XZZSB
	freopen("in.in","r",stdin);
	freopen("out.out","w",stdout);
#endif
	int n=gi(),K=gi(),qaq=0,p;
	for(int i=1;i<=n;++i){
		A[i]=gi();
		if(i&&A[i]+A[i-1]>qaq)qaq=A[i]+A[i-1],p=i-1;
	}
	if(qaq<K)return puts("Impossible"),0;
	puts("Possible");
	for(int i=1;i<p;++i)printf("%d\n",i);
	for(int i=n-1;i>=p;--i)printf("%d\n",i);
	return 0;
}

Submission Info

Judge Result