#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

void doWork()
{
    int n, a, b;
    cin >> n >> a >> b;
    vector<int> t(n), p(n);
    for(int i = 0; i < n; i++)
        cin >> t[i];
    for(int i = 0; i < n; i++)
        cin >> p[i];

    int tot = 0;
    vector<char> ans(n);
    vector<bool> used(n);
    vector<pair<int, int>> v(n);
    for(int i = 0; i < n; i++)
        v[i] = {t[i] - p[i], i};
    sort(v.rbegin(), v.rend());

    for(int i = 0; i < a; i++)
    {
        tot += t[v[i].second];
        ans[v[i].second] = 'T', used[v[i].second] = 1;
    }

    v.clear();
    for(int i = 0; i < n; i++)
    {
        if(used[i])
            continue;
        v.push_back({p[i] - t[i], i});
    }
    sort(v.rbegin(), v.rend());

    for(int i = 0; i < b; i++)
    {
        tot += p[v[i].second];
        ans[v[i].second] = 'P', used[v[i].second] = 1;
    }

    for(int i = 0; i < n; i++)
    {
        if(used[i])
            continue;

        if(t[i] >= p[i])
            tot += t[i], ans[i] = 'T';
        else
            tot += p[i], ans[i] = 'P';

    }
    cout << tot << '\n';
    for(auto &it: ans)
        cout << it << ' ';
}

signed main()
{
    FIO
    int T = 1;
//    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}