def f():
    yield 1
    yield 2
    yield 3
a, *b = f()
print(a, b)

class A:
    def __init__(self):
        self.i = 0
    def __iter__(self):
        return self
    def __next__(self):
        if self.i > 2:
            raise StopIteration
        self.i += 1
        return self.i
a, b, c = A()
print(a, b, c)

a, b, *c, d = (1,2,3,4,5,6)
print(c)

from collections import deque
q = deque(maxlen=3)
q.append(1)
q.appendleft(2)
q.append(3)
q.append(4)
q.popleft()
print(q.popleft())

import heapq
d = [5, -2, 3, 4, 1, 7 -3, 11, -9, 0, -1, 6]
a = heapq.nsmallest(1, d)
b = heapq.nlargest(1, d)
print(*a, *b)

import heapq
s = [2, 1, 3]
heapq.heapify(s)
print(s[0])

import heapq
s = [2, 3, 0, 1]
heapq.heapify(s)
print(s[-1])

avg = lambda x: sum(x) / len(x)
def f(values):
    a, *b, c = values
    return avg(b)
f([0, 2, 3, 4])

recs = [(1, 2, 3), (1, 2), (3, 4), (0, 1, 2, 3, 4)]
s = 0
for a, *b in recs:
    s += sum(b)
print(s)

import sys
def f(n):
  if n == 0:
    return 1
  return n * f(n-1)  # 1
sys.setrecursionlimit(1000)  # 2 
f(50)  # 3 
sys.setrecursionlimit(1)  # 4
f(50)  # 5