code: def _division(divisor, dividend, remainder, base):
          
          quotient = []
          for value in dividend:
              remainder = remainder * base + value
              (quot, rem) = divmod(remainder, divisor)
              quotient.append(quot)
              if quot > 0:
                  remainder = rem
          return (quotient, remainder)
docs: Get the quotient and remainder
  
          :param int divisor: the divisor
          :param dividend: the divident
          :type dividend: sequence of int
          :param int remainder: initial remainder
          :param int base: the base
  
          :returns: quotient and remainder
          :rtype: tuple of (list of int) * int
  
          Complexity: O(log_{divisor}(quotient))