added 2019/09

kajott · kajott · commit 89d93500a275 · 2019-12-09T17:42:05.000+01:00
diff --git a/2019/09/README.md b/2019/09/README.md
@@ -0,0 +1,64 @@
+# 2019, Day 9: Sensor Boost
+
+You've just said goodbye to the rebooted rover and left Mars when you receive a faint distress signal coming from the asteroid belt. It must be the Ceres monitoring station!
+
+In order to lock on to the signal, you'll need to boost your sensors. The Elves send up the latest _BOOST_ program - Basic Operation Of System Test.
+
+While BOOST (your puzzle input) is capable of boosting your sensors, for tenuous safety reasons, it refuses to do so until the computer it runs on passes some checks to demonstrate it is a _complete Intcode computer_.
+
+## Part 1
+
+[Your existing Intcode computer](../05) is missing one key feature: it needs support for parameters in _relative mode_.
+
+Parameters in mode `2`, _relative mode_, behave very similarly to parameters in _position mode_: the parameter is interpreted as a position. Like position mode, parameters in relative mode can be read from or written to.
+
+The important difference is that relative mode parameters don't count from address `0`. Instead, they count from a value called the _relative base_. The _relative base_ starts at `0`.
+
+The address a relative mode parameter refers to is itself _plus_ the current _relative base_. When the relative base is `0`, relative mode parameters and position mode parameters with the same value refer to the same address.
+
+For example, given a relative base of `50`, a relative mode parameter of `-7` refers to memory address `50 + -7 =` _`43`_.
+
+The relative base is modified with the _relative base offset_ instruction:
+
+*   Opcode `9` _adjusts the relative base_ by the value of its only parameter. The relative base increases (or decreases, if the value is negative) by the value of the parameter.
+
+For example, if the relative base is `2000`, then after the instruction `109,19`, the relative base would be `2019`. If the next instruction were `204,-34`, then the value at address `1985` would be output.
+
+Your Intcode computer will also need a few other capabilities:
+
+*   The computer's available memory should be much larger than the initial program. Memory beyond the initial program starts with the value `0` and can be read or written like any other memory. (It is invalid to try to access memory at a negative address, though.)
+*   The computer should have support for large numbers. Some instructions near the beginning of the BOOST program will verify this capability.
+
+Here are some example programs that use these features:
+
+*   `109,1,204,-1,1001,100,1,100,1008,100,16,101,1006,101,0,99` takes no input and produces a [copy of itself](https://en.wikipedia.org/wiki/Quine_(computing)) as output.
+*   `1102,34915192,34915192,7,4,7,99,0` should output a 16-digit number.
+*   `104,1125899906842624,99` should output the large number in the middle.
+
+The BOOST program will ask for a single input; run it in test mode by providing it the value `1`. It will perform a series of checks on each opcode, output any opcodes (and the associated parameter modes) that seem to be functioning incorrectly, and finally output a BOOST keycode.
+
+Once your Intcode computer is fully functional, the BOOST program should report no malfunctioning opcodes when run in test mode; it should only output a single value, the BOOST keycode. _What BOOST keycode does it produce?_
+
+Your puzzle answer was `3765554916`.
+
+## Part 2
+
+_You now have a complete Intcode computer._
+
+Finally, you can lock on to the Ceres distress signal! You just need to boost your sensors using the BOOST program.
+
+The program runs in sensor boost mode by providing the input instruction the value `2`. Once run, it will boost the sensors automatically, but it might take a few seconds to complete the operation on slower hardware. In sensor boost mode, the program will output a single value: _the coordinates of the distress signal_.
+
+Run the BOOST program in sensor boost mode. _What are the coordinates of the distress signal?_
+
+Your puzzle answer was `76642`.
+
+
+## Solution Notes
+
+With this, the Intcode machine gets a proper stack, and the program of part 2 makes already good use of it.
+
+The golf implementations are almost identical, only the input parameter changes.
+
+* Part 1, Python: 440 bytes, <100 ms
+* Part 2, Python: 440 bytes, ~2.5 s
diff --git a/2019/09/aoc2019_09_part1.py b/2019/09/aoc2019_09_part1.py
@@ -0,0 +1,13 @@
+from collections import*
+_=int
+M=defaultdict(_,enumerate(map(_,open("input.txt").read().split(','))));p=s=0
+while M[p]!=99:
+ o=M[p];l=map(_,str(o)[-3::-1]+"000");o%=100;n=_("0331122331"[o]);i,j,k=[M[p+x]+s*(m>1)for x,m in zip((1,2,3),l)];a,b=[(M[x]if m-1else x)for x,m in zip((i,j),l)];p+=n+1
+ if o<2:M[k]=a+b
+ elif o<3:M[k]=a*b
+ elif o<4:M[i]=1
+ elif o<5:print a
+ elif o>8:s+=a
+ elif o>7:M[k]=a==b
+ elif o>6:M[k]=a<b
+ elif(o>5)^(a!=0):p=b
diff --git a/2019/09/aoc2019_09_part2.py b/2019/09/aoc2019_09_part2.py
@@ -0,0 +1,13 @@
+from collections import*
+_=int
+M=defaultdict(_,enumerate(map(_,open("input.txt").read().split(','))));p=s=0
+while M[p]!=99:
+ o=M[p];l=map(_,str(o)[-3::-1]+"000");o%=100;n=_("0331122331"[o]);i,j,k=[M[p+x]+s*(m>1)for x,m in zip((1,2,3),l)];a,b=[(M[x]if m-1else x)for x,m in zip((i,j),l)];p+=n+1
+ if o<2:M[k]=a+b
+ elif o<3:M[k]=a*b
+ elif o<4:M[i]=2
+ elif o<5:print a
+ elif o>8:s+=a
+ elif o>7:M[k]=a==b
+ elif o>6:M[k]=a<b
+ elif(o>5)^(a!=0):p=b
diff --git a/2019/09/input.txt b/2019/09/input.txt
@@ -0,0 +1 @@
+1102,34463338,34463338,63,1007,63,34463338,63,1005,63,53,1102,3,1,1000,109,988,209,12,9,1000,209,6,209,3,203,0,1008,1000,1,63,1005,63,65,1008,1000,2,63,1005,63,904,1008,1000,0,63,1005,63,58,4,25,104,0,99,4,0,104,0,99,4,17,104,0,99,0,0,1102,1,30,1010,1102,1,38,1008,1102,1,0,1020,1102,22,1,1007,1102,26,1,1015,1102,31,1,1013,1102,1,27,1014,1101,0,23,1012,1101,0,37,1006,1102,735,1,1028,1102,1,24,1009,1102,1,28,1019,1102,20,1,1017,1101,34,0,1001,1101,259,0,1026,1101,0,33,1018,1102,1,901,1024,1101,21,0,1016,1101,36,0,1011,1102,730,1,1029,1101,1,0,1021,1102,1,509,1022,1102,39,1,1005,1101,35,0,1000,1102,1,506,1023,1101,0,892,1025,1101,256,0,1027,1101,25,0,1002,1102,1,29,1004,1102,32,1,1003,109,9,1202,-3,1,63,1008,63,39,63,1005,63,205,1001,64,1,64,1106,0,207,4,187,1002,64,2,64,109,-2,1208,-4,35,63,1005,63,227,1001,64,1,64,1105,1,229,4,213,1002,64,2,64,109,5,1206,8,243,4,235,1106,0,247,1001,64,1,64,1002,64,2,64,109,14,2106,0,1,1105,1,265,4,253,1001,64,1,64,1002,64,2,64,109,-25,1201,4,0,63,1008,63,40,63,1005,63,285,1106,0,291,4,271,1001,64,1,64,1002,64,2,64,109,14,2107,37,-7,63,1005,63,313,4,297,1001,64,1,64,1106,0,313,1002,64,2,64,109,-7,21101,40,0,5,1008,1013,37,63,1005,63,333,1105,1,339,4,319,1001,64,1,64,1002,64,2,64,109,-7,1207,0,33,63,1005,63,355,1106,0,361,4,345,1001,64,1,64,1002,64,2,64,109,7,21102,41,1,9,1008,1017,41,63,1005,63,387,4,367,1001,64,1,64,1106,0,387,1002,64,2,64,109,-1,21102,42,1,10,1008,1017,43,63,1005,63,411,1001,64,1,64,1106,0,413,4,393,1002,64,2,64,109,-5,21101,43,0,8,1008,1010,43,63,1005,63,435,4,419,1106,0,439,1001,64,1,64,1002,64,2,64,109,16,1206,3,455,1001,64,1,64,1106,0,457,4,445,1002,64,2,64,109,-8,21107,44,45,7,1005,1017,479,4,463,1001,64,1,64,1106,0,479,1002,64,2,64,109,6,1205,5,497,4,485,1001,64,1,64,1106,0,497,1002,64,2,64,109,1,2105,1,6,1105,1,515,4,503,1001,64,1,64,1002,64,2,64,109,-10,2108,36,-1,63,1005,63,535,1001,64,1,64,1105,1,537,4,521,1002,64,2,64,109,-12,2101,0,6,63,1008,63,32,63,1005,63,561,1001,64,1,64,1105,1,563,4,543,1002,64,2,64,109,25,21108,45,46,-2,1005,1018,583,1001,64,1,64,1105,1,585,4,569,1002,64,2,64,109,-23,2108,34,4,63,1005,63,607,4,591,1001,64,1,64,1106,0,607,1002,64,2,64,109,3,1202,7,1,63,1008,63,22,63,1005,63,633,4,613,1001,64,1,64,1106,0,633,1002,64,2,64,109,12,21108,46,46,3,1005,1015,651,4,639,1106,0,655,1001,64,1,64,1002,64,2,64,109,-5,2102,1,-1,63,1008,63,35,63,1005,63,679,1001,64,1,64,1105,1,681,4,661,1002,64,2,64,109,13,21107,47,46,-7,1005,1013,701,1001,64,1,64,1105,1,703,4,687,1002,64,2,64,109,-2,1205,2,715,1106,0,721,4,709,1001,64,1,64,1002,64,2,64,109,17,2106,0,-7,4,727,1105,1,739,1001,64,1,64,1002,64,2,64,109,-23,2107,38,-6,63,1005,63,759,1001,64,1,64,1106,0,761,4,745,1002,64,2,64,109,-3,1207,-4,40,63,1005,63,779,4,767,1105,1,783,1001,64,1,64,1002,64,2,64,109,-8,2101,0,-1,63,1008,63,35,63,1005,63,809,4,789,1001,64,1,64,1105,1,809,1002,64,2,64,109,-6,2102,1,8,63,1008,63,32,63,1005,63,835,4,815,1001,64,1,64,1106,0,835,1002,64,2,64,109,6,1201,5,0,63,1008,63,37,63,1005,63,857,4,841,1106,0,861,1001,64,1,64,1002,64,2,64,109,2,1208,0,32,63,1005,63,883,4,867,1001,64,1,64,1106,0,883,1002,64,2,64,109,23,2105,1,-2,4,889,1001,64,1,64,1106,0,901,4,64,99,21102,27,1,1,21101,0,915,0,1106,0,922,21201,1,55337,1,204,1,99,109,3,1207,-2,3,63,1005,63,964,21201,-2,-1,1,21101,0,942,0,1105,1,922,21202,1,1,-1,21201,-2,-3,1,21102,957,1,0,1105,1,922,22201,1,-1,-2,1106,0,968,21201,-2,0,-2,109,-3,2105,1,0
diff --git a/2019/09/intcode.py b/2019/09/intcode.py
@@ -0,0 +1,273 @@
+#!/usr/bin/env python3
+"""
+Advent of Code 2019 'Intcode' interpreter with tracing.
+Feature Level: 9.0 (day.part)
+"""
+import sys
+import itertools, collections
+import argparse
+import fnmatch
+
+g_DefaultTracing = False
+g_Code = []
+
+def fmt_arg(x,m):
+    if m == 0:     return str(x)
+    if m == 1:     return "#" + str(x)
+    if m == 2:     return "(" + str(x) + ")"
+    else:          return "?" + str(x)
+OP_COLUMN_WIDTH = 20
+
+class Operation:
+    def __init__(self, name, params=0, mem_inputs=[], mem_outputs=[], func=None, force_tracing=False):
+        self.name = name
+        self.params = params
+        self.inputs = set(mem_inputs)
+        self.outputs = set(mem_outputs)
+        self.func = func
+        self.force_tracing = force_tracing
+
+class Machine:
+    ops = {
+    # code:           "name",#arg,inputs,outputs,func
+         1: Operation("add",   3, [1,2], [3],  lambda m,o,i: i[1] + i[2]),
+         2: Operation("mul",   3, [1,2], [3],  lambda m,o,i: i[1] * i[2]),
+         3: Operation("in",    1, [],    [1],  lambda m,o,i: m.inq.pop(0) if m.inq else m.rollback()),
+         4: Operation("out",   1, [1],   [],   lambda m,o,i: m.outq.append(i[1])),
+         5: Operation("jnz",   2, [1,2], [0],  lambda m,o,i: i[2] if i[1] else m.ip),
+         6: Operation("jz",    2, [1,2], [0],  lambda m,o,i: m.ip if i[1] else i[2]),
+         7: Operation("cmplt", 3, [1,2], [3],  lambda m,o,i: i[1] < i[2]),
+         8: Operation("cmpeq", 3, [1,2], [3],  lambda m,o,i: i[1] == i[2]),
+         9: Operation("arb",   1, [1],   [-1], lambda m,o,i: m.rb + i[1]),
+        99: Operation("halt",  func=lambda m,o,i: m.halt()),
+    }
+
+    def __init__(self, code=None, name="", inputs=[], overrides={}, tracing=None):
+        if code is None:
+            code = g_Code
+        if isinstance(code, dict):
+            self.M = code.copy()
+        else:
+            self.M = collections.defaultdict(int, dict(zip(itertools.count(), code)))
+        self.M.update(overrides)
+        self.prefix = ("<{}> ".format(name)) if name else ""
+        self.running = True
+        self.halted = False
+        self.tracing = g_DefaultTracing if (tracing is None) else tracing
+        self.ip = self.last_ip = self.rb = 0
+        self.inq = list(inputs)
+        self.outq = []
+
+    def rollback(self):
+        self.running = False
+        self.ip = self.last_ip
+
+    def halt(self):
+        self.running = False
+        self.halted = True
+
+    def send(self, *data):
+        if len(data) == 1 and not isinstance(data[0], int):
+            data = data[0]
+        self.inq.extend(data)
+
+    def step(self):
+        try:
+            opcode = self.M[self.ip]
+            op = self.ops[opcode % 100]
+        except KeyError:
+            op = Operation("#INV", func=lambda m,o,i: m.halt(), force_tracing=True)
+
+        p_mode = list(map(int, str(opcode)))[-2::-1] + [0] * (op.params + 2)
+        p_raw = [self.M[self.ip + i] for i in range(op.params + 1)]
+        p_addr = [((self.rb + r) if (m == 2) else r) for r, m in zip(p_raw, p_mode)]
+        p_val = [(a if (m == 1) else self.M[a]) for a, m in zip(p_addr, p_mode)]
+
+        if self.tracing or op.force_tracing:
+            line = "{}{:04d}: {:05d} > {:<5s} {}".format \
+                   (self.prefix, self.ip, opcode, op.name,
+                    ", ".join(fmt_arg(r, m) for r, m in zip(p_raw[1:], p_mode[1:])).ljust(OP_COLUMN_WIDTH))
+
+        self.last_ip = self.ip
+        self.ip += op.params + 1
+        orig_ip = self.ip
+        orig_rb = self.rb
+
+        res = op.func(self, op, [(v if (i in op.inputs) else r) for r, v, i in zip(p_raw, p_val, range(op.params + 1))])
+
+        if (res is not None) and self.running:
+            if isinstance(res, (int, bool)):
+                res = [res]
+            for i, v in zip(sorted(op.outputs), res):
+                v = int(v)
+                if i > 0:
+                    self.M[p_addr[i]] = v
+                elif i == 0:
+                    self.ip = v
+                else:  # i < 0: RB
+                    self.rb = v
+
+        if self.tracing or op.force_tracing:
+            for i in range(1, op.params + 1):
+                if ((i in op.inputs) and (p_mode[i] != 1)) or (i in op.outputs):
+                    line += " | {}: {}".format(p_addr[i], p_val[i])
+                if i in op.outputs:
+                    line += " -> {}".format(self.M[p_addr[i]])
+            if 0 in op.outputs:
+                if self.ip == orig_ip:
+                    line += " | ip: unchanged"
+                else:
+                    line += " | ip: {} -> {}".format(orig_ip, self.ip)
+            if -1 in op.outputs:
+                line += " | rb: {} -> {}".format(orig_rb, self.rb)
+            print(line.rstrip(), file=sys.stderr)
+
+    def run(self, *data):
+        """
+        send data into the output queue
+        and run until next output is sent and return it,
+        or None if a halt instruction occurred or the input buffer ran under
+        """
+        self.send(*data)
+        self.running = True
+        while self.running and not self.outq:
+            self.step()
+        if self.outq:
+            return self.outq.pop(0)
+
+    def run_all(self, *data):
+        """
+        send data into the output queue,
+        run until the 'halt' instruction,
+        and return all output values that occurred
+        """
+        self.send(*data)
+        self.running = True
+        while self.running:
+            self.step()
+        q = self.outq
+        self.outq = []
+        return q
+
+###############################################################################
+
+Puzzles = []
+def puzzle(fn):
+    Puzzles.append((fn.__name__.strip('_').replace('_', '.'), fn))
+    return fn
+
+def run_for_single_output(*inputs):
+    m = Machine(inputs=inputs)
+    r = m.run()
+    assert m.run() is None
+    print(r)
+
+def run_for_multiple_outputs(*inputs):
+    m = Machine(inputs=inputs)
+    r = m.run_all()
+    assert m.halted
+    return r
+
+@puzzle
+def _2_1():
+    m = Machine(overrides={1:12, 2:2})
+    assert m.run() is None
+    print(m.M[0])
+
+@puzzle
+def _2_2():
+    for nv in range(10000):
+        m = Machine(overrides={1:nv//100, 2:nv%100})
+        assert m.run() is None
+        if m.M[0] == 19690720:
+            print(nv)
+            break
+
+@puzzle
+def _5_1():
+    o = run_for_multiple_outputs(1)
+    assert not any(o[:-1])
+    print(o[-1])
+
+@puzzle
+def _5_2():
+    run_for_single_output(5)
+
+@puzzle
+def _7_1():
+    def test(phases):
+        x = 0
+        for name, phase in zip("ABCDE", phases):
+            x = Machine(inputs=[phase, x], name=name).run()
+        return x
+    print(max(map(test, itertools.permutations(range(5)))))
+
+@puzzle
+def _7_2():
+    def test(phases):
+        machines = [Machine(inputs=[phase], name=name) for name, phase in zip("ABCDE", phases)]
+        x = 0
+        for m in itertools.cycle(machines):
+            r = m.run(x)
+            if r is None:
+                break
+            x = r
+        return x
+    print(max(map(test, itertools.permutations(range(5,10)))))
+
+@puzzle
+def _9_1():
+    run_for_single_output(1)
+
+@puzzle
+def _9_2():
+    run_for_single_output(2)
+
+###############################################################################
+
+if __name__ == "__main__":
+    parser = argparse.ArgumentParser()
+    parser.add_argument("puzzles", metavar="PUZZLE", nargs='*',
+                        help="select a puzzle to solve (choices: {})".format(', '.join(n for n,f in Puzzles)))
+    parser.add_argument("-f", "--file", metavar="FILE", default="input.txt",
+                        help="intcode file to run")
+    parser.add_argument("-i", "--inputs", metavar="VALUES",
+                        help="input values to use")
+    parser.add_argument("-v", "--verbose", action='store_true',
+                        help="trace execution even if running a puzzle")
+    parser.add_argument("-q", "--quiet", action='store_true',
+                        help="don't trace execution")
+    parser.add_argument("--vn", metavar="NOUN,VERB",
+                        help="initial values of memory locations 1 and 2")
+    args = parser.parse_args()
+
+    g_DefaultTracing = bool(args.verbose)
+    g_Code = list(map(int, open(args.file).read().replace(',', ' ').split()))
+
+    if args.puzzles:
+        ok = False
+        for name, fn in Puzzles:
+            if any(fnmatch.fnmatch(name, pat) for pat in args.puzzles):
+                ok = True
+                fn()
+        if not ok:
+            parser.error("no matching puzzle")
+    else:
+        m = Machine(
+            inputs = map(int, args.inputs.replace(',', ' ').split()) if args.inputs else [],
+            overrides = dict(zip(itertools.count(1), map(int, args.vn.replace(',', ' ').split()))) if args.vn else {},
+            tracing = g_DefaultTracing or not(args.quiet),
+        )
+        have_out = False
+        while True:
+            out = m.run()
+            if out is not None:
+                print(out)
+                have_out = True
+            elif m.halted:
+                if not have_out:
+                    print("M[0] =", m.M[0])
+                break
+            else:
+                print("Input queue underflow.")
+                break
diff --git a/2019/README.md b/2019/README.md
@@ -4,8 +4,10 @@
 | -------: | :---: | :--------: | :---------- |
 |  [1](01) | ★★★☆☆ | ★☆☆☆☆      | addition, simple math, light recursion
 |  [2](02) | ★★★☆☆ | ★★☆☆☆      | von Neumann machine emulation
-|  [3](03) | ★★★★☆ | ★★★☆☆      | 2D grid traversal and intersection
+|  [3](03) | ★★★★☆ | ★★☆☆☆      | 2D grid traversal and intersection
 |  [4](04) | ★★★☆☆ | ★★★☆☆      | string matching
 |  [5](05) | ★★★☆☆ | ★★★☆☆      | extended von Neumann machine emulation
 |  [6](06) | ★★★★☆ | ★★☆☆☆      | graph depth computation
 |  [7](07) | ★★★☆☆ | ★★★☆☆      | multi-processor pipe emulation
+|  [8](08) | ★★★★☆ | ★★☆☆☆      | image layer compositing
+|  [9](09) | ★★★☆☆ | ★★☆☆☆      | machine emulation with stack feature

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1 @@`
	`1`	+1102,34463338,34463338,63,1007,63,34463338,63,1005,63,53,1102,3,1,1000,109,988,209,12,9,1000,209,6,209,3,203,0,1008,1000,1,63,1005,63,65,1008,1000,2,63,1005,63,904,1008,1000,0,63,1005,63,58,4,25,104,0,99,4,0,104,0,99,4,17,104,0,99,0,0,1102,1,30,1010,1102,1,38,1008,1102,1,0,1020,1102,22,1,1007,1102,26,1,1015,1102,31,1,1013,1102,1,27,1014,1101,0,23,1012,1101,0,37,1006,1102,735,1,1028,1102,1,24,1009,1102,1,28,1019,1102,20,1,1017,1101,34,0,1001,1101,259,0,1026,1101,0,33,1018,1102,1,901,1024,1101,21,0,1016,1101,36,0,1011,1102,730,1,1029,1101,1,0,1021,1102,1,509,1022,1102,39,1,1005,1101,35,0,1000,1102,1,506,1023,1101,0,892,1025,1101,256,0,1027,1101,25,0,1002,1102,1,29,1004,1102,32,1,1003,109,9,1202,-3,1,63,1008,63,39,63,1005,63,205,1001,64,1,64,1106,0,207,4,187,1002,64,2,64,109,-2,1208,-4,35,63,1005,63,227,1001,64,1,64,1105,1,229,4,213,1002,64,2,64,109,5,1206,8,243,4,235,1106,0,247,1001,64,1,64,1002,64,2,64,109,14,2106,0,1,1105,1,265,4,253,1001,64,1,64,1002,64,2,64,109,-25,1201,4,0,63,1008,63,40,63,1005,63,285,1106,0,291,4,271,1001,64,1,64,1002,64,2,64,109,14,2107,37,-7,63,1005,63,313,4,297,1001,64,1,64,1106,0,313,1002,64,2,64,109,-7,21101,40,0,5,1008,1013,37,63,1005,63,333,1105,1,339,4,319,1001,64,1,64,1002,64,2,64,109,-7,1207,0,33,63,1005,63,355,1106,0,361,4,345,1001,64,1,64,1002,64,2,64,109,7,21102,41,1,9,1008,1017,41,63,1005,63,387,4,367,1001,64,1,64,1106,0,387,1002,64,2,64,109,-1,21102,42,1,10,1008,1017,43,63,1005,63,411,1001,64,1,64,1106,0,413,4,393,1002,64,2,64,109,-5,21101,43,0,8,1008,1010,43,63,1005,63,435,4,419,1106,0,439,1001,64,1,64,1002,64,2,64,109,16,1206,3,455,1001,64,1,64,1106,0,457,4,445,1002,64,2,64,109,-8,21107,44,45,7,1005,1017,479,4,463,1001,64,1,64,1106,0,479,1002,64,2,64,109,6,1205,5,497,4,485,1001,64,1,64,1106,0,497,1002,64,2,64,109,1,2105,1,6,1105,1,515,4,503,1001,64,1,64,1002,64,2,64,109,-10,2108,36,-1,63,1005,63,535,1001,64,1,64,1105,1,537,4,521,1002,64,2,64,109,-12,2101,0,6,63,1008,63,32,63,1005,63,561,1001,64,1,64,1105,1,563,4,543,1002,64,2,64,109,25,21108,45,46,-2,1005,1018,583,1001,64,1,64,1105,1,585,4,569,1002,64,2,64,109,-23,2108,34,4,63,1005,63,607,4,591,1001,64,1,64,1106,0,607,1002,64,2,64,109,3,1202,7,1,63,1008,63,22,63,1005,63,633,4,613,1001,64,1,64,1106,0,633,1002,64,2,64,109,12,21108,46,46,3,1005,1015,651,4,639,1106,0,655,1001,64,1,64,1002,64,2,64,109,-5,2102,1,-1,63,1008,63,35,63,1005,63,679,1001,64,1,64,1105,1,681,4,661,1002,64,2,64,109,13,21107,47,46,-7,1005,1013,701,1001,64,1,64,1105,1,703,4,687,1002,64,2,64,109,-2,1205,2,715,1106,0,721,4,709,1001,64,1,64,1002,64,2,64,109,17,2106,0,-7,4,727,1105,1,739,1001,64,1,64,1002,64,2,64,109,-23,2107,38,-6,63,1005,63,759,1001,64,1,64,1106,0,761,4,745,1002,64,2,64,109,-3,1207,-4,40,63,1005,63,779,4,767,1105,1,783,1001,64,1,64,1002,64,2,64,109,-8,2101,0,-1,63,1008,63,35,63,1005,63,809,4,789,1001,64,1,64,1105,1,809,1002,64,2,64,109,-6,2102,1,8,63,1008,63,32,63,1005,63,835,4,815,1001,64,1,64,1106,0,835,1002,64,2,64,109,6,1201,5,0,63,1008,63,37,63,1005,63,857,4,841,1106,0,861,1001,64,1,64,1002,64,2,64,109,2,1208,0,32,63,1005,63,883,4,867,1001,64,1,64,1106,0,883,1002,64,2,64,109,23,2105,1,-2,4,889,1001,64,1,64,1106,0,901,4,64,99,21102,27,1,1,21101,0,915,0,1106,0,922,21201,1,55337,1,204,1,99,109,3,1207,-2,3,63,1005,63,964,21201,-2,-1,1,21101,0,942,0,1105,1,922,21202,1,1,-1,21201,-2,-3,1,21102,957,1,0,1105,1,922,22201,1,-1,-2,1106,0,968,21201,-2,0,-2,109,-3,2105,1,0