#include <bits/stdc++.h>
//#include "race.h"
//#include <stdio.h>
//#include <stdlib.h>
//const int FF = 200005;
using namespace std;
int best_path(int N, int K, int H[][2], int L[]) {
int jog = -1;
for (int i = 0; i < N; ++i) {
int j = i, sum = 0, ans = 0;
while (j < N and sum < K) {
sum += L[j];
ans++;
j++;
}
if (sum == K) {
if (jog == -1) {
jog = ans;
}
else jog = min (jog, ans);
}
}
return jog;
}
//int main () {
// freopen ("kk.txt", "r", stdin);
// int N, K;
// cin >> N >> K;
// int H[N][2], L[N];
// for (int i = 0; i < N; ++i) {
// cin >> H[i][0] >> H[i][1] >> L[i];
// }
// cout << best_path(N, K, H, L);
//}
