정수 m이 주어질 때, s단 n차원 계단 피라미드의 블록 수가 m이 되는 n(3 이상)과 s를 찾고, 없으면 impossible을 출력한다.
어려움8수학이분 탐색정수론완전 탐색아직 제출이 없습니다시간 제한2초메모리 제한512 MBOnce again the time dawns to demonstrate the sheer power of the Illuminati. To do so, it was decided to build an n-dimensional hyper-step pyramid using n-dimensional blocks:
To prove their might even further the Illuminati leaders have decided to add two more requirements:

Figure H.1: A 3-dimensional hyper pyramid with 3 steps consisting of 14 blocks in total.
The input consists of:
If a hyper-step pyramid matching all the requirements exists, output a single line with two integers n and s, the dimension of the pyramid and its number of steps. If none exists, output impossible. If multiple solutions exist, any will be accepted.