The Largest City Nearby（NOIOPJENGLISH17）

The Largest City Nearby

https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH17

 1000ms  65536K

描述：

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.

有n个城市，给出城市间边的长度，找出索引最长的城市，并使得城市1和它之间存在一条路径，且该路径的长度不超过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.

第一行：两个正整数表示n和k

接下来n行：第i行包含n个整数表示城市i和其他城市的距离

输出：

One integer id.

一个数表示id

样例输入：

4 6
0 4 5 7
4 0 9 3
5 9 0 1
7 3 1 0

样例输出：

4