#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

ll my_gcd(ll a, ll b) {
    ll ret = 0;
    if (a < b) {
        swap(a, b);
    }
    if (b == 0) {
        ret = a;
    } else {
        ret = my_gcd(b, a % b);
    }
    return ret;
}

int main() {
    ll T;
    cin >> T;
    while (T--) {
        ll K, M, N;
        cin >> K >> M >> N;
        if (M == 1) {
            cout << "No" << endl;
            continue;
        }
        M--;
        ll g = my_gcd(K, M);
        ll one_loop = K / g;
        ll max_ans = (one_loop / 2) * g;
        if (N > max_ans) {
            cout << "No" << endl;
        } else {
            cout << "Yes" << endl;
            vector<ll> A(0);
            for (ll i = 0; i < g; i++) {
                ll now = i;
                for (ll j = 0; j < one_loop / 2; j++) {
                    A.push_back(now);
                    now = (now + 2 * M) % K;
                    if (A.size() >= N) {
                        break;
                    }
                }
            }
            for (ll i = 0; i < N; i++) {
                cout << A[i] + 1;
                if (i < N - 1) {
                    cout << " ";
                }
            }
            cout << endl;
        }
    }
}