#include <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"

using namespace std;

namespace First
{

using i128 = unsigned long long; // not int128
const i128 LIM = (i128)-1;
const int SZ = 16;
struct longint
{
    i128 c[SZ]{};
};

longint add(longint a, longint b)
{
    int c = 0;
    longint res;
    for (int i = 0; i < SZ; i++)
    {
        if (!c)
        {
            i128 t = ~a.c[i];
            if (b.c[i] > t) c = 1;
            else c = 0;
            res.c[i] = a.c[i] + b.c[i];
        }
        else if (a.c[i] == LIM && b.c[i] == LIM) c = 1, res.c[i] = LIM;
        else
        {
            if (a.c[i] != LIM) a.c[i]++;
            else b.c[i]++;
            i128 t = ~a.c[i];
            if (b.c[i] > t) c = 1;
            else c = 0;
            res.c[i] = a.c[i] + b.c[i];
        }
    }
    return res;
}

longint make(i128 b)
{
    longint a;
    a.c[0] = b;
    return a;
}

longint sub(longint a, longint b)
{
    for (int i = 0; i < SZ; i++) b.c[i] = ~b.c[i];
    return add(a, add(b, make(1)));
}

bool cmp(longint a, longint b)
{
    // a < b
    for (int i = SZ - 1; i >= 0; i--)
    {
        if (a.c[i] < b.c[i]) return true;
        if (a.c[i] > b.c[i]) return false;
    }
    return false;
}

void output(i128 x)
{
    if (x > 9) output(x / 10);
    cout << int(x % 10);
}

void output(longint x)
{
    for (int i = SZ - 1; i >= 0; i--) output(x.c[i]), cout << ' ';
}

const int N = 320;

longint f[N][N];

void pre()
{
	if (f[0][0].c[0]) return;			
    f[0][0] = make(1);
    for (int i = 1; i < N; i++)
        for (int j = 0; j < N; j++)
            for (int k = 0; k <= j; k++)
                f[i][j] = add(f[i][j], f[i - 1][j - k]);
}


}

void encode(int n, int *p)
{
	using namespace First;
    pre();
    
    vector<int> msg;
    for (int i = 0; i < n; i++) msg.push_back(p[i]);
    
    longint x;
    while (msg.size() < 64) msg.push_back(0);
    for (int i = 0; i < 8; i++)
    {
        i128 cur = 0;
        for (int j = 7; j >= 0; j--) cur = (cur << 8) | msg[i * 8 + j];
        x.c[i] = cur;
    }
    int i = 1;
    while (cmp(f[256][i], x)) i++;
    vector<int> sol;
    for (int k = 256; k >= 1; k--)
    {
        int j = 0;
        longint sum;
        // cout << k << ' ' << i << ':'; output(x); cout << endl;
        while (!cmp(x, add(sum, f[k - 1][i - j]))) assert(j <= i), sum = add(sum, f[k - 1][i - j]), j++;
        i -= j, x = sub(x, sum);
        while (j--) sol.push_back(k - 1);
    }
    assert(sol.size() <= 5 * n);
    for (int x : sol) send(x);
}

#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"

using namespace std;

namespace Second
{
	
using i128 = unsigned long long; // not int128
const i128 LIM = (i128)-1;
const int SZ = 16;
struct longint
{
    i128 c[SZ]{};
};

longint add(longint a, longint b)
{
    int c = 0;
    longint res;
    for (int i = 0; i < SZ; i++)
    {
        if (!c)
        {
            i128 t = ~a.c[i];
            if (b.c[i] > t) c = 1;
            else c = 0;
            res.c[i] = a.c[i] + b.c[i];
        }
        else if (a.c[i] == LIM && b.c[i] == LIM) c = 1, res.c[i] = LIM;
        else
        {
            if (a.c[i] != LIM) a.c[i]++;
            else b.c[i]++;
            i128 t = ~a.c[i];
            if (b.c[i] > t) c = 1;
            else c = 0;
            res.c[i] = a.c[i] + b.c[i];
        }
    }
    return res;
}

longint make(i128 b)
{
    longint a;
    a.c[0] = b;
    return a;
}

longint sub(longint a, longint b)
{
    for (int i = 0; i < SZ; i++) b.c[i] = ~b.c[i];
    return add(a, add(b, make(1)));
}

bool cmp(longint a, longint b)
{
    // a < b
    for (int i = SZ - 1; i >= 0; i--)
    {
        if (a.c[i] < b.c[i]) return true;
        if (a.c[i] > b.c[i]) return false;
    }
    return false;
}

void output(i128 x)
{
    if (x > 9) output(x / 10);
    cout << int(x % 10);
}

void output(longint x)
{
    for (int i = SZ - 1; i >= 0; i--) output(x.c[i]), cout << ' ';
}

const int N = 320;

longint f[N][N];

void pre()
{
	if (f[0][0].c[0]) return;				
    f[0][0] = make(1);
    for (int i = 1; i < N; i++)
        for (int j = 0; j < N; j++)
            for (int k = 0; k <= j; k++)
                f[i][j] = add(f[i][j], f[i - 1][j - k]);
}

}

void decode(int n, int l, int *p)
{
	using namespace Second;
    pre();
    
    vector<int> msg;
    for (int i = 0; i < l; i++) msg.push_back(p[i]);
    
    longint x;
    int c[256]{};
    for (int x : msg) c[x]++;
    
    int i = l;
    for (int k = 256; k >= 1; k--)
    {
        for (int j = 0; j < c[k - 1]; j++) x = add(x, f[k - 1][i - j]);
        i -= c[k - 1];
    }
    
    vector<int> sol;
    for (int i = 0; i < 8; i++)
    {
        i128 cur = x.c[i];
        for (int j = 0; j < 8; j++)
            sol.push_back(cur & 0xff), cur >>= 8;
    }
    while (sol.size() > n) assert(sol.back() == 0), sol.pop_back();
    for (int x : sol) output(x);
}