input: Write a python function to compute the number of pairs of houses that require exactly k streets to travel between them in a city with n houses connected linearly and an additional street between houses x and y. The function should return an array where each element represents the count of such pairs for each k from 1 to n.
  
  from typing import List
  from itertools import accumulate
  
  def count_street_pairs(n: int, x: int, y: int) -> List[int]:
      """
      Given three positive integers n, x, and y, representing a city with n houses connected end-to-end and another street between houses x and y, determine the number of house pairs requiring k streets of travel.
  
      For every k from 1 to n, compute how many house pairs (house1, house2) need exactly k streets to travel between them.
  
      Returns a 1-indexed list where each position k contains the total number of valid house pairs for that distance.
  
      Examples:
      >>> n = 3, x = 1, y = 3
      [6,0,0]
      >>> n = 5, x = 2, y = 4
      [10,8,2,0,0]
      >>> n = 4, x = 1, y = 1
      [6,4,2,0]
  
      Constraints:
      2 <= n <= 100
      1 <= x, y <= n
      """
output: def count_street_pairs(n: int, x: int, y: int) -> List[int]:
      def distance(a, b):
          return min(abs(a - b), abs(a - x) + 1 + abs(y - b), abs(a - y) + 1 + abs(x - b))
  
      result = [0] * n
      for i in range(1, n + 1):
          for j in range(i + 1, n + 1):
              result[distance(i, j) - 1] += 1
      return result