Aita

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

int ans[200001];
int n,k;

char ok() {
    for (int i = 1; i < n; ++i) {
        if (abs(ans[i-1] - ans[i]) < k) return 0;
    }
    return 1;
}

void print() {
    for (int i = 0; i < n; ++i) {
        cout << ans[i] << " ";
    }
    cout << endl;
}

int main() {
    cin.sync_with_stdio(0);

    cin >> n >> k;
    if (k == 2) {
        int j = 1;
        for (int i = 0; j <= ceil(n/2.0); i+=2, ++j) {
            ans[i] = j;
        }
        for (int i = 1; j<=n; i+=2, ++j) {
            ans[i] = j;
        }
    } else if (n <= 10) {
        for (int i = 1; i<=n; ++i) {
            ans[i-1] = i;
        }
        while(next_permutation(ans,ans+n) && !ok()) {
        }
    }
    if (!ok()) {
        cout << "QAQ" << endl;
    } else {
        print();
    }
    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: ACCEPTED