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

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, p, q) = (c[0], c[1], c[2]);
        var a = NList;
        WriteLine(string.Join(" ", Perm(n, p, q, a)));
    }
    static int[] Perm(int n, int p, int q, int[] a)
    {
        var next = (int[])a.Clone();
        var hasnext = NextPermutation(next);
        if (!hasnext)
        {
            return new int[] { -1 };
        }
        for (var i = 0; i < n; ++i)
        {
            if (next[i] == p) return next;
            if (next[i] == q) break;
        }
        next = (int[])a.Clone();
        var tree = new AvlTree<int>();
        var hasp = false;
        var hasq = false;
        for (var i = n - 1; i >= 0; --i)
        {
            tree.Insert(next[i]);
            if (next[i] == p) hasp = true;
            if (next[i] == q) hasq = true;
            var idx = 0;
            var large = tree.LowerBound(next[i] + 1, ref idx);
            if (idx == tree.GetCount() || !hasp || !hasq) continue;
            var firstisq = false;
            if (large == q) large = tree.LowerBound(large + 1, ref idx);
            if (idx == tree.GetCount()) continue;
            next[i] = large;
            tree.Delete(large);
            if (large == p) hasp = false;
            for (var j = i + 1; j < n; ++j)
            {
                if (p < q)
                {
                    next[j] = tree.ElementAt(0);
                    tree.Delete(next[j]);
                }
                else
                {
                    if (firstisq && hasp)
                    {
                        var ins = tree.ElementAt(1);
                        next[j] = ins;
                        tree.Delete(ins);
                        if (ins == p) hasp = false;
                    }
                    else
                    {
                        var ins = tree.ElementAt(0);
                        if (ins == q && hasp)
                        {
                            firstisq = true;
                            --j;
                            continue;
                        }
                        next[j] = ins;
                        tree.Delete(ins);
                        if (ins == p) hasp = false;
                    }
                }
            }
            return next;
        }
        return new int[] { -1 };
    }
    static bool NextPermutation<T>(T[] arr) where T : IComparable<T>
    {
        var i = arr.Length - 1;
        while (i > 0 && arr[i - 1].CompareTo(arr[i]) >= 0) i--;
        if (i == 0) return false;
        var j = arr.Length - 1;
        while (j > i && arr[i - 1].CompareTo(arr[j]) >= 0) j--;
        (arr[i - 1], arr[j]) = (arr[j], arr[i - 1]);
        Array.Reverse(arr, i, arr.Length - i);
        return true;
    }
    public class AvlTree<T> where T: IComparable<T>
    {
        private class Node<U> where U: IComparable<U>
        {
            public U Value;
            public Node<U> Lc = null;
            public Node<U> Rc = null;
            public int Height;
            public int Count;
            public int CCount;
            public Node(int height, U value)
            {
                Height = height;
                Count = 1;
                CCount = 1;
                Value = value;
            }
        }
        private Node<T> root = null;
        static int GetHeight(Node<T> t)
        {
            return t == null ? 0 : t.Height;
        }
        static int GetCount(Node<T> t)
        {
            return t == null ? 0 : t.Count;
        }
        static int GetBalance(Node<T> t)
        {
            return GetHeight(t.Lc) - GetHeight(t.Rc);
        }
        static void Recalc(Node<T> t)
        {
            if (t == null) return;
            t.Height = 1 + Math.Max(GetHeight(t.Lc), GetHeight(t.Rc));
            t.Count = t.CCount + GetCount(t.Lc) + GetCount(t.Rc);
        }
        static Node<T> RotateLeft(Node<T> t)
        {
            Node<T> u = t.Rc;
            Node<T> t2 = u.Lc;
            u.Lc = t;
            t.Rc = t2;
            Recalc(t);
            Recalc(u);
            return u;
        }
        static Node<T> RotateRight(Node<T> t)
        {
            Node<T> u = t.Lc;
            Node<T> t2 = u.Rc;
            u.Rc = t;
            t.Lc = t2;
            Recalc(t);
            Recalc(u);
            return u;
        }
        static Node<T> RotateLR(Node<T> t)
        {
            t.Lc = RotateLeft(t.Lc);
            return RotateRight(t);
        }
        static Node<T> RotateRL(Node<T> t)
        {
            t.Rc = RotateRight(t.Rc);
            return RotateLeft(t);
        }
        static Node<T> BalanceLeft(Node<T> t)
        {
            if (GetBalance(t) > 1)
            {
                if (GetBalance(t.Lc) < 0) t = RotateLR(t);
                else t = RotateRight(t);
            }
            Recalc(t);
            return t;
        }
        static Node<T> BalanceRight(Node<T> t)
        {
            if (GetBalance(t) < -1)
            {
                if (GetBalance(t.Rc) > 0) t = RotateRL(t);
                else t = RotateLeft(t);
            }
            Recalc(t);
            return t;
        }
        /// <summary>valueを挿入する</summary>
        public void Insert(T value)
        {
            root = Insert(root, value);
        }
        Node<T> Insert(Node<T> cur, T value)
        {
            if (cur == null)
            {
                return new Node<T>(1, value);
            }
            var d = value.CompareTo(cur.Value);
            if (d < 0)
            {
                cur.Lc = Insert(cur.Lc, value);
                return BalanceLeft(cur);
            }
            else if (d > 0)
            {
                cur.Rc = Insert(cur.Rc, value);
                return BalanceRight(cur);
            }
            else
            {
                ++cur.CCount;
                Recalc(cur);
                return cur;
            }
        }
        /// <summary>valueを削除する 存在しない場合はなにもしない</summary>
        public void Delete(T value)
        {
            root = Delete(root, value);
        }
        Node<T> Delete(Node<T> cur, T value)
        {
            if (cur == null) return null;
            var d = value.CompareTo(cur.Value);
            if (d < 0)
            {
                cur.Lc = Delete(cur.Lc, value);
                return BalanceRight(cur);
            }
            else if (d > 0)
            {
                cur.Rc = Delete(cur.Rc, value);
                return BalanceLeft(cur);
            }
            else
            {
                --cur.CCount;
                if (cur.CCount == 0)
                {
                    if (cur.Lc != null)
                    {
                        Node<T> del = null;
                        var max = DeleteMax(cur.Lc, ref del);
                        cur.Lc = max;
                        cur.Value = del.Value;
                        cur.CCount = del.CCount;
                        return BalanceRight(cur);
                    }
                    else
                    {
                        return cur.Rc;
                    }
                }
                else
                {
                    Recalc(cur);
                    return cur;
                }
            }
        }
        Node<T> DeleteMax(Node<T> t, ref Node<T> del)
        {
            if (t.Rc == null)
            {
                del = t;
                return t.Lc;
            }
            else
            {
                var max = DeleteMax(t.Rc, ref del);
                t.Rc = max;
                return BalanceLeft(t);
            }
        }
        /// <summary>小さいほうからpos番目の要素を取得する</summary>
        public T ElementAt(int pos)
        {
            if (pos < 0 || pos >= GetCount(root)) return default;
            var t = ElementAt(root, pos);
            return t.Value;
        }
        /// <summary>小さいほうからpos番目の要素を取得する</summary>
        public T ElementAt(int pos, T defaultValue)
        {
            if (pos < 0 || pos >= GetCount(root)) return defaultValue;
            return ElementAt(pos);
        }
        Node<T> ElementAt(Node<T> cur, int pos)
        {
            if (pos < GetCount(cur.Lc)) return ElementAt(cur.Lc, pos);
            if (pos < GetCount(cur.Lc) + cur.CCount) return cur;
            if (pos < cur.Count) return ElementAt(cur.Rc, pos - GetCount(cur.Lc) - cur.CCount);
            return null;
        }
        public void Debug()
        {
            if (root == null) return;
            Console.WriteLine($"root val:{root.Value}, CCount:{root.CCount}, Count:{root.Count}");
            Debug(root.Value, root.Lc);
            Debug(root.Value, root.Rc);
        }
        void Debug(T pval, Node<T> cur)
        {
            if (cur == null) return;
            Console.WriteLine($"{pval} -> val:{cur.Value}, CCount:{cur.CCount}, Count:{cur.Count}");
            Debug(cur.Value, cur.Lc);
            Debug(cur.Value, cur.Rc);
        }
        /// <summary>value以上でもっとも小さい値とその場所を返却する そのようなものが存在しなければデフォルト値を返す</summary>
        public T LowerBound(T value, ref int index)
        {
            var cur = root;
            T ans = default;
            var add = 0;
            index = GetCount(root);
            while (cur != null)
            {
                if (value.CompareTo(cur.Value) <= 0)
                {
                    ans = cur.Value;
                    index = add + GetCount(cur.Lc);
                    cur = cur.Lc;
                }
                else
                {
                    add += GetCount(cur.Lc) + cur.CCount;
                    cur = cur.Rc;
                }
            }
            return ans;
        }
        /// <summary>要素の個数を求める</summary>
        public int GetCount()
        {
            return GetCount(root);
        }
        /// <summary>要素の一覧を返す</summary>
        public List<T> GetValues()
        {
            var list = new List<T>();
            if (root != null) GetValues(root, list);
            return list;
        }
        static void GetValues(Node<T> cur, List<T> list)
        {
            if (cur.Lc != null) GetValues(cur.Lc, list);
            list.Add(cur.Value);
            if (cur.Rc != null) GetValues(cur.Rc, list);
        }
        /// <summary>指定された要素が存在するか求める</summary>
        /// <param name="value"></param>
        /// <returns></returns>
        public bool Contains(T value)
        {
            if (root == null) return false;
            return Contains(root, value);
        }
        static bool Contains(Node<T> cur, T value)
        {
            var d = cur.Value.CompareTo(value);
            if (d == 0) return true;
            if (d > 0)
            {
                if (cur.Lc == null) return false;
                return Contains(cur.Lc, value);
            }
            else
            {
                if (cur.Rc == null) return false;
                return Contains(cur.Rc, value);
            }
        }
    }
}