using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var n = c[2];
        var map = NArr(n);
        var yset = new HashSet<int>();
        foreach (var cell in map)
        {
            yset.Add(cell[1]);
        }
        var ylist = new List<int>(yset);
        ylist.Sort();
        var dic = new Dictionary<int, int>();
        for (var i = 0; i < ylist.Count; ++i) dic[ylist[i]] = i;
        var lists = new List<(int id, int x)>[ylist.Count];
        for (var i = 0; i < lists.Length; ++i) lists[i] = new List<(int id, int x)>();
        for (var i = 0; i < n; ++i)
        {
            var yid = dic[map[i][1]];
            lists[yid].Add((i, map[i][0]));
        }
        for (var i = 0; i < lists.Length; ++i) lists[i].Sort((l, r) => l.x.CompareTo(r.x));
        var INF = long.MaxValue / 2;
        var ans = Enumerable.Repeat(INF, n).ToArray();
        for (var i = 0; i < lists.Length; ++i)
        {
            for (var j = 0; j < lists[i].Count; ++j)
            {
                var id = lists[i][j].id;
                if (j > 0) ans[id] = Math.Min(ans[id], lists[i][j].x - lists[i][j - 1].x);
                if (j + 1 < lists[i].Count) ans[id] = Math.Min(ans[id], lists[i][j + 1].x - lists[i][j].x);
                if (i > 0 && ylist[i - 1] + 1 == ylist[i])
                    ans[id] = Math.Min(ans[id], Math.Max(lists[i][j].x, lists[i - 1][0].x));
                if (i + 1 < lists.Length && ylist[i] + 1 == ylist[i + 1])
                    ans[id] = Math.Min(ans[id], Math.Max(lists[i][j].x, lists[i + 1][0].x));
            }
        }
        var tmp = INF;
        for (var i = 0; i < lists.Length; ++i)
        {
            var ntmp = INF;
            for (var j = 0; j < lists[i].Count; ++j)
            {
                var id = lists[i][j].id;
                ans[id] = Math.Min(ans[id], tmp + lists[i][j].x + ylist[i] - 2);
                ntmp = Math.Min(ntmp, lists[i][j].x - ylist[i]);
            }
            tmp = Math.Min(tmp, ntmp);
        }
        tmp = INF;
        for (var i = lists.Length - 1; i >= 0; --i)
        {
            var ntmp = INF;
            for (var j = 0; j < lists[i].Count; ++j)
            {
                var id = lists[i][j].id;
                ans[id] = Math.Min(ans[id], tmp + lists[i][j].x - ylist[i] - 2);
                ntmp = Math.Min(ntmp, lists[i][j].x + ylist[i]);
            }
            tmp = Math.Min(tmp, ntmp);
        }
        WriteLine(string.Join("\n", ans));
    }
}