DSA01028 - LIỆT KÊ TỔ HỢP

//Made By Phuong Nam PROPTIT <3//
#pragma GCC Optimize("O3")
#include<bits/stdc++.h>
#include<string>
#include<vector>
#define alphaa "abcdefghijklmnopqrstuvwxyz"
#define ALPHAA "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define f(i,a,b) for(int i=a;i<=b;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
#define f0(i,n) for(int i=0;i<n;i++)
#define ff(i,b,a) for(int i=b;i>=a;i--)
#define el cout<<'\n'
#define fi first
#define se second
#define pb push_back
#define pk pop_back
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(s) s.begin(),s.end()
using namespace std;
typedef long long ll;
const int N=1e6+3;
const int MOD=1e9+7;
template<class X,class Y>
    void minimize(X &x,const Y &y) {
        if (x>y) x=y;
    }
template<class X,class Y>
    void maximize(X &x,const Y &y) {
        if (x<y) x=y;
    }
template<class T>
    T Abs(const T &x) {
        return (x<0?-x:x);
    }
int n,a[1005],k,c[1005],b[1005],m=0;
void xuly()
{
    cin>>n>>k;
    f1(i,n) cin>>a[i];
    set<int>s(a+1,a+n+1);
    for(auto i:s) b[++m]=i;
    f1(i,k) c[i]=i;
    while(1)
    {
        vi l;
        f1(i,k)
        {
            if(c[i]>m) break;
            if(b[c[i]]==b[c[i-1]]) break;
            l.pb(b[c[i]]);
        }
        if(l.size()==k)
        {
           for(auto i:l) cout<<i<<' ';
           el;
        }
        int i=k;
        while(i&&c[i]==s.size()-k+i) i--;
        if(i)
        {
            c[i]++;
            f(j,i+1,k) c[j]=c[j-1]+1;
        }
        else return;
    }
}
int main()
{
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  int t=1;
  //cin>>t;
  while(t--) xuly();
  return 0;
}
//-----YEU CODE HON CRUSH-----//