#include <bits/stdc++.h>
#define ll long long
#define pb push_back
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define sz(x) (int)x.size()
#define fi first
#define sd second
#define all(x) x.begin(), x.end()
using namespace std;
//using namespace __gnu_pbds;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("avx2")
const int N = (int)1e5 + 500;
int n, k, x[N], y[N];
int main()
{
ios::sync_with_stdio(0); cin.tie(NULL);
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> x[i] >> y[i];
int x0 = *min_element(x + 1, x + n + 1), y0 = *min_element(y + 1, y + n + 1);
int l = max(*max_element(x + 1, x + n + 1) - x0, *max_element(y + 1, y + n + 1) - y0);
cout << x0 << ' ' << y0 << ' ' << max(l, 1);
}
