english-17 The Largest City Nearby
描述
There are N cities, the length of edges between cities is given. Please find the city with the largest index id satisfying that there exisits a path between city 1 and city id and the length of this path is no more than K.
输入
First line: two positive integers N (N <= 100) and K (K <= 10000).Next N lines: the i-th line contains N non-negative integers (<= 100) indicating the length of edge between city i and other cities.
输出
One integer id.
样例输入
1
2
3
4
5
64 6
0 4 5 7
4 0 9 3
5 9 0 1
7 3 1 0
样例输出
限制