#include <bits/stdc++.h>
#include "aplusb.h"
using namespace std;
#define FOR(i, n, k) for(auto nx = (i);nx < (n);nx += (k))
#define FOR2(i, n, k) for(auto nxx = (i);nxx < (n);nxx += (k))
vector<int> smallest_sums(int n, vector<int> a, vector<int> b) {
vector<int> ans;
FOR(0, n, 1) {
ans.push_back(a[0] + b[nx]);
}
FOR(1, n, 1) {
ans.emplace_back(b[0] + a[nx]);
}
sort(ans.begin(), ans.end());
return {ans.begin(), ans.begin() + n};
}
/*
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠀⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⢆⠀⠀⠀⠀⠀⢸⡀⠸⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠹⡈⠓⢤⣀⠀⠀⠸⣧⠀⢻⡄⠀⠀⠀⢀⣀⣠⡴⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢱⣄⠀⠀⠉⠉⠛⠛⠀⠀⠻⠒⠂⠉⢁⡴⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⣀⠀⠀⠀⢀⡠⠔⠚⢉⠤⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠒⠤⣀⠁⠒⠦⠤⠤⢤⣤⠄⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠈⠙⢍⡁⠀⠀⠀⡔⢁⡄⠀⠀⠀⠀⠀⠀⠀⠀⠈⠢⣀⠀⠀⠭⠤⢠⡤⠔⠊⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⢨⡿⠀⣼⢜⠏⡄⠀⡀⠀⡠⠀⡖⠀⢠⠀⠀⢄⠉⢀⠀⠀⠀⠳⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢠⣿⡵⡼⠏⡜⢸⠁⣤⠇⢀⠇⢠⡇⢰⢸⣾⠀⢸⡄⠀⣧⠀⣆⠀⠨⠒⢤⣄⡀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢠⠏⣻⠃⠀⣼⠇⡆⣰⢹⠀⣾⠀⣸⠇⢸⣾⣿⣇⠈⣿⣆⢹⡇⢹⣦⡈⢗⠉⠉⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⢀⣴⡿⠊⡽⢀⠎⣿⠀⣠⡗⢚⣾⣿⣴⠳⣧⡞⡄⢿⠟⠉⠉⢙⣦⢳⠘⣿⣿⣆⣿⡦⠄⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠈⠁⠀⢀⣇⡎⢠⢿⢠⣿⣤⠊⢀⣠⣴⣿⣿⠴⢷⣿⣤⣶⣾⣿⣿⡿⣷⢿⣿⣦⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⡼⢻⣥⣿⢸⣸⣿⢿⣾⣿⣿⣿⣿⠟⠀⠀⠘⢿⣿⣿⣿⠟⠀⢹⣾⣾⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠁⡿⢻⢟⣿⣿⣷⡄⠙⠿⠿⠿⠏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣼⢋⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠈⠁⢸⠟⡿⣿⣿⡇⠀⠀⠀⠀⢀⣠⠤⠐⠒⠒⠒⠢⡄⠀⢀⣯⠞⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⠀⠁⠈⢦⣽⡀⠀⠀⣴⢋⣤⣴⣶⣿⣿⡿⣿⡇⠀⢸⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢳⣄⠀⠸⣿⢟⡏⠝⠒⢓⣣⠟⢁⣴⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⡷⣄⡈⠙⠛⠋⠉⠁⣀⡴⣻⣿⣶⣤⣀⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣰⣶⣶⣤⣼⡧⠿⣙⣶⣶⣶⣶⣾⣿⣧⣿⣿⣿⣿⣿⣿⣇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⢠⣤⣀⣠⣿⠿⣿⣿⣿⣷⠀⠈⠳⢿⣋⣿⣿⡿⠛⠁⣿⣿⣿⣿⣿⣿⣿⣶⣤⡀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⣿⣿⣿⣿⣧⣝⢿⣿⣿⠀⠠⣀⠀⠈⠉⠉⢰⡆⠀⢋⣿⣴⣿⣿⣿⣾⣿⣿⡀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢰⣿⣿⢿⣿⣿⣿⣿⣿⣿⣿⣧⡀⠹⡆⠀⠀⠀⣾⠀⠀⣸⣿⣿⣿⣿⡿⠋⢸⣿⣇⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢐⣿⣿⣿⣦⣝⣿⣿⣿⣿⣿⣿⣿⣿⣄⠑⠀⠀⠀⠘⠀⢠⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠶⣤⣄⠀⠀
⠀⠀⠀⠀⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣄⠀⠀⢀⣠⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠀⣿⣌⣇⠀
⠀⠀⠀⣠⠏⢉⣻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡗⠄⠠⠋⠀⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣤⣿⣿⣿⡆
⢀⣠⠞⣱⣾⣿⣿⣿⣿⣿⣿⡿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⠀⠀⠀⠀⠘⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇
*/
