#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define ins insert
#define sz(x) (long long)x.size()
typedef long long ll;
typedef long double ld;
const int N = 3e5 + 5;
const ld pi = 3.141592653;
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll INF = __LONG_LONG_MAX__;

using namespace std;

int dx[9] = {1, -1, 0, 0, 1, 1, -1, -1, 0};
int dy[9] = {0, 0, 1, -1, 1, -1, 1, -1, 0};

int main()
{
        ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
        int T = 1;
        cin>>T;
        while(T--)
        {
                int n, i;
                cin>>n;
                vector<int> a(n);
                for(i = 0; i<n; i++) cin>>a[i];
                int ma = *max_element(a.begin(), a.end());
                int sum = accumulate(a.begin(), a.end(), 0);
                if(2 * ma > sum || sum % 2 != 0) cout<<"T";
                else cout<<"HL";
                cout<<"\n";
        }
        return 0;
}


#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define ins insert
#define sz(x) (long long)x.size()
typedef long long ll;
typedef long double ld;
const int N = 1e5 + 5;
const ld pi = 3.141592653;
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll INF = __LONG_LONG_MAX__;

using namespace std;

int dx[9]={1, -1, 0, 0, 1, 1, -1, -1, 0};
int dy[9]={0, 0, 1, -1, 1, -1, 1, -1, 0};

int main()
{
        ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
        int T = 1;
        cin>>T;
        while(T--)
        {
                int n, i, j;
                cin>>n;
                vector<int> a(n);
                string ans;
                for(i=0; i<n; i++) cin>>a[i];
                sort(a.begin(), a.end(), __greater());
                if(n==1) ans = "T";
                else{
                        int moves = 0, x = a[0], y = a[1];
                        bool ok = true;
                        vector<bool> mark(n, false);
                        mark[0] = true; mark[1] = true;
                        while(ok){
                                if(moves%2==0){
                                        if(x>0){
                                                x--; moves++;
                                        }
                                        else{
                                                for(j=0; j<n; j++){
                                                        if(mark[j]==false){
                                                                x = a[j]; mark[j] = true; break;
                                                        }
                                                }
                                                if(j==n){
                                                        ok = false; break;
                                                }
                                                else{
                                                        x--; moves++;
                                                }
                                        }
                                }
                                else{
                                        if(y>0){
                                                y--; moves++;
                                        }
                                        else{
                                                for(j=0; j<n; j++){
                                                        if(mark[j]==false){
                                                                x = a[j]; mark[j]=true; break;
                                                        }
                                                }
                                                if(j==n){
                                                        ok = false; break;
                                                }
                                                else{
                                                        y--; moves++;
                                                }
                                        }
                                }
                        }
                        if(moves%2!=0) ans = "T";
                        else ans = "HL";
                }
                cout<<ans<<"\n";
        }
        return 0;
}


#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define ins insert
#define sz(x) (long long)x.size()
typedef long long ll;
typedef long double ld;
const int N = 1e5 + 5;
const ld pi = 3.141592653;
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll INF = __LONG_LONG_MAX__;

using namespace std;

int dx[9]={1, -1, 0, 0, 1, 1, -1, -1, 0};
int dy[9]={0, 0, 1, -1, 1, -1, 1, -1, 0};

int main()
{
        ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
        int T = 1;
        cin>>T;
        while(T--)
        {
                int n, i, j;
                cin>>n;
                vector<int> a(n);
                string ans;
                for(i=0; i<n; i++) cin>>a[i];
                sort(a.begin(), a.end(), __greater());
                if(n==1) ans = "T";
                else{
                        int moves = 0, x = a[0], y = a[1];
                        bool ok = true;
                        vector<bool> mark(n, false);
                        mark[0] = true; mark[1] = true;
                        while(ok){
                                if(moves%2==0){
                                        if(x>0){
                                                x--; moves++;
                                        }
                                        else{
                                                for(j=0; j<n; j++){
                                                        if(mark[j]==false){
                                                                x = a[j]; mark[j] = true; break;
                                                        }
                                                }
                                                if(j==n){
                                                        ok = false; break;
                                                }
                                                else{
                                                        x--; moves++;
                                                }
                                        }
                                }
                                else{
                                        if(y>0){
                                                y--; moves++;
                                        }
                                        else{
                                                for(j=0; j<n; j++){
                                                        if(mark[j]==false){
                                                                y = a[j]; mark[j]=true; break;
                                                        }
                                                }
                                                if(j==n){
                                                        ok = false; break;
                                                }
                                                else{
                                                        y--; moves++;
                                                }
                                        }
                                }
                        }
                        if(moves%2!=0) ans = "T";
                        else ans = "HL";
                }
                cout<<ans<<"\n";
        }
        return 0;
}


#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define ins insert
#define sz(x) (long long)x.size()
typedef long long ll;
typedef long double ld;
const int N = 3e5 + 5;
const ld pi = 3.141592653;
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll INF = __LONG_LONG_MAX__;

using namespace std;

int dx[9] = {1, -1, 0, 0, 1, 1, -1, -1, 0};
int dy[9] = {0, 0, 1, -1, 1, -1, 1, -1, 0};

int main()
{
        ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
        int T = 1;
        cin>>T;
        while(T--)
        {
                int n, i;
                cin>>n;
                vector<int> a(n);
                for(i = 0; i<n; i++) cin>>a[i];
                int ma = *max_element(a.begin(), a.end());
                int sum = accumulate(a.begin(), a.end(), 0);
                if(2 * ma > sum || sum % 2 != 0) cout<<"T";
                else cout<<"NL";
                cout<<"\n";
        }
        return 0;
}


#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define F first
#define S second
#define mp make_pair

#define int long long
#define ceildiv(a, b) (a) / (b) + ((a) % (b) ? 1 : 0)
#define mod(n, M) ((n % M) + M) % M

signed main() {
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        int s = 0;
        int mx = 0;
        for (int i = 0; i < n; i++) {
            int ai;
            cin >> ai;
            if (ai > mx)
                mx = ai;
            s += ai;
        }
        if (n == 1 || mx > s / 2) {
            cout << "T" << endl;
            continue;
        }

        if (s % 2 == 1)
            cout << "T" << endl;
        else
            cout << "HL" << endl;
    }
}


#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define F first
#define S second
#define mp make_pair

#define int long long
#define ceildiv(a, b) (a) / (b) + ((a) % (b) ? 1 : 0)
#define mod(n, M) ((n % M) + M) % M

int a[(int)1e3];

signed main() {
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        int s = 0;
        for (int i = 0; i < n; i++) {
            cin >> a[i];
            s += a[i];
        }
        if (n == 1) {
            cout << "T" << endl;
            continue;
        }

        if (s % 2 == 0)
            cout << "T" << endl;
        else
            cout << "HL" << endl;
    }
}


#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define F first
#define S second
#define mp make_pair

#define int long long
#define ceildiv(a, b) (a) / (b) + ((a) % (b) ? 1 : 0)
#define mod(n, M) ((n % M) + M) % M

signed main() {
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        int s = 0;
        for (int i = 0; i < n; i++) {
            int ai;
            cin >> ai;
            s += ai;
        }
        if (n == 1) {
            cout << "T" << endl;
            continue;
        }

        if (s % 2 == 1)
            cout << "T" << endl;
        else
            cout << "HL" << endl;
    }
}


//   __________________
//  | ________________ |
//  ||          ____  ||
//  ||   /\    |      ||
//  ||  /__\   |      ||
//  || /    \  |____  ||
//  ||________________||
//  |__________________|
//  \###################\
//   \###################\
//    \        ____       \
//     \_______\___\_______\
// An AC a day keeps the doctor away.

#ifdef local
#include <bits/extc++.h>
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(...) qqbx(#__VA_ARGS__, __VA_ARGS__)
template <typename H, typename ...T> constexpr void qqbx(const char *s, const H &h, T &&...args) {
    for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
    std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
    if constexpr(sizeof...(T)) qqbx(++s, args...);
}
#else
#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
#include <bits/extc++.h>
#include <bits/stdc++.h>
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define all(v) begin(v),end(v)
#define get_pos(v,x) int(lower_bound(begin(v),end(v),x)-begin(v))
#define sort_uni(v) sort(begin(v),end(v)),v.erase(unique(begin(v),end(v)),end(v))
#define pb emplace_back
#define ff first
#define ss second
#define mem(v,x) memset(v,x,sizeof v)

using namespace std;
using namespace __gnu_pbds;
typedef int64_t ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;
template <typename T> using max_heap = std::priority_queue<T,vector<T>,less<T> >;
template <typename T> using min_heap = std::priority_queue<T,vector<T>,greater<T> >;
template <typename T> using rbt = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
constexpr ld PI = acos(-1), eps = 1e-7;
constexpr ll N = 1000025, INF = 1e18, MOD = 1000000007, K = 14699, inf = 1e9;
constexpr inline ll cdiv(ll x, ll m) { return x/m + ((x<0 ^ m>0) && (x%m)); } // ceiling divide
constexpr inline ll modpow(ll e,ll p,ll m=MOD) { ll r=1; for(e%=m;p;p>>=1,e=e*e%m) if(p&1) r=r*e%m; return r; }

signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        vector<int> a(n);
        int mx = 0, sum = 0;
        for(int &x: a) cin >> x;
        for(int x: a) mx = max(mx, x), sum += x;
        if((sum - mx) & 1) cout << "HL\n";
        else cout << "T\n";
    }
}


//   __________________
//  | ________________ |
//  ||          ____  ||
//  ||   /\    |      ||
//  ||  /__\   |      ||
//  || /    \  |____  ||
//  ||________________||
//  |__________________|
//  \###################\
//   \###################\
//    \        ____       \
//     \_______\___\_______\
// An AC a day keeps the doctor away.

#ifdef local
#include <bits/extc++.h>
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(...) qqbx(#__VA_ARGS__, __VA_ARGS__)
template <typename H, typename ...T> constexpr void qqbx(const char *s, const H &h, T &&...args) {
    for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
    std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
    if constexpr(sizeof...(T)) qqbx(++s, args...);
}
#else
#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
#include <bits/extc++.h>
#include <bits/stdc++.h>
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define all(v) begin(v),end(v)
#define get_pos(v,x) int(lower_bound(begin(v),end(v),x)-begin(v))
#define sort_uni(v) sort(begin(v),end(v)),v.erase(unique(begin(v),end(v)),end(v))
#define pb emplace_back
#define ff first
#define ss second
#define mem(v,x) memset(v,x,sizeof v)

using namespace std;
using namespace __gnu_pbds;
typedef int64_t ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;
template <typename T> using max_heap = std::priority_queue<T,vector<T>,less<T> >;
template <typename T> using min_heap = std::priority_queue<T,vector<T>,greater<T> >;
template <typename T> using rbt = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
constexpr ld PI = acos(-1), eps = 1e-7;
constexpr ll N = 1000025, INF = 1e18, MOD = 1000000007, K = 14699, inf = 1e9;
constexpr inline ll cdiv(ll x, ll m) { return x/m + ((x<0 ^ m>0) && (x%m)); } // ceiling divide
constexpr inline ll modpow(ll e,ll p,ll m=MOD) { ll r=1; for(e%=m;p;p>>=1,e=e*e%m) if(p&1) r=r*e%m; return r; }

signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        vector<int> a(n);
        for(int &x: a) cin >> x;
        if(n == 1) cout << "T\n";
        else if(n == 2) {
            cout << (a[0]==a[1] ? "HL\n" : "T\n");
        } else {
            int sum = 0;
            for(int x: a) sum += a;
            cout << (sum & 1 ? "HL\n" : "T\n");
        }
    }
}


//   __________________
//  | ________________ |
//  ||          ____  ||
//  ||   /\    |      ||
//  ||  /__\   |      ||
//  || /    \  |____  ||
//  ||________________||
//  |__________________|
//  \###################\
//   \###################\
//    \        ____       \
//     \_______\___\_______\
// An AC a day keeps the doctor away.

#ifdef local
#include <bits/extc++.h>
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(...) qqbx(#__VA_ARGS__, __VA_ARGS__)
template <typename H, typename ...T> constexpr void qqbx(const char *s, const H &h, T &&...args) {
    for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
    std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
    if constexpr(sizeof...(T)) qqbx(++s, args...);
}
#else
#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
#include <bits/extc++.h>
#include <bits/stdc++.h>
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define all(v) begin(v),end(v)
#define get_pos(v,x) int(lower_bound(begin(v),end(v),x)-begin(v))
#define sort_uni(v) sort(begin(v),end(v)),v.erase(unique(begin(v),end(v)),end(v))
#define pb emplace_back
#define ff first
#define ss second
#define mem(v,x) memset(v,x,sizeof v)

using namespace std;
using namespace __gnu_pbds;
typedef int64_t ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;
template <typename T> using max_heap = std::priority_queue<T,vector<T>,less<T> >;
template <typename T> using min_heap = std::priority_queue<T,vector<T>,greater<T> >;
template <typename T> using rbt = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
constexpr ld PI = acos(-1), eps = 1e-7;
constexpr ll N = 1000025, INF = 1e18, MOD = 1000000007, K = 14699, inf = 1e9;
constexpr inline ll cdiv(ll x, ll m) { return x/m + ((x<0 ^ m>0) && (x%m)); } // ceiling divide
constexpr inline ll modpow(ll e,ll p,ll m=MOD) { ll r=1; for(e%=m;p;p>>=1,e=e*e%m) if(p&1) r=r*e%m; return r; }

signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        vector<int> a(n);
        for(int &x: a) cin >> x;
        if(n == 1) cout << "T\n";
        else if(n == 2) {
            cout << (a[0]==a[1] ? "HL\n" : "T\n");
        } else {
            int sum = 0;
            for(int x: a) sum += x;
            cout << (sum & 1 ? "T\n" : "HL\n");
        }
    }
}


//   __________________
//  | ________________ |
//  ||          ____  ||
//  ||   /\    |      ||
//  ||  /__\   |      ||
//  || /    \  |____  ||
//  ||________________||
//  |__________________|
//  \###################\
//   \###################\
//    \        ____       \
//     \_______\___\_______\
// An AC a day keeps the doctor away.

#ifdef local
#include <bits/extc++.h>
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(...) qqbx(#__VA_ARGS__, __VA_ARGS__)
template <typename H, typename ...T> constexpr void qqbx(const char *s, const H &h, T &&...args) {
    for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
    std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
    if constexpr(sizeof...(T)) qqbx(++s, args...);
}
#else
#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
#include <bits/extc++.h>
#include <bits/stdc++.h>
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define all(v) begin(v),end(v)
#define get_pos(v,x) int(lower_bound(begin(v),end(v),x)-begin(v))
#define sort_uni(v) sort(begin(v),end(v)),v.erase(unique(begin(v),end(v)),end(v))
#define pb emplace_back
#define ff first
#define ss second
#define mem(v,x) memset(v,x,sizeof v)

using namespace std;
using namespace __gnu_pbds;
typedef int64_t ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;
template <typename T> using max_heap = std::priority_queue<T,vector<T>,less<T> >;
template <typename T> using min_heap = std::priority_queue<T,vector<T>,greater<T> >;
template <typename T> using rbt = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
constexpr ld PI = acos(-1), eps = 1e-7;
constexpr ll N = 1000025, INF = 1e18, MOD = 1000000007, K = 14699, inf = 1e9;
constexpr inline ll cdiv(ll x, ll m) { return x/m + ((x<0 ^ m>0) && (x%m)); } // ceiling divide
constexpr inline ll modpow(ll e,ll p,ll m=MOD) { ll r=1; for(e%=m;p;p>>=1,e=e*e%m) if(p&1) r=r*e%m; return r; }

signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        vector<int> a(n);
        for(int &x: a) cin >> x;
        if(n == 1) cout << "T\n";
        else if(n == 2) {
            cout << (a[0]==a[1] ? "HL\n" : "T\n");
        } else {
            int sum = 0, mx = 0;
            for(int x: a) sum += x, mx = max(mx, x);
            if(mx > sum - mx) cout << "T\n";
            else cout << (sum & 1 ? "T\n" : "HL\n");
        }
    }
}


//   __________________
//  | ________________ |
//  ||          ____  ||
//  ||   /\    |      ||
//  ||  /__\   |      ||
//  || /    \  |____  ||
//  ||________________||
//  |__________________|
//  \###################\
//   \###################\
//    \        ____       \
//     \_______\___\_______\
// An AC a day keeps the doctor away.

#ifdef local
#include <bits/extc++.h>
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(...) qqbx(#__VA_ARGS__, __VA_ARGS__)
template <typename H, typename ...T> constexpr void qqbx(const char *s, const H &h, T &&...args) {
    for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
    std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
    if constexpr(sizeof...(T)) qqbx(++s, args...);
}
#else
#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
#include <bits/extc++.h>
#include <bits/stdc++.h>
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define all(v) begin(v),end(v)
#define get_pos(v,x) int(lower_bound(begin(v),end(v),x)-begin(v))
#define sort_uni(v) sort(begin(v),end(v)),v.erase(unique(begin(v),end(v)),end(v))
#define pb emplace_back
#define ff first
#define ss second
#define mem(v,x) memset(v,x,sizeof v)

using namespace std;
using namespace __gnu_pbds;
typedef int64_t ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;
template <typename T> using max_heap = std::priority_queue<T,vector<T>,less<T> >;
template <typename T> using min_heap = std::priority_queue<T,vector<T>,greater<T> >;
template <typename T> using rbt = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
constexpr ld PI = acos(-1), eps = 1e-7;
constexpr ll N = 1000025, INF = 1e18, MOD = 1000000007, K = 14699, inf = 1e9;
constexpr inline ll cdiv(ll x, ll m) { return x/m + ((x<0 ^ m>0) && (x%m)); } // ceiling divide
constexpr inline ll modpow(ll e,ll p,ll m=MOD) { ll r=1; for(e%=m;p;p>>=1,e=e*e%m) if(p&1) r=r*e%m; return r; }

signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        vector<int> a(n);
        int mx = 0, sum = 0;
        for(int &x: a) cin >> x;
        for(int x: a) mx = max(mx, x), sum += x;
        if(mx > sum - mx) cout << "T\n";
        else cout << "HL\n";
    }
}


#include <bits/stdc++.h>
#include <fstream>
#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(7)<<(x)
#define all(v) (v).begin(), ( v).end()
using namespace  std;
#define forn(i, b) for (int i=0; i<b; ++i)
using ll = long long;
const int mod = (ll)998244353;
#define PI acos(-1)
typedef pair<int , int> pairs;
typedef complex<ll> G;
const int INF = 1e9 + 1 ;
const int N = 10;
const double eps = 1e-7;

int power(int a, int b){
    if(!b)
        return 1;
    int c=power(a,b/2);
    c=(1LL*c*c)%mod;
    if(b%2)
        c=(1LL*c*a)%mod;
    return c;
}

int mul(int a, int b) {
    return (ll)a * b % mod;
}

void done() {

}

void solve()
{

}

void another() {
    int n;
    cin >> n;
    vector<int> a(n);
    int tot = 0;
    for(int i = 0;i < n; ++i) {
        cin >> a[i];
        tot += a[i];
    }
    for(int i = 0;i < n;++i) {
        if(a[i] > tot / 2) {
            cout << "T" << '\n';
            return;
        }
    }
    cout << (tot % 2 == 0 ? "HL" : "T") << '\n';

}
void test_case() {
    int t;
    cin >> t;
    while(t--)another();
}
int main() {

    ios::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);

    test_case();
}


#include <bits/stdc++.h>
#include <fstream>
#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(7)<<(x)
#define all(v) (v).begin(), ( v).end()
using namespace  std;
#define forn(i, b) for (int i=0; i<b; ++i)
using ll = long long;
const int mod = (ll)998244353;
#define PI acos(-1)
typedef pair<int , int> pairs;
typedef complex<ll> G;
const int INF = 1e9 + 1 ;
const int N = 10;
const double eps = 1e-7;

int power(int a, int b){
    if(!b)
        return 1;
    int c=power(a,b/2);
    c=(1LL*c*c)%mod;
    if(b%2)
        c=(1LL*c*a)%mod;
    return c;
}

int mul(int a, int b) {
    return (ll)a * b % mod;
}

void done() {

}

void solve()
{

}

void another() {
    int n;
    cin >> n;
    vector<int>a(n);
    for(int i = 0;i < n;++i) {
        cin >> a[i];
    }
    cout << (n % 2 == 0 ? "HL" : "T") << '\n';

}
void test_case() {
    int t;
    cin >> t;
    while(t--)another();
}
int main() {

    ios::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);

    test_case();
}


#include "Bruh.h"
#include <bits/stdc++.h>

using namespace std;

Bruh::Bruh()

{
    cout << "I am the constructor." << endl;
}
Bruh::~Bruh()

{
    cout << "I am the constructor." << endl;
}


#include <bits/stdc++.h>

using namespace std;

int main(){

	int t;
	cin >> t;
	while(t--){
		int n,turn = 0,prev = -1;
		cin >> n;
		vector<pair<int,int>> num(n);
		for(int x = 0; x < n; x++){
			int a;
			cin >> a;
			num[x] = {a,x};
		}
		if(n == 1){
			cout << 'T' << endl;
			continue;
		}
		while(true){
			sort(num.begin(),num.end());
			auto p = num[num.size()-1];
			if(p.first == 0) break;
			if(p.second == prev){
				p = num[num.size()-2];
				if(p.first == 0) break;
				prev = p.second;
				num[num.size()-2].first--;
			}else{
				prev = p.second;
				num[num.size()-1].first--;
			}
			turn++;
		}
		if(turn%2 == 1) cout << "T" << endl;
		else cout << "HL" << endl;
	}
}


#include <bits/stdc++.h>

using namespace std;

int main(){

	int t;
	cin >> t;
	while(t--){
		ios::sync_with_stdio(false);
		cin.tie(0);cout.tie(0);
		int n,arr[10001],sum = 0,mx = 0;
		cin >> n;
		for(int x = 0; x < n; x++){
			cin >> arr[x];
			sum += arr[x];
			mx = max(mx,arr[x]);
		}
		if(mx > floor(sum/2) || sum % 2 == 1)
			cout << 'T' << endl;
		else cout << "HL" << endl;
	}
}


#include <bits/stdc++.h>

using namespace std;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int t;
	cin >> t;
	while(t--){
		int n,arr[10001],sum = 0,mx = 0;
		cin >> n;
		for(int x = 0; x < n; x++){
			cin >> arr[x];
			sum += arr[x];
			mx = max(mx,arr[x]);
		}
		if(mx > floor(sum/2) || sum % 2 == 1)
			cout << 'T' << endl;
		else cout << "HL" << endl;
	}
}


#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
const int MAXN = 107;
int a[MAXN];
int main(){
    fastio; int tc; cin>>tc;
    while(tc--){
        int n; cin>>n;
        int mx = -1;
        int sm = 0;
        set<int> aux;
        for(int i=0; i<n; i++){
            cin>>a[i];
            if(aux.find(a[i]) != aux.end())continue;
            sm += a[i];
            mx = max(mx, a[i]);
        }
        if(mx < sm - mx){
            cout<<"HL"<<endl; continue;
        }else{
            cout<<"T"<<endl; continue;
        }
    }
}


#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
int main(){
    fastio; int n; cin>>n;
    vector<int> stones(n);
    int mx = -1, s=0;
    for(int i=0; i<n; i++){
        cin>>stones[i];
        mx = max(stones[i],mx);
        s += stones[i];
    }
    if(2*mx > s)cout<<"T"<<endl;
    else{
        if(s%2==0)cout<<"HL"<<endl;
        else cout<<"T"<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
const int MAXN = 107;
int a[MAXN];
int main(){
    fastio; int tc; cin>>tc;
    while(tc--){
        int n; cin>>n;
        int mx = -1;
        int sm = 0;
        set<int> aux;
        for(int i=0; i<n; i++){
            cin>>a[i];
            if(aux.find(a[i]) != aux.end())continue;
            sm += a[i];
            mx = max(mx, a[i]);
        }
        if(mx <= sm - mx){
            cout<<"HL"<<endl; continue;
        }else{
            cout<<"T"<<endl; continue;
        }
    }
}


#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
const int MAXN = 107;
int a[MAXN];
int main(){
    fastio; int tc; cin>>tc;
    while(tc--){
        int n; cin>>n;
        int mx = -1;
        int sm = 0;
        int aux = 0;
        for(int i=0; i<n; i++){
            cin>>a[i];
            sm += a[i];
            aux = (aux^a[i]);
            mx = max(mx, a[i]);
        }
        if(mx > sm - mx){
            cout<<"T"<<endl; continue;
        }
        sort(a, a+n);
        if(n==1){
            cout<<"T"<<endl;
        }else if(n==2){
            if(a[0] == a[1])cout<<"HL"<<endl;
            else cout<<"T"<<endl;
        }else{//3 piles or more !!!
            if(aux==0)cout<<"HL"<<endl;
            else cout<<"T"<<endl;
        }
    }
}


#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
int main(){
    fastio;
    int tc; cin>>tc;
    while(tc--){
        int n; cin>>n;
        vector<int> stones(n);
        int mx = -1, s=0;
        for(int i=0; i<n; i++){
            cin>>stones[i];
            mx = max(stones[i], mx);
            s += stones[i];
        }
        if(2*mx > s){
            cout<<"T"<<endl;
        }else{
            if(s%2==0)cout<<"HL"<<endl;
            else cout<<"T"<<endl;
        }
    }
}


#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
const int MAXN = 107;
int a[MAXN];
int main(){
    fastio; int tc; cin>>tc;
    while(tc--){
        int n; cin>>n;
        int mx = -1;
        int sm = 0;
        set<int> aux;
        for(int i=0; i<n; i++){
            cin>>a[i];
            if(aux.find(a[i]) != aux.end())continue;
            sm += a[i];
            mx = max(mx, a[i]);
        }
        if(mx == sm - mx){
            cout<<"HL"<<endl; continue;
        }else{
            cout<<"T"<<endl; continue;
        }
    }
}


#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
const int MAXN = 107;
int a[MAXN];
int main(){
    fastio; int tc; cin>>tc;
    while(tc--){
        int n; cin>>n;
        int mx = -1;
        int sm = 0;
        int aux = 0;
        set<int> auxx;
        for(int i=0; i<n; i++){
            cin>>a[i];
            sm += a[i];
            if(auxx.find(a[i])==auxx.end()){
                auxx.insert(a[i]);
                aux = (aux^a[i]);
            }
            mx = max(mx, a[i]);
        }
        if(mx > sm - mx){
            cout<<"T"<<endl; continue;
        }
        sort(a, a+n);
        if(n==1){
            cout<<"T"<<endl;
        }else if(n==2){
            if(a[0] == a[1])cout<<"HL"<<endl;
            else cout<<"T"<<endl;
        }else{//3 piles or more !!!
            if(aux==0)cout<<"HL"<<endl;
            else cout<<"T"<<endl;
        }
    }
}


#include <bits/stdc++.h>
using namespace std;
int main(){
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  while(t--){
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++){
      cin >> a[i];
    }
    sort(a.begin(), a.end(), greater<int>());
    int opt = 0, last = -1;
    while(true){
      int k = last == 0;
      for(int i = 0; i < a.size(); i++){
	if(i!=last && a[i]>=a[k])
	  k = i;
      }
      if(a[k]==0 || k == last){
	if(opt%2==0)
	  cout << "HL" << endl;
	else
	  cout << "T" << endl;
	break;
      }
      last = k;
      opt++;
      a[k]--;
    }
  }
}


#include <bits/stdc++.h>
using namespace std;
int main(){
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        vector<int> a(n);
        for(int i = 0; i < n; i++){
            cin >> a[i];
        }
        sort(a.begin(), a.end(), greater<int>());
        int opt = 0, last = -1;
        while(true){
            int k = 0;
            for(int i = 0; i < a.size(); i++){
                if(i!=last && a[i]>a[k])
                    k = i;
            }
            if(a[k]==0 || k == last){
                if(opt%2==0)
                    cout << "HL" << endl;
                else
                    cout << "T" << endl;
                break;
            }
            last = k;
            opt++;
            a[k]--;
        }
    }
}


#include <bits/stdc++.h>
using namespace std;
int main(){
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  while(t--){
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++){
      cin >> a[i];
    }
    sort(a.begin(), a.end(), greater<int>());
    int opt = 0, last = -1;
    while(true){
      int k = last == 0;
      for(int i = 0; i < a.size(); i++){
	if(i!=last && a[i]>=a[k])
	  k = i;
      }
      if(a[k]==0 || k == last || k >= n){
	if(opt%2==0)
	  cout << "HL" << endl;
	else
	  cout << "T" << endl;
	break;
      }
      last = k;
      opt++;
      a[k]--;
    }
  }
}


#include <bits/stdc++.h>

using namespace std;

int main(){
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  while(t--){
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++){
      cin >> a[i];
    }
    sort(a.begin(), a.end(), greater<int>());
    int opt = 0, last = -1;
    while(true){
      int k = -1;
      for(int i = 0; i < a.size(); i++){
	if(i!=last && a[i] > 0 && (k == -1 || a[i]>=a[k]))
	  k = i;
      }
      if(k == -1){
	if(opt%2==0)
	  cout << "HL" << endl;
	else
	  cout << "T" << endl;
	break;
      }
      last = k;
      opt++;
      a[k]--;
    }
  }
}


#include <bits/stdc++.h>
using namespace std;
int main(){
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        vector<int> a(n);
        for(int i = 0; i < n; i++){
            cin >> a[i];
        }
        sort(a.begin(), a.end(), greater<int>());
        int opt = 0, last = -1;
        while(true){
            int k = 0;
            for(int i = 0; i < a.size(); i++){
                if(i!=last && a[i]>=a[k])
                    k = i;
            }
            if(a[k]==0 || k == last){
                if(opt%2==0)
                    cout << "HL" << endl;
                else
                    cout << "T" << endl;
                break;
            }
            last = k;
            opt++;
            a[k]--;
        }
    }
}


#include <bits/stdc++.h>

using namespace std;

int main(){
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  while(t--){
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++){
      cin >> a[i];
    }
    sort(a.begin(), a.end(), greater<int>());
    int opt = 0, last = -1;
    while(true){
      int k = -1;
      for(int i = 0; i < a.size(); i++){
	if(i!=last && a[i] >= 0 && (k == -1 || a[i]>=a[k]))
	  k = i;
      }
      if(k == -1){
	if(opt%2==0)
	  cout << "HL" << endl;
	else
	  cout << "T" << endl;
	break;
      }
      last = k;
      opt++;
      a[k]--;
    }
  }
}


#include <bits/stdc++.h>

using namespace std;

int main(){
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  while(t--){
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++){
      cin >> a[i];
    }
    sort(a.begin(), a.end(), greater<int>());
    int opt = 0, last = -1;
    while(true){
      int k = -1;
      for(int i = 0; i < a.size(); i++){
	if(i!=last && (k == -1 || a[i]>=a[k]))
	  k = i;
      }
      if(k == -1 || k == last){
	if(opt%2==0)
	  cout << "HL" << endl;
	else
	  cout << "T" << endl;
	break;
      }
      last = k;
      opt++;
      a[k]--;
    }
  }
}


#include <bits/stdc++.h>
using namespace std;
int main(){
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        vector<int> a(n);
        int sum = 0;
        for(int i = 0; i < n; i++){
            cin >> a[i];
            sum +=a[i];
        }
        sort(a.begin(), a.end(), greater<int>());
        int opt = 0, last = -1;
        if(a[0]>(1+sum)/2 || sum%2==1)
            cout << "T" << endl;
        else
            cout << "HL" <<endl;

    }
}


#include <bits/stdc++.h>
using namespace std;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t; cin >> t;
  while(t--){
    int n; cin >> n;
    int v = 0;
    vector<int> a(n); for(auto&i:a) cin >> i, v += i;
    int m = 0; for(auto&i:a) m = max(m, i);
    cout << ((v-m-1)|v&1?"T\n":"HL\n");
  }
}


#include <bits/stdc++.h>
using namespace std;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t; cin >> t;
  while(t--){
    int n; cin >> n;
    int v = 0;
    vector<int> a(n); for(auto&i:a) cin >> i, v += i;
    int m = 0; for(auto&i:a) m = max(m, i);
    cout << ((v-m+1)|v&1?"T\n":"HL\n");
  }
}


#include <bits/stdc++.h>
using namespace std;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t; cin >> t;
  while(t--){
    int n; cin >> n;
    int v = 0;
    vector<int> a(n); for(auto&i:a) cin >> i, v += i;
    int m = 0; for(auto&i:a) m = max(m, i);
    cout << (((v-m+1)|v)&1?"T\n":"HL\n");
  }
}


#include <bits/stdc++.h>
using namespace std;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t; cin >> t;
  while(t--){
    int n; cin >> n;
    int v = 0;
    vector<int> a(n); for(auto&i:a) cin >> i, v += i;
    int m = 0, c = 0;
    for(auto&i:a){
      if(i == m) c++;
      if(i > m) m = i, c = 1;
    }
    cout << (v-m*c+c&1?"T\n":"HL\n");
  }
}


#include <bits/stdc++.h>
using namespace std;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t; cin >> t;
  while(t--){
    int n; cin >> n;
    int v = 0;
    vector<int> a(n); for(auto&i:a) cin >> i, v += i;
    int m = 0; for(auto&i:a) m = max(m, i);
    cout << (v-m&1?"HL\n":"T\n");
  }
}


#include <bits/stdc++.h>
using namespace std;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t; cin >> t;
  while(t--){
    int n; cin >> n;
    int v = 0;
    vector<int> a(n); for(auto&i:a) cin >> i, v += i;
    int m = 0; for(auto&i:a) m = max(m, i);
    cout << (m*2 > v || v&1 ? "T\n" : "HL\n");
  }
}


#include <bits/stdc++.h>
using namespace std;

const int N = 106;
int a[N];

void go() {
    int n; scanf("%d", &n);
    int sum = 0;
    int mx = 0;
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
        sum += a[i];
        mx = max(mx, a[i]);
    }
    if (n == 1) {
        puts("T");
    }
    else if (n == 2) {
        if (a[1] == a[2]) {
            puts("HL");
        }
        else {
            puts("T");
        }
    }
    else {
        if (sum - mx < mx) {
            puts("T");
        }
        else if (sum & 1) {
            puts("T");
        }
        else {
            puts("HL");
        }
    }
}

int main () {
    int T; scanf("%d", &T);
    while (T--) {
        go();
    }
}


#include <bits/stdc++.h>
using namespace std;

const int N = 106;
int a[N];

void go() {
    int n; scanf("%d", &n);
    int sum = 0;
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
        sum += a[i];
    }
    if (n == 1) {
        puts("T");
    }
    else if (n == 2) {
        if (a[1] == a[2]) {
            puts("HL");
        }
        else {
            puts("T");
        }
    }
    else {
        if (sum & 1) {
            puts("HL");
        }
        else {
            puts("T");
        }
    }
}

int main () {
    int T; scanf("%d", &T);
    while (T--) {
        go();
    }
}


#include <bits/stdc++.h>
using namespace std;

const int N = 106;
int a[N];

void go() {
    int n; scanf("%d", &n);
    int sum = 0;
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
        sum += a[i];
    }
    if (n == 1) {
        puts("T");
    }
    else if (n == 2) {
        if (a[1] == a[2]) {
            puts("HL");
        }
        else {
            puts("T");
        }
    }
    else {
        if (sum & 1) {
            puts("T");
        }
        else {
            puts("HL");
        }
    }
}

int main () {
    int T; scanf("%d", &T);
    while (T--) {
        go();
    }
}


#include <bits/stdc++.h>
using namespace std;

const int N = 106;
int a[N];

void go() {
    int n; scanf("%d", &n);
    int sum = 0;
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
        sum += a[i];
    }
    if (n == 1) {
        puts("T");
    }
    else if (n == 2) {
        if (a[1] == a[2]) {
            puts("HL");
        }
        else {
            puts("T");
        }
    }
    else {
        puts("T");
        return;
        if (sum & 1) {
            puts("T");
        }
        else {
            puts("HL");
        }
    }
}

int main () {
    int T; scanf("%d", &T);
    while (T--) {
        go();
    }
}


#include <bits/stdc++.h>

using namespace std;

int main()
{
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	int t;
	cin >> t;
	for(;t>0;t--)
	{
		int n;
		int a;
		int sum=0;
		cin >> n;
		for(int i=0;i<n;i++)
		{
			cin >> a;
		sum+=a;
		}
		if(n==1)
			cout << "T\n";
		else
	{
		if(sum%2==0)
			cout << "HL\n";
		else
			cout << "T\n";
	}
}
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main()
{
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	int t;
	cin >> t;
	for(;t>0;t--)
	{
		int n;
		int a;
		cin >> n;
		for(int i=0;i<n;i++)
			cin >> a;
		if(n%2==1)
		cout << "T\n";
		else
		cout << "HL\n";
	}
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main()
{
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	int t;
	cin >> t;
	for(;t>0;t--)
	{
		int n;
		int a;
		int sum=0;
		cin >> n;
		for(int i=0;i<n;i++)
		{
			cin >> a;
			sum+=a;
		}
		if(n==1)
			cout << "T\n";
		else
	{
		if(sum%2==0)
			cout << "HL\n";
		else
			cout << "T\n";
	}
}
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main()
{
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	int t;
	cin >> t;
	for(;t>0;t--)
	{
		int n;
		int a;
		int maxi=0;
		int sum=0;
		cin >> n;
		for(int i=0;i<n;i++)
		{
			cin >> a;
			sum+=a;
			maxi=max(maxi,a);
		}
		if(n==1)
			cout << "T\n";
		else
		{
			if(n==2)
			{
				if(maxi*2==sum)
				cout << "HL\n";
			else
				cout << "T\n";
			}
			else
			{
			if(maxi>sum-maxi)
				cout << "T\n";
			else
				{
					if(sum%2==0)
				cout << "HL\n";
			else
				cout << "T\n";
				}
			}
		}
	}
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
int X[110];
int SumA,SumB;
void Solve()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>X[i];
    SumA=SumB=0;
    sort(X,X+n);
    reverse(X,X+n);
    for(int i=0;i<n-1;i++)
        if(SumA<=SumB)
            SumA+=X[i];
        else    SumB+=X[i];
    if(SumA<=SumB)
        puts("HL");
    else    puts("T");
    return ;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
        Solve();
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int x[110];
void Solve()
{
    int n;
    cin>>n;
    int Sum=0;
    for(int i=0;i<n;i++)
    {
        cin>>x[i];
        Sum+=x[i];
    }
    int last=-1;
    for(int i=0;i<Sum;i++)
    {
        bool find=false;
        for(int j=0;j<n;j++)
            if(j!=last&&x[j])
            {
                x[j]--;
                last=j;
                find=true;
                break;
            }
        if(!find)
        {
            if(i%2)
                puts("HL");
            else    puts("T");
            return ;
        }
    }
    if(Sum%2)
        puts("HL");
    else    puts("T");
}
int main()
{
    int t;
    cin>>t;
    while(t--)
        Solve();
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int x[110];
void Solve()
{
    int n;
    cin>>n;
    int Sum=0;
    for(int i=0;i<n;i++)
    {
        cin>>x[i];
        Sum+=x[i];
    }
    sort(x,x+n);
    reverse(x,x+n);
    int last=-1;
    for(int i=0;i<Sum;i++)
    {
        bool find=false;
        for(int j=0;j<n;j++)
            if(j!=last&&x[j])
            {
                x[j]--;
                last=j;
                find=true;
                break;
            }
        if(!find)
        {
            if(i%2)
                puts("T");
            else    puts("HL");
            return ;
        }
    }
    if(Sum%2)
        puts("T");
    else    puts("HL");
}
int main()
{
    int t;
    cin>>t;
    while(t--)
        Solve();
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int x[110];
void Solve()
{
    int n;
    cin>>n;
    int Sum=0;
    for(int i=0;i<n;i++)
    {
        cin>>x[i];
        Sum+=x[i];
    }
    sort(x,x+n);
    reverse(x,x+n);
    int last=-1;
    for(int i=0;i<Sum;i++)
    {
        bool find=false;
        for(int j=0;j<n;j++)
            if(j!=last&&x[j])
            {
                x[j]--;
                last=j;
                find=true;
                break;
            }
        if(!find)
        {
            if(i%2)
                puts("T");
            else    puts("HL");
            return ;
        }
        int tmp=x[last];
        sort(x,x+n);
        reverse(x,x+n);
        for(int j=0;j<n;j++)
            if(x[j]==tmp)
            {
                last=j;
                break;
            }
    }
    if(Sum%2)
        puts("T");
    else    puts("HL");
}
int main()
{
    int t;
    cin>>t;
    while(t--)
        Solve();
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int x[110];
void Solve()
{
    int n;
    cin>>n;
    int Sum=0;
    for(int i=0;i<n;i++)
    {
        cin>>x[i];
        Sum+=x[i];
    }
    int last=-1;
    for(int i=0;i<Sum;i++)
    {
        bool find=false;
        for(int j=0;j<n;j++)
            if(j!=last&&x[j])
            {
                x[j]--;
                last=j;
                find=true;
                break;
            }
        if(!find)
        {
            if(i%2)
                puts("T");
            else    puts("HL");
            return ;
        }
    }
    if(Sum%2)
        puts("T");
    else    puts("HL");
}
int main()
{
    int t;
    cin>>t;
    while(t--)
        Solve();
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int x[110];
void Solve()
{
    int n;
    cin>>n;
    int Sum=0;
    for(int i=0;i<n;i++)
    {
        cin>>x[i];
        Sum+=x[i];
    }
    sort(x,x+n);
    //reverse(x,x+n);
    int last=-1;
    for(int i=0;i<Sum;i++)
    {
        bool find=false;
        for(int j=0;j<n;j++)
            if(j!=last&&x[j])
            {
                x[j]--;
                last=j;
                find=true;
                break;
            }
        if(!find)
        {
            if(i%2)
                puts("T");
            else    puts("HL");
            return ;
        }
    }
    if(Sum%2)
        puts("T");
    else    puts("HL");
}
int main()
{
    int t;
    cin>>t;
    while(t--)
        Solve();
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int X[110];
int SumA,SumB;
void Solve()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>X[i];
    SumA=SumB=0;
    sort(X,X+n);
    reverse(X,X+n);
    for(int i=0;i<n-1;i++)
        if(SumA<=SumB)
            SumA+=X[i];
        else    SumB+=X[i];
    if(SumA>=SumB)
        puts("HL");
    else    puts("T");
    return ;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
        Solve();
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int x[110];
void Solve()
{
    int n;
    cin>>n;
    int Sum=0;
    for(int i=0;i<n;i++)
    {
        cin>>x[i];
        Sum+=x[i];
    }
    sort(x,x+n);
    reverse(x,x+n);
    int last=-1;
    for(int i=0;i<Sum;i++)
    {
        bool find=false;
        for(int j=0;j<n;j++)
            if(j!=last&&x[j])
            {
                x[j]--;
                last=j;
                find=true;
                break;
            }
        if(!find)
        {
            if(i%2)
                puts("T");
            else    puts("HL");
            return ;
        }
        sort(x,x+n);
        reverse(x,x+n);
    }
    if(Sum%2)
        puts("T");
    else    puts("HL");
}
int main()
{
    int t;
    cin>>t;
    while(t--)
        Solve();
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int X[110];
int SumA,SumB;
void Solve()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>X[i];
    SumA=SumB=0;
    sort(X,X+n);
    reverse(X,X+n);
    for(int i=0;i<n-1;i++)
        if(SumA<=SumB)
            SumA+=X[i];
        else    SumB+=X[i];
    if(SumA>SumB)
        puts("HL");
    else    puts("T");
    return ;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
        Solve();
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int X[110];
int SumA,SumB;
void Solve()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>X[i];
    SumA=SumB=0;
    sort(X,X+n);
    reverse(X,X+n);
    if(n==1)
    {
        puts("T");
        return ;
    }
    for(int i=0;i<n-1;i++)
        if(SumA<=SumB)
            SumA+=X[i];
        else    SumB+=X[i];
    if(SumA>=SumB)
        puts("HL");
    else    puts("T");
    return ;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
        Solve();
    return 0;
}


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;

typedef long double ld;
typedef pair<ll,ll> pp;
typedef tree<pp,null_type,less<pp>,rb_tree_tag,tree_order_statistics_node_update> super_set;

#define x1 dfds
#define y1 dsfdsfe
#define pb push_back
#define forn(i,n) for(ll i = 1;i<=n;++i)
#define fi first
#define sc second
#define endl '\n'
#define po(x) (1ll<<x)
#define log sdfdsfdsf

const ll DIM = 100+7;
const ll INF = 1E17;

int getInt(int a = 0, int b = INT_MAX){
	static mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	return uniform_int_distribution <int> (a, b)(rng);
}

ll A[DIM];
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    ll t;
    cin>>t;
    while(t--){
        ll n;

        cin>>n;
        ll sum = 0;
        ll mx = 0;
        forn(i,n){
            cin>>A[i];
            sum+=A[i];
            mx = max(mx,A[i]);
        }
        if (mx*2>sum){
            ll state = (sum-mx+1)%2;
            ll ad = mx*2-sum;
            state+=(ad)%2;
            if (state%2)cout<<"T\n";
            else cout<<"HL\n";
        }
        else{
            if (sum%2==0)cout<<"HL\n";
            else cout<<"T\n";
        }

    }

    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long y,k,n,x,_3aaa=0,i2=1;
    cin>>y>>k>>n;
    if(n<=y)goto here;
    if(y<k){i2=k-y;}
    for(int i=i2 ; i <= n ; i++){
        if((y+i)%k==0){_3aaa=1;x=i;break;}
    }
    for(int i=0 ; i <= n-y and _3aaa ; i+=k){
        if((y+x+i)%k==0&&(y+x+i)<=n)cout<<x+i<<' ';
    }here:
    if(!_3aaa)cout<<-1<<endl;
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long y,k,n,x,_3aaa=0,i2=1,o=1;
    cin>>y>>k>>n;
    if(n<=y)goto here;
    if(y<k)i2=k-y;
    else if(y==k)i2=y;
    else{
        while((o*k)<y)o++;
        o*=k;x=o-y;
        _3aaa=1;
        goto here2;
    }
    for(int i=i2 ; i <= n-y ; i++){
        if((y+i)%k==0){_3aaa=1;x=i;break;}
    }here2:
    for(int i=0 ; i <= n-y and _3aaa ; i+=k){
        if((y+x+i)%k==0&&(y+x+i)<=n&&(x+i)!=0)cout<<x+i<<' ';
    }here:
    if(!_3aaa)cout<<-1<<endl;
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long y,k,n,x,_3aaa=0,i2=1,o=1;
    cin>>y>>k>>n;
    if(n<=y)goto here;
    if(y<k)i2=k-y;
    else if(y==k)i2=y;
    else{
        while((o*k)<y)o++;
        o*=k;x=o-y;
        _3aaa=1;
        goto here2;
    }
    for(int i=i2 ; i <= n-y ; i++){
        if((y+i)%k==0){_3aaa=1;x=i;break;}
    }here2:
    for(int i=0 ; i <= n-y and _3aaa ; i+=k){
        if((y+x+i)%k==0&&(y+x+i)<=n)cout<<x+i<<' ';
    }here:
    if(!_3aaa)cout<<-1<<endl;
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long y,k,n,x,_3aaa=0;
    cin>>y>>k>>n;
    for(int i=1 ; i <= n-y ; i++){
        if((y+i)%k==0){_3aaa=1;x=i;break;}
    }
    for(int i=0 ; i <= n-y and _3aaa ; i+=k){
        if((y+x+i)%k==0&&(y+x+i)<=n)cout<<x+i<<' ';
    }
    if(!_3aaa)cout<<-1<<endl;
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long y,k,n,x,_3aaa=0,i2=1,o=1;
    cin>>y>>k>>n;
    if(n<=y)goto here;
    if(y<k)i2=k-y;
    else if(y==k)i2=y;
    else{
        while((o*k)<y)o++;
        o*=k;x=o-y;
        if(x+y<=n)_3aaa=1;
        goto here2;
    }
    for(int i=i2 ; i <= n-y ; i++){
        if((y+i)%k==0){_3aaa=1;x=i;break;}
    }here2:
    for(int i=0 ; i <= n-y and _3aaa ; i+=k){
        if((y+x+i)%k==0&&(y+x+i)<=n&&(x+i)!=0)cout<<x+i<<' ';
    }here:
    if(!_3aaa)cout<<-1<<endl;
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long y,k,n,x,_3aaa=0,i2=1,o=1;
    cin>>y>>k>>n;
    if(n<=y)goto here;
    if(y<k)i2=k-y;
    else if(y==k)i2=y;
    else{
        while((o*k)<y)o++;
        o*=k;x=o-y;
        if(x+y<=n&&x+k<=n)_3aaa=1;
        goto here2;
    }
    for(int i=i2 ; i <= n-y ; i++){
        if((y+i)%k==0){_3aaa=1;x=i;break;}
    }here2:
    for(int i=0 ; i <= n-y and _3aaa ; i+=k){
        if((y+x+i)%k==0&&(y+x+i)<=n&&(x+i)!=0)cout<<x+i<<' ';
    }here:
    if(!_3aaa)cout<<-1<<endl;
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long y,k,n,x,_3aaa=0,i2=1;
    cin>>y>>k>>n;
    if(n<=y)goto here;
    if(y>k&&k!=1){x=((y+k)/k);_3aaa=1;goto here2;}
    else if(y<k){i2=k-y;}
    for(int i=i2 ; i <= n ; i++){
        if((y+i)%k==0){_3aaa=1;x=i;break;}
    }here2:
    for(int i=0 ; i <= n-y and _3aaa ; i+=k){
        if((y+x+i)%k==0&&(y+x+i)<=n)cout<<x+i<<' ';
    }here:
    if(!_3aaa)cout<<-1<<endl;
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long y,k,n,x,_3aaa=0,i2=1,o=1;
    cin>>y>>k>>n;
    if(n<=y){cout<<-1<<endl;return 0;}
    else{x=k-(y%k);y=y+x;}
    if(y<=n)
    while(y<=n){
        cout<<x<<' ';x+=k;y+=k;
    }
    else cout<<-1<<endl;
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long y,k,n,x,_3aaa=0;
    cin>>y>>k>>n;
    if((n-y)<k)goto here;
    for(int i=1 ; i <= n-y ; i++){
        if((y+i)%k==0){_3aaa=1;x=i;break;}
    }
    for(int i=0 ; i <= n-y and _3aaa ; i+=k){
        if((y+x+i)%k==0&&(y+x+i)<=n)cout<<x+i<<' ';
    }here:
    if(!_3aaa)cout<<-1<<endl;
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long y,k,n,x,_3aaa=0,i2=1,o=1;
    cin>>y>>k>>n;
    if(n<=y)goto here;
    if(y<k)i2=k-y;
    else if(y==k)i2=y;
    else{
        while((o*k)<y)o++;
        o*=k;x=o-y;
        if(x+y<=n&&x!=0)_3aaa=1;
        goto here2;
    }
    for(int i=i2 ; i <= n-y ; i++){
        if((y+i)%k==0){_3aaa=1;x=i;break;}
    }here2:
    for(int i=0 ; i <= n-y and _3aaa ; i+=k){
        if((y+x+i)%k==0&&(y+x+i)<=n&&(x+i)!=0)cout<<x+i<<' ';
    }here:
    if(!_3aaa)cout<<-1<<endl;
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long y,k,n,x,_3aaa=0,i2=1;
    cin>>y>>k>>n;
    if(n<=y)goto here;
    if(y<k){i2=k-y;}
    for(int i=i2 ; i <= n-y ; i++){
        if((y+i)%k==0){_3aaa=1;x=i;break;}
    }
    for(int i=0 ; i <= n-y and _3aaa ; i+=k){
        if((y+x+i)%k==0&&(y+x+i)<=n)cout<<x+i<<' ';
    }here:
    if(!_3aaa)cout<<-1<<endl;
    return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

long long n,k,x,s,p=1,y,z,ma;

int main(){
    cin>>y>>k>>n;
    x=y;
    if (n<=y) {cout<<-1; return 0;}
    for(int i=1; i<=n; i++)
    	if ((y+i)%k==0) {cout<<i<<" "; y+=i; p=0; break; }
    y+=k;
    while(y<=n){
    	p=0;
    	cout<<y-x<<" ";
    	y+=k;
    }
    if (p==1) cout<<-1;
    return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;
int y,k,n,l=0;
int main()
{
	cin>>y>>k>>n;
	for(int i=1; i*k-y%k+y<=n; i++)
	 {
	 cout<<i*k-y%k<<' ';
	 l++;
	 }
	 if(!l)
	  cout<<"-1";
	return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

long long n,k,x,s,p=1,y,z,ma;

int main(){
    cin>>y>>k>>n;
    x=y;
    if (n<=y) {cout<<-1; return 0;}
    if (k==n) {cout<<n-y; return 0;}
    for(int i=1; i<=n; i++)
    	if ((y+i)%k==0) {cout<<i<<" "; y+=i; p=0; break; }
    y+=k;
    while(y<=n){
    	p=0;
    	cout<<y-x<<" ";
    	y+=k;
    }
    if (p==1) cout<<-1;
    return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

int y,n,k,p=0;

int main() {
	cin>>y>>k>>n;
	if (k==n || k>(n-y)) {cout<<-1; exit(0);}
	for (int i=1; i<=n-y; i++) {
		if ((y+i)%k==0) {p=i; break;}

		if (i>k) break;
	}
    if (p!=0) {cout<<p<<" ";
    	p+=k;
    	while(p+y<=n){
    		cout<<p<<" ";
    	    p+=k;
    	}
    	exit(0);
    }
    cout<<-1;

	return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

int y,n,k,p=0;

int main() {
	cin>>y>>k>>n;
	if (k==n) {cout<<n-y; exit(0);}
	for (int i=1; i<=n-y; i++) {
		if ((y+i)%k==0) {p=i; break;}

		if (i>k) break;
	}
    if (p!=0) {cout<<p<<" ";
    	p+=k;
    	while(p+y<=n){
    		cout<<p<<" ";
    	    p+=k;
    	}
    	exit(0);
    }
    cout<<-1;

	return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

long long n,k,x,s,p=1,y,z,ma;

int main(){
    cin>>y>>k>>n;
    x=y;
    if (n<=y || k>n) {cout<<-1; return 0;}
    if (k==n) {cout<<n-y; return 0;}
    for(int i=1; i<=n-y; i++)
    	if ((y+i)%k==0) {cout<<i<<" "; y+=i; p=0; break; }
    y+=k;
    while(y<=n){
    	p=0;
    	cout<<y-x<<" ";
    	y+=k;
    }
    if (p==1) cout<<-1;
    return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

int y,n,k,p=0;

int main() {
	cin>>y>>k>>n;
	if (k==n) {cout<<n-y; exit(0);}
	if (y>k){
		for (int i=1; i<=n-y; i++) {
			if ((y+i)%k==0) {p=i; break;}
			if (i>k) break;
		}
	} else {
		for (int i=k-y; i<=n-y; i++) {
			if ((y+i)%k==0) {p=i; break;}
			if (i>k) break;
		}
	}
    if (p!=0) {cout<<p<<" ";
    	p+=k;
    	while(p+y<=n){
    		cout<<p<<" ";
    	    p+=k;
    	}
    	exit(0);
    }
    cout<<-1;

	return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

int y,n,k,p=0;

int main() {
	cin>>y>>k>>n;
	if (k==n && y<k) {cout<<n-y; exit(0);}
	if (k==n && y==k) {cout<<-1; exit(0);}

	if (k==y && k+y<=n) p=y; else {
		if (y>k){
			for (int i=1; i<=n-y; i++) {
				if ((y+i)%k==0) {p=i; break;}
			}
		} else {
			if (y<k){
				for (int i=k-y; i<=n-y; i++) {
					if ((y+i)%k==0) {p=i; break;}
					}
		}
		}
	}

    if (p!=0) {cout<<p<<" ";
    	p+=k;
    	while(p+y<=n){
    		cout<<p<<" ";
    	    p+=k;
    	}
    	exit(0);
    }
    cout<<-1;

	return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

long long n,k,x,s,p=1,y,z,ma,ii;

int main(){
    cin>>y>>k>>n;
    x=y;
    if (n<=y || k>n) {cout<<-1; return 0;}
    if (k==n) {cout<<n-y; return 0;}
    if (y<k) {ii=k-y;}
    for(int i=ii; i<=n-y; i++)
    	if ((y+i)%k==0) {cout<<i<<" "; y+=i; p=0; break; }
    y+=k;
    while(y<=n){
    	p=0;
    	cout<<y-x<<" ";
    	y+=k;
    }
    if (p==1) cout<<-1;
    return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

long long n,k,x,s,p=1,y,z,ma,ii;

int main(){
    cin>>y>>k>>n;
    x=y;
    if (n<=y || k>n) {cout<<-1; return 0;}
    if (k==n) {cout<<n-y; return 0;}
    if (y<k) {cout<<k-y<<" "; y=k; p=0;} else{
    for(int i=1; i<=n-y; i++)
    	if ((y+i)%k==0) {cout<<i<<" "; y+=i; p=0; break; } }
    y+=k;
    while(y<=n){
    	p=0;
    	cout<<y-x<<" ";
    	y+=k;
    }
    if (p==1) cout<<-1;
    return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

int y,n,k,p=0;

int main() {
	cin>>y>>k>>n;
	for (int i=1; i<=n-y; i++) {
		if ((y+i)%k==0) {p=i; break;}

		if (i>k) break;
	}
    if (p!=0) {cout<<p<<" ";
    	p+=k;
    	while(p+y<=n){
    		cout<<p<<" ";
    	    p+=k;
    	}
    	exit(0);
    }
    cout<<-1;

	return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

long long n,k,x,s,p=1,y,z,ma,ii;

int main(){
    cin>>y>>k>>n;
    x=y;
    if (n<=y || k>n) {cout<<-1; return 0;}
    if (k==n) {cout<<n-y; return 0;}
    if (y<k) {cout<<k-y<<" "; y=k; p=0;} else
    if (y==k) y=k;  else{

    for(int i=1; i<=n-y; i++)
    	if ((y+i)%k==0) {cout<<i<<" "; y+=i; p=0; break; } }
    y+=k;
    while(y<=n){
    	p=0;
    	cout<<y-x<<" ";
    	y+=k;
    }
    if (p==1) cout<<-1;
    return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

long long n,k,x,s,p=1,y,z,ma,ii;

int main(){
    cin>>y>>k>>n;
    x=y;
    if (n<=y || k>n) {cout<<-1; return 0;}
    if (k==n) {cout<<n-y; return 0;}
    if (y<=k) {cout<<k-y<<" "; y=k; p=0;} else{
    for(int i=1; i<=n-y; i++)
    	if ((y+i)%k==0) {cout<<i<<" "; y+=i; p=0; break; } }
    y+=k;
    while(y<=n){
    	p=0;
    	cout<<y-x<<" ";
    	y+=k;
    }
    if (p==1) cout<<-1;
    return 0;
}


#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>

using namespace std;

long long n,k,x,s,p=1,y,z,ma,ii;

int main(){
    cin>>y>>k>>n;
    x=y;
    if (n<=y || k>n) {cout<<-1; return 0;}
    if (k==n) {cout<<n-y; return 0;}
    if (y<k) {cout<<k-y<<" "; y=k; } else{
    for(int i=1; i<=n-y; i++)
    	if ((y+i)%k==0) {cout<<i<<" "; y+=i; p=0; break; } }
    y+=k;
    while(y<=n){
    	p=0;
    	cout<<y-x<<" ";
    	y+=k;
    }
    if (p==1) cout<<-1;
    return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long j=0,y,k,n;
	long i;
	while(cin>>y>>k>>n)
	{
			for(i=1;i+y<=n;i++)
				if((i+y)%k==0)
				{
					j=1;
					break;
				}
			if(j==1)
			{
				for(j=i;j<=n-y;)
				{
					cout<<j<<" ";
					j+=k;
				}
				cout<<endl;
			}
			else{
				cout<<-1<<endl;
			}
			j=0;
	}
		return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long j=0,y,k,n;
	long i;
	scanf("%d%d%d",&y,&k,&n);
	for(i=1;i+y<=n;i++)
		if((i+y)%k==0)
		{
			j=1;
			break;
		}
	if(j==1)
	{
		for(j=i;j<=n-y;)
		{
			printf("%d ",j);
			j+=k;
		}
		printf("\n");
	}
	else{
		printf("%d",-1);
		printf("\n");}
		return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long j=0,y,k,n;
	long i;
	while(scanf("%d%d%d",&y,&k,&n)!=EOF)
	{
	for(i=1;i+y<=n;i++)
		if((i+y)%k==0)
		{
			j=1;
			printf("%d ",i);
		}
		if(j==0)
			printf("%d",-1);
		printf("\n");
		j=0;
	}
		return 0;

}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long i,j,y,k,n,p;
	cin>>y>>k>>n;
	j=0;
			if(n<k||y>=n)
			{
				cout<<-1<<endl;
				return 0;
			}
			for(i=1;i+y<=n;i++)
				if((i+y)%k==0)
				{
					j=1;
					break;
				}
			if(j==1)
			{
				for(p=i;p+y<=n;p+=k)
				{
					cout<<p<<" ";
				}
				cout<<endl;
                                 return 0;
			}
			else{
				cout<<-1<<endl;
                                return 0;
			}
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	int  i=1,j=0,y,k,n,p,l=0;
	cin>>y>>k>>n;
			if(n<k||y>=n)
			{
				cout<<-1<<endl;
				return 0;
			}
			if(y<k)
				i=k-y;
			else
			{
				for(i=1;i<=n-y;i++)
				{
					if((i+y)%k==0) {l=1;break;}}
			}if(l==0){cout<<-1<<endl;return 0;}
			for(p=i;p+y<=n;p+=k)
				{
					cout<<p<<" ";
				}
				cout<<endl;
		return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	int j,y,k,n;
	int i;
	scanf("%d%d%d",&y,&k,&n);
	for(i=0;i+y<=n;i++)
		if((i+y)%k==0)
			printf("%d ",i);
		return 0;

}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long j=0,y,k,n,p;
	long i=0;
	while(cin>>y>>k>>n)
	{
			for(i=1;i+y<=n;i++)
				if((i+y)%k==0)
				{
					j=1;
					break;
				}
			if(j==1)
			{
				for(p=i;p+y<=n;)
				{
					cout<<p<<" ";
					p+=k;
				}
				cout<<endl;
			}
			else{
				cout<<-1<<endl;
			}
			j=0;
	}
		return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	int  i=1,j=0,y,k,n,p,l=0;
	cin>>y>>k>>n;
			if(n<k||y>=n)
			{
				cout<<-1<<endl;
				return 0;
			}
			if(y<k)
				i=k-y;
			else
			{
				for(i=1;i<=n-y;i++)
				{
					if((i+y)%k==0)
					{
						l=1;
					   break;
					}
				}
			}
			if(y>=k&&l==0)
			{
				cout<<-1<<endl;
				return 0;
			}
			for(p=i;p+y<=n;p+=k)
				{
					cout<<p<<" ";
				}
				cout<<endl;
		return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long j=0,y,k,n;
	long i;
	while(cin>>y>>k>>n)
	{
			for(i=0;i+y<=n;i++)
				if((i+y)%k==0)
				{
					j=1;
					break;
				}
			if(j==1)
			{
				for(j=i;j<=n-y;)
				{
					cout<<j<<" ";
					j+=k;
				}
				cout<<endl;
			}
			else{
				cout<<-1<<endl;
			}
			j=0;
	}
		return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long j,y,k,n;
	long i;
	while(scanf("%d%d%d",&y,&k,&n)!=EOF)
	{
	for(i=1;i+y<=n;i++)
		if((i+y)%k==0)
			printf("%d ",i);
		printf("\n");
	}
		return 0;

}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	int j=0,y,k,n,p;
	int i=0;
	while(cin>>y>>k>>n)
	{
			for(i=1;i+y<=n;i++)
				if((i+y)%k==0)
				{
					j=1;
					break;
				}
			if(j==1)
			{
				for(p=i;p+y<=n;)
				{
					cout<<p<<" ";
					p+=k;
				}
				cout<<endl;
			}
			else{
				cout<<-1<<endl;
			}
			j=0;
	}
		return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	int j,y,k,n;
	int i;
	while(scanf("%d%d%d",&y,&k,&n)!=EOF)
	{
	for(i=1;i+y<=n;i++)
		if((i+y)%k==0)
			printf("%d ",i);
		printf("\n");
	}
		return 0;

}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long  i=1,j=0,y,k,n,p,l=0;
	      scanf("%d%d%d",&y,&k,&n);
			if(n<k||y>=n)
			{
				cout<<-1<<endl;
				return 0;
			}
			if(y<k)
				i=k-y;
			else
			{
				for(i=1;i<=n-y;i++)
				{
					if((i+y)%k==0)
					{
						l=1;
					   break;
					}
				}
			}
			if(y>=k&&l==0)
			{
				cout<<-1<<endl;
				return 0;
			}
			for(p=i;p+y<=n;p+=k)
				{
				printf("%d ",p);
				}
				cout<<endl;
		return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long j=0,y,k,n;
	long i;
	while(scanf("%d%d%d",&y,&k,&n)!=EOF){
	for(i=1;i+y<=n;i++)
		if((i+y)%k==0)
		{
			j=1;
			break;
		}
	if(j==1)
	{
		for(j=i;j<=n-y;)
		{
			printf("%d ",j);
			j+=k;
		}
		printf("\n");
	}
	else{
		printf("%d",-1);
		printf("\n");}}
		return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long  i=1,j=0,y,k,n,p,l=0;
	      scanf("%d%d%d",&y,&k,&n);
			if(n<k||y>=n)
			{
				printf("%d\n",-1);
				return 0;
			}
			if(y<k)
				i=k-y;
			i=k-y%k;
			if(i+y>n)
			{
				printf("%d\n",-1);
				return 0;
			}
			for(p=i;p+y<=n;p+=k)
			{
				printf("%d ",p);
			}
				cout<<endl;
		return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long j=0,y,k,n;
	long i;
	scanf("%d%d%d",&y,&k,&n);
	for(i=1;i+y<=n;i++)
		if((i+y)%k==0)
		{
			j=1;
			printf("%d ",i);
		}
	if(j==0)
		printf("%d",-1);
	printf("\n");
		return 0;

}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long j=0,y,k,n;
	long i;
	scanf("%d%d%d",&y,&k,&n);
	for(i=1;i+y<=n;i++)
		if((i+y)%k==0)
		{
			j=1;
			break;
		}
	if(j==1)
	{
		for(j=i;j<=n;)
		{
			printf("%d ",j);
			j+=k;
		}
		printf("\n");
	}
	else{
		printf("%d",-1);
		printf("\n");}
		return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	int  i=1,j=0,y,k,n,p;
	cin>>y>>k>>n;
			if(n<k||y>=n)
			{
				cout<<-1<<endl;
				return 0;
			}
			if(y<k)
				i=k-y;
			else
			{
				for(i=1;i<=n-y;i++)
				{
					if((i+y)%k==0) break;}
			}
			for(p=i;p+y<=n;p+=k)
				{
					cout<<p<<" ";
				}
				cout<<endl;
		return 0;
}


#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long j=0,y,k,n;
	long i;
	while(scanf("%d%d%d",&y,&k,&n)!=-1){
	for(i=1;i+y<=n;i++)
		if((i+y)%k==0)
		{
			j=1;
			break;
		}
	if(j==1)
	{
		for(j=i;j<=n-y;)
		{
			printf("%d ",j);
			j+=k;
		}
		printf("\n");
	}
	else{
		printf("%d",-1);
		printf("\n");}
          j=0;
}
		return 0;
}


#include <cstdio>

using namespace std;

int main()
{
    int y , k , n ;
    scanf ( "%d%d%d" , &y , &k , &n );
    int num =  (y / k + 1 ) * k ;
    if ( num <= n )
    {
            while ( num <= n )
            {
                while ( num - y <= 0 )  num += k;
                printf ( "%d " , num - y );
                num +=k;
            }
    }
    else  printf ( "-1" );
}


#include<iostream>
using namespace std;
int main(){
    long long y,k,n,temp;
    while(cin>>y>>k>>n){
            bool f =0;
            for(int i=y+1;i<=n;i++){
                    if(i%k==0){
                        temp=i-y;
                        f=1;
                        break;
                    }
            }
            if(f==0)
                    cout<<-1;
            else if(f==1){
                    cout<<temp;
                    for(int i=temp+k;i<(n-y);i=i+k)
                            cout<<" "<<i;
            }
                     cout<<endl;

    }

}


#include<stdio.h>

int main()
{
    int k,x,y,n;
    scanf("%d%d%d",&y,&k,&n);
    x=k-y%k;
    while(x-k>0)
        x-=k;
    bool judge=true;
    for(;x+y<=n;x+=k)
    {
        printf("%d",x);
        if(x+y+k<=n)
            printf(" ");
        judge=false;
    }
    if(judge)
        printf("-1\n");
    else printf("\n");
    return 0;
}


#include <cstdio>
using namespace std;

int main()
{
    int y, k, n;
    while(~scanf("%d %d %d", &y, &k, &n))
    {
        n -= y;
        int x = (k+(-y)%k)%k;
        while(x < 1) x += k;
        if(x > n){
             puts("-1");
             continue;
        }
        bool f = false;
        while(x <= n)
        {
            if(f) printf(" ");
            printf("%d", x);
            x += k;
            f = true;
        }
        puts("");
    }
    return 0;
}


#include <iostream>

using namespace std;

int main()
{
    long y , k , n ;
    cin >> y >> k >> n;
    long num = k;
    if (  y >= n )
    {
        cout << -1 << endl;
        return 0;
    }
    bool flag = false;
    while ( num  <= n )
    {
            while (  num <  y  )    num += k;
            if ( flag )   cout << " " ;
            cout << num - y  ;
            num +=  k;
            flag =  true;
    }
    cout << endl;
    return 0;
}


#include<iostream>
using namespace std;
int x,y,n,k;
int main()
{
	cin>>y>>k>>n;
	int s=0;
	for(int i=k;i<=n;i+=k)
	{
		if(i-y>0)
		{
			if(s)cout<<' ';
			cout<<i-y;
			s++;
		}
	}
	if(s==0)cout<<-1;
	cout<<endl;
	return 0;
}


#include <cstdio>
#include <vector>
#include <iostream>
#include <cstring>
using namespace std;

int main()
{
    int n, k, y;
    while(~scanf("%d %d %d", &y, &k, &n))
    {
        if(y >= n)
        {
            puts("-1");
            continue;
        }
        y++;

        int Min = y/k;
        if(Min * k < y) Min++;
        int Max = n/k;
        if(Min > Max)
        {
            puts("-1");
            continue;
        }

        int flag = 0;
        for(int i = Min; i <= Max; i++)
        {
            if(flag) printf(" ");
            flag = 1;
            printf("%d",i*k-y + 1);
        }
        puts("");
    }
    return 0;
}


#include <iostream>

using namespace std;

int main()
{
   int x,y,n;
   cin>>x>>n>>y;
   if(x>=y)
   {
       cout<<-1;
   }
   else
   {
       for(int i =1;;i++)
       {
           if((n*i)>x&&(n*i)<=y)
           {
               cout<<(n*i)-x<<" ";
           }
           else if((n*i)>y)
              break;

       }
   }
   cout<<endl;
   return 0;
}


#include<stdio.h>
#include<string>
#include<iostream>
using namespace std;
int main()
{
    //freopen("1.in","r",stdin);
    long long y,n,k;
    while(scanf("%I64d%I64d%I64d",&y,&k,&n)!=EOF)
    {
        long long r=n/k;
        if(n%k==0)r--;
        r=r*k;
        long long l=y/k+1;
        l=l*k;
        if(l>r)printf("-1\n");
        else
        {
        printf("%I64d",l-y);
        for(long long i=l+k;i<=r;i+=k)
        printf(" %I64d",i-y);
        printf("\n");
        }
    }
    return 0;
}


#include<iostream>
#include<cstdio>
#include<algorithm>
#include<math.h>
#include<map>
#include<vector>
#include<set>
using  namespace std;

int dp[100007];
int main(){
    int y,k,n;
    while(cin>>y>>k>>n){
        int x = k - y % k;
        //if(x == 0) x = k;
        if(x == 0) x = k;
        int cnt = 0;
        while(1){
            if( y + x <= n){
                dp[cnt++] = x;
            }
            else break;
            x+=k;
        }
        sort(dp,dp+cnt);
        if(cnt == 0)
            cout<<-1<<endl;
        else {
            for(int i = 0;i < cnt ;i++){
                if(i != 0) cout<<" ";
                cout<<dp[i];
            }
            cout<<endl;
        }
    }
}


int main()
{
    int y, k, n;
    scanf("%d%d%d", &y, &k, &n);
    int x = k - y % k;
    int top = n - y;
    if (x <= top)
    {
        printf("%d", x);
        x += k;
        while (x <= top)
        {
            printf(" %d", x);
            x += k;
        }
        printf("\n");
    }
    else
    {
        printf("-1\n");
    }
    return 0;
}


#include <iostream>
using namespace std;
int main(){
	int y,k,n,re=0;
	while(cin>>y>>k>>n){
        if(n-y<k){cout<<-1<<endl;continue;}
        for(int i=0;i<10;i++){
            if(i*k>y){
                re=i*k-y;
                break;
            }
        }
        for(int t=re;t+y<=n;t+=k){
            cout<<t<<" ";

        }
        cout<<endl;

	}

}


#include <iostream>
using namespace std;
int main()
{
    long y,k,n,m;
    int l,r;
    while(cin>>y>>k>>n){
        l=y/k;
        r=n/k;
        if(l>=r){
            cout<<"-1"<<endl;
            continue;
        }
        for(m=l+1;m<=r;++m){
            cout<<m*k-y<<" ";
        }
        cout<<endl;
    }
    return 0;
}


#include <iostream>

using namespace std;

int main()
{
    int y,k,n;
    cin >> y >> k >> n;
    if(y>=n||y/k==n/k)
    {
        cout << -1 << endl;
        return 0;
    }
    int i=(y/k+1)*k;
    for(; i <= n-k; i+=k)
            cout << i-y <<' ';
    cout << i-y << endl;
    return 0;
}


#include <cstdio>
#include <cstdlib>
int main()
{
	int y,n,k,i;
	scanf("%d %d %d",&y,&k,&n);
	for(i=(y/k+1)*k;i<=n;i+=k)
	{
		printf("%d ",i-y);
	}
	if((y/k+1)*k>n)
	{
		printf("-1");
	}
	return 0;
}