code: def pop(self, count=1):
          
          if count < 0:
              return self.popleft(-count)
  
          new_right_list, new_left_list = PDeque._pop_lists(self._right_list, self._left_list, count)
          return PDeque(new_left_list, new_right_list, max(self._length - count, 0), self._maxlen)
docs: Return new deque with rightmost element removed. Popping the empty queue
          will return the empty queue. A optional count can be given to indicate the
          number of elements to pop. Popping with a negative index is the same as
          popleft. Executes in amortized O(k) where k is the number of elements to pop.
  
          >>> pdeque([1, 2]).pop()
          pdeque([1])
          >>> pdeque([1, 2]).pop(2)
          pdeque([])
          >>> pdeque([1, 2]).pop(-1)
          pdeque([2])