You are given an empty graph of N vertices and M queries of two types:
Given a number X answer what is the shortest distance from the vertex 1 to the vertex X.
Given two integers X, Y add the new oriented edge from X to Y.

Input
The first line contains two integers N and M.
The following M lines describe queries in the format mentioned above

Output
For each query of the first type output one integer on a separate line - answer for the corresponding query. Output -1 if it's impossible to get to the vertex in this query from the vertex 1.

Constraints
1 ≤ N ≤ 1000
1 ≤ M ≤ 500 000
1 ≤ X, Y ≤ N

SAMPLE INPUT
4 7
1 4
2 1 2
2 2 3
2 3 4
1 4
2 2 4
1 4


SAMPLE OUTPUT
-1
3
2
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
import Queue

def updateDis(f, g, d):
	q = Queue.Queue()
	q.put(f)
	
	while not q.empty():
		cur = q.get()
		for i in g[cur]:
			if d[i]>d[cur]+1:
				d[i]=d[cur]+1
				q.put(i)
				
def main():	
	N, M = map(int, raw_input().split(" "))
	graph = [[] for j in xrange(N)]
	dis = [99999 for i in xrange(N)]
	dis[0]=0
	for x in xrange(M):
		query =[int(i) for i in raw_input().split(" ") if i!=""]
		if len(query) > 2:
			graph[query[1]-1].append( query[2]-1 )
			if dis[query[2]-1] > dis[query[1]-1]+1:
				dis[query[2]-1] = dis[query[1]-1]+1
				updateDis(query[2]-1,graph,dis)
				#print dis
		else:
			print -1 if dis[query[1]-1]>=99999 else dis[query[1]-1]


main()

'''
4 7
1 4
2 1 2
2 2 3
2 3 4
1 4
2 2 4
1 4

def getShortestDis(g,frm, to):
	q = Queue.Queue()
	q.put((frm,0))
	
	while not q.empty():
		cur = q.get()
		if cur[0]==to:
			return cur[1]
		for i in g[cur[0]]:
			q.put( (i,(cur[1]+1)) )
	return -1	


'''