input: from typing import List
  
  
  def find_matches(query: str, choices: List[str], threshold: int) -> List[str]:
      """ Find all strings in choices that are close matches to the query string as 
      measured by Levenshtein distance, within a given threshold.
  
      >>> find_matches("apple", ["apple", "apples", "app", "aple"], 2)
      ['apple', 'apples', 'app']
      >>> find_matches("abc", ["abc", "abcdef", "ab", "abcd"], 1)
      ['abc', 'ab']
      """
output:     from Levenshtein import distance
      return [choice for choice in choices if distance(query, choice) <= threshold]