input: Write a function to find all the numbers divisible by a certain number within a certain range. If no number is divisible by the given divisor, return an empty list.
  
  def find_numbers_divisible_by(m, n, divisor):
      divisible_numbers = []
      for i in range(m, n+1):
          if i % divisor == 0:
              divisible_numbers.append(i)
      return divisible_numbers
  
  assert find_numbers_divisible_by(36, 74, 6)==[36, 42, 48, 54, 60, 66, 72]
  assert find_numbers_divisible_by(10, 20, 3)==[12, 15, 18]
  assert find_numbers_divisible_by(1, 5, 2)==[2, 4]
  assert find_numbers_divisible_by(100, 110, 12)==[]
  assert find_numbers_divisible_by(0, 1, 8)==[]
output: def find_numbers_divisible_by(m, n, divisor):
      divisible_numbers = []
      for i in range(m, n+1):
          if i % divisor == 0:
              divisible_numbers.append(i)
      return divisible_numbers