#include "bartender.h"
#include<bits/stdc++.h>
using namespace std;
static __int128 fact[31];
__int128 P2I(std::vector<int> R)
{
if(R.size() == 0) return 0;
__int128 ans = R[0]*fact[R.size()-1];
vector<int> R2;
for(int i=1; i<(int)R.size(); ++i)
{
if(R[i] > R[0]) R2.push_back(R[i]-1);
else R2.push_back(R[i]);
}
return ans + P2I(R2);
}
vector<int> I2D(int K, int N, __int128 x)
{
vector<int> V(N);
for(int i=N-1; i>=0; --i)
{
V[i] = x%K;
x /= K;
}
return V;
}
static void Init(int N)
{
fact[0] = 1;
for(int i=1; i<=N; ++i)
fact[i] = i*fact[i-1];
}
std::vector<int> BlendWines(int K, std::vector<int> R){
Init(R.size());
for(auto&x:R) --x;
vector<int> A = I2D(K, R.size(), P2I(R));
for(auto&x:A)++x;
return A;
}
#include "taster.h"
#include<bits/stdc++.h>
using namespace std;
static __int128 fact[31];
vector<int> I2P(int N, __int128 v)
{
if(N == 0)
{
vector<int> R2;
return R2;
}
vector<int> R2 = I2P(N-1, v%fact[N-1]);
vector<int> R; R.push_back(v/fact[N-1]);
for(int i=0; i<N-1; ++i)
{
if(R2[i] >= R[0]) R.push_back(R2[i]+1);
else R.push_back(R2[i]);
}
return R;
}
__int128 D2I(int K, vector<int> V)
{
__int128 ans = 0;
for(int i=0; i<(int)V.size(); ++i)
ans = ans*K+V[i];
return ans;
}
static void Init(int N)
{
fact[0] = 1;
for(int i=1; i<=N; ++i)
fact[i] = i*fact[i-1];
}
std::vector<int> SortWines(int K, std::vector<int> A) {
Init(A.size());
for(auto&x:A) --x;
vector<int> R = I2P(A.size(), D2I(K, A));
for(auto&x:R)++x;
return R;
}
