#include <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
long long int f[55][55];
void encode(int N, int M[]) {
    for (int i = 0; i <= 35; i++) {
        for (int j = 0; j < 27; j++) {
            f[i][j] = 0;
            if (i == 0 && j == 0) f[i][j] = 1;
            if (i != 0) f[i][j] += f[i - 1][j];
            if (j != 0) f[i][j] += f[i][j - 1];
        }
    }
    int c = 0;
    for (int i = 0; i < N; i += 7) {
        long long int h = 0, k = 1, d = 0;
        for (int j = i; j < min(i + 7, N); j++) {
            h += 1ll * k * M[j];
            k *= 256;
            d++;
        }
        for (int j = d * 5; j >= 1; j--) {
            for (int k = 0; k < min(256 - c, 27); k++) {
                if (f[j][k] > h){
                    if (k != 0) h -= f[j][k - 1];
                    send(c + k);
                    break;
                }
            }
        }
        c += 27;
    }
}

#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
long long int f[55][55];
vector<int> g[10005];
void decode(int N, int L, int X[]) {
    for (int i = 0; i <= 35; i++) {
        for (int j = 0; j < 27; j++) {
            f[i][j] = 0;
            if (i == 0 && j == 0) f[i][j] = 1;
            if (i != 0) f[i][j] += f[i - 1][j];
            if (j != 0) f[i][j] += f[i][j - 1];
        }
    }
    for (int i = 0; i < N; i++) g[i].clear();
    for (int i = 0; i < L; i++) {
        g[X[i] / 27].push_back(X[i] % 27);
    }
    for (int i = 0; i < N; i++) {
        if (g[i].empty()) continue;
        sort(g[i].begin(), g[i].end());
        long long int c = 0;
        for (int j = g[i].size() - 1; j >= 0; j--) {
            int w = g[i][j];
            if (w != 0) {
                c += f[j + 1][w - 1];
            }
        }
        for (int j = i * 7; j < min((i + 1) * 7, N); j++) {
            output(c % 256);
            c /= 256;
        }
    }
}