






'''simple docstring'''
from __future__ import annotations





def 	_a(					UpperCamelCase__			:  int,		UpperCamelCase__			:  int							):




      '''simple docstring'''






      if partitions <= 0:
            raise ValueError('''partitions must be a positive number!'''							)
      if partitions > number_of_bytes:
            raise ValueError('''partitions can not > number_of_bytes!'''							)
      SCREAMING_SNAKE_CASE__       :			Optional[int]													=number_of_bytes // partitions
      SCREAMING_SNAKE_CASE__       :			str													=[]
      for i in range(UpperCamelCase__							):
            SCREAMING_SNAKE_CASE__       :			Union[str, Any]													=i * bytes_per_partition + 1
            SCREAMING_SNAKE_CASE__       :			Dict													=(
                number_of_bytes if i == partitions - 1 else (i + 1) * bytes_per_partition
            )
            allocation_list.append(f"{start_bytes}-{end_bytes}"							)
      return allocation_list


if __name__ == "__main__":
  import doctest

  doctest.testmod()







'''simple docstring'''
def 	_a(					UpperCamelCase__			:  Optional[Any]=2_8_1_2_3							):




      '''simple docstring'''






      SCREAMING_SNAKE_CASE__       :			List[Any]													=[1] * (limit + 1)

      for i in range(2,		int(limit**0.5							) + 1							):
            sum_divs[i * i] += i
            for k in range(i + 1,		limit // i + 1							):
                  sum_divs[k * i] += k + i

      SCREAMING_SNAKE_CASE__       :			List[str]													=set()
      SCREAMING_SNAKE_CASE__       :			str													=0

      for n in range(1,		limit + 1							):
            if sum_divs[n] > n:
                  abundants.add(UpperCamelCase__							)

            if not any((n - a in abundants) for a in abundants							):
                  res += n

      return res


if __name__ == "__main__":
  print(solution())