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
  
  
  class AntiDivision:
      def __init__(self):
          self.A, self.B, self.C, self.D = map(int, input().split())
  
      def cal(self):
          a_b_count = self.B - self.A + 1
          lcm = (self.C * self.D) // fractions.gcd(self.C, self.D)
          c_count = self.B // self.C - (self.A - 1) // self.C
          d_count = self.B // self.D - (self.A - 1) // self.D
          lcm_count = self.B // lcm - (self.A - 1) // lcm
  
          print(a_b_count - c_count - d_count + lcm_count)
  
  
  antiDivision = AntiDivision()
  antiDivision.cal()
  
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"}]