input: def sum_two_digit_elements(arr, k):
      """
      Given an array of integers arr and an integer k, return
      the sum of elements that have at most two digits within the first k elements of arr.
  
      Example:
  
          Input: arr = [111,21,3,4000,5,6,7,8,9], k = 4
          Output: 24 # sum of 21 + 3
  
      Constraints:
          1. 1 <= len(arr) <= 100
          2. 1 <= k <= len(arr)
      """
output:     
      return sum(x for x in arr[:k] if -99 <= x <= 99)
  