input: Write a function to generate a list of numbers from 0 to 50 that are divisible by both 3 and 5. Return the list of these numbers. If the range is invalid or the divisors are invalid, return an empty list.
  assert generate_divisible_numbers(0, 50, 3, 5) == [0, 15, 30, 45]
  assert generate_divisible_numbers(0, 50, 3, 7) == []
  assert generate_divisible_numbers(0, 50, 1, 1) == [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]
  assert generate_divisible_numbers(-5, 5, 1, 1) == [0, 1, 2, 3, 4, 5]
  assert generate_divisible_numbers(0, 100, 0, 5) == []
  assert generate_divisible_numbers(0, 0, 1, 1) == []
output: def generate_divisible_numbers(start, end, divisor1, divisor2):
      if divisor1 == 0 or divisor2 == 0:
          return []
      return [num for num in range(start, end + 1) if num % divisor1 == 0 and num % divisor2 == 0]