#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<>,
rb_tree_tag, tree_order_statistics_node_update>
ordered_set;
#define ll long long
#define ii pair<ll,ll>
#ifndef DEBUG
#define cerr if (0) cerr
#define endl '\n'
#endif
const ll inf=1e15;
const ll maxn=1e5+5;
const ll mod=1e9+7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,k,x,y,minx=inf,miny=inf,maxx=-inf,maxy=-inf;
cin>>n>>k;
assert(k==1);
for (int i=1;i<=n;i++){
cin>>x>>y;
minx=min(minx,x);
miny=min(miny,y);
maxx=max(maxx,x);
maxy=max(maxy,y);
}
cout<<minx<<' '<<miny<<' '<<max(maxx-minx,maxy-miny);
return 0;
}
