#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;

int main(){
    ll N,K;cin>>N>>K;
    ll cnt=N/K;
    ll cost=N*(N+1)/2;
    if(cost%K!=0){
        cout<<"No"<<endl;
        return 0;
    }
    cost/=K;
    cout<<"Yes"<<endl;
    vector<bool> used(N+1,false);
    REP(i,K){
        if(cnt%2==0) REP(j,cnt/2){
            cout<<(N/K)*i+j+1<<" "<<N-(N/K)*i-j;
            if(j==cnt/2-1) cout<<endl;
            else cout<<" ";
        }
        else{
            ll sum=0;
            REP(j,cnt/2){
                if(i<=K/2){
                    int l=(cnt/2+1)*i+j+1,r=N-(cnt/2)*i-j;
                    while(used[l]) l++;
                    sum+=l+r;
                    cout<<l<<" "<<r;
                    if(j==cnt/2-1){
                        cout<<" "<<cost-sum<<endl;
                        used[cost-sum]=true;
                    }
                    else cout<<" ";
                    used[l]=true;
                    used[r]=true;
                }
                else{
                    int l=(cnt/2+1)*(i-K/2)+j,r=N-(cnt/2)*i-j;
                    while(used[l]) l++;
                    sum+=l+r;
                    cout<<l<<" "<<r;
                    if(j==cnt/2-1){
                        cout<<" "<<cost-sum<<endl;
                        used[cost-sum]=true;
                    }
                    else cout<<" ";
                    used[l]=true;
                    used[r]=true;
                }
            }
        }
    }
}