#include "aplusb.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// #define int long long
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define FIO cin.tie(0) -> sync_with_stdio(0);
vector<int> smallest_sums(int N, vector<int> a, vector<int> b) {
vector<int> res;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
res.push_back(a[i] + b[j]);
}
}
sort(all(res));
vector<int> ans;
for (int i = 0; i < N; i++) {
ans.push_back(res[i]);
}
return ans;
}
