### 001

```python
def f1(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f1([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 002

```python
def f2(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * prices[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f2([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 003

```python
def f3(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    finished = set()
    result = []
    groups = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                needs[nxt] -= 1
    returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f3(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 004

```python
def f4(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        routes.setdefault(a, []).append(b)
    steps = {start: 0} if limit > 0 or limit < 0 else {}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    pending.append(nxt)
    result = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': result, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f4([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 005

```python
def f5(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f5([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 006

```python
def f6(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices or rate0 <= rate0 + 0:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices and count > 0:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f6([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 007

```python
def f7(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip().upper()
    excluded = {normalize(value) for value in excluded}
    a = {normalize(value) for value in left if normalize(value) != normalize(value) or normalize(value) != ''} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f7(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 008

```python
def f8(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        tallies[word] = min(9, tallies.get(word, 0) + 1)
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f8(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 009

```python
def f9(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(totals) if value >= limit]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f9([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 010

```python
def f10(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(totals) if value >= limit]
    growth = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': min(256, max(totals)), 'hits': matches, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f10([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 011

```python
def f11(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    result = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f11([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 012

```python
def f12(rows, keep, factors):
    rows = list(rows)
    kept = []
    groupmap = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * factors[group]
            kept.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            grand += cost
    kept.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(kept), 'total': grand, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, cost in kept)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f12([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 013

```python
def f13(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            cost = value * prices[group]
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f13([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 014

```python
def f14(rows, keep, factors):
    rows = list(rows)
    selected = []
    totals = {}
    grand = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep:
            cost = value * factors[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            grand += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': grand, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f14([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 015

```python
def f15(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f15([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 016

```python
def f16(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep:
            charge = value * prices[group]
            selected.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            amount += charge
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f16([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 017

```python
def f17(rows, keep, prices):
    rows = list(rows)
    matches = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * abs(prices[group])
            matches.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            sumvalue += cost
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f17([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 018

```python
def f18(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    items = []
    for key, count in left[:20]:
        if key in ratemap:
            items.append((key, count * ratemap[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len({key for key, value in items})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f18([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 019

```python
def f19(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f19([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 020

```python
def f20(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * prices[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            grand += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': grand, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f20([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 021

```python
def f21(rows, keep, factors):
    rows = list(rows)
    matches = []
    groupmap = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * factors[group]
            matches.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            amount += cost
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(matches), 'total': amount, 'groups': groupmap, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f21([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 022

```python
def f22(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(windows) if value >= limit]
    growth = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': positions, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f22([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 023

```python
def f23(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    initial = dict(indegree)
    finished = set()
    result = []
    groups = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        groups.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f23(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 024

```python
def f24(left, right, banned):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \n').upper()
    banned = {str(value).strip() for value in banned}
    a = {normalize(value) for value in left} - banned
    b = {normalize(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f24(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 025

```python
def f25(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f25(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 026

```python
def f26(rows, keep, factors):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            charge = value * abs(factors[group])
            selected.append((code, charge))
            buckets[group] = buckets.get(group, 0) + charge
            amount += charge
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': list(dict.fromkeys((code for code, charge in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f26([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 027

```python
def f27(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x = max(-64, min(64, x + dx))
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f27([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 028

```python
def f28(rows, keep, prices):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            charge = value * abs(prices[group])
            kept.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            amount += charge
    kept.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(kept), 'total': amount, 'groups': totals, 'top': [code for code, charge in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f28([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 029

```python
def f29(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value > limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f29([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 030

```python
def f30(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep and value != 0:
            cost = value * prices[group]
            matches.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(matches), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in matches)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f30([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 031

```python
def f31(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    indexes = [pos for pos, value in enumerate(totals) if value >= limit]
    ups = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': indexes, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f31([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 032

```python
def f32(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f32([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 033

```python
def f33(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    result = list(distance)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': edge, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f33([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 034

```python
def f34(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f34([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 035

```python
def f35(rows, keep, ratemap):
    rows = list(rows)
    matches = []
    buckets = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * abs(ratemap[group])
            matches.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            sumvalue += cost
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(matches), 'total': sumvalue, 'groups': buckets, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f35([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 036

```python
def f36(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap or rate0 <= rate0 + 0:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in ratemap})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f36([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 037

```python
def f37(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f37(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 038

```python
def f38(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    result = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': furthest[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f38([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 039

```python
def f39(rows, keep, prices):
    rows = list(rows)
    kept = []
    buckets = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * prices[group]
            kept.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            sumvalue += cost
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': sumvalue, 'groups': buckets, 'top': [code for code, cost in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f39([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 040

```python
def f40(left, right, excluded):
    left = list(left)

    def canon(value):
        return ' '.join(str(value).split()).upper()
    excluded = {str(value).strip() for value in excluded}
    a = {canon(value) for value in left} - excluded
    b = {canon(value) for value in right} - excluded
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f40(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 041

```python
def f41(rows, keep, ratemap):
    rows = list(rows)
    kept = []
    totals = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            score = value * ratemap[group]
            kept.append((code, score))
            totals[group] = totals.get(group, 0) + score
            grand += score
    kept.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(kept), 'total': grand, 'groups': totals, 'top': list(dict.fromkeys((code for code, score in kept)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f41([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 042

```python
def f42(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    complete = set()
    result = []
    layers = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            complete.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f42(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 043

```python
def f43(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f43([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 044

```python
def f44(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(series) if value >= limit and (limit >= 0 or pos > 0)]
    increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': min(256, max(series)), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f44([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 045

```python
def f45(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(windows) if value >= limit]
    growth = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f45([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 046

```python
def f46(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f46([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 047

```python
def f47(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f47(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 048

```python
def f48(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in repeats:
                repeats.append(list(point))
            known.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f48([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 049

```python
def f49(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    handled = set()
    sequence = []
    layers = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f49(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 050

```python
def f50(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip().upper()
    excluded = {str(value).upper() for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f50(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 051

```python
def f51(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    complete = set()
    sequence = []
    groups = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f51(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 052

```python
def f52(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    complete = set()
    listing = []
    groups = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        groups.append(current)
        for node in current:
            complete.add(node)
            listing.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f52(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 053

```python
def f53(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0} if limit > 0 or limit < 0 else {}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f53([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 054

```python
def f54(left, right, banned):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \n').upper()
    banned = {str(value).upper() for value in banned}
    a = {normalize(value) for value in left} - banned
    b = {normalize(value) for value in right if normalize(value) != ''} - banned
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f54(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 055

```python
def f55(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    sequence = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f55([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 056

```python
def f56(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip(' ').upper()
    excluded = {normalize(value) for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f56(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 057

```python
def f57(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f57(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 058

```python
def f58(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \r').upper()
    excluded = {str(value).upper() for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f58(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 059

```python
def f59(left, right, ignored):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \r').upper()
    ignored = {str(value).strip() for value in ignored}
    a = {normalize(value) for value in left} - ignored
    b = {normalize(value) for value in right} - ignored
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f59(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 060

```python
def f60(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f60([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 061

```python
def f61(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap or rate0 <= rate0 + 0:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f61([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 062

```python
def f62(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f62([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 063

```python
def f63(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(routes.get(cur, []))[:20]:
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    listing = list(steps)
    lastlevel = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': listing, 'depth': steps, 'frontier': lastlevel, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f63([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 064

```python
def f64(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    finished = set()
    sequence = []
    rounds = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f64(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 065

```python
def f65(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(series) if value >= limit]
    ups = sum((1 for pos in range(1, min(65, len(series))) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f65([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 066

```python
def f66(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f66([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 067

```python
def f67(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f67([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 068

```python
def f68(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value > limit]
    growth = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f68([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 069

```python
def f69(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(totals) if value >= limit]
    growth = sum((1 for pos in range(1, min(65, len(totals))) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': indexes, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f69([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 070

```python
def f70(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        nextmap.setdefault(a, []).append(b)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < limit:
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    result = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': result, 'depth': levels, 'frontier': furthest[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f70([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 071

```python
def f71(left, right, excluded):
    left = list(left)

    def canon(value):
        return str(value).strip(' \n').upper()
    excluded = {canon(value) for value in excluded}
    a = {canon(value) for value in left} - excluded
    b = {canon(value) for value in right} - excluded
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f71(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 072

```python
def f72(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    listing = list(levels)
    lastlevel = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': listing, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f72([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 073

```python
def f73(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f73(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 074

```python
def f74(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices and rate0 != 0:
            prices[name0] = rate0
    items = []
    for key, count in left:
        if key in prices:
            items.append((key, count * prices[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f74([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 075

```python
def f75(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    startdegree = dict(needs)
    handled = set()
    result = []
    rounds = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in handled))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        rounds.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[nxt] -= 1
    returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f75(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 076

```python
def f76(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f76([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 077

```python
def f77(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f77(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 078

```python
def f78(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x = max(-64, min(64, x + dx))
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f78([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 079

```python
def f79(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows[:64]) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f79([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 080

```python
def f80(rows, keep, prices):
    rows = list(rows)
    matches = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * prices[group]
            matches.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            amount += cost
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': amount, 'groups': buckets, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f80([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 081

```python
def f81(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f81([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 082

```python
def f82(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value >= limit and (limit >= 0 or pos > 0)]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f82([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 083

```python
def f83(left, right, excluded):
    left = list(left)

    def canon(value):
        return str(value).strip(' \r').upper()
    excluded = {canon(value) for value in excluded}
    a = {canon(value) for value in left} - excluded
    b = {canon(value) for value in right} - excluded
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f83(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 084

```python
def f84(left, right, excluded):
    left = list(left)

    def normalize(value):
        return ' '.join(str(value).split()).upper()
    excluded = {normalize(value) for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f84(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 085

```python
def f85(left, right, ignored):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \n').upper()
    ignored = {normalize(value) for value in ignored}
    a = {normalize(value) for value in left} - ignored
    b = {normalize(value) for value in right if normalize(value) != ''} - ignored
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f85(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 086

```python
def f86(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f86([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 087

```python
def f87(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    steps = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if steps[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    work.append(nxt)
    sequence = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f87([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 088

```python
def f88(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors and rate0 != 0:
            factors[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f88([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 089

```python
def f89(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors:
            factors[name0] = rate0
    items = []
    for key, count in left[:20]:
        if key in factors and count > 0:
            items.append((key, count * factors[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f89([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 090

```python
def f90(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f90([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 091

```python
def f91(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    sorteditems = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in tallies.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f91(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 092

```python
def f92(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f92(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 093

```python
def f93(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    rootsource = dict(needs)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f93(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 094

```python
def f94(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f94(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 095

```python
def f95(rows, keep, factors):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep} and value >= 0:
            cost = value * factors[group]
            kept.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    kept.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(kept), 'total': amount, 'groups': totals, 'top': [code for code, cost in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f95([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 096

```python
def f96(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f96([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 097

```python
def f97(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f97([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 098

```python
def f98(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        children.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    result = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': result, 'depth': steps, 'frontier': furthest[:3], 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f98([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 099

```python
def f99(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(windows) if value >= limit]
    growth = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': positions, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f99([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 100

```python
def f100(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    combined = []
    for key, count in left:
        if key in ratemap:
            combined.append((key, count * ratemap[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f100([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 101

```python
def f101(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(min(64, len(values) - size + 1)):
        series.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(series) if value >= limit and (limit >= 0 or pos > 0)]
    growth = sum((1 for pos in range(1, min(65, len(series))) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f101([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 102

```python
def f102(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    handled = set()
    listing = []
    groups = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        groups.append(current)
        for node in current:
            handled.add(node)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f102(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 103

```python
def f103(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows[:64]) if value >= limit and (limit >= 0 or pos > 0)]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f103([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 104

```python
def f104(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    handled = set()
    listing = []
    layers = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f104(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 105

```python
def f105(rows, keep, factors):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * abs(factors[group])
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f105([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 106

```python
def f106(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    items = []
    for key, count in left[:20]:
        if key in ratemap:
            items.append((key, count * ratemap[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f106([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 107

```python
def f107(left, right, ignored):
    left = list(left)

    def tidy(value):
        return str(value).strip().upper()
    ignored = {str(value).strip() for value in ignored}
    a = {tidy(value) for value in left if tidy(value) != tidy(value) or tidy(value) != ''} - ignored
    b = {tidy(value) for value in right} - ignored
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f107(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 108

```python
def f108(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f108([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 109

```python
def f109(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    complete = set()
    result = []
    rounds = []
    while len(complete) < len(nodes) and len(complete) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            complete.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f109(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 110

```python
def f110(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f110([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 111

```python
def f111(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    groupmap = {}
    amount = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep:
            charge = value * abs(ratemap[group])
            selected.append((code, charge))
            groupmap[group] = groupmap.get(group, 0) + charge
            amount += charge
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': groupmap, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f111([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 112

```python
def f112(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(series) if value >= limit]
    increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f112([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 113

```python
def f113(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    rootsource = dict(needs)
    complete = set()
    result = []
    layers = []
    while len(complete) < len(nodes) and len(complete) < 20:
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            complete.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f113(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 114

```python
def f114(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    handled = set()
    result = []
    groups = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f114(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 115

```python
def f115(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    sequence = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f115([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 116

```python
def f116(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f116([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 117

```python
def f117(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    indexes = [pos for pos, value in enumerate(totals[:64]) if value >= limit]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f117([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 118

```python
def f118(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f118([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 119

```python
def f119(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    growth = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f119([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 120

```python
def f120(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    startdegree = dict(needs)
    finished = set()
    listing = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f120(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 121

```python
def f121(left, right, excluded):
    left = list(left)

    def tidy(value):
        return ' '.join(str(value).split()).upper()
    excluded = {tidy(value) for value in excluded}
    a = {tidy(value) for value in left} - excluded
    b = {tidy(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f121(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 122

```python
def f122(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap and count > 0:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted({key for key, count in left if key not in ratemap})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f122([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 123

```python
def f123(left, right, ignored):
    left = list(left)

    def tidy(value):
        return ' '.join(str(value).split()).upper()
    ignored = {str(value).strip() for value in ignored}
    a = {tidy(value) for value in left} - ignored
    b = {tidy(value) for value in right} - ignored
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f123(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 124

```python
def f124(left, right, ignored):
    left = list(left)

    def tidy(value):
        return str(value).strip().upper()
    ignored = {str(value).upper() for value in ignored}
    a = {tidy(value) for value in left} - ignored
    b = {tidy(value) for value in right} - ignored
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f124(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 125

```python
def f125(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    complete = set()
    sequence = []
    groups = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f125(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 126

```python
def f126(left, right, ignored):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \r').upper()
    ignored = {normalize(value) for value in ignored}
    a = {normalize(value) for value in left} - ignored
    b = {normalize(value) for value in right} - ignored
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f126(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 127

```python
def f127(left, right, excluded):
    left = list(left)

    def tidy(value):
        return str(value).strip(' ').upper()
    excluded = {tidy(value) for value in excluded}
    a = {tidy(value) for value in left if tidy(value) != tidy(value) or tidy(value) != ''} - excluded
    b = {tidy(value) for value in right} - excluded
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f127(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 128

```python
def f128(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f128([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 129

```python
def f129(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f129([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 130

```python
def f130(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        routes.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    sequence = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest[:3], 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f130([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 131

```python
def f131(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    sequence = list(distance)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': edge, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f131([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 132

```python
def f132(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \r').upper()
    excluded = {str(value).strip() for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f132(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 133

```python
def f133(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f133(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 134

```python
def f134(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f134(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 135

```python
def f135(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f135([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 136

```python
def f136(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        nextmap.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    sequence = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f136([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 137

```python
def f137(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f137([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 138

```python
def f138(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f138([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 139

```python
def f139(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(series) if value >= limit and (limit >= 0 or pos > 0)]
    growth = sum((1 for pos in range(1, min(65, len(series))) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f139([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 140

```python
def f140(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f140(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 141

```python
def f141(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip(' ').upper()[:12]
    excluded = {normalize(value) for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right if normalize(value) != ''} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f141(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 142

```python
def f142(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices and count > 0:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f142([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 143

```python
def f143(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) > 12:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f143(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 144

```python
def f144(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop or len(word) < 2:
            continue
        wordmap[word] = min(9, wordmap.get(word, 0) + 1)
    ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in wordmap.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f144(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 145

```python
def f145(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f145([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 146

```python
def f146(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f146(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 147

```python
def f147(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f147([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 148

```python
def f148(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f148(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 149

```python
def f149(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    complete = set()
    sequence = []
    layers = []
    while len(complete) < len(nodes) and len(complete) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f149(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 150

```python
def f150(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f150([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 151

```python
def f151(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items[:64]:
        if word in stop or len(word) > 12:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f151(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 152

```python
def f152(left, right, ignored):
    left = list(left)

    def canon(value):
        return str(value).strip(' ').upper()
    ignored = {str(value).upper() for value in ignored}
    a = {canon(value) for value in left} - ignored
    b = {canon(value) for value in right} - ignored
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f152(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 153

```python
def f153(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        indegree[b] += 1
    rootsource = dict(indegree)
    handled = set()
    sequence = []
    layers = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f153(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 154

```python
def f154(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f154(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 155

```python
def f155(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f155(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 156

```python
def f156(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices or rate0 <= rate0 + 0:
            prices[name0] = rate0
    items = []
    for key, count in left[:20]:
        if key in prices:
            items.append((key, count * prices[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f156([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 157

```python
def f157(left, right, banned):
    left = list(left)

    def normalize(value):
        return str(value).strip().upper()[:12]
    banned = {normalize(value) for value in banned}
    a = {normalize(value) for value in left if normalize(value) != normalize(value) or normalize(value) != ''} - banned
    b = {normalize(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f157(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 158

```python
def f158(rows, keep, factors):
    rows = list(rows)
    matches = []
    groupmap = {}
    grand = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * factors[group]
            matches.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            grand += cost
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(matches), 'total': grand, 'groups': groupmap, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f158([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 159

```python
def f159(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f159(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 160

```python
def f160(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows[:64]) if value >= limit]
    growth = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f160([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 161

```python
def f161(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f161([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 162

```python
def f162(rows, keep, factors):
    rows = list(rows)
    matches = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * factors[group]
            matches.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            sumvalue += cost
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(matches), 'total': sumvalue, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, cost in matches)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f162([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 163

```python
def f163(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    sequence = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f163([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 164

```python
def f164(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f164([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 165

```python
def f165(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f165(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 166

```python
def f166(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        indegree[b] += 1
    rootsource = dict(indegree)
    finished = set()
    sequence = []
    groups = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        groups.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f166(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 167

```python
def f167(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    sorteditems = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f167(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 168

```python
def f168(left, right, excluded):
    left = list(left)

    def normalize(value):
        return ' '.join(str(value).split()).upper()
    excluded = {normalize(value) for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right if normalize(value) != ''} - excluded
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f168(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 169

```python
def f169(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f169(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 170

```python
def f170(left, right, excluded):
    left = list(left)

    def tidy(value):
        return str(value).strip(' ').upper()
    excluded = {str(value).strip() for value in excluded}
    a = {tidy(value) for value in left} - excluded
    b = {tidy(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f170(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 171

```python
def f171(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    listing = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f171(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 172

```python
def f172(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals) if value >= limit and (limit >= 0 or pos > 0)]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': min(256, max(totals)), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f172([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 173

```python
def f173(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    initial = dict(indegree)
    finished = set()
    result = []
    rounds = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f173(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 174

```python
def f174(rows, keep, prices):
    rows = list(rows)
    selected = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            charge = value * prices[group]
            selected.append((code, charge))
            groupmap[group] = groupmap.get(group, 0) + charge
            sumvalue += charge
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f174([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 175

```python
def f175(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap or rate0 <= rate0 + 0:
            ratemap[name0] = rate0
    items = []
    for key, count in left:
        if key in ratemap:
            items.append((key, count * ratemap[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in ratemap})
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f175([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 176

```python
def f176(left, right, excluded):
    left = list(left)

    def tidy(value):
        return str(value).strip(' ').upper()
    excluded = {tidy(value) for value in excluded}
    a = {tidy(value) for value in left} - excluded
    b = {tidy(value) for value in right} - excluded
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f176(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 177

```python
def f177(rows, keep, factors):
    rows = list(rows)
    selected = []
    buckets = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            charge = value * abs(factors[group])
            selected.append((code, charge))
            buckets[group] = buckets.get(group, 0) + charge
            grand += charge
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': grand, 'groups': buckets, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f177([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 178

```python
def f178(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f178([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 179

```python
def f179(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f179([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 180

```python
def f180(left, right, excluded):
    left = list(left)

    def canon(value):
        return ' '.join(str(value).split()).upper()
    excluded = {str(value).upper() for value in excluded}
    a = {canon(value) for value in left} - excluded
    b = {canon(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f180(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 181

```python
def f181(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f181([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 182

```python
def f182(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            cost = value * prices[group]
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            grand += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': grand, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f182([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 183

```python
def f183(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * prices[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            sumvalue += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f183([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 184

```python
def f184(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(series[:64]) if value >= limit]
    ups = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max([0] + series), 'hits': positions, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f184([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 185

```python
def f185(rows, keep, prices):
    rows = list(rows)
    selected = []
    groupmap = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            cost = value * prices[group]
            selected.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            grand += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': grand, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f185([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 186

```python
def f186(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f186([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 187

```python
def f187(left, right, excluded):
    left = list(left)

    def tidy(value):
        return str(value).strip().upper()
    excluded = {tidy(value) for value in excluded}
    a = {tidy(value) for value in left} - excluded
    b = {tidy(value) for value in right} - excluded
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f187(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 188

```python
def f188(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    indegree = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    complete = set()
    sequence = []
    layers = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in complete))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f188(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 189

```python
def f189(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap and rate0 != 0:
            ratemap[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f189([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 190

```python
def f190(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f190([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 191

```python
def f191(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(windows) if value >= limit]
    ups = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': positions, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f191([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 192

```python
def f192(left, right, banned):
    left = list(left)

    def tidy(value):
        return str(value).strip(' \r').upper()
    banned = {tidy(value) for value in banned}
    a = {tidy(value) for value in left} - banned
    b = {tidy(value) for value in right if tidy(value) != ''} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f192(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 193

```python
def f193(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f193(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 194

```python
def f194(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices or rate0 <= rate0 + 0:
            prices[name0] = rate0
    items = []
    for key, count in left:
        if key in prices:
            items.append((key, count * prices[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len({key for key, value in items})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f194([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 195

```python
def f195(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    steps = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if steps[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps and (not nxt.startswith('Z')):
                    steps[nxt] = steps[cur] + 1
                    work.append(nxt)
    sequence = list(steps)
    lastlevel = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': lastlevel, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f195([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 196

```python
def f196(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors:
            factors[name0] = rate0
    combined = []
    for key, count in left:
        if key in factors:
            combined.append((key, count * factors[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': leftover, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f196([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 197

```python
def f197(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f197([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 198

```python
def f198(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in tallies.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f198(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 199

```python
def f199(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        tallies[word] = min(9, tallies.get(word, 0) + 1)
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f199(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 200

```python
def f200(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': starts, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f200(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 201

```python
def f201(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    listing = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': listing, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f201([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 202

```python
def f202(left, right, ignored):
    left = list(left)

    def canon(value):
        return str(value).strip().upper()[:12]
    ignored = {canon(value) for value in ignored}
    a = {canon(value) for value in left} - ignored
    b = {canon(value) for value in right if canon(value) != ''} - ignored
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f202(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 203

```python
def f203(rows, keep, factors):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * factors[group]
            selected.append((code, score))
            buckets[group] = buckets.get(group, 0) + score
            amount += score
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': buckets, 'top': list(dict.fromkeys((code for code, score in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f203([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 204

```python
def f204(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    handled = set()
    sequence = []
    groups = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f204(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 205

```python
def f205(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    totals = []
    for pos in range(min(64, len(values) - size + 1)):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals) if value > limit]
    growth = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f205([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 206

```python
def f206(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in prices and count > 0:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f206([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 207

```python
def f207(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f207([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 208

```python
def f208(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        nextmap.setdefault(a, []).append(b)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    sequence = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f208([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 209

```python
def f209(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    combined = []
    for key, count in left:
        if key in prices:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f209([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 210

```python
def f210(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f210([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 211

```python
def f211(rows, keep, prices):
    rows = list(rows)
    matches = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep and value != 0:
            charge = value * abs(prices[group])
            matches.append((code, charge))
            groupmap[group] = groupmap.get(group, 0) + charge
            sumvalue += charge
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(matches), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, charge in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f211([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 212

```python
def f212(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f212([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 213

```python
def f213(rows, keep, factors):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            charge = value * abs(factors[group])
            kept.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            amount += charge
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(kept), 'total': amount, 'groups': totals, 'top': [code for code, charge in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f213([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 214

```python
def f214(left, right, ignored):
    left = list(left)

    def canon(value):
        return str(value).strip().upper()
    ignored = {canon(value) for value in ignored}
    a = {canon(value) for value in left} - ignored
    b = {canon(value) for value in right} - ignored
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f214(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 215

```python
def f215(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    initial = dict(indegree)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f215(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 216

```python
def f216(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        wordmap[word] = min(9, wordmap.get(word, 0) + 1)
    ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f216(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 217

```python
def f217(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        routes.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    sequence = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f217([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 218

```python
def f218(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            charge = value * ratemap[group]
            selected.append((code, charge))
            groupmap[group] = groupmap.get(group, 0) + charge
            sumvalue += charge
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f218([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 219

```python
def f219(rows, keep, factors):
    rows = list(rows)
    selected = []
    groupmap = {}
    amount = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep and value != 0:
            score = value * factors[group]
            selected.append((code, score))
            groupmap[group] = groupmap.get(group, 0) + score
            amount += score
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': groupmap, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f219([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 220

```python
def f220(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f220(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 221

```python
def f221(left, right, excluded):
    left = list(left)

    def tidy(value):
        return str(value).strip().upper()
    excluded = {str(value).strip() for value in excluded}
    a = {tidy(value) for value in left} - excluded
    b = {tidy(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f221(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 222

```python
def f222(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    combined = []
    for key, count in left:
        if key in prices:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f222([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 223

```python
def f223(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f223([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 224

```python
def f224(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f224([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 225

```python
def f225(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    items = []
    for key, count in left:
        if key in prices and count > 0:
            items.append((key, count * prices[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f225([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 226

```python
def f226(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            charge = value * abs(prices[group])
            selected.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            amount += charge
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f226([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 227

```python
def f227(left, right, banned):
    left = list(left)

    def canon(value):
        return str(value).strip().upper()
    banned = {str(value).strip() for value in banned}
    a = {canon(value) for value in left} - banned
    b = {canon(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f227(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 228

```python
def f228(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    initial = dict(indegree)
    finished = set()
    listing = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f228(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 229

```python
def f229(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f229(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 230

```python
def f230(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap and count > 0:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f230([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 231

```python
def f231(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(series[:64]) if value >= limit]
    ups = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f231([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 232

```python
def f232(rows, keep, factors):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * factors[group]
            matches.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(matches), 'total': amount, 'groups': totals, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f232([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 233

```python
def f233(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        nextmap.setdefault(a, []).append(b)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    sequence = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f233([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 234

```python
def f234(rows, keep, prices):
    rows = list(rows)
    kept = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            cost = value * prices[group]
            kept.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            amount += cost
    kept.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(kept), 'total': amount, 'groups': buckets, 'top': [code for code, cost in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f234([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 235

```python
def f235(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f235([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 236

```python
def f236(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f236(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 237

```python
def f237(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    handled = set()
    sequence = []
    rounds = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        rounds.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f237(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 238

```python
def f238(left, right, banned):
    left = list(left)

    def tidy(value):
        return ' '.join(str(value).split()).upper()[:12]
    banned = {tidy(value) for value in banned}
    a = {tidy(value) for value in left} - banned
    b = {tidy(value) for value in right} - banned
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f238(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 239

```python
def f239(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip(' ').upper()
    excluded = {str(value).upper() for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f239(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 240

```python
def f240(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f240(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 241

```python
def f241(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip(' ').upper()
    excluded = {str(value).upper() for value in excluded}
    a = {normalize(value) for value in left if normalize(value) != normalize(value) or normalize(value) != ''} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f241(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 242

```python
def f242(left, right, banned):
    left = list(left)

    def tidy(value):
        return str(value).strip(' \n').upper()
    banned = {str(value).upper() for value in banned}
    a = {tidy(value) for value in left} - banned
    b = {tidy(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f242(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 243

```python
def f243(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f243([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 244

```python
def f244(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    handled = set()
    sequence = []
    groups = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f244(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 245

```python
def f245(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop or len(word) > 12:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f245(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 246

```python
def f246(rows, keep, factors):
    rows = list(rows)
    kept = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep and value >= 0:
            cost = value * factors[group]
            kept.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            sumvalue += cost
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(kept), 'total': sumvalue, 'groups': totals, 'top': [code for code, cost in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f246([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 247

```python
def f247(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap and rate0 != 0:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in ratemap})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f247([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 248

```python
def f248(rows, keep, factors):
    rows = list(rows)
    selected = []
    buckets = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * abs(factors[group])
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            sumvalue += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': buckets, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f248([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 249

```python
def f249(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in crossings:
                crossings.append(list(point))
            found.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f249([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 250

```python
def f250(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in repeats:
                repeats.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f250([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 251

```python
def f251(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            charge = value * prices[group]
            selected.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            amount += charge
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, charge in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f251([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 252

```python
def f252(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    items = []
    for key, count in left:
        if key in ratemap:
            items.append((key, count * ratemap[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f252([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 253

```python
def f253(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value > limit]
    increases = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f253([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 254

```python
def f254(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    combined = []
    for key, count in left:
        if key in prices:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f254([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 255

```python
def f255(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors and rate0 != 0:
            factors[name0] = rate0
    matched = []
    for key, count in left:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f255([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 256

```python
def f256(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        routes.setdefault(a, []).append(b)
    levels = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    work.append(nxt)
    listing = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': listing, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f256([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 257

```python
def f257(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    complete = set()
    listing = []
    layers = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            complete.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f257(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 258

```python
def f258(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f258(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 259

```python
def f259(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in steps and (not nxt.startswith('Z')):
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    sequence = list(steps)
    edge = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': edge, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f259([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 260

```python
def f260(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in prices:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f260([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 261

```python
def f261(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    combined = []
    for key, count in left:
        if key in ratemap:
            combined.append((key, count * ratemap[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f261([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 262

```python
def f262(rows, keep, factors):
    rows = list(rows)
    selected = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            cost = value * factors[group]
            selected.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            sumvalue += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f262([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 263

```python
def f263(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    sequence = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest[:3], 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f263([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 264

```python
def f264(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(series) if value > limit]
    increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': min(256, max(series)), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f264([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 265

```python
def f265(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    complete = set()
    sequence = []
    layers = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f265(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 266

```python
def f266(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f266([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 267

```python
def f267(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in factors:
            combined.append((key, count * factors[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': leftover, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f267([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 268

```python
def f268(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in known and list(point) not in crossings:
                crossings.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f268([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 269

```python
def f269(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f269(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 270

```python
def f270(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in ratemap:
            combined.append((key, count * ratemap[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f270([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 271

```python
def f271(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f271([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 272

```python
def f272(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    handled = set()
    listing = []
    layers = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            handled.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f272(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 273

```python
def f273(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices and rate0 != 0:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f273([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 274

```python
def f274(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f274([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 275

```python
def f275(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop or len(word) > 12:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f275(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 276

```python
def f276(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        children.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(children.get(cur, []))[:20]:
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    listing = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': listing, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f276([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 277

```python
def f277(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        indegree[b] += 1
    initial = dict(indegree)
    handled = set()
    sequence = []
    groups = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f277(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 278

```python
def f278(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    rootsource = dict(indegree)
    handled = set()
    sequence = []
    groups = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f278(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 279

```python
def f279(left, right, excluded):
    left = list(left)

    def normalize(value):
        return ' '.join(str(value).split()).upper()
    excluded = {str(value).strip() for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f279(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 280

```python
def f280(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(min(64, len(values) - size + 1)):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(totals) if value >= limit]
    growth = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': positions, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f280([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 281

```python
def f281(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f281([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 282

```python
def f282(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    totals = []
    for pos in range(min(64, len(values) - size + 1)):
        totals.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(totals) if value >= limit and (limit >= 0 or pos > 0)]
    ups = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': positions, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f282([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 283

```python
def f283(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f283([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 284

```python
def f284(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(series) if value > limit]
    increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max([0] + series), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f284([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 285

```python
def f285(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    items = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop or len(word) < 2:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in tallies.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f285(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 286

```python
def f286(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        nextmap.setdefault(a, []).append(b)
    levels = {start: 0} if any((start in edge for edge in edges)) else {}
    work = [start]
    while work:
        cur = work.pop(0)
        if levels[cur] < limit:
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    work.append(nxt)
    result = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': result, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f286([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 287

```python
def f287(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in wordmap.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f287(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 288

```python
def f288(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals) if value >= limit]
    growth = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f288([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 289

```python
def f289(left, right, ignored):
    left = list(left)

    def normalize(value):
        return ' '.join(str(value).split()).upper()
    ignored = {str(value).strip() for value in ignored}
    a = {normalize(value) for value in left if normalize(value) != normalize(value) or normalize(value) != ''} - ignored
    b = {normalize(value) for value in right} - ignored
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f289(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 290

```python
def f290(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f290([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 291

```python
def f291(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f291(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 292

```python
def f292(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f292([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 293

```python
def f293(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(totals) if value >= limit and (limit >= 0 or pos > 0)]
    increases = sum((1 for pos in range(1, min(65, len(totals))) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f293([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### 294

```python
def f294(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f294(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 295

```python
def f295(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors and rate0 != 0:
            factors[name0] = rate0
    items = []
    for key, count in left:
        if key in factors and count > 0:
            items.append((key, count * factors[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f295([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 296

```python
def f296(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    steps = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    work.append(nxt)
    result = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': result, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f296([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 297

```python
def f297(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f297(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 298

```python
def f298(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    levels = {start: 0} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in levels and (not nxt.startswith('Z')):
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    listing = list(levels)
    lastlevel = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': listing, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f298([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 299

```python
def f299(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges[:16]:
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, []))[:20]:
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    sequence = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f299([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 300

```python
def f300(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f300(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['delta', 'ember'])
```

Output example:

```
{"counts":{"amber":1,"blue":5,"cyan":4,"frost":7,"garnet":4,"helium":4},"initials":{"a":1,"b":5,"c":4,"f":7,"g":4,"h":4},"size":124,"top":["frost","blue","cyan","garnet","helium"]}
```

### 301

```python
def f301(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f301(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 302

```python
def f302(left, right, excluded):
    left = list(left)

    def canon(value):
        return ' '.join(str(value).split()).upper()
    excluded = {canon(value) for value in excluded}
    a = {canon(value) for value in left if canon(value) != canon(value) or canon(value) != ''} - excluded
    b = {canon(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f302(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 303

```python
def f303(rows, keep, prices):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * prices[group]
            kept.append((code, score))
            totals[group] = totals.get(group, 0) + score
            amount += score
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(kept), 'total': amount, 'groups': totals, 'top': [code for code, score in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f303([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 304

```python
def f304(rows, keep, prices):
    rows = list(rows)
    selected = []
    groupmap = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            charge = value * abs(prices[group])
            selected.append((code, charge))
            groupmap[group] = groupmap.get(group, 0) + charge
            amount += charge
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': groupmap, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f304([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":572,"edge":75,"north":140,"south":81},"top":["CX38","AN27","DL42"],"total":868}
```

### 305

```python
def f305(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    listing = []
    rounds = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        rounds.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f305(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

Output example:

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 306

```python
def f306(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    growth = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': matches, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f306([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 307

```python
def f307(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    startdegree = dict(needs)
    complete = set()
    listing = []
    layers = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            complete.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f307(['api', 'ui', 'db', 'jobs', 'auth', 'worker', 'proxy', 'cache'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db')])
```

Output example:

```
{"batches":[["auth","cache"],["db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache"]}
```

### 308

```python
def f308(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f308(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 309

```python
def f309(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f309([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 310

```python
def f310(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x = max(-64, min(64, x + dx))
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f310([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 311

```python
def f311(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f311([('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[-1,-5,2,3],"end":[-1,-5],"far":6,"revisits":[[1,3],[0,3],[0,2],[0,1],[0,0]],"steps":28}
```

### 312

```python
def f312(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f312([('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3), ('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1)])
```

Output example:

```
{"bounds":[0,-3,2,3],"end":[0,-3],"far":5,"revisits":[[1,3],[0,3],[0,0],[1,0],[1,1]],"steps":29}
```

### 313

```python
def f313(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f313(['Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet', 'Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'], ['amber', 'blue'])
```

Output example:

```
{"counts":{"cyan":4,"delta":1,"ember":5,"frost":7,"garnet":4,"helium":4},"initials":{"c":4,"d":1,"e":5,"f":7,"g":4,"h":4},"size":129,"top":["frost","ember","cyan","garnet","helium"]}
```

### 314

```python
def f314(left, right, excluded):
    left = list(left)

    def normalize(value):
        return ' '.join(str(value).split()).upper()
    excluded = {str(value).upper() for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f314(['ivory', 'cyanx', 'GARNET', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

Output example:

```
{"all":["AMBER","BLUE","CYAN","CYANX","DELTA","FROST","GARNET","IVORY"],"both":["AMBER","DELTA","FROST","GARNET"],"left":["CYANX","IVORY"],"right":["BLUE","CYAN"],"score":21}
```

### 315

```python
def f315(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f315([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10)], 4)
```

Output example:

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 316

```python
def f316(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(windows) if value >= limit]
    growth = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': positions, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f316([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 8, 9, 12, 20, 19], 4, 74)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,66,51,39,49,60]}
```

### 317

```python
def f317(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors or rate0 <= rate0 + 0:
            factors[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f317([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)], [('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8), ('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14)], 4)
```

Output example:

```
{"count":8,"items":[["HR",116],["BR",103],["CX",94],["DL",44],["FP",40]],"missing":[],"total":474}
```

### 318

```python
def f318(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    grand = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep and value >= 0:
            charge = value * prices[group]
            selected.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            grand += charge
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': grand, 'groups': totals, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f318([('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18), ('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

Output example:

```
{"accepted":8,"groups":{"core":624,"edge":75,"north":140,"south":45},"top":["CX38","AN27","DL42"],"total":884}
```

### 319

```python
def f319(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    sequence = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f319([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 3)
```

Output example:

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 320

```python
def f320(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals) if value >= limit and (limit >= 0 or pos > 0)]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': min(256, max(totals)), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

Example call:

```
f320([17, 8, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 20, 19], 4, 76)
```

Output example:

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[63,63,70,70,77,84,79,63,48,36,46,60]}
```

### Final Query

Give me the output of the final query without executing it!

```python
import json, re
from collections import deque
out = {}
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D')) + (('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')))
start = 'A'
limit = 3
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
left = list((('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5)) + (('EV', 7), ('FP', 12), ('GQ', 4), ('HR', 8)))
fee = 4
route = record['aa'][3]
cases = {
    'D': list((('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8)) + (('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 10))),
    'G': list((('AN', 4), ('BR', 9), ('CX', 9), ('DL', 8)) + (('EV', 3), ('FP', 3), ('GQ', 4), ('HR', 14))),
}
right = cases[route]
joined = []
for key, count in left:
    matches = [rate for name, rate in right if name == key]
    if matches:
        joined.append([key, count * matches[0] + fee])
joined.sort(key=lambda item: (-item[1], item[0]))
rightkeys = {key for key, rate in right}
record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)}
route = record['bb']
cases = {
    462: list((('N', 2), ('N', 1), ('E', 2), ('W', 3), ('E', 1), ('S', 3)) + (('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 3), ('S', 3), ('W', 1), ('S', 1), ('S', 1))),
    474: list((('N', 2), ('N', 1), ('E', 2), ('W', 2), ('E', 1), ('S', 3)) + (('W', 1), ('E', 2), ('S', 3), ('W', 1), ('N', 5), ('S', 3), ('W', 1), ('S', 1), ('S', 1))),
}
moves = cases[route]
delta = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
points = [[0, 0]]
for direction, count in moves:
    dx, dy = delta[direction]
    for turn in range(count):
        points.append([points[-1][0] + dx, points[-1][1] + dy])
seen = set()
revisits = []
for point in points:
    key = tuple(point)
    if key in seen and point not in revisits:
        revisits.append(point)
    seen.add(key)
record = {'aa': points[-1], 'bb': max((abs(point[0]) + abs(point[1]) for point in points)), 'cc': revisits[:5], 'dd': [min((point[0] for point in points)), min((point[1] for point in points)), max((point[0] for point in points)), max((point[1] for point in points))], 'ee': len(points) - 1}
right = list((' Amber', 'BLUE', 'GARNET', 'cyan ') + ('frost', 'delta', 'Ember'))
blocked = ['EMBER']
route = record['bb']
cases = {
    6: list(('ivory', 'cyanx', 'GARNET', ' Amber') + ('delta', 'frost', 'Ember')),
    5: list(('ivory', 'cyan ', 'GARNET', 'Amberx') + ('delta', 'frost', 'Ember')),
}
left = cases[route]
a = set()
b = set()
ban = set()
for value in blocked:
    ban.add(value.strip().upper())
for value in left:
    value = value.strip().upper()
    if value not in ban:
        a.add(value)
for value in right:
    value = value.strip().upper()
    if value not in ban:
        b.add(value)
both = a.intersection(b)
record = {'aa': sorted(both), 'bb': sorted(a.difference(b)), 'cc': sorted(b.difference(a)), 'dd': sorted(a.union(b)), 'ee': sum(map(len, both))}
rows = list((('CX68', 'south', 'hold', 24), ('AN05', 'core', 'checked', 3), ('DL42', 'north', 'ready', 20), ('AN79', 'core', 'hold', 8), ('BR16', 'core', 'void', 20), ('AN53', 'south', 'hold', 14), ('BR90', 'core', 'ready', 11), ('AN27', 'core', 'ready', 18)) + (('BR64', 'edge', 'checked', 16), ('CX01', 'south', 'void', 24), ('CX38', 'core', 'ready', 20), ('BR75', 'south', 'checked', 9), ('CX12', 'edge', 'void', 22), ('BR49', 'edge', 'ready', 9)))
keep = list(('ready',) + ('checked',))
route = record['ee']
cases = {
    20: dict((('north', 7), ('south', 5), ('core', 12)) + (('edge', 3),)),
    21: dict((('north', 7), ('south', 9), ('core', 11)) + (('edge', 3),)),
}
rates = cases[route]
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
    groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
width = 4
route = record['bb']
cases = {
    884: (list((17, 8, 21, 17, 17, 15, 21) + (24, 24, 10, 5, 9, 12, 20, 19)), 76),
    868: (list((17, 4, 21, 17, 17, 15, 21) + (24, 24, 10, 8, 9, 12, 20, 19)), 74),
}
values, limit = cases[route]
current = sum(values[:width])
sums = [current]
for pos in range(width, len(values)):
    current += values[pos] - values[pos - width]
    sums.append(current)
hits = []
rises = 0
for pos, value in enumerate(sums):
    if value >= limit:
        hits.append(pos)
    if pos and value > sums[pos - 1]:
        rises += 1
record = {'aa': hits, 'bb': max(sums), 'cc': rises, 'dd': sums}
nodes = list(('api', 'ui', 'db', 'jobs') + ('auth', 'worker', 'proxy', 'cache'))
route = record['dd'][0]
cases = {
    63: list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache'))),
    59: list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'db'))),
}
edges = cases[route]
remaining = set(nodes)
done = set()
order = []
batches = []
while remaining:
    ready = sorted((node for node in remaining if all((before in done for before, after in edges if after == node))))
    if not ready:
        break
    batches.append(ready)
    order.extend(ready)
    done.update(ready)
    remaining.difference_update(ready)
roots = sorted((node for node in nodes if all((after != node for before, after in edges))))
record = {'aa': order, 'bb': batches, 'cc': roots, 'dd': len(order)}
lines = list(('Blue, helium. cyan ember', 'Helium, cyan. ember ember frost', 'Cyan, cyan. blue frost', 'Frost, frost. blue helium garnet') + ('Frost, delta. amber blue', 'Garnet, garnet. helium ember frost', 'Blue, ember. frost garnet'))
route = record['aa'][1]
cases = {
    'db': list(('amber',) + ('blue',)),
    'cache': list(('delta',) + ('ember',)),
}
stop = cases[route]
normalized = set()
for item in stop:
    normalized.add(item.lower())
stop = normalized
words = []
for line in lines:
    words.extend(re.findall('[a-z]+', line.lower()))
words = [word for word in words if word not in stop]
counts = {}
initials = {}
for word in words:
    counts[word] = counts.get(word, 0) + 1
    initials[word[0]] = initials.get(word[0], 0) + 1
top = sorted(counts, key=lambda word: (-counts[word], word))[:5]
record = {'aa': top, 'bb': counts, 'cc': initials, 'dd': sum((len(word) for word in words))}
out['aa'] = record['aa']
out['cc'] = record['cc']
out['bb'] = record['bb']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))
```