#include using namespace std; using ll = long long int; using P = pair; using P3 = pair; using PP = pair; constexpr int INF = 1<<30; constexpr ll MOD = ll(1e9)+7; constexpr int di[] = {0,1,0,-1}; constexpr int dj[] = {1,0,-1,0}; vector divisor(ll n) { vector res; for (ll i = 1; i * i <= n; i++) { if (n % i == 0) { res.push_back(i); if (i != n / i) res.push_back(n / i); } } return res; } ll gcd(ll p, ll q){ if(q==0) return p; else return gcd(q, p%q); } int main(){ ll n, m, k; char op; cin >> n >> m >> k >> op; vector a(n), b(m); for(int i=0;i> b[i]; } for(int i=0;i> a[i]; } if(op == '+'){ map mp; for(int i=0;i mp; vector cum(div.size()); for(int i=0;i