#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
int n,a[200005],maxx,sum,s2;
void solve()
{
	int ans=0;
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	sum=a[1],s2=a[1];
	ans=a[1]*2;
	maxx=a[1];
	cout<<ans<<endl;
	for(int i=2;i<=n;i++)
	{
		s2+=a[i];
		maxx=max(maxx,a[i]);
		sum+=s2;
		cout<<sum+maxx*i<<endl;
	 } 
	 
}
signed main()
{
	int _=1;
	//cin>>_;
	while(_--) solve();
	return 0;
}
#pragma region Macros
#include <bits/stdc++.h>
#if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG)
#include <atcoder/all>
#endif
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##_len; ++i)
#define EACH(i, v) for(const auto& i : v)
#define ALL(x) (x).begin(),(x).end()
#define ALLR(x) (x).rbegin(),(x).rend()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T>using vec = vector<T>;
template<class T, class U>using umap = unordered_map<T, U>;
template<class T>using uset = unordered_set<T>;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vl = vec<ll>;
#define fi first
#define se second
#define el endl
constexpr ll INF = numeric_limits<ll>::max()/2-1;
#pragma endregion

#pragma region IOMacros
template<class T>
istream &operator>>(istream &stream, vec<T>& o){REP(i, o.size())stream >> o[i];return stream;}
template<class T>
ostream &operator<<(ostream &stream, vec<T>& objs){REP(i, objs.size())stream << objs[i] << " ";stream << el;return stream;}

#define I(T, ...) ;T __VA_ARGS__;__i(__VA_ARGS__);
void __i() {}
template<class T, class... Ts> void __i(T&& o, Ts&&... args){cin >> o;__i(forward<Ts>(args)...);}

void O() {cout << el;}
template<class T, class... Ts> void O(T&& o, Ts&&... args){cerr << o << " ";O(forward<Ts>(args)...);}
#pragma endregion

void Main();

int main(){
    std::cin.tie(nullptr);
    std::cout << std::fixed << std::setprecision(15);
    Main();
    return 0;
}

#pragma region graph
struct edge{
    ll from, to, cost;
    bool operator<(const edge& r) const{return cost<r.cost;}
    bool operator>(const edge& r) const{return cost>r.cost;}
};
struct graph{
    ll V;
    vector<vector<edge> > G;
    graph(ll n){
        init(n);
    }
    void init(ll n){
        V = n;
        G.resize(V);
    }
    // 無向グラフ
    void add_edge(ll s, ll t, ll cost = 1){
        add_diedge(s, t, cost);
        add_diedge(t, s, cost);
    }
    // 有向グラフ
    void add_diedge(ll s, ll t, ll cost = 1){
        if(s < 0 || t < 0 || s >= V || t >= V) return;
        G[s].push_back({s, t, cost});
    }
    auto pos2d(ll height, ll width){
        return [height, width](ll y, ll x){
            return 
                (y < 0 || y >= height || x < 0 || x >= width)
                ? -1
                : y*width + x;
        };
    }
};
#pragma endregion

// O(|E|log|V|)
vector<ll> dijkstra(const graph& g, ll s){
    vector<ll> d(g.V, INF);
    d[s] = 0;
    priority_queue<P,vector<P>, greater<P>> que;
    que.push({0, s});
    while(!que.empty()){
        auto [c, v] = que.top(); que.pop();
        if(d[v]<c) continue;
        for(auto e : g.G[v]){
            if(d[e.to]>d[v]+e.cost){
                d[e.to] = d[v]+e.cost;
                que.push({d[e.to],e.to});
            }
        }
    }
    return d;
}

void Main(){
    I(ll, R, C);
    graph g(2*R*C);
    auto pos = g.pos2d(R, C);
    ll W = R*C;
    REP(i, R){
        REP(j, C-1){
            I(ll, A);
            g.add_edge(pos(i, j), pos(i, j+1), A);
        }
    }
    REP(i, R-1){
        REP(j, C){
            I(ll, B);
            g.add_diedge(pos(i, j), pos(i+1, j), B);
        }
    }
    REP(i, R-1){
        REP(j, C){
            g.add_diedge(W+pos(i+1, j), W+pos(i, j), 1);
        }
    }
    REP(i, R){
        REP(j, C){
            g.add_diedge(pos(i, j), W+pos(i, j), 1);
            g.add_diedge(W+pos(i, j), pos(i, j), 0);
        }
    }
    auto d = dijkstra(g, pos(0, 0));
    cout << d[pos(R-1, C-1)] << el;
}
