def max_window_sum(nums, k):
    if k < 1 or k > len(nums):
        return None
    total = sum(nums[:k])
    best = total
    for right in range(k, len(nums)):
        total += nums[right] - nums[right - k]
        best = max(best, total)
    return best