// #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include using namespace std; #define INTERACTIVE namespace templates { // type using ll = long long; using ull = unsigned long long; using Pii = pair; using Pil = pair; using Pli = pair; using Pll = pair; template using pq = priority_queue; template using qp = priority_queue, greater>; // clang-format off #define vec(T, A, ...) vector A(__VA_ARGS__); #define vvec(T, A, h, ...) vector> A(h, vector(__VA_ARGS__)); #define vvvec(T, A, h1, h2, ...) vector>> A(h1, vector>(h2, vector(__VA_ARGS__))); // clang-format on // for loop #define fori1(a) for (ll _ = 0; _ < (a); _++) #define fori2(i, a) for (ll i = 0; i < (a); i++) #define fori3(i, a, b) for (ll i = (a); i < (b); i++) #define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c)) #define overload4(a, b, c, d, e, ...) e #define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__) // declare and input // clang-format off #define INT(...) int __VA_ARGS__; inp(__VA_ARGS__); #define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__); #define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__); #define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__); #define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___); #define VEC(T, A, n) vector A(n); inp(A); #define VVEC(T, A, n, m) vector> A(n, vector(m)); inp(A); // clang-format on // const value const ll MOD1 = 1000000007; const ll MOD9 = 998244353; const double PI = acos(-1); // other macro #if !defined(RIN__LOCAL) && !defined(INTERACTIVE) #define endl "\n" #endif #define spa ' ' #define len(A) ll(A.size()) #define all(A) begin(A), end(A) // function vector stoc(string &S) { int n = S.size(); vector ret(n); for (int i = 0; i < n; i++) ret[i] = S[i]; return ret; } string ctos(vector &S) { int n = S.size(); string ret = ""; for (int i = 0; i < n; i++) ret += S[i]; return ret; } template auto min(const T &a) { return *min_element(all(a)); } template auto max(const T &a) { return *max_element(all(a)); } template auto clamp(T &a, const S &l, const S &r) { return (a > r ? r : a < l ? l : a); } template inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } template inline bool chclamp(T &a, const S &l, const S &r) { auto b = clamp(a, l, r); return (a != b ? a = b, 1 : 0); } template T sum(vector &A) { T tot = 0; for (auto a : A) tot += a; return tot; } template vector compression(vector X) { sort(all(X)); X.erase(unique(all(X)), X.end()); return X; } // input and output namespace io { // __int128_t std::ostream &operator<<(std::ostream &dest, __int128_t value) { std::ostream::sentry s(dest); if (s) { __uint128_t tmp = value < 0 ? -value : value; char buffer[128]; char *d = std::end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = std::end(buffer) - d; if (dest.rdbuf()->sputn(d, len) != len) { dest.setstate(std::ios_base::badbit); } } return dest; } // vector template istream &operator>>(istream &is, vector &A) { for (auto &a : A) is >> a; return is; } template ostream &operator<<(ostream &os, vector &A) { for (size_t i = 0; i < A.size(); i++) { os << A[i]; if (i != A.size() - 1) os << ' '; } return os; } // vector> template istream &operator>>(istream &is, vector> &A) { for (auto &a : A) is >> a; return is; } template ostream &operator<<(ostream &os, vector> &A) { for (size_t i = 0; i < A.size(); i++) { os << A[i]; if (i != A.size() - 1) os << endl; } return os; } // pair template istream &operator>>(istream &is, pair &A) { is >> A.first >> A.second; return is; } template ostream &operator<<(ostream &os, pair &A) { os << A.first << ' ' << A.second; return os; } // vector> template istream &operator>>(istream &is, vector> &A) { for (size_t i = 0; i < A.size(); i++) { is >> A[i]; } return is; } template ostream &operator<<(ostream &os, vector> &A) { for (size_t i = 0; i < A.size(); i++) { os << A[i]; if (i != A.size() - 1) os << endl; } return os; } // tuple template struct TuplePrint { static ostream &print(ostream &os, const T &t) { TuplePrint::print(os, t); os << ' ' << get(t); return os; } }; template struct TuplePrint { static ostream &print(ostream &os, const T &t) { os << get<0>(t); return os; } }; template ostream &operator<<(ostream &os, const tuple &t) { TuplePrint::print(os, t); return os; } // io functions void FLUSH() { cout << flush; } void print() { cout << endl; } template void print(Head &&head, Tail &&...tail) { cout << head; if (sizeof...(Tail)) cout << spa; print(std::forward(tail)...); } template void prisep(vector &A, S sep) { int n = A.size(); for (int i = 0; i < n; i++) { cout << A[i]; if (i != n - 1) cout << sep; } cout << endl; } template void priend(T A, S end) { cout << A << end; } template void prispa(T A) { priend(A, spa); } template bool printif(bool f, T A, S B) { if (f) print(A); else print(B); return f; } template void inp(T &...a) { (cin >> ... >> a); } } // namespace io using namespace io; // read graph vector> read_edges(int n, int m, bool direct = false, int indexed = 1) { vector> edges(n, vector()); for (int i = 0; i < m; i++) { INT(u, v); u -= indexed; v -= indexed; edges[u].push_back(v); if (!direct) edges[v].push_back(u); } return edges; } vector> read_tree(int n, int indexed = 1) { return read_edges(n, n - 1, false, indexed); } template vector>> read_wedges(int n, int m, bool direct = false, int indexed = 1) { vector>> edges(n, vector>()); for (int i = 0; i < m; i++) { INT(u, v); T w; inp(w); u -= indexed; v -= indexed; edges[u].push_back({v, w}); if (!direct) edges[v].push_back({u, w}); } return edges; } template vector>> read_wtree(int n, int indexed = 1) { return read_wedges(n, n - 1, false, indexed); } // yes / no namespace yesno { // yes inline bool yes(bool f = true) { cout << (f ? "yes" : "no") << endl; return f; } inline bool Yes(bool f = true) { cout << (f ? "Yes" : "No") << endl; return f; } inline bool YES(bool f = true) { cout << (f ? "YES" : "NO") << endl; return f; } // no inline bool no(bool f = true) { cout << (!f ? "yes" : "no") << endl; return f; } inline bool No(bool f = true) { cout << (!f ? "Yes" : "No") << endl; return f; } inline bool NO(bool f = true) { cout << (!f ? "YES" : "NO") << endl; return f; } // possible inline bool possible(bool f = true) { cout << (f ? "possible" : "impossible") << endl; return f; } inline bool Possible(bool f = true) { cout << (f ? "Possible" : "Impossible") << endl; return f; } inline bool POSSIBLE(bool f = true) { cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl; return f; } // impossible inline bool impossible(bool f = true) { cout << (!f ? "possible" : "impossible") << endl; return f; } inline bool Impossible(bool f = true) { cout << (!f ? "Possible" : "Impossible") << endl; return f; } inline bool IMPOSSIBLE(bool f = true) { cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl; return f; } // Alice Bob inline bool Alice(bool f = true) { cout << (f ? "Alice" : "Bob") << endl; return f; } inline bool Bob(bool f = true) { cout << (f ? "Bob" : "Alice") << endl; return f; } // Takahashi Aoki inline bool Takahashi(bool f = true) { cout << (f ? "Takahashi" : "Aoki") << endl; return f; } inline bool Aoki(bool f = true) { cout << (f ? "Aoki" : "Takahashi") << endl; return f; } } // namespace yesno using namespace yesno; } // namespace templates using namespace templates; void solve() { LL(h, w, n); VEC(Pll, AB, n); fori(i, n) swap(AB[i].first, AB[i].second); map> mp; for (auto [a, b] : AB) { mp[a].push_back(b); } for (auto &p : mp) { sort(all(p.second)); } const ll inf = 1LL << 60; vec(ll, ans, n, inf); fori(i, n) { auto [a, b] = AB[i]; auto p = lower_bound(all(mp[a]), b) - mp[a].begin(); if (p > 0) { chmin(ans[i], b - mp[a][p - 1]); } if (p + 1 < len(mp[a])) { chmin(ans[i], mp[a][p + 1] - b); } if (mp.count(a + 1)) { auto q = lower_bound(all(mp[a + 1]), b) - mp[a + 1].begin(); if (q > 0) { chmin(ans[i], b); } if (q < len(mp[a + 1])) { chmin(ans[i], mp[a + 1][q]); } } if (mp.count(a - 1)) { auto q = lower_bound(all(mp[a - 1]), b) - mp[a - 1].begin(); if (q > 0) { chmin(ans[i], b); } if (q < len(mp[a - 1])) { chmin(ans[i], mp[a - 1][q]); } } } vec(int, ind, n); iota(all(ind), 0); sort(all(ind), [&](int i, int j) { return AB[i] < AB[j]; }); { int l = 0; ll ma = -inf; fori(r, n) { while (AB[ind[r]].first - AB[ind[l]].first >= 2) { auto [a, b] = AB[ind[l]]; chmax(ma, a - (b - 1)); l++; } auto [a, b] = AB[ind[r]]; ll tmp = b - 1 + a - ma; chmin(ans[ind[r]], tmp); } } { int r = n - 1; ll mi = inf; fori(l, n - 1, -1, -1) { while (AB[ind[r]].first - AB[ind[l]].first >= 2) { auto [a, b] = AB[ind[r]]; chmin(mi, a + b - 1); r--; } auto [a, b] = AB[ind[l]]; ll tmp = mi - a + b - 1; chmin(ans[ind[l]], tmp); } } prisep(ans, "\n"); } int main() { #ifndef INTERACTIVE cin.tie(0)->sync_with_stdio(0); #endif // cout << fixed << setprecision(12); int t; t = 1; // cin >> t; while (t--) solve(); return 0; }