using System;
using System.Collections.Generic;
using System.Linq;

// https://yukicoder.me/problems/no/3016
class Program
{
    static string InputPattern = "InputX";

    static List<string> GetInputList()
    {
        var WillReturn = new List<string>();

        if (InputPattern == "Input1") {
            WillReturn.Add("3");
            WillReturn.Add("1 2 3 ");
            WillReturn.Add("1 1");
            //1
            //3
        }
        else if (InputPattern == "Input2") {
            WillReturn.Add("5");
            WillReturn.Add("4 1 5 1 3 ");
            WillReturn.Add("5 2 1 5");
            //2
            //1 3
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    static void Main()
    {
        List<string> InputList = GetInputList();
        long[] AArr = InputList[1].Trim().Split(' ').Select(pX => long.Parse(pX)).ToArray();
        long[] BArr = InputList[2].Trim().Split(' ').Select(pX => long.Parse(pX)).ToArray();
        Array.Sort(AArr);
        Array.Sort(BArr);

        var InsFenwick_Tree = new Fenwick_Tree(BArr.GetUpperBound(0));
        for (long I = 0; I <= BArr.GetUpperBound(0); I++) {
            long ABS = Math.Abs(AArr[I] - BArr[I]);
            InsFenwick_Tree[I] = ABS;
        }

        // 不満度の合計[未使用なハチマキ]なDict
        var SumDict = new Dictionary<long, long>();
        SumDict[AArr[AArr.GetUpperBound(0)]] = InsFenwick_Tree.GetSum(0, InsFenwick_Tree.GetUB());

        for (long I = AArr.GetUpperBound(0) - 1; 0 <= I; I--) {
            long ABS = Math.Abs(AArr[I + 1] - BArr[I]);
            InsFenwick_Tree[I] = ABS;
            SumDict[AArr[I]] = InsFenwick_Tree.GetSum(0, InsFenwick_Tree.GetUB());
        }

        //foreach (var EachPair in SumDict) {
        //    Console.WriteLine("SumDict[{0}]={1}", EachPair.Key, EachPair.Value);
        //}

        long[] ValuesArr = SumDict.Values.ToArray();
        long MinVal = ValuesArr.Min();

        var AnswerList = new List<long>();
        foreach (var EachPair in SumDict) {
            if (EachPair.Value == MinVal) {
                AnswerList.Add(EachPair.Key);
            }
        }
        AnswerList.Sort();
        Console.WriteLine(AnswerList.Count);
        Console.WriteLine(LongEnumJoin(" ", AnswerList));
    }

    // セパレータとLong型の列挙を引数として、結合したstringを返す
    static string LongEnumJoin(string pSeparater, IEnumerable<long> pEnum)
    {
        string[] StrArr = Array.ConvertAll(pEnum.ToArray(), pX => pX.ToString());
        return string.Join(pSeparater, StrArr);
    }

}

// フェニック木
#region Fenwick_Tree
internal class Fenwick_Tree
{
    private long[] mBitArr;
    private long mExternalArrUB;

    // ノードのIndexの列挙を返す
    internal IEnumerable<long> GetNodeIndEnum()
    {
        for (long I = 0; I <= mExternalArrUB; I++) {
            yield return I;
        }
    }

    // 木のノードのUBを返す
    internal long GetUB()
    {
        return mExternalArrUB;
    }

    // コンストラクタ(外部配列のUBのみ指定)
    internal Fenwick_Tree(long pExternalArrUB)
    {
        mExternalArrUB = pExternalArrUB;

        // フェニック木の外部配列は0オリジンで、
        // フェニック木の内部配列は1オリジンなため、2を足す
        mBitArr = new long[pExternalArrUB + 2];
    }

    // コンストラクタ(初期化用の配列指定)
    internal Fenwick_Tree(long[] pArr)
        : this(pArr.GetUpperBound(0))
    {
        for (long I = 0; I <= pArr.GetUpperBound(0); I++) {
            this.Add(I, pArr[I]);
        }
    }

    // コンストラクタ(初期化用のList指定)
    internal Fenwick_Tree(List<long> pList)
        : this(pList.Count - 1)
    {
        for (int I = 0; I <= pList.Count - 1; I++) {
            this.Add(I, pList[I]);
        }
    }

    // インデクサ
    internal long this[long pInd]
    {
        get { return GetSum(pInd, pInd); }
        set { Add(pInd, value - GetSum(pInd, pInd)); }
    }

    // [pSta,pEnd] のSumを返す
    internal long GetSum(long pSta, long pEnd)
    {
        return GetSum(pEnd) - GetSum(pSta - 1);
    }

    // [0,pEnd] のSumを返す
    internal long GetSum(long pEnd)
    {
        pEnd++; // 1オリジンに変更

        long Sum = 0;
        while (pEnd >= 1) {
            Sum += mBitArr[pEnd];
            pEnd -= pEnd & -pEnd;
        }
        return Sum;
    }

    // [I] に Xを加算
    internal void Add(long pI, long pX)
    {
        pI++; // 1オリジンに変更

        while (pI <= mBitArr.GetUpperBound(0)) {
            mBitArr[pI] += pX;
            pI += pI & -pI;
        }
    }
}
#endregion