#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int a, b, n;
    string s;
    cout << "Hello World!\n";

    cin >> n;
    ll ans = 0;
    for (int i = 1; i <= n; i++) ans += i;
    cout << ans << "\n";

    cin >> a >> b >> s;
    cout << a + b << " " << s << "\n";

    cin >> n;
    for (int i = 1; i <= n; i++) {
        if (i % 3 == 0 && i % 5 == 0) {
            cout << "FizzBuzz\n";
        } else if (i % 3 == 0) {
            cout << "Fizz\n";
        } else if (i % 5 == 0) {
            cout << "Buzz\n";
        } else {
            cout << i;
        }
    }

    cin >> n;
    ans = 0;
    for (int i = 0; i < n; i++) {
        ll a;
        cin >> a;
        ans += a;
    }
    cout << ans << "\n";

    cin >> n;
    ans = 0;
    for (int i = 0; i < n; i++) {
        ll a;
        cin >> a;
        ans += a;
    }
    cout << ans << "\n";

    return 0;
}