#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")

#define _CRT_SECURE_NO_WARNINGS
# include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
# include <bitset>
# include <map>
# include <queue>
# include <ctime>
# include <stack>
# include <set>
# include <list>
# include <random>
# include <deque>
# include <functional>
# include <iomanip>
# include <sstream>
# include <fstream>
# include <complex>
# include <numeric>
# include <immintrin.h>
# include <cassert>
# include <array>
# include <tuple>
# include <unordered_map>
# include <unordered_set>

#ifdef LOCAL0000
# include <opencv2/core/core.hpp>
# include <opencv2/highgui/highgui.hpp>
# include <opencv2/imgproc/imgproc.hpp>
#endif

using namespace std;

#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define DBN1(a)           cerr<<#a<<"="<<(a)<<"\n"
#define DBN2(a,b)         cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define DBN3(a,b,c)       cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define DBN4(a,b,c,d)     cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define DBN5(a,b,c,d,e)   cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define DBN6(a,b,c,d,e,f) cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define DBN(...) macro_dispatcher(DBN, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,n) cerr<<#a<<"=["; printarray(a,n); cerr<<"]\n"
#define DAR(a,n,s) cerr<<#a<<"["<<s<<"-"<<n-1<<"]=["; printarray(a,n,s); cerr<<"]\n"

#ifdef _MSC_VER
#define PREFETCH(ptr, rw, level) ((void)0)
#else
#define PREFETCH(ptr, rw, level) __builtin_prefetch(ptr, rw, level)
#endif

#if defined _MSC_VER
#define ASSUME(condition) ((void)0)
#define __restrict
#elif defined __clang__
#define ASSUME(condition)       __builtin_assume(condition)
#elif defined __GNUC__
[[noreturn]] __attribute__((always_inline)) inline void undefinedBehaviour() {}
#define ASSUME(condition)       ((condition) ? true : (undefinedBehaviour(), false))
#endif

#ifdef LOCAL
#define CURTIME() cerr << clock() * 1.0 / CLOCKS_PER_SEC << endl
#else
#define CURTIME()
#endif

typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef int itn;

template<class T1, class T2, class T3>
struct triple{ T1 a; T2 b; T3 c; triple() : a(T1()), b(T2()), c(T3()) {}; triple(T1 _a, T2 _b, T3 _c) :a(_a), b(_b), c(_c){} };
template<class T1, class T2, class T3>
bool operator<(const triple<T1,T2,T3>&t1,const triple<T1,T2,T3>&t2){if(t1.a!=t2.a)return t1.a<t2.a;else if(t1.b!=t2.b)return t1.b<t2.b;else return t1.c<t2.c;}
template<class T1, class T2, class T3>
bool operator>(const triple<T1,T2,T3>&t1,const triple<T1,T2,T3>&t2){if(t1.a!=t2.a)return t1.a>t2.a;else if(t1.b!=t2.b)return t1.b>t2.b;else return t1.c>t2.c;}
#define tri triple<int,int,int>
#define trll triple<ll,ll,ll>

#define FI(n) for(int i=0;i<(n);++i)
#define FJ(n) for(int j=0;j<(n);++j)
#define FK(n) for(int k=0;k<(n);++k)
#define FL(n) for(int l=0;l<(n);++l)
#define FQ(n) for(int q=0;q<(n);++q)
#define FOR(i,a,b) for(int i = (a), __e = (int) (b); i < __e; ++i)
#define all(a) std::begin(a), std::end(a)
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())

#define sqr(x) ((x) * (x))
#define sqrt(x) sqrt(1.0 * (x))
#define pow(x, n) pow(1.0 * (x), n)

#define COMPARE(obj) [&](const std::decay_t<decltype(obj)>& a, const std::decay_t<decltype(obj)>& b)
#define COMPARE_BY(obj, field) [&](const std::decay_t<decltype(obj)>& a, const std::decay_t<decltype(obj)>& b) { return a.field < b.field; }

#define checkbit(n, b) (((n) >> (b)) & 1)
#define setbit(n, b) ((n) | (static_cast<std::decay<decltype(n)>::type>(1) << (b)))
#define removebit(n, b) ((n) & ~(static_cast<std::decay<decltype(n)>::type>(1) << (b)))
#define flipbit(n, b) ((n) ^ (static_cast<std::decay<decltype(n)>::type>(1) << (b)))
inline int countBits(uint v){v=v-((v>>1)&0x55555555);v=(v&0x33333333)+((v>>2)&0x33333333);return((v+(v>>4)&0xF0F0F0F)*0x1010101)>>24;}
inline int countBits(ull v){uint t=v>>32;uint p=(v & ((1ULL << 32) - 1)); return countBits(t) + countBits(p); }
inline int countBits(ll v){return countBits((ull)v); }
inline int countBits(int v){return countBits((uint)v); }
unsigned int reverseBits(uint x){ x = (((x & 0xaaaaaaaa) >> 1) | ((x & 0x55555555) << 1)); x = (((x & 0xcccccccc) >> 2) | ((x & 0x33333333) << 2)); x = (((x & 0xf0f0f0f0) >> 4) | ((x & 0x0f0f0f0f) << 4)); x = (((x & 0xff00ff00) >> 8) | ((x & 0x00ff00ff) << 8)); return((x >> 16) | (x << 16)); }
template<class T> inline int sign(T x){ return x > 0 ? 1 : x < 0 ? -1 : 0; }
inline bool isPowerOfTwo(int x){ return (x != 0 && (x&(x - 1)) == 0); }
constexpr ll power(ll x, int p) { return p == 0 ? 1 : (x * power(x, p - 1)); }
template<class T>
inline bool inRange(const T& val, const T& min, const T& max) { return min <= val && val <= max; }
//template<class T1, class T2, class T3> T1 inline clamp(T1 x, const T2& a, const T3& b) { if (x < a) return a; else if (x > b) return b; else return x; }
unsigned long long rdtsc() { unsigned long long ret = 0;
#ifdef __clang__
    return __builtin_readcyclecounter();
#endif
#ifndef _MSC_VER
    asm volatile("rdtsc" : "=A" (ret) : :);
#endif
    return ret; }
// Fast IO ********************************************************************************************************
const int __BS = 4096;
static char __bur[__BS + 16], *__er = __bur + __BS, *__ir = __er;
template<class T = int> T readInt() {
    auto c = [&]() { if (__ir == __er) std::fill(__bur, __bur + __BS, 0), cin.read(__bur, __BS), __ir = __bur; };
    c(); while (*__ir && (*__ir < '0' || *__ir > '9') && *__ir != '-') ++__ir; c();
    bool m = false; if (*__ir == '-') ++__ir, c(), m = true;
    T r = 0; while (*__ir >= '0' && *__ir <= '9') r = r * 10 + *__ir - '0', ++__ir, c();
    ++__ir; return m ? -r : r;
}
string readString() {
    auto c = [&]() { if (__ir == __er) std::fill(__bur, __bur + __BS, 0), cin.read(__bur, __BS), __ir = __bur; };
    string r; c(); while (*__ir && isspace(*__ir)) ++__ir, c();
    while (!isspace(*__ir)) r.push_back(*__ir), ++__ir, c();
    ++__ir; return r;
}
char readChar() {
    auto c = [&]() { if (__ir == __er) std::fill(__bur, __bur + __BS, 0), cin.read(__bur, __BS), __ir = __bur; };
    c(); while (*__ir && isspace(*__ir)) ++__ir, c(); return *__ir++;
}
static char __buw[__BS + 20], *__iw = __buw, *__ew = __buw + __BS;
template<class T>
void writeInt(T x, char endc = '\n') {
    if (x < 0) *__iw++ = '-', x = -x; if (x == 0) *__iw++ = '0';
    char* s = __iw;
    while (x) { T t = x / 10; char c = x - 10 * t + '0'; *__iw++ = c; x = t; }
    char* f = __iw - 1; while (s < f) swap(*s, *f), ++s, --f;
    if (__iw > __ew) cout.write(__buw, __iw - __buw), __iw = __buw;
    if (endc) { *__iw++ = endc; }
}
template<class T>
void writeStr(const T& str) {
    int i = 0; while (str[i]) { *__iw++ = str[i++]; if (__iw > __ew) cout.write(__buw, __iw - __buw), __iw = __buw; }
}
struct __FL__ { ~__FL__() { if (__iw != __buw) cout.write(__buw, __iw - __buw); } };
static __FL__ __flushVar__;

//STL output *****************************************************************************************************
#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p);
TT1 ostream& operator << (ostream& os, const vector<T>& v);
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v);
TT1T2 ostream& operator << (ostream& os, const multiset<T1, T2>&v);
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v);
TT1T2T3 ostream& operator << (ostream& os, const map<T1, T2, T3>& v);
TT1T2T3 ostream& operator << (ostream& os, const multimap<T1, T2, T3>& v);
TT1T2T3 ostream& operator << (ostream& os, const triple<T1, T2, T3>& t);
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){       bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) {     bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){    bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const triple<T1, T2, T3>& t){ return os << "(" << t.a << ", " << t.b << ", " << t.c << ")"; }
TT1T2 void printarray(const T1& a, T2 sz, T2 beg = 0){ for (T2 i = beg; i<sz; i++) cout << a[i] << " "; cout << endl; }

//STL input *****************************************************************************************************
TT1T2T3 inline istream& operator >> (istream& os, triple<T1, T2, T3>& t);
TT1T2 inline istream& operator >> (istream& os, pair<T1, T2>& p) { return os >> p.first >> p.second; }
TT1 inline istream& operator >> (istream& os, vector<T>& v) {
    if (v.size()) for (T& t : v) os >> t; else {
        string s; T obj; while (s.empty()) {getline(os, s); if (!os) return os;}
        stringstream ss(s); while (ss >> obj) v.push_back(obj);
    }
    return os;
}
TT1T2T3 inline istream& operator >> (istream& os, triple<T1, T2, T3>& t) { return os >> t.a >> t.b >> t.c; }

//Pair magic *****************************************************************************************************
#define PT1T2 pair<T1, T2>
TT1T2 inline PT1T2 operator+(const PT1T2 &p1 , const PT1T2 &p2) { return PT1T2(p1.first + p2.first, p1.second + p2.second); }
TT1T2 inline PT1T2& operator+=(PT1T2 &p1 , const PT1T2 &p2) { p1.first += p2.first, p1.second += p2.second; return p1; }
TT1T2 inline PT1T2 operator-(const PT1T2 &p1 , const PT1T2 &p2) { return PT1T2(p1.first - p2.first, p1.second - p2.second); }
TT1T2 inline PT1T2& operator-=(PT1T2 &p1 , const PT1T2 &p2) { p1.first -= p2.first, p1.second -= p2.second; return p1; }

#undef TT1
#undef TT1T2
#undef TT1T2T3

#define FREIN(FILE) freopen(FILE, "rt", stdin)
#define FREOUT(FILE) freopen(FILE, "wt", stdout)
#ifdef LOCAL
#define BEGIN_PROFILE(idx, name) int profileIdx = idx; profileName[profileIdx] = name; totalTime[profileIdx] -= rdtsc() / 1e3;
#define END_PROFILE totalTime[profileIdx] += rdtsc() / 1e3; totalCount[profileIdx]++;
#else
#define BEGIN_PROFILE(idx, name)
#define END_PROFILE
#endif

const int USUAL_MOD = 1000000007;
template<class T> inline void normmod(T &x, T m = USUAL_MOD) { x %= m; if (x < 0) x += m; }
template<class T1, class T2> inline T2 summodfast(T1 x, T1 y, T2 m = USUAL_MOD) { T2 res = x + y; if (res >= m) res -= m; return res; }
template<class T1, class T2, class T3 = int> inline void addmodfast(T1 &x, T2 y, T3 m = USUAL_MOD) { x += y; if (x >= m) x -= m; }
template<class T1, class T2, class T3 = int> inline void submodfast(T1 &x, T2 y, T3 m = USUAL_MOD) { x -= y; if (x < 0) x += m; }
inline ll mulmod(ll x, ll n, ll m){ x %= m; n %= m; ll r = x * n - ll(ld(x)*ld(n) / ld(m)) * m; while (r < 0) r += m; while (r >= m) r -= m; return r; }
inline ll powmod(ll x, ll n, ll m){ ll r = 1; normmod(x, m); while (n){ if (n & 1) r *= x; x *= x; r %= m; x %= m; n /= 2; }return r; }
inline ll powmulmod(ll x, ll n, ll m) { ll res = 1; normmod(x, m); while (n){ if (n & 1)res = mulmod(res, x, m); x = mulmod(x, x, m); n /= 2; } return res; }
template<class T> inline T gcd(T a, T b) { while (b) { T t = a % b; a = b; b = t; } return a; }
template<class T>
T fast_gcd(T u, T v) {
    int shl = 0; while ( u && v && u != v) { T eu = u & 1; u >>= eu ^ 1; T ev = v & 1; v >>= ev ^ 1;
        shl += (~(eu | ev) & 1); T d = u & v & 1 ? (u + v) >> 1 : 0; T dif = (u - v) >> (sizeof(T) * 8 - 1); u -= d & ~dif; v -= d & dif;
    } return std::max(u, v) << shl;
}

inline ll lcm(ll a, ll b){ return a / gcd(a, b) * b; }
template<class T> inline T gcd(T a, T b, T c){ return gcd(gcd(a, b), c); }
ll gcdex(ll a, ll b, ll& x, ll& y) {
    if (!a) { x = 0; y = 1; return b; }
    ll y1; ll d = gcdex(b % a, a, y, y1); x = y1 - (b / a) * y;
    return d;
}
template<class T> bool isPrime(T x) { if (x <= 4 || x % 2 == 0 || x % 3 == 0) return x == 2 || x == 3;
    for (T i = 5; i * i <= x; i += 6) if (x % i == 0 || x % (i + 2) == 0) return 0; return 1; }
bool millerRabin(long long n) {
    if (n <= 1000) return isPrime(n);
    long long s = n - 1; int t = 0; while (s % 2 == 0) s /= 2, ++t;
    for (int a : {2, 325, 9375, 28178, 450775, 9780504, 1795265022}) { if (!(a %= n)) return true;
        long long f = powmulmod(a, s, n); if (f == 1 || f == n - 1) continue;
        for (int i = 1; i < t; ++i) if ((f = mulmod(f, f, n)) == n - 1) goto nextp;
        return false; nextp:;
    } return true;
}

// Useful constants

//int some_primes[7] = {24443, 100271, 1000003, 1000333, 5000321, 98765431,
#define T9          1000000000
#define T18         1000000000000000000LL
#define INF         1011111111
#define LLINF       1000111000111000111LL
#define mod         1000000007
#define fftmod      998244353
#define EPS         (double)1e-10
#define PI          3.14159265358979323846264
#define link        asaxlajrewqwe
#define rank        wahayawehasdakw
//*************************************************************************************


int32_t solve();
int32_t main(int argc, char** argv) {
    ios_base::sync_with_stdio(0);cin.tie(0);
#ifdef LOCAL
    if (argc == 1 || argv[1] == string("test")) {
        FREIN("examples/001");
    } else {
        FREIN(argv[1]);
    }
    FREOUT("out.txt");
#endif
    return solve();
}
string world;
string q;
constexpr int MAXQ = 10010;
constexpr int TEN = 10;

template <typename T, size_t N> struct alignas(16) aligned_array : public std::array<T, N> {};
using ArrTen = array<int, TEN>;
void updString(string& s) { for (char& c : s) c -= 'A'; }
mt19937_64 gen;
int rnd(int n) {
    return uniform_int_distribution<>(0, n - 1)(gen);
}
ArrTen nex[50001];
struct Hist {
    Hist *parent;
    pii move;
};
Hist allHist[1 << 21];
Hist *lastHist = allHist;
vector<Hist*> histPool;
Hist *getNewHist() {
    if (histPool.empty()) {
        return lastHist++;
    } else {
        auto res = histPool.back();
        histPool.pop_back();
        return res;
    }
}
/***** PARAMS *****/
int NOT_LAST_BONUS = 8;
constexpr int MAX_STATES_CNT = 60;
constexpr int DEPTH1_TRIES = 6;
constexpr int DEPTH0_TRIES = 2;
constexpr int GREEDY_STEPS = 24;
/***** PARAMS *****/
bool used[50000];
struct State {
    ArrTen whereIsUnit = {};
    ArrTen colorsInPocket = {};
    int score = 0;
    Hist* hist = nullptr;
    int calcScore() {
        int score = 0;
        auto tmp = whereIsUnit;
        sort(tmp.begin(), tmp.end(), std::greater<int>());
        for (int i = 0; i < TEN; ++i) {
            score += (i + 4) * tmp[i];
        }
        score += tmp[TEN - 1] * 8;
        return score;
    }
    inline bool anyoneAtPos(int pos) const {
        for (int x : whereIsUnit) {
            if (x == pos) return true;
        }
        return false;
    }
    int getLastUnit() const {
        return int(min_element(all(whereIsUnit)) - begin(whereIsUnit));
    }
    int getNextSameColor_Used(int pos, int color) const {
        do {
            pos = nex[pos][color];
        } while (used[pos]);
        return pos;
    }
    int getNextSameColor(int pos, int color) const {
        do {
            pos = nex[pos][color];
        } while (anyoneAtPos(pos));
        return pos;
    }
    inline void addColor(int color) {
        colorsInPocket[color]++;
    }
    inline void delColor(int color) {
        colorsInPocket[color]--;
    }
    void makeTheMove(int idx, int color) {
        whereIsUnit[idx] = getNextSameColor(whereIsUnit[idx], color);
        delColor(color);
    }
    void makeTheMove(int idx, int color, int pos) {
        whereIsUnit[idx] = pos;
        delColor(color);
    }
    void mutateGreedy(int cur, int stepsCnt) {
        for (int x : whereIsUnit) {
            used[x] = true;
        }
        while (stepsCnt-- > 0 && cur < MAXQ) {
            addColor(q[cur++]);
            int idx = getLastUnit();
            int pos = whereIsUnit[idx];
            used[pos] = false;
            int maxNextPos = -1;
            int what = -1;
            for (int i = 0; i < TEN; ++i) {
                if (!colorsInPocket[i]) continue;
                int nextPos = getNextSameColor_Used(pos, i);
                if (nextPos > maxNextPos) {
                    maxNextPos = nextPos;
                    what = i;
                }
            }
            used[maxNextPos] = true;
            makeTheMove(idx, what, maxNextPos);
        }
        for (int x : whereIsUnit) {
            used[x] = false;
        }
    }
    template<int depth>
    int generateNewStates(int maxCnt, State* res, int cur) {
        addColor(q[cur]);
        tri whoWhatAndWhere[depth == 0 ? 10 : 100];
        int sz = 0;
        int idx = getLastUnit();
        for (int who = (depth ? 0 : idx); who < (depth ? TEN : idx + 1); ++who) {
            for (int what = 0; what < TEN; ++what) {
                if (!colorsInPocket[what]) continue;
                int where = getNextSameColor(whereIsUnit[who], what) - whereIsUnit[who];
                if (idx != who) {
                    where -= NOT_LAST_BONUS;
                }
                whoWhatAndWhere[sz++] = {who, what, where};
            }
        }
        sort(whoWhatAndWhere, whoWhatAndWhere + sz , [](tri a, tri b){
            return a.c > b.c;
        });
        int resultMoves = 0;
        maxCnt = min(maxCnt, sz);
        for (auto [who, what, _] : whoWhatAndWhere) {
            if (maxCnt-- == 0) break;
            int oldPos = whereIsUnit[who];
            int where = getNextSameColor(oldPos, what);
            makeTheMove(who, what, where);
            if (depth == 0 || cur + 1 == MAXQ) {
                auto greedy = *this;
                greedy.mutateGreedy(cur + 1, GREEDY_STEPS);
                score = max(score, greedy.calcScore());
            } else {
                score = 0;
                generateNewStates<0>(DEPTH0_TRIES, nullptr, cur + 1);
            }
            if (res != nullptr) {
                auto prevHist = hist;
                hist = getNewHist();
                hist->move = {who, what};
                hist->parent = prevHist;
                *res++ = *this;
                hist = prevHist;
            }
            whereIsUnit[who] = oldPos;
            colorsInPocket[what]++;
            ++resultMoves;
        }
        delColor(q[cur]);
        return resultMoves;
    }
};
std::ostream& operator<<(std::ostream& os, const State& s) {
    return os << s.colorsInPocket << ' ' << s.whereIsUnit;
}
bool operator < (const State& a, const State& b) {
    return (a.score > b.score) || (a.score == b.score && a.colorsInPocket < b.colorsInPocket);
}
bool operator == (const State& a, const State& b) {
    return a.score == b.score && a.colorsInPocket == b.colorsInPocket;
}
int solve() {
    //    ifstream fin("examples/001");
    int n, s, c, h, U;
    cin >> n >> s >> c >> h >> U;
    cin >> world;
    cin >> q;
    updString(world);
    updString(q);
    const int MAXPOS = 50000;
    for (int i = 0; i < TEN; ++i) nex[MAXPOS][i] = MAXPOS;
    for (int i = MAXPOS - 1; i >= 0; --i) {
        for (int j = 0; j < TEN; ++j) {
            nex[i][j] = nex[i + 1][j];
        }
        nex[i][world[i + 1]] = i + 1;
    }
    static int indices[MAX_STATES_CNT * TEN];
    static State __states[2][MAX_STATES_CNT * TEN];
    auto states = __states[0];
    auto newStates = __states[1];
    int statesCnt = 1;
    for (int i = 0; i < TEN - 1; ++i) {
        states[0].addColor(q[i]);
    }
    for (int i = 0; i < TEN; ++i) {
        states[0].whereIsUnit[i] = i;
    }
    for (int i = TEN - 1; i + 1 < (int)q.size(); ++i) {
        if (i == 9000) NOT_LAST_BONUS = 24;
        if (i == 9500) NOT_LAST_BONUS = 64;
        if (i == 9900) NOT_LAST_BONUS = 256;
        for (int i = 0; i < statesCnt; ++i) {
            indices[i] = i;
        }
        auto cmp = [&](int x, int y) { return states[x] < states[y]; };
        shuffle(indices, indices + statesCnt, gen);
        sort(indices, indices + statesCnt, cmp);
        int oldStatesCnt = statesCnt;
        statesCnt = 1;
        for (int j = 1; j < oldStatesCnt; ++j) {
            int x = indices[j];
            int y = indices[statesCnt - 1];
            if (statesCnt == MAX_STATES_CNT || states[x] == states[y]) {
                histPool.push_back(states[x].hist);
            } else {
                indices[statesCnt++] = x;
            }
        }
        int newStatesCnt = 0;
        for (int j = 0; j < statesCnt; ++j) {
            auto& state = states[indices[j]];
            state.score = 0;
            newStatesCnt += state.generateNewStates<1>(DEPTH1_TRIES, newStates + newStatesCnt, i);
        }
        statesCnt = newStatesCnt;
        swap(states, newStates);
    }
    sort(states, states + statesCnt);
    auto bestScore = states[0].whereIsUnit[states[0].getLastUnit()];
    vector<pii> ans;
    auto hist = states[0].hist;
    while (hist != nullptr) {
        ans.push_back(hist->move);
        hist = hist->parent;
    }
    reverse(all(ans));
    for (auto p : ans) {
        cout << p.first << ' ' << char(p.second + 'A') << endl;
    }
    DBN(bestScore);
    CURTIME();
    FREOUT("score.txt");
    cout << bestScore << endl;
    //    DBN(bestScore);
    return 0;
}