1860. 진기의 최고급 붕어빵(D3)

#include <stdio.h>
#include <algorithm>
using namespace std;
int main(void)
{    
    setbuf(stdout, NULL);
    int test_case;
    scanf("%d", &test_case);
    for (int z = 1; z<= test_case; z++) {
        
        int n, m, k;
        scanf("%d%d%d", &n,&m,&k);
        int a[101] = { 0, };
        for (int i = 0; i < 101; i++)
            a[i] = 2e9;
        for(int i=0;i<n;i++)
            scanf("%d", &a[i]);
 
        sort(a, a + 100);
        int cnt = 0;
        printf("#%d ", z);
        if (a[0] < m) {
            printf("Impossible\n");
            continue;
        }
        int check = 0;
        for (int i = 0, j = 0; j < n; i = i + 1)
        {
            if (i != 0 && i%m == 0)
                cnt += k;
 
            for (; a[j] <= i;) {
                cnt--;
                j++;
            }
            if (cnt < 0) {
                check = -1;
                break;
            }
        }
        if (check == -1)
            printf("Impossible\n");
        else
            printf("Possible\n");
    }
    return 0;
}