#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
int N = 0, M = 0,tgrade=0;
cin >> N >> M;
for (int i = 0; i < N; i++){
cin >> tgrade;
vector<int> sgrade;
double sum = 0;
for (int j = 1; j < N; j++){
int temp = 0;
cin >> temp;
if (temp >= 0 && temp <= M){
sgrade.push_back(temp);
}
}
sort(sgrade.begin(), sgrade.end());
for (int j = 1; j < sgrade.size() - 1; j++){
sum += sgrade[j];
}
sum = sum / (sgrade.size() - 2);
sum = (sum + tgrade) / 2.0;
int x = round(sum);
printf("%d\n", x);
}
return 0;
}