///Enta etfsh5t nseet el rank

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
        tree_order_statistics_node_update>;
#define pb push_back
#define F first
#define S second
#define f(i, a, b) for (int i = a; i < b; i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
//#define mp(x, y) make_pair(x, y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ull = unsigned long long;
using uint = uint32_t;
using ii = pair<int, int>;

const int N = 1e4 + 6, A = 26, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-9;
const ll INF = 1e15;

int a[N], b[N];
int n, x, y;

void doWork() {

    cin >> n >> x >> y;
    f(i, 1, n + 1) cin >> a[i];
    f(i, 1, n + 1) cin >> b[i];
    vector<char> ans(n + 1);
    vector<ii> vp;
    int sum = 0;
    f(i, 1, n + 1) {
        sum += a[i];
        ans[i] = 'T';
        vp.push_back({b[i] - a[i], i});
    }
    sort(rall(vp));
    for (int i = 0; i < n - x; i++) {
        if (i >= y && vp[i].F <= 0)break;
        ans[vp[i].S] = 'P';
        sum += vp[i].F;
    }
    cout << sum << '\n';
    f(i, 1, n + 1) cout << ans[i] << ' ';

}


int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    int t = 1;
//    cin >> t;
    while (t--)
        doWork();

    return 0;
}