1770B - Koxia and Permutation - CodeForces Solution

#include <bits/stdc++.h>
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define endl '\n'
const int N = 1e6 + 9, MOD = 1000000007;
typedef long long ll;
using namespace std;
void solve()
{
    int n, m;
    cin >> n >> m;
    int r = n, l = 1;
    while (l < r)
    {
        cout << r << " " << l << " ";
        l++, r--;
    }
    if (n % 2)
        cout << l;
    cout << "\n";
}
int main(void)
{
    IO;
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}