#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--){
        int k, m, n;
        cin >> k >> m >> n;
        m--;
        if(2 * n > k){
            cout << "No\n";
            continue;
        }
        vector<pair<int,int>> p;
        p.emplace_back(1, 0);
        for(int i = m + 1; i <= 2 * m; i++){
            p.emplace_back(i, i - m);
        }
        vector<int> dp(k + 1, -(1 << 30)), par(k + 1, -1);
        dp[0] = 0;
        for(int i = 0; i < k; i++){
            for(auto &&[d, add] : p){
                if(i + d > k) break;
                if(dp[i + d] < dp[i] + add){
                    dp[i + d] = dp[i] + add;
                    par[i + d] = i;
                }
            }
        }
        if(dp[k] < n){
            cout << "No\n";
            continue;
        }
        vector<int> ans;
        int r = k;
        while(r != 0){
            int l = par[r];
            for(int i = l; i + m < r; i++){
                ans.emplace_back(i + 1);
            }
            r = l;
        }
        cout << "Yes\n";
        for(int i = 0; i < n; i++){
            cout << ans[i] << (i + 1 == n ? '\n' : ' ');
        }
    }
}