The Quietest Library

An urban planner needs to build a library that spans exactly K contiguous blocks. Each block has a recorded 'noise level'. To ensure a quiet environment, the library should be placed where the total noise level of the K blocks is minimized. Find the starting block index of this optimal location. If multiple locations have the same minimum noise, return the smallest index. Input Format: - Line 1: Two integers N (total blocks) and K (library length). - Line 2: N integers representing the noise levels of each block. Output Format: - A single integer representing the 0-indexed starting position. Example: Input: 5 2 10 2 3 8 1 Output: 1