#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int h, w;
  scanf("%d %d", &h, &w);
  vector<vector<unsigned int>> a(h, vector<unsigned int>(w));
  rep(i,0,h) rep(j,0,w) scanf("%u", &a[i][j]);
  vector<unsigned int> s(h);
  unsigned int t = 0;
  rep(i,0,h) {
    rep(j,0,w) s[i] += a[i][j];
    t += s[i];
  }
  rep(i,0,h) {
    printf("%u\n", t+s[i]);
  }
  return 0;
}