#include #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--) #define all(x) (x).begin(), (x).end() #define sz(x) int(x.size()) using namespace std; using ll = long long; const int INF = 1e9; const ll LINF = 1e18; template void get_unique(vector& x) { x.erase(unique(x.begin(), x.end()), x.end()); } template bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } template vector make_vec(size_t a) { return vector(a); } template auto make_vec(size_t a, Ts... ts) { return vector(ts...))>(a, make_vec(ts...)); } template istream& operator>>(istream& is, vector& v) { for (int i = 0; i < int(v.size()); i++) { is >> v[i]; } return is; } template ostream& operator<<(ostream& os, const vector& v) { for (int i = 0; i < int(v.size()); i++) { os << v[i]; if (i < sz(v) - 1) os << ' '; } return os; } void solve() { ll a, b, c, k; cin >> a >> b >> c >> k; while (k--) { auto [na, nb, nc] = make_tuple((a + b) / 2, (b + c) / 2, (c + a) / 2); a = na, b = nb, c = nc; if (a == b && b == c) break; } cout << a + b + c << '\n'; } int main() { int tt; cin >> tt; while (tt--) solve(); }