LumberUolevi

/*
    Road to Freedom
*/

#include <bits/stdc++.h>

using namespace std;

#define ll             long long int
#define F              first
#define S              second
#define pb             push_back
#define si             set <int>
#define vi             vector <int>
#define pii            pair <int, int>
#define vpi            vector <pii>
#define vpp            vector <pair<int, pii>>
#define mii            map <int, int>
#define mpi            map <pii, int>
#define spi            set <pii>
#define endl           "\n"
#define sz(x)          ((int) x.size())
#define all(p)         p.begin(), p.end()
#define double         long double
#define que_max        priority_queue <int>
#define que_min        priority_queue <int, vi, greater<int>>
#define bug(...)       __f (#__VA_ARGS__, __VA_ARGS__)
#define print(a)       for(auto x : a) cout << x << " ";
#define print1(a)      for(auto x : a) cout << x.F << " " << x.S << endl
#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl
#define REP(i,a,b)     for (int i = a; i <= b; i++)

inline int power(int a, int b)
{
    int x = 1;
    while (b)
    {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}

template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
    const char* comma = strchr (names + 1, ',');
    cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
}

const int N = 200005;

int mod = 998244353;


void solve() {
    /*
        should be a greedy problem, pick n - i and i into a truck
    */
    int n,k; cin >> n >> k;
    vector<int> ans;
    if(n == 1) {
        cout << n;
        return;
    }
    int l = 1;
    
    ans.push_back(n);
    k--;
    int r = n - 1;
    while(l < r && k){
        ans.push_back(r); k--; r--;
        if(k) {
            ans.push_back(l);
            l++;
            k--;
        }
    }

    if(k) ans.push_back(l);

    sort(ans.begin(), ans.end());
    print(ans);

}

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #ifndef ONLINE_JUDGE
        freopen("input.txt",  "r",  stdin);
        freopen("output.txt", "w", stdout);
    #endif

    clock_t z = clock();

    int t = 1;
    // cin >> t;
    while (t--) solve();

    cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);

    return 0;
}

Test 1

Verdict: ACCEPTED

Run Time : 3.6e-05

Test 2

Verdict: ACCEPTED

Run Time : 3.8e-05

Test 3

Verdict: ACCEPTED

Run Time : 3.8e-05

Test 4

Verdict: WRONG ANSWER

Run Time : 3.9e-05

Test 5

Verdict: ACCEPTED

Run Time : 4.7e-05

Test 6

Verdict: ACCEPTED

Run Time : 3.7e-05

Test 7

Verdict: ACCEPTED

Run Time : 3.8e-05

Test 8

Verdict: ACCEPTED

Run Time : 3.8e-05

Test 9

Verdict: ACCEPTED

Run Time : 4e-05

Test 10

Verdict: ACCEPTED

Run Time : 3.7e-05

Test 11

Verdict: WRONG ANSWER

Run Time : 3.9e-05

Test 12

Verdict: ACCEPTED

Run Time : 3.9e-05

Test 13

Verdict: ACCEPTED

Run Time : 3.9e-05

Test 14

Verdict: WRONG ANSWER

Run Time : 3.9e-05

Test 15

Verdict: ACCEPTED

Run Time : 4.4e-05

Test 16

Verdict: ACCEPTED

Run Time : 3.7e-05

Test 17

Verdict: WRONG ANSWER

Run Time : 4e-05

Test 18

Verdict: ACCEPTED

Run Time : 3.7e-05

Test 19

Verdict: ACCEPTED

Run Time : 4e-05

Test 20

Verdict: ACCEPTED

Run Time : 4e-05

Test 21

Verdict: ACCEPTED

Run Time : 4.1e-05

Test 22

Verdict: ACCEPTED

Run Time : 3.9e-05

Test 23

Verdict: WRONG ANSWER

Run Time : 4e-05

Test 24

Verdict: ACCEPTED

Run Time : 4e-05

Test 25

Verdict: ACCEPTED

Run Time : 4.2e-05

Test 26

Verdict: ACCEPTED

Run Time : 3.8e-05

Test 27

Verdict: ACCEPTED

Run Time : 4.2e-05

Test 28

Verdict: WRONG ANSWER

Run Time : 3.7e-05

Test 29

Verdict: WRONG ANSWER

Run Time : 4.2e-05

Test 30

Verdict: ACCEPTED

Run Time : 3.8e-05

Test 31

Verdict: WRONG ANSWER

Run Time : 4.9e-05

Test 32

Verdict: WRONG ANSWER

Run Time : 4.9e-05

Test 33

Verdict: WRONG ANSWER

Run Time : 4.8e-05

Test 34

Verdict: WRONG ANSWER

Run Time : 5.3e-05

Test 35

Verdict: WRONG ANSWER

Run Time : 6.1e-05

Test 36

Verdict: WRONG ANSWER

Run Time : 5.6e-05

Test 37

Verdict: WRONG ANSWER

Run Time : 6e-05

Test 38

Verdict: WRONG ANSWER

Run Time : 3.9e-05

Test 39

Verdict: ACCEPTED

Run Time : 6e-05

Test 40

Verdict: ACCEPTED

Run Time : 3.8e-05

Test 41

Verdict: ACCEPTED

Run Time : 0.00011

Test 42

Verdict: WRONG ANSWER

Run Time : 0.000135

Test 43

Verdict: WRONG ANSWER

Run Time : 0.000189

Test 44

Verdict: ACCEPTED

Run Time : 0.00017

Test 45

Verdict: ACCEPTED

Run Time : 0.000174

Test 46

Verdict: WRONG ANSWER

Run Time : 0.000167

Test 47

Verdict: ACCEPTED

Run Time : 0.000661

Test 48

Verdict: ACCEPTED

Run Time : 6.8e-05

Test 49

Verdict: ACCEPTED

Run Time : 0.000733

Test 50

Verdict: WRONG ANSWER

Run Time : 5.2e-05

Test 51

Verdict: WRONG ANSWER

Run Time : 0.00321

Test 52

Verdict: ACCEPTED

Run Time : 0.001558

Test 53

Verdict: WRONG ANSWER

Run Time : 0.001183

Test 54

Verdict: ACCEPTED

Run Time : 0.000835

Test 55

Verdict: WRONG ANSWER

Run Time : 0.002341

Test 56

Verdict: WRONG ANSWER

Run Time : 0.000902

Test 57

Verdict: ACCEPTED

Run Time : 0.004807

Test 58

Verdict: ACCEPTED

Run Time : 0.000576

Test 59

Verdict: WRONG ANSWER

Run Time : 0.009007

Test 60

Verdict: WRONG ANSWER

Run Time : 0.000158

Test 61

Verdict: ACCEPTED

Run Time : 0.00627

Test 62

Verdict: ACCEPTED

Run Time : 0.004801

Test 63

Verdict: ACCEPTED

Run Time : 0.005083