#include <bits/stdc++.h>
#include "race.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#define fio ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
#define ld long double
#define en exit(0);
#define pb push_back
#define fi first
#define se second
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int best_path(int N, int K, int H[][2], int L[])
{
int res = -1, it = 0, cur = 0;
for(int i = 0;i < N - 1;i++)
{
cur += L[i];
while(cur > K || L[it] == 0)
cur -= L[it++];
if(cur == K && (res == -1 || i - it + 1 < res))
res = i - it + 1;
}
return res;
}
