namespace AtCoder; #nullable enable using System.Numerics; static class Extensions { public static T[] Repeat(this int time, Func F) => Enumerable.Range(0, time).Select(_ => F()).ToArray(); } class AtCoder { object? Solve() { var h = Int(); var w = Int(); var n = Int(); var warps = new ((int, int), (int, int))[n]; for (var i = 0; i < n; i++) { var a = Int(); var b = Int(); var c = Int(); var d = Int(); warps[i] = ((a, b), (c, d)); } var dz = new Dictionary<(int, int), int>(); var q = new PriorityQueue<(int, int, int), int>(); dz[(1, 1)] = 0; q.Enqueue((1, 1, 0), 0); while (q.Count > 0) { var (u, v, k) = q.Dequeue(); if ((u, v) == (h, w)) continue; if (k > dz[(u, v)]) continue; foreach (var ((a, b), (c, d)) in warps) { var dd = k + Math.Abs(u - a) + Math.Abs(v - b) + 1; if (dz.TryGetValue((c, d), out var dn)) if (dn <= dd) continue; dz[(c, d)] = dd; q.Enqueue((c, d, dd), dd); } { var (a, b) = (h, w); var (c, d) = (h, w); var dd = k + Math.Abs(u - a) + Math.Abs(v - b); if (dz.TryGetValue((c, d), out var dn)) if (dn <= dd) continue; dz[(c, d)] = dd; q.Enqueue((c, d, dd), dd); } } return dz[(h, w)]; } public static void Main() => new AtCoder().Run(); public void Run() { var res = Solve(); if (res != null) { if (res is bool yes) res = yes ? "Yes" : "No"; sw.WriteLine(res); } sw.Flush(); } string[] input = Array.Empty(); int iter = 0; readonly StreamWriter sw = new(Console.OpenStandardOutput()) { AutoFlush = false }; #pragma warning disable IDE0051 string String() { while (iter >= input.Length) (input, iter) = (Console.ReadLine()!.Split(' '), 0); return input[iter++]; } T Input() where T : IParsable => T.Parse(String(), null); int Int() => Input(); void Out(object? x, string? separator = null) { separator ??= Environment.NewLine; if (x is System.Collections.IEnumerable obj and not string) { var firstLine = true; foreach (var item in obj) { if (!firstLine) sw.Write(separator); firstLine = false; sw.Write(item); } } else sw.Write(x); sw.WriteLine(); } #pragma warning restore IDE0051 }