Aita

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdint>
#include <numeric>

using namespace std;

typedef int64_t ll;

template <typename T>
T tabs(T x)
{
    return x < 0 ? -x : x;
}

template <typename C>
bool check(const C& a, int n, int k)
{
    for (int i = 1; i < n; ++i) {
        if (tabs(a[i]-a[i-1]) < k)
            return false;
    }
    return true;
}

int main()
{
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) a[i] = i+1;
    do {
        if (!check(a, n, k)) continue;
        for (auto x: a) {
            cout << x << ' ';
        }
        cout << endl;
        return 0;
    } while (next_permutation(a.begin(), a.end()));
    cout << "QAQ";
    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED