code: def total_divisible_numbers(arr, S):
      # find lcm for all numbers in the array
      lcm = 1
      for a in arr:
          lcm = (a * lcm) // gcd(a, lcm)
  
      # return the count of numbers divisble by the lcm number (smaller or equal to S)
      return S // lcm
  
label_desc: Use image node_id 1 for calling a global function with example usage: total_divisible_numbers(arr, S) and returns: unknown