using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using static System.Console;
using static System.Convert;
using static System.Math;
using Pi = Pair<int, int>;
using PL = Pair<long, int>;
//using static System.Globalization.CultureInfo;
using System.Text;
class Program
{
    public static bool chmin<T>(ref T num, T val) where T : IComparable<T>
    { if (num.CompareTo(val) == 1) { num = val; return true; } return false; }
    public static bool chmax<T>(ref T num, T val) where T : IComparable<T>
    { if (num.CompareTo(val) == -1) { num = val; return true; } return false; }
    public static void swap<T>(ref T v1, ref T v2)
    { var t = v2; v2 = v1; v1 = t; }
    public static void Fail() => Fail("No");
    public static void Fail<T>(T s) { WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
    static void Main(string[] args)
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        Console.SetOut(sw);
        var p = new Program();
        for (var i = 1; i > 0; --i) 
            p.Solve();
        Console.Out.Flush();
    }
    void Solve()
    {
        int num, m;
        Input.Make(out num, out m);
        var edge = Input.edge<int>(num);
        for (var i = 0; i < m; i++)
        {
            int a, b;
            Input.Make(out a, out b);
            a--; b--;
            edge[a].Add(b);
        }
        for (var i = 0; i < num; i++)
        {
            var st = new PersistentStack<int>[num];
            var que = new Queue<int>();
            que.Enqueue(i);
            st[i] = new PersistentStack<int>();st[i]=st[i].Push(-1);
            var last = -1;
            while (que.Any())
            {
                var p = que.Dequeue();
                foreach (var e in edge[p])
                {
                    if (e == i)
                    {
                        last = p;break;
                    }
                    if(st[e]==null)
                    {
                        st[e] = st[p].Push(p);
                        que.Enqueue(e);
                    }
                }
            }
            if (last == -1) continue;
            while (true)
            {
                var th = new HashSet<int>();
                var s = st[last];
                th.Add(last);
                var ro = new List<int>() { last };
                while (s.Peek != -1)
                { th.Add(s.Peek); ro.Add(s.Peek); s = st[s.Peek]; }
                for (var j = 0; j < ro.Count; j++)
                {
                    foreach (var e in edge[ro[j]])
                        if (th.Contains(e) && ro[(j - 1 + ro.Count) % ro.Count] != e)
                        {
                            var index = 0;
                            while (ro[index] != e) index++;
                            if (j > index)
                                st[e] = st[ro[j]].Push(ro[j]);
                            else
                            {
                                st[e] = st[e].Push(-1);
                                last = ro[j];
                            }
                            goto END;
                        }
                }
                Fail($"{ro.Count}\n{string.Join("\n", ro.Select(v => ++v))}");

            END:;
            }
        }
        WriteLine(-1);
    }
}

public class PersistentStack<T>
{
    private class Node
    {
        public T Key { get; set; }
        public Node next { get; set; }
        public Node(T key, Node next) { this.Key = key; this.next = next; }
    }
    public int Count { get; private set; }
    public PersistentStack() { }
    private PersistentStack(Node head, int Count = 0) { this.head = head; this.Count = Count; }
    private Node head;
    public T Peek { get { return head.Key; } }
    public PersistentStack<T> Push(T val)
        => new PersistentStack<T>(new Node(val, head), Count + 1);
    public PersistentStack<T> Pop()
        => new PersistentStack<T>(head.next, Count - 1);

}

public class Input
{
    public static string read => ReadLine().Trim();
    public static int[] ar => read.Split(' ').Select(int.Parse).ToArray();
    public static int num => ToInt32(read);
    public static long[] arL => read.Split(' ').Select(long.Parse).ToArray();
    public static long numL => ToInt64(read);
    public static T[] create<T>(int n, Func<int, T> f)
        => Enumerable.Repeat(0, n).Select(f).ToArray();
    public static char[][] grid(int h)
        => create(h, _ => read.ToCharArray());
    public static int[] ar1D(int n)
        => create(n, _ => num);
    public static long[] arL1D(int n)
        => create(n, _ => numL);
    public static string[] strs(int n)
        => create(n, _ => read);
    public static int[][] ar2D(int n)
        => create(n, _ => ar);
    public static long[][] arL2D(int n)
        => create(n, _ => arL);
    public static List<T>[] edge<T>(int n)
        => create(n, _ => new List<T>());
    public static T GetValue<T>(string g)
    {
        var t = typeof(T);
        if (t == typeof(int))
            return (T)(object)int.Parse(g);
        if (t == typeof(long))
            return (T)(object)long.Parse(g);
        if (t == typeof(string))
            return (T)(object)g;
        if (t == typeof(char))
            return (T)(object)char.Parse(g);
        if (t == typeof(double))
            return (T)(object)double.Parse(g);
        if (t == typeof(bool))
            return (T)(object)bool.Parse(g);
        return default(T);
    }
    public static void Make<T1, T2>(out T1 v1, out T2 v2)
    {
        v1 = Next<T1>();
        v2 = Next<T2>();
    }
    public static void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3)
    {
        Make(out v1, out v2);
        v3 = Next<T3>();
    }
    public static void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4)
    {
        Make(out v1, out v2, out v3);
        v4 = Next<T4>();
    }
    public static void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5)
    {
        Make(out v1, out v2, out v3, out v4);
        v5 = Next<T5>();
    }
    public static void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6)
    {
        Make(out v1, out v2, out v3, out v4, out v5);
        v6 = Next<T6>();
    }
    private static Queue<string> sc;
    public static T Next<T>() { sc = sc ?? new Queue<string>(); if (sc.Count == 0) foreach (var item in read.Split(' ')) sc.Enqueue(item); return GetValue<T>(sc.Dequeue()); }
    public static void Next<T>(ref T val) => val = Next<T>();
    public const long Inf = (long)1e18;
    public const double eps = 1e-6;
    public const string Alfa = "abcdefghijklmnopqrstuvwxyz";
    public const int MOD = 1000000007;
}

public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1 { get; set; }
    public T2 v2 { get; set; }
    public Pair() { v1 = Input.Next<T1>(); v2 = Input.Next<T2>(); }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString()
        => $"{v1.ToString()} {v2.ToString()}";
    public override bool Equals(object obj)
        => this == (Pair<T1, T2>)obj;
    public override int GetHashCode()
        => v1.GetHashCode() ^ v2.GetHashCode();
    public static bool operator ==(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) == 0;
    public static bool operator !=(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) != 0;
    public static bool operator >(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) == 1;
    public static bool operator >=(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) != -1;
    public static bool operator <(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) == -1;
    public static bool operator <=(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) != 1;
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3 { get; set; }
    public Pair() : base() { v3 = Input.Next<T3>(); }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString()
        => $"{base.ToString()} {v3.ToString()}";
}


Measured memory_bytes: 23520