input: Write a function to find all numbers divisible by a certain divisor within a given range [m, n]. If a number in the range is divisible by the divisor, it should be included in the result. The function should return a list of all such numbers.
  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(1, 10, 2)==[2, 4, 6, 8, 10]
  assert find_numbers_divisible_by(15, 20, 5)==[15, 20]
  assert find_numbers_divisible_by(100, 110, 7)==[105]
  assert find_numbers_divisible_by(1, 5, 3)==[3]
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