cf601A The Two Routes

A. The Two Routes

time limit per test 2 seconds

memory limit per test 256 megabytes

input standard input

output standard output

In Absurdistan, there are n towns (numbered 1 through n) and m bidirectional railways. There is also an absurdly simple road network — for each pair of different towns x and y, there is a bidirectional road between towns x and y if and only if there is no railway between them. Travelling to a different town using one railway or one road always takes exactly one hour.

A train and a bus leave town 1 at the same time. They both have the same destination, town n, and don't make any stops on the way (but they can wait in town n). The train can move only along railways and the bus can move only along roads.

You've been asked to plan out routes for the vehicles; each route can use any road/railway multiple times. One of the most important aspects to consider is safety — in order to avoid accidents at railway crossings, the train and the bus must not arrive at the same town (except town n) simultaneously.

Under these constraints, what is the minimum number of hours needed for both vehicles to reach town n (the maximum of arrival times of the bus and the train)? Note, that bus and train are not required to arrive to the town n at the same moment of time, but are allowed to do so.

Input

The first line of the input contains two integers n and m (2 ≤ n ≤ 400, 0 ≤ m ≤ n(n - 1) / 2) — the number of towns and the number of railways respectively.

Each of the next m lines contains two integers u and v, denoting a railway between towns u and v (1 ≤ u, v ≤ n, u ≠ v).

You may assume that there is at most one railway connecting any two towns.

Output

Output one integer — the smallest possible time of the later vehicle's arrival in town n. If it's impossible for at least one of the vehicles to reach town n, output  - 1.

Examples

input

4 2
1 3
3 4

output

2

input

4 6
1 2
1 3
1 4
2 3
2 4
3 4

output

-1

input

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

output

3

Note

In the first sample, the train can take the route  and the bus can take the route . Note that they can arrive at town4 at the same time.

In the second sample, Absurdistan is ruled by railwaymen. There are no roads, so there's no way for the bus to reach town 4.

有n个点，n*(n-1)/2条边，任意两个点之间都有边，现在把边黑白染色，有m条白的边，其他都黑色的。两个人一开始位于1号点，第一个人只走白边，第二个人只走黑边，问两个人都到达n的最短时间。有一个人不能到达就输出-1。可以不同步，就是不必同时到达n

一开始我这想半天。。还想过爆搜。。主要是题面太有误导性

后来突然醒悟，一定有一条1到n的，不管是黑色还是白色

然后只要看另一个人什么时候到就好啦

这题n才400这么小，都能folyd了

 #include<cstdio>
 #include<iostream>
 #include<cstring>
 #include<cstdlib>
 #include<algorithm>
 #include<cmath>
 #include<queue>
 #include<deque>
 #include<set>
 #include<map>
 #include<ctime>
 #define LL long long
 #define inf 0x7ffffff
 #define pa pair<int,int>
 #define pi 3.1415926535897932384626433832795028841971
 using namespace std;
 inline LL read()
 {
     LL x=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }
 inline void write(LL a)
 {
     if (a<){printf("-");a=-a;}
     if (a>=)write(a/);
     putchar(a%+'');
 }
 inline void writeln(LL a){write(a);printf("\n");}
 int n,m;
 int dis[][];
 bool mrk[][],fuckyou;
 int main()
 {
     n=read();m=read();
     memset(dis,/,sizeof(dis));
     for (int i=;i<=m;i++)
     {
         int x=read(),y=read();
         mrk[x][y]=mrk[y][x]=;
     }
     if (mrk[][n])fuckyou=;
     for (int i=;i<=n;i++)
         for (int j=;j<=n;j++)
             if (fuckyou^mrk[i][j])dis[i][j]=1ll;
     for (int k=;k<=n;k++)
         for (int i=;i<=n;i++)
             for (int j=;j<=n;j++)
                 dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
     if (dis[][n]>=)printf("-1");
     else printf("%d\n",dis[][n]);
 }

cf601A