#include <bits/stdc++.h>
using namespace std;
#define ll          long long
#define ld          long double

void dfs(ll x, ll p, vector<ll>&par, vector<ll>&vis, vector<vector<ll>>&g, vector<vector<bool>>&ed)
{
	vis[x]=1;
	par[x]=p;
	for(ll y : g[x])
	{
		if(vis[y]==1)
		{
			set<ll>cyc;
			ll cur=x;
			while(cur!=y)
			{
				cyc.insert(cur);
				cur=par[cur];
			}
			cyc.insert(cur);
			bool ok=1;
			// only el of set
			ll n=g.size()-1;
			for(ll z : cyc)
			{
				ll cnt=0;
				for(ll i=1; i<=n; i++) if(cyc.count(i)) cnt+=ed[z][i];
				if(cnt>1) {ok=0; break;}
			}
			if(ok)
			{
				cout<<cyc.size()<<endl;
				for(ll z : cyc) cout<<z<<endl;
				exit(0);
			}
		}
		else 
		{
			dfs(y, x, par, vis, g, ed);
		}
	}
	vis[x]=2;
}

void solve()  
{
	ll n, m; cin>>n>>m;
	vector<vector<ll>>g(n + 1);
	vector<vector<bool>>ed(n+1, vector<bool>(n+1, 0));
	for(ll i=0; i<m; i++) { ll x, y; cin>>x>>y; g[x].push_back(y); ed[x][y]=1; }
	vector<ll>par(n+1);
	vector<ll>vis(n+1, 0);
	for(ll i=1; i<=n; i++) if(vis[i]==0) { vis[i]=1; dfs(i, i, par, vis, g, ed); }
	cout<<-1<<endl;
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);  
	ll T = 1;
	//cin>>T; 
	while(T--)
	    solve();
	return 0;
}

### Prompt

Generate a cpp solution to the following problem:

Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains no self-loops or multiple edges.

Determine whether there exists an induced subgraph (see Notes) of G such that the in-degree and out-degree of every vertex are both 1. If the answer is yes, show one such subgraph.
Here the null graph is not considered as a subgraph.

Constraints

* 1 \leq N \leq 1000
* 0 \leq M \leq 2000
* 1 \leq A_i,B_i \leq N
* A_i \neq B_i
* All pairs (A_i, B_i) are distinct.
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N M
A_1 B_1
A_2 B_2
:
A_M B_M


Output

If there is no induced subgraph of G that satisfies the condition, print `-1`. Otherwise, print an induced subgraph of G that satisfies the condition, in the following format:


K
v_1
v_2
:
v_K


This represents the induced subgraph of G with K vertices whose vertex set is \\{v_1, v_2, \ldots, v_K\\}. (The order of v_1, v_2, \ldots, v_K does not matter.) If there are multiple subgraphs of G that satisfy the condition, printing any of them is accepted.

Examples

Input

4 5
1 2
2 3
2 4
4 1
4 3


Output

3
1
2
4


Input

4 5
1 2
2 3
2 4
1 4
4 3


Output

-1


Input

6 9
1 2
2 3
3 4
4 5
5 6
5 1
5 2
6 1
6 2


Output

4
2
3
4
5

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
#define ll          long long
#define ld          long double

void dfs(ll x, ll p, vector<ll>&par, vector<ll>&vis, vector<vector<ll>>&g, vector<vector<bool>>&ed)
{
	vis[x]=1;
	par[x]=p;
	for(ll y : g[x])
	{
		if(vis[y]==1)
		{
			set<ll>cyc;
			ll cur=x;
			while(cur!=y)
			{
				cyc.insert(cur);
				cur=par[cur];
			}
			cyc.insert(cur);
			bool ok=1;
			// only el of set
			ll n=g.size()-1;
			for(ll z : cyc)
			{
				ll cnt=0;
				for(ll i=1; i<=n; i++) if(cyc.count(i)) cnt+=ed[z][i];
				if(cnt>1) {ok=0; break;}
			}
			if(ok)
			{
				cout<<cyc.size()<<endl;
				for(ll z : cyc) cout<<z<<endl;
				exit(0);
			}
		}
		else 
		{
			dfs(y, x, par, vis, g, ed);
		}
	}
	vis[x]=2;
}

void solve()  
{
	ll n, m; cin>>n>>m;
	vector<vector<ll>>g(n + 1);
	vector<vector<bool>>ed(n+1, vector<bool>(n+1, 0));
	for(ll i=0; i<m; i++) { ll x, y; cin>>x>>y; g[x].push_back(y); ed[x][y]=1; }
	vector<ll>par(n+1);
	vector<ll>vis(n+1, 0);
	for(ll i=1; i<=n; i++) if(vis[i]==0) { vis[i]=1; dfs(i, i, par, vis, g, ed); }
	cout<<-1<<endl;
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);  
	ll T = 1;
	//cin>>T; 
	while(T--)
	    solve();
	return 0;
}

```