stable_sort idea

/**
 *    author:  compounding
 *    created: 2024-12-25 16:12:44
 **/
#include <bits/stdc++.h>
using namespace std;
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define NeedForSpeed                  \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
#define int long long
#define all(x) (x).begin(), (x).end()
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vpi;
#define f first
#define s second
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define endl "\n"
const int mod = 1000000007;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }

void solve()
{
    int n, k;
    cin >> n >> k;
    vpi a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i].f;
        a[i].f %= k;
        if (!a[i].f)
        {
            a[i].f = k;
        }
        a[i].s = i;
    }
    // stable_sort to maintain the order of the elements (smaller index first)
    stable_sort(all(a), [&](pair<int, int> i, pair<int, int> j)
                { return i.f > j.f; });
    for (auto x : a)
    {
        cout << x.s + 1 << " ";
    }
    cout << endl;
}

signed main()
{
    NeedForSpeed;
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}