using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Number = System.Int64;

namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var m = sc.Integer();
            var a = Enumerate(m, x => sc.Integer(n));
            long val = -1;
            var id = -1;
            for (int _ = 0; _ < m; _++)
            {
                var b = a[_];
                long v = 0;

                var L = new RMQSegmentTree(n + 1);

                for (int i = 0; i < n; i++)
                {
                    var M = new RMQSegmentTree(n + 1);
                    for (int j = i + 1; j < n; j++)
                        M.Update(b[j], b[j]);


                    var R = new RMQSegmentTree(n + 1);
                    for (int j = n - 1; j > i; j--)
                    {
                        M.Update(b[j], 0);
                        var min = Math.Min(b[i], b[j]);
                        var max = Math.Max(b[i], b[j]);
                        long add = 0;
                        if (M.Query(0, min) > 0)
                            add = Math.Max(max, M.Query(0, min));
                        if (M.Query(max + 1, n + 1) > 0)
                        {
                            add = Math.Max(add, max);
                            add = Math.Max(add, M.Query(max + 1, n));
                        }
                        if (b[i] < b[j])
                        {
                            if (R.Query(0, b[j]) > 0)
                            {
                                add = Math.Max(add, max);
                                add = Math.Max(add, R.Query(0, b[j]));
                            }
                            if (L.Query(b[i] + 1, n + 1) > 0)
                            {
                                add = Math.Max(add, max);
                                add = Math.Max(add, L.Query(b[i] + 1, n));
                            }
                        }
                        else if (b[i] > b[j])
                        {
                            if (L.Query(1, b[i] - 1) > 0)
                            {
                                add = Math.Max(add, max);
                                add = Math.Max(add, L.Query(1, b[i] - 1));
                            }
                            if (R.Query(b[j] + 1, n + 1) > 0)
                            {
                                add = Math.Max(add, max);
                                add = Math.Max(add, R.Query(b[j] + 1, n + 1));
                            }

                        }
                        v += add;

                        R.Update(b[j], b[j]);
                    }
                    L.Update(b[i], b[i]);

                }
                Debug.WriteLine(v);
                if (val < v)
                {
                    val = v;
                    id = _;
                }

            }
            IO.Printer.Out.WriteLine(id);

        }
        public bool ISOTAKUDAIGAKU(long l, long m, long r)
        {
            var a = new long[] { l, m, r };
            return ISOTAKUDAIGAKU(a);
        }
        public bool ISOTAKUDAIGAKU(long[] a)
        {
            if (a.Length != 3) return false;
            if (a.Distinct().Count() != 3) return false;
            if (a[0] < a[1] && a[1] > a[2]) return true;
            if (a[0] > a[1] && a[1] < a[2]) return true;
            return false;
        }

        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }

    }
}

#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { var s = Scan(); return s != "" ? double.Parse(Scan(), CultureInfo.InvariantCulture) : double.NaN; }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion
#region RMQSegmentTere
[System.Diagnostics.DebuggerDisplay("Data={ToString()}")]
public class RMQSegmentTree
{
    const long MIN = 0;
    int n;
    long[] data;
    public RMQSegmentTree(int size)
    {
        n = 1;
        while (n < size)
            n <<= 1;
        data = new long[n << 1];
        for (int i = 0; i < data.Length; i++)
            data[i] = MIN;
    }
    public RMQSegmentTree(long[] a)
    {
        n = 1;
        while (n < a.Length)
            n <<= 1;
        data = new long[n << 1];
        for (int i = n; i < data.Length; i++)
        {
            if (i - n < a.Length) data[i] = a[i];
            else data[i] = MIN;
        }
        for (int i = n - 1; i >= 0; i--)
        {
            data[i] = Math.Max(data[i << 1], data[(i << 1) + 1]);
        }
    }

    // turn kth index value into v
    public void Update(int k, long v)
    {
        k += n;
        data[k] = v;
        k >>= 1;
        while (k > 0)
        {
            data[k] = Math.Max(data[k << 1], data[(k << 1) + 1]);
            k >>= 1;
        }

    }
    public long Query(int a, int b) { return Query(a, b, 1, 0, n); }
    private long Query(int a, int b, int k, int l, int r)
    {
        if (r <= a || b <= l)
            return MIN;
        if (a <= l && r <= b)
            return data[k];
        else
        {
            var vl = Query(a, b, k << 1, l, (l + r) >> 1);
            var vr = Query(a, b, (k << 1) + 1, (l + r) >> 1, r);
            return Math.Max(vl, vr);
        }
    }

    /*
    ///<summary>Data[i]</summary>>
    public long this[int i] { get { return data[i + n]; } }
    ///<summary>Minimum[a,b)</summary>>
    public long this[int l, int r] { get { return Query(l, r, 1, 0, n); } }
    public override string ToString()
    {
        return string.Join(",", Enumerable.Range(0, n).Select(i => this[i]).Where(v => v != Max));
    }
    public string Visualize()
    {
        var sb = new System.Text.StringBuilder();
        var k = 2;
        var len = n << 1;
        for (int i = 1; i < len; i++)
        {
            if (data[i] != Max) sb.Append(data[i]);
            else sb.Append('-');
            if (i < k - 1) sb.Append(',');
            else if (i < len - 1)
            {
                sb.AppendLine();
                k <<= 1;
            }
        }
        return sb.ToString();
    }
     //*/
}
#endregion