#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool check(ll u, ll v, ll w, ll x) {
if (u * x + v == w) return true;
if (u * x + w == v) return true;
if (v * x + u == w) return true;
if (v * x + w == u) return true;
if (w * x + u == v) return true;
if (w * x + v == u) return true;
return false;
}
vector<ll> get_candidates(ll u, ll v, ll w) {
vector<ll> res;
if ((w - v) % u == 0) {
ll x = (w - v) / u;
if (x >= 0) res.push_back(x);
}
if ((v - w) % u == 0) {
ll x = (v - w) / u;
if (x >= 0) res.push_back(x);
}
if ((w - u) % v == 0) {
ll x = (w - u) / v;
if (x >= 0) res.push_back(x);
}
if ((u - w) % v == 0) {
ll x = (u - w) / v;
if (x >= 0) res.push_back(x);
}
if ((v - u) % w == 0) {
ll x = (v - u) / w;
if (x >= 0) res.push_back(x);
}
if ((u - v) % w == 0) {
ll x = (u - v) / w;
if (x >= 0) res.push_back(x);
}
sort(res.begin(), res.end());
res.erase(unique(res.begin(), res.end()), res.end());
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
