// #include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>

#define pb push_back

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;


int T,n,m;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 0x3f3f3f3f;
ll MAX = 0x3f3f3f3f3f3f3f3;
ll MIN = -MAX;
const int maxn = 100;
priority_queue<int> p_q;
priority_queue <int,vector<int>,less<int> > less_q;

ll gcd (ll a, ll b)
{
    if (b == 0)
        return a;
    return gcd (b, a % b);
}

int lowbit(int x){
    return x & -x ;
}


struct Point
{
    int x, y;
    bool operator < (const Point &a) const
    {
        if(x == a.x)
            return y < a.y;
        return x < a.x;//按x升序排列
    }
}p[1005];

bool cmp(Point a, Point b)
{
    if(a.x == b.x)
        return a.y < b.y;
    return a.x < b.x;
}



int main() {
    scanf("%d",&T);
    // ios::sync_with_stdio (0), cin.tie (0), cout.tie (0);
    while(T--) {
        cout <<"Hello World!\n";
    }
    return 0;
}