WOJ 26 Lost in WHU（矩阵快速幂+邻接矩阵乘法）

Input file: standard input
Output file: standard output 
Time limit: 1 second
Memory limit: 512 mebibytes

As one of the most beautiful campus in China, Wuhan University is around several hills, so the road is complex and visitors always lose themselves. Give a undirected graph of WHU of $N$ points and a deadline, then you should count the number of plan to reach the destination by deadline (the starting point is 1 and the ending point is $N$).

Input

First line contains the number of points $N$ ($N\le 100$) and the number of edges