Count Pairs That Sum

Write count_pairs(values: list[int], target: int) -> int that returns how many pairs of positions, with the first index before the second, hold two values adding up to target. Use two nested loops over range(len(values)) so every pair is tried exactly once, and keep a running count instead of returning early. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: two lines, a space-separated list of integers and then the target; the tests print the count your function returns.