You are given five arrays of the same length n that describe n records. Record i has a time timestamps[i], a label venues[i], a price fillPrices[i], a reference price benchmarkPrices[i], and a count volumes[i]. You are also given a string targetVenue and two integers maxSpread and maxCost.

Keep only the records whose label equals targetVenue, and put the kept records in increasing order of time. You can assume no two records that share a label also share a time.

The cost of a record is abs(fillPrices[i] - benchmarkPrices[i]) * volumes[i].

A window is a contiguous block of the kept records in that order. A window fits the budgets when both of these hold:

• the largest price in the window minus the smallest price in the window is at most maxSpread;
• the total cost of the records in the window is at most maxCost.

Return the number of records in the longest window that fits the budgets. If no record has the label targetVenue, return 0. If no window fits the budgets, return 0.

Examples