#include <vector>
#include <string>
#include <algorithm>
using namespace std;
class IncrementingSequence{
public :
string canItBeDone( int k, vector < int > A) {
sort( A.begin ( ) , A.end ( ) ) ;
int N = A.size ( ) ;
for ( int i= 1 ; i<= N; i++ ) {
if ( A[ i- 1 ] == i ) continue ;
if ( A[ i- 1 ] > i ) return "IMPOSSIBLE" ;
A[ i- 1 ] + = k;
sort( A.begin ( ) , A.end ( ) ) ;
i-- ;
}
return "POSSIBLE" ;
}
} ;
I2luY2x1ZGUgPHZlY3Rvcj4KI2luY2x1ZGUgPHN0cmluZz4KI2luY2x1ZGUgPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKY2xhc3MgSW5jcmVtZW50aW5nU2VxdWVuY2V7CnB1YmxpYzoKICBzdHJpbmcgY2FuSXRCZURvbmUoaW50IGssIHZlY3RvciA8aW50PiBBKXsKICAgIHNvcnQoIEEuYmVnaW4oKSwgQS5lbmQoKSApOwogICAgaW50IE4gPSBBLnNpemUoKTsKICAgIGZvciggaW50IGk9MTsgaTw9TjsgaSsrICl7CiAgICAgIGlmKCBBW2ktMV0gPT0gaSApIGNvbnRpbnVlOwogICAgICBpZiggQVtpLTFdID4gaSApIHJldHVybiAiSU1QT1NTSUJMRSI7CiAgICAgIEFbaS0xXSArPSBrOwogICAgICBzb3J0KCBBLmJlZ2luKCksIEEuZW5kKCkgKTsKICAgICAgaS0tOwogICAgfQogICAgcmV0dXJuICJQT1NTSUJMRSI7CiAgfQp9Ow==