output_description: Print the number of integers between A and B (inclusive) that can be evenly
  divided by neither C nor D.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B C D
attempt: import fractions
  
  parents = list(map(int, input().split(" ")))
  All = parents[1] - parents[0]
  min_2 = (parents[2] * parents[3]) // fractions.gcd(parents[2], parents[3])
  
  All = All - All // parents[2] - All // parents[3] + All // min_2
  
  if (
      parents[2] >= parents[0]
      and parents[2] <= parents[1]
      and parents[2] > (parents[1] - parents[0])
  ):
      All = All - 1
  if (
      parents[3] >= parents[0]
      and parents[3] <= parents[1]
      and parents[3] > (parents[1] - parents[0])
  ):
      All = All - 1
  
  if All < 0:
      All = 0
  print(All)
  
problem_description: Statement
  
  You are given four integers A, B, C, and D. Find the number of integers
  between A and B (inclusive) that can be evenly divided by neither C nor D.
samples: [{"input": "4 9 2 3", "output": "2\n    \n\n5 and 7 satisfy the condition.\n\n* * *"}, {"input": "10 40 6 8", "output": "23\n    \n\n* * *"}, {"input": "314159265358979323 846264338327950288 419716939 937510582", "output": "532105071133627368"}]