#include <bits/stdc++.h>
#define int long long
#define fast ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define lg2(n) (63-__builtin_clzll(n))
#define mask(n) (1LL << (n))
#define TASK ""
#define openfile();  if( fopen(TASK".inp", "r")){freopen(TASK".inp", "r", stdin);freopen(TASK".out", "w", stdout);}
#define lc(n) (n << 1)
#define rc(n) ((n << 1) | 1)

#define fi first
#define se second
#define FOR(i, l, r, k) for( int i = l; i <= r; i += k)
#define FOD(i, r, l, k) for( int i = r; i >= l; i -= k)

#define mii map<int,int>
#define umi unordered_map<int, int>
#define pii pair<int,int>
#define vi vector<int>

using namespace std;

const int oo = 1e18 + 100;
const int mod = 1e9 + 7;
const int nmax = 2e5 + 8;
const int base = 311;

int n, m, x, y, k, dp[108][108][15][15];

int sol(int i, int i2, int k1, int k2){
    if(i == n && i2 == m) return 1;
//    if(i > n + 1 || i2 > m + 1)  return 0;
    if(dp[i][i2][k1][k2] != -1) return dp[i][i2][k1][k2];
    int cur = 0;
    if(k1 < x && i < n){
        cur += sol(i + 1, i2, k1 + 1, 0);
    }
    if(k2 < y && i2 < m){
        cur += sol(i, i2 + 1, 0, k2 + 1);
    }
    return dp[i][i2][k1][k2] = cur;
}
int ans[208], ok;
void trace(int i, int i2, int k1, int k2){
        if(i == n && i2 == m) return;
        int cur = 0;
        if(i < n && k1 < x) cur = sol(i + 1, i2, k1 + 1, 0);
        if(cur >= k){
            ans[i + i2 + 1] = 0;
            trace(i + 1, i2, k1 + 1, 0);
        }
        else{
            k -= cur;
//            if(i2 >= m || k2 >= y || k > sol(i, i2 + 1, 0, k2 + 1)) return void(ok = 1);
            ans[i + i2 + 1] = 1;
            if(i2 < m && k2 < y) trace(i, i2 + 1, 0, k2 + 1);
        }
}

main(){
    fast;
    openfile();
    memset(dp, -1, sizeof dp);
    cin >> n >> m >> x >> y >> k;
//    n = n + m;
    cout << sol(0, 0, 0, 0) << endl;
    if(k > sol(0, 0, 0, 0)){
        return cout << -1, 0;
    }
    trace(0, 0, 0, 0);
//    if(ok) return cout << -1, 0;
    for(int i = 1; i <= n + m; ++i){
        cout << (ans[i] ? 'H' : 'F');
    }
}