Most consecutive elements from an index whose sum stays below a target

You get a non-decreasing array, a start index and a target. Return how many consecutive elements, starting at that index, can be added while the sum stays below the target. Use prefix sums and binary search so many queries are cheap.