import macros;macro ImportExpand(s:untyped):untyped = parseStmt($s[2])
# source: src/cplib/tmpl/sheep.nim
ImportExpand "cplib/tmpl/sheep" <=== "when not declared CPLIB_TMPL_SHEEP:\n    const CPLIB_TMPL_SHEEP* = 1\n    {.warning[UnusedImport]: off.}\n    {.hint[XDeclaredButNotUsed]: off.}\n    import algorithm\n    import sequtils\n    import tables\n    import macros\n    import math\n    import sets\n    import strutils\n    import strformat\n    import sugar\n    import heapqueue\n    import streams\n    import deques\n    import bitops\n    import std/lenientops\n    import options\n    #入力系\n    proc scanf(formatstr: cstring){.header: \"<stdio.h>\", varargs.}\n    proc getchar(): char {.importc: \"getchar_unlocked\", header: \"<stdio.h>\", discardable.}\n    proc ii(): int {.inline.} = scanf(\"%lld\\n\", addr result)\n    proc lii(N: int): seq[int] {.inline.} = newSeqWith(N, ii())\n    proc si(): string {.inline.} =\n        result = \"\"\n        var c: char\n        while true:\n            c = getchar()\n            if c == ' ' or c == '\\n' or c == '\\255':\n                break\n            result &= c\n    \n    # 出力系\n    # 1. 実際の処理を行う proc (openArray を受け取る)\n    proc print_internal(prop: tuple[f: File, sepc: string, endc: string, flush: bool], args: openArray[string]) =\n        for i in 0 ..< args.len:\n            prop.f.write(args[i])\n            if i != args.len - 1:\n                prop.f.write(prop.sepc)\n            else:\n                prop.f.write(prop.endc)\n        if prop.flush:\n            prop.f.flushFile()\n\n    # 2. ユーザーが呼び出すためのインターフェース (varargs を受け取る)\n    proc print*(prop: tuple[f: File, sepc: string, endc: string, flush: bool], args: varargs[string, `$`]) =\n        # varargs は内部では openArray として扱えるので、そのまま渡せる\n        print_internal(prop, args)\n\n    proc print*(args: varargs[string, `$`]) =\n        # こちらも内部用の proc を呼ぶ\n        print_internal((f: stdout, sepc: \" \", endc: \"\\n\", flush: false), args)\n    macro getSymbolName(x: typed): string = x.toStrLit\n    macro debug*(args: varargs[untyped]): untyped =\n        when defined(debug):\n            result = newNimNode(nnkStmtList, args)\n            template prop(e: string = \"\"): untyped = (f: stderr, sepc: \"\", endc: e, flush: true)\n            for i, arg in args:\n                if arg.kind == nnkStrLit:\n                    result.add(quote do: print(prop(), \"\\\"\", `arg`, \"\\\"\"))\n                else:\n                    result.add(quote do: print(prop(\": \"), getSymbolName(`arg`)))\n                    result.add(quote do: print(prop(), `arg`))\n                if i != args.len - 1: result.add(quote do: print(prop(), \", \"))\n                else: result.add(quote do: print(prop(), \"\\n\"))\n        else:\n            return (quote do: discard)\n    #chmin,chmax\n    template `max=`(x, y) =\n        let yVal = y # yが計算式の場合に評価を1回にするため\n        if x < yVal:\n            x = yVal\n\n    template `min=`(x, y) =\n        let yVal = y\n        if x > yVal:\n            x = yVal\n    proc chmin[T](x: var T, y: T):bool=\n        if x > y:\n            x = y\n            return true\n        return false\n    proc chmax[T](x: var T, y: T):bool=\n        if x < y:\n            x = y\n            return true\n        return false\n    #bit演算\n    proc `%`*(x: int, y: int): int =\n        result = x mod y\n        if y > 0 and result < 0: result += y\n        if y < 0 and result > 0: result += y\n    proc `//`*(x: int, y: int): int{.inline.} =\n        result = x div y\n        if y > 0 and result * y > x: result -= 1\n        if y < 0 and result * y < x: result -= 1\n    proc `%=`(x: var int, y: int): void = x = x%y\n    proc `//=`(x: var int, y: int): void = x = x//y\n    proc `**`(x: int, y: int): int = x^y\n    proc `**=`(x: var int, y: int): void = x = x^y\n    proc `^`(x: int, y: int): int = x xor y\n    proc `|`(x: int, y: int): int = x or y\n    proc `&`(x: int, y: int): int = x and y\n    proc `>>`(x: int, y: int): int = x shr y\n    proc `<<`(x: int, y: int): int = x shl y\n    proc `~`(x: int): int = not x\n    proc `^=`(x: var int, y: int): void = x = x ^ y\n    proc `&=`(x: var int, y: int): void = x = x & y\n    proc `|=`(x: var int, y: int): void = x = x | y\n    proc `>>=`(x: var int, y: int): void = x = x >> y\n    proc `<<=`(x: var int, y: int): void = x = x << y\n    proc `[]`(x: int, n: int): bool = (x and (1 shl n)) != 0\n    #便利な変換\n    proc `!`(x: char, a = '0'): int = int(x)-int(a)\n    #定数\n    when not declared CPLIB_UTILS_CONSTANTS:\n        const CPLIB_UTILS_CONSTANTS* = 1\n        const INF32*: int32 = 1001000027.int32\n        const INF64*: int = int(3300300300300300491)\n    \n    const INF = INF64\n    #converter\n\n    #range\n    iterator range(start: int, ends: int, step: int): int =\n        var i = start\n        if step < 0:\n            while i > ends:\n                yield i\n                i += step\n        elif step > 0:\n            while i < ends:\n                yield i\n                i += step\n    iterator range(ends: int): int = (for i in 0..<ends: yield i)\n    iterator range(start: int, ends: int): int = (for i in\n            start..<ends: yield i)\n\n    #joinが非stringでめちゃくちゃ遅いやつのパッチ\n    proc join*[T: not string](a: openArray[T], sep: string = \"\"): string = a.mapit($it).join(sep)\n\n    proc dump[T](arr:seq[seq[T]])=\n        for i in 0..<len(arr):\n            echo arr[i]\n\n    proc sum(slice:HSlice[int,int]):int=\n        return (slice.a+slice.b)*len(slice)//2\n    \n    proc `<`[T](l,r:seq[T]):bool=\n        for i in 0..<min(len(l),len(r)):\n            if l[i] > r[i]:\n                return false\n            elif l[i] < r[i]:\n                return true\n        return len(l) < len(r)\n    \n    # Yes/No\n    proc yes*(b: bool = true): void = print(if b: \"Yes\" else: \"No\")\n    proc no*(b: bool = true): void = yes(not b)\n\n    proc takahashi(b:bool = true) : void = print(if b: \"Takahashi\" else: \"Aoki\")\n    proc aoki(b:bool = true) : void = takahashi(not b)\n\n    template dblock(body: untyped) =\n        when defined(debug):\n            block:\n                body\n"
# source: src/cplib/graph/bellmanford.nim
ImportExpand "cplib/graph/bellmanford" <=== "when not declared CPLIB_GRAPH_BELLMANFORD:\n    const CPLIB_GRAPH_BELLMANFORD* = 1\n    import deques\n    import sequtils\n    import macros\n    when not declared CPLIB_GRAPH_GRAPH:\n        const CPLIB_GRAPH_GRAPH* = 1\n    \n        import sequtils\n        import math\n        type DynamicGraph*[T] = ref object of RootObj\n            edges*: seq[seq[(int32, T)]]\n            len*: int\n        type StaticGraph*[T] = ref object of RootObj\n            src*, dst*: seq[int32]\n            cost*: seq[T]\n            elist*: seq[(int32, T)]\n            start*: seq[int32]\n            len*: int\n    \n        type WeightedDirectedGraph*[T] = ref object of DynamicGraph[T]\n        type WeightedUnDirectedGraph*[T] = ref object of DynamicGraph[T]\n        type UnWeightedDirectedGraph* = ref object of DynamicGraph[int]\n        type UnWeightedUnDirectedGraph* = ref object of DynamicGraph[int]\n        type WeightedDirectedStaticGraph*[T] = ref object of StaticGraph[T]\n        type WeightedUnDirectedStaticGraph*[T] = ref object of StaticGraph[T]\n        type UnWeightedDirectedStaticGraph* = ref object of StaticGraph[int]\n        type UnWeightedUnDirectedStaticGraph* = ref object of StaticGraph[int]\n    \n        type GraphTypes*[T] = DynamicGraph[T] or StaticGraph[T]\n        type DirectedGraph* = WeightedDirectedGraph or UnWeightedDirectedGraph or WeightedDirectedStaticGraph or UnWeightedDirectedStaticGraph\n        type UnDirectedGraph* = WeightedUnDirectedGraph or UnWeightedUnDirectedGraph or WeightedUnDirectedStaticGraph or UnWeightedUnDirectedStaticGraph\n        type WeightedGraph*[T] = WeightedDirectedGraph[T] or WeightedUnDirectedGraph[T] or WeightedDirectedStaticGraph[T] or WeightedUnDirectedStaticGraph[T]\n        type UnWeightedGraph* = UnWeightedDirectedGraph or UnWeightedUnDirectedGraph or UnWeightedDirectedStaticGraph or UnWeightedUnDirectedStaticGraph\n        type DynamicGraphTypes* = WeightedDirectedGraph or UnWeightedDirectedGraph or WeightedUnDirectedGraph or UnWeightedUnDirectedGraph\n        type StaticGraphTypes* = WeightedDirectedStaticGraph or UnWeightedDirectedStaticGraph or WeightedUnDirectedStaticGraph or UnWeightedUnDirectedStaticGraph\n    \n        proc add_edge_dynamic_impl*[T](g: DynamicGraph[T], u, v: int, cost: T, directed: bool) =\n            g.edges[u].add((v.int32, cost))\n            if not directed: g.edges[v].add((u.int32, cost))\n    \n        proc initWeightedDirectedGraph*(N: int, edgetype: typedesc = int): WeightedDirectedGraph[edgetype] =\n            result = WeightedDirectedGraph[edgetype](edges: newSeq[seq[(int32, edgetype)]](N), len: N)\n        proc add_edge*[T](g: var WeightedDirectedGraph[T], u, v: int, cost: T) =\n            g.add_edge_dynamic_impl(u, v, cost, true)\n    \n        proc initWeightedUnDirectedGraph*(N: int, edgetype: typedesc = int): WeightedUnDirectedGraph[edgetype] =\n            result = WeightedUnDirectedGraph[edgetype](edges: newSeq[seq[(int32, edgetype)]](N), len: N)\n        proc add_edge*[T](g: var WeightedUnDirectedGraph[T], u, v: int, cost: T) =\n            g.add_edge_dynamic_impl(u, v, cost, false)\n    \n        proc initUnWeightedDirectedGraph*(N: int): UnWeightedDirectedGraph =\n            result = UnWeightedDirectedGraph(edges: newSeq[seq[(int32, int)]](N), len: N)\n        proc add_edge*(g: var UnWeightedDirectedGraph, u, v: int) =\n            g.add_edge_dynamic_impl(u, v, 1, true)\n    \n        proc initUnWeightedUnDirectedGraph*(N: int): UnWeightedUnDirectedGraph =\n            result = UnWeightedUnDirectedGraph(edges: newSeq[seq[(int32, int)]](N), len: N)\n        proc add_edge*(g: var UnWeightedUnDirectedGraph, u, v: int) =\n            g.add_edge_dynamic_impl(u, v, 1, false)\n    \n        proc len*[T](G: WeightedGraph[T]): int = G.len\n        proc len*(G: UnWeightedGraph): int = G.len\n    \n        iterator `[]`*[T](g: WeightedDirectedGraph[T] or WeightedUnDirectedGraph[T], x: int): (int, T) =\n            for e in g.edges[x]: yield (e[0].int, e[1])\n        iterator `[]`*(g: UnWeightedDirectedGraph or UnWeightedUnDirectedGraph, x: int): int =\n            for e in g.edges[x]: yield e[0].int\n    \n        proc add_edge_static_impl*[T](g: StaticGraph[T], u, v: int, cost: T, directed: bool) =\n            g.src.add(u.int32)\n            g.dst.add(v.int32)\n            g.cost.add(cost)\n            if not directed:\n                g.src.add(v.int32)\n                g.dst.add(u.int32)\n                g.cost.add(cost)\n    \n        proc build_impl*[T](g: StaticGraph[T]) =\n            g.start = newSeqWith(g.len + 1, 0.int32)\n            for i in 0..<g.src.len:\n                g.start[g.src[i]] += 1\n            g.start.cumsum\n            g.elist = newSeq[(int32, T)](g.start[^1])\n            for i in countdown(g.src.len - 1, 0):\n                var u = g.src[i]\n                var v = g.dst[i]\n                g.start[u] -= 1\n                g.elist[g.start[u]] = (v, g.cost[i])\n        proc build*(g: StaticGraphTypes) = g.build_impl()\n    \n        proc initWeightedDirectedStaticGraph*(N: int, edgetype: typedesc = int, capacity: int = 0): WeightedDirectedStaticGraph[edgetype] =\n            result = WeightedDirectedStaticGraph[edgetype](\n                src: newSeqOfCap[int32](capacity),\n                dst: newSeqOfCap[int32](capacity),\n                cost: newSeqOfCap[edgetype](capacity),\n                elist: newSeq[(int32, edgetype)](0),\n                start: newSeq[int32](0),\n                len: N\n            )\n        proc add_edge*[T](g: var WeightedDirectedStaticGraph[T], u, v: int, cost: T) =\n            g.add_edge_static_impl(u, v, cost, true)\n    \n        proc initWeightedUnDirectedStaticGraph*(N: int, edgetype: typedesc = int, capacity: int = 0): WeightedUnDirectedStaticGraph[edgetype] =\n            result = WeightedUnDirectedStaticGraph[edgetype](\n                src: newSeqOfCap[int32](capacity*2),\n                dst: newSeqOfCap[int32](capacity*2),\n                cost: newSeqOfCap[edgetype](capacity*2),\n                elist: newSeq[(int32, edgetype)](0),\n                start: newSeq[int32](0),\n                len: N\n            )\n        proc add_edge*[T](g: var WeightedUnDirectedStaticGraph[T], u, v: int, cost: T) =\n            g.add_edge_static_impl(u, v, cost, false)\n    \n        proc initUnWeightedDirectedStaticGraph*(N: int, capacity: int = 0): UnWeightedDirectedStaticGraph =\n            result = UnWeightedDirectedStaticGraph(\n                src: newSeqOfCap[int32](capacity),\n                dst: newSeqOfCap[int32](capacity),\n                cost: newSeqOfCap[int](capacity),\n                elist: newSeq[(int32, int)](0),\n                start: newSeq[int32](0),\n                len: N\n            )\n        proc add_edge*(g: var UnWeightedDirectedStaticGraph, u, v: int) =\n            g.add_edge_static_impl(u, v, 1, true)\n    \n        proc initUnWeightedUnDirectedStaticGraph*(N: int, capacity: int = 0): UnWeightedUnDirectedStaticGraph =\n            result = UnWeightedUnDirectedStaticGraph(\n                src: newSeqOfCap[int32](capacity*2),\n                dst: newSeqOfCap[int32](capacity*2),\n                cost: newSeqOfCap[int](capacity*2),\n                elist: newSeq[(int32, int)](0),\n                start: newSeq[int32](0),\n                len: N\n            )\n        proc add_edge*(g: var UnWeightedUnDirectedStaticGraph, u, v: int) =\n            g.add_edge_static_impl(u, v, 1, false)\n    \n        proc static_graph_initialized_check*[T](g: StaticGraph[T]) = assert g.start.len > 0, \"Static Graph must be initialized before use.\"\n    \n        iterator `[]`*[T](g: WeightedDirectedStaticGraph[T] or WeightedUnDirectedStaticGraph[T], x: int): (int, T) =\n            g.static_graph_initialized_check()\n            for i in g.start[x]..<g.start[x+1]: yield (g.elist[i][0].int, g.elist[i][1])\n        iterator `[]`*(g: UnWeightedDirectedStaticGraph or UnWeightedUnDirectedStaticGraph, x: int): int =\n            g.static_graph_initialized_check()\n            for i in g.start[x]..<g.start[x+1]: yield g.elist[i][0].int\n    \n        iterator to_and_cost*[T](g: DynamicGraph[T], x: int): (int, T) =\n            for e in g.edges[x]: yield (e[0].int, e[1])\n        iterator to_and_cost*[T](g: StaticGraph[T], x: int): (int, T) =\n            g.static_graph_initialized_check()\n            for i in g.start[x]..<g.start[x+1]: yield (g.elist[i][0].int, g.elist[i][1])\n        \n        import tables\n    \n        type UnWeightedUnDirectedTableGraph*[T] = object \n            toi* : Table[T,int]\n            v* : seq[T]\n            graph* : UnWeightedUnDirectedGraph\n    \n        type UnWeightedDirectedTableGraph*[T] = object \n            toi* : Table[T,int]\n            v* : seq[T]\n            graph* : UnWeightedDirectedGraph\n    \n        type WeightedUnDirectedTableGraph*[T,S] = object \n            toi* : Table[T,int]\n            v* : seq[T]\n            graph* : WeightedUnDirectedGraph[S]\n    \n        type WeightedDirectedTableGraph*[T,S] = object \n            toi* : Table[T,int]\n            v* : seq[T]\n            graph* : WeightedDirectedGraph[S]\n    \n        type UnWeightedTableGraph*[T] = UnWeightedUnDirectedTableGraph[T] or UnWeightedDirectedTableGraph[T]\n        type WeightedTableGraph*[T,S] = WeightedUnDirectedTableGraph[T,S] or WeightedDirectedTableGraph[T,S]\n    \n        proc initUnWeightedUnDirectedTableGraph*[T](V:openArray[T]):UnWeightedUnDirectedTableGraph[T]=\n            for i in 0..<len(V):\n                result.toi[V[i]] = i\n            result.graph = initUnWeightedUnDirectedGraph(len(V))\n            result.v = @V\n    \n        proc initUnWeightedDirectedTableGraph*[T](V:openArray[T]):UnWeightedDirectedTableGraph[T]=\n            for i in 0..<len(V):\n                result.toi[V[i]] = i\n            result.graph = initUnWeightedDirectedGraph(len(V))\n            result.v = @V\n    \n        proc initWeightedUnDirectedTableGraph*[T](V:openArray[T],S:typedesc = int):WeightedUnDirectedTableGraph[T,S]=\n            for i in 0..<len(V):\n                result.toi[V[i]] = i\n            result.graph = initWeightedUnDirectedGraph(len(V),S)\n            result.v = @V\n    \n        proc initWeightedDirectedTableGraph*[T](V:openArray[T],S:typedesc = int):WeightedDirectedTableGraph[T,S]=\n            for i in 0..<len(V):\n                result.toi[V[i]] = i\n            result.graph = initWeightedDirectedGraph(len(V),S)\n            result.v = @V\n    \n        proc add_edge*[T](g: var UnWeightedTableGraph[T],u,v:T)=\n            g.graph.add_edge(g.toi[u],g.toi[v])\n    \n        proc add_edge*[T,S](g: var WeightedTableGraph[T,S],u,v:T,cost:S)=\n            g.graph.add_edge(g.toi[u],g.toi[v],cost)\n    \n        iterator `[]`*[T,S](g: WeightedDirectedTableGraph[T,S] or WeightedUnDirectedTableGraph[T,S], x: T): (T, S) = \n            for (x,y) in g.graph[g.toi[x]]:\n                yield (g.v[x],y)\n        iterator `[]`*[T](g: UnWeightedDirectedTableGraph[T] or UnWeightedUnDirectedTableGraph[T], x: T): T = \n            for x in g.graph[g.toi[x]]:\n                yield g.v[x]\n    \n    when not declared CPLIB_GRAPH_RESTORE_SHORTESTPATH_FROM_PREV:\n        const CPLIB_GRAPH_RESTORE_SHORTESTPATH_FROM_PREV* = 1\n        import algorithm\n        proc restore_shortest_path_from_prev*(prev: seq[int], goal: int): seq[int] =\n            var i = goal\n            while i != -1:\n                result.add(i)\n                i = prev[i]\n            result.reverse\n    \n    proc restore_bellmanford_impl[T](G: DynamicGraph[T] or StaticGraph[T], start: int or seq[int], ZERO, INF: T): tuple[costs: seq[T], prev: seq[int]] =\n        let N = len(G)\n        var\n            costs = newSeqWith(N, INF)\n            prev = newSeqWith(N, -1)\n            changed: bool\n        when start is int:\n            costs[start] = ZERO\n        else:\n            for s in start:\n                costs[s] = ZERO\n        for _ in 0..<N:\n            changed = false\n            for i in 0..<N:\n                if costs[i] == INF: continue\n                for (j, c) in G.to_and_cost(i):\n                    var temp = costs[i] + c\n                    if temp < costs[j]:\n                        prev[j] = i\n                        costs[j] = temp\n                        changed = true\n            if not changed: break\n        if changed:\n            for _ in 0..<N:\n                for i in 0..<N:\n                    if costs[i] == INF: continue\n                    for (j, c) in G.to_and_cost(i):\n                        var temp = costs[i] + c\n                        if temp < costs[j]:\n                            costs[j] = -INF\n                            prev[j] = -1\n        return (costs, prev)\n    macro declareBellmanFord(name, t, zero, inf) =\n        let impl_name = ident($`name` & \"_impl\")\n        quote do:\n            proc `name`*(G: DynamicGraph[`t`] or StaticGraph[`t`], start: int or seq[int], ZERO: `t` = `zero`, INF: `t` = `inf`): auto =\n                `impl_name`(G, start, ZERO, INF)\n    declareBellmanFord(restore_bellmanford, int, 0, INF64)\n    declareBellmanFord(restore_bellmanford, int32, 0i32, INF32)\n    declareBellmanFord(restore_bellmanford, float, 0.0, 1e100)\n    declareBellmanFord(restore_bellmanford, float32, 0.0'f32, 1e30'f32)\n    proc restore_bellmanford*[T](G: DynamicGraph[T] or StaticGraph[T], start: int or seq[int], ZERO, INF: T): auto =\n        restore_bellmanford_impl(G, start, ZERO, INF)\n    proc bellmanford_impl[T](G: DynamicGraph[T] or StaticGraph[T], start: int or seq[int], ZERO, INF: T): auto =\n        var (costs, _) = restore_bellmanford(G, start, ZERO, INF)\n        return costs\n    declareBellmanFord(bellmanford, int, 0, INF64)\n    declareBellmanFord(bellmanford, int32, 0i32, INF32)\n    declareBellmanFord(bellmanford, float, 0.0, 1e100)\n    declareBellmanFord(bellmanford, float32, 0.0'f32, 1e30'f32)\n    proc bellmanford*[T](G: DynamicGraph[T] or StaticGraph[T], start: int or seq[int], ZERO, INF: T): auto =\n        bellmanford_impl(G, start, ZERO, INF)\n    proc shortest_path_bellmanford_impl[T](G: DynamicGraph[T] or StaticGraph[T], start, goal: int, ZERO, INF: T): tuple[path: seq[int], cost: T] =\n        var (costs, prev) = restore_bellmanford(G, start, ZERO, INF)\n        result.path = prev.restore_shortest_path_from_prev(goal)\n        result.cost = costs[goal]\n    proc shortest_path_bellmanford*(G: DynamicGraph[int] or StaticGraph[int], start, goal: int, ZERO: int = 0, INF: int = INF64): tuple[path: seq[int], cost: int] =\n        shortest_path_bellmanford_impl(G, start, goal, ZERO, INF)\n    proc shortest_path_bellmanford*(G: DynamicGraph[int32] or StaticGraph[int32], start, goal: int, ZERO: int32 = 0, INF: int32 = INF32): tuple[path: seq[int], cost: int32] =\n        shortest_path_bellmanford_impl(G, start, goal, ZERO, INF)\n    proc shortest_path_bellmanford*(G: DynamicGraph[float] or StaticGraph[float], start, goal: int, ZERO: float = 0.0, INF: float = 1e100): tuple[path: seq[int], cost: float] =\n        shortest_path_bellmanford_impl(G, start, goal, ZERO, INF)\n    proc shortest_path_bellmanford*(G: DynamicGraph[float32] or StaticGraph[float32], start, goal: int, ZERO: float32 = 0.0'f32, INF: float32 = 1e30'f32): tuple[path: seq[int], cost: float32] =\n        shortest_path_bellmanford_impl(G, start, goal, ZERO, INF)\n    proc shortest_path_bellmanford*[T](G: DynamicGraph[T] or StaticGraph[T], start, goal: int, ZERO, INF: T): tuple[path: seq[int], cost: T] =\n        shortest_path_bellmanford_impl(G, start, goal, ZERO, INF)\n"
# source: src/cplib/collections/staticbitset.nim
ImportExpand "cplib/collections/staticbitset" <=== "when not declared CPLIB_COLLECTIONS_STATIC_BITSET:\n    const CPLIB_COLLECTIONS_STATIC_BITSET* = 1\n    import math\n    import bitops\n    import algorithm\n    import strutils\n    \n    type BitSet*[size:static int] {.byref.}= object\n        bits : array[(size+63) div 64,uint]\n    \n    proc varor(x:var uint,y:uint) {.importcpp:\"# |= #\".}\n    proc varand(x:var uint,y:uint) {.importcpp:\"# &= #\".}\n    proc varxor(x:var uint,y:uint) {.importcpp:\"# ^= #\".}\n    proc varshr(x:var uint,y:int) {.importcpp:\"# >>= #\".}\n    proc varshl(x:var uint,y:int) {.importcpp:\"# <<= #\".}\n\n    proc trim[size](bitset: var BitSet[size]) =\n        const mod64 = size mod 64\n        when mod64 != 0:\n            bitset.bits[^1].varand((1u shl mod64) - 1)\n\n    proc initBitSet*(x:static int):BitSet[x]=\n        discard\n\n    proc initBitSet*(v:openArray[bool],size:static int):Bitset[size]=\n        const mask = ((1 shl 6) - 1)\n        for i in 0..<len(v):\n            if v[i]:\n                varor(result.bits[i shr 6],1u shl (i and mask))\n\n    proc initBitSetFromIndexes*(indexes:openArray[int],size:static int):Bitset[size]=\n        const mask = ((1 shl 6) - 1)\n        for i in indexes:\n            if i < 0 or i >= size:\n                raise newException(IndexDefect, \"BitSet index out of bounds\")\n            varor(result.bits[i shr 6],1u shl (i and mask))\n    \n    proc `&`*[size](x,y:BitSet[size]):BitSet[size]=\n        for i in 0..<len(result.bits):\n            result.bits[i] = x.bits[i] and y.bits[i]\n    \n    proc `&=`*[size](x:var BitSet[size],y:BitSet[size])=\n        for i in 0..<len(y.bits):\n            varand(x.bits[i],y.bits[i])\n    \n    proc `|`*[size](x,y:BitSet[size]):BitSet[size]=\n        for i in 0..<len(y.bits):\n            result.bits[i] = x.bits[i] or y.bits[i]\n    \n    proc `|=`*[size](x:var BitSet[size],y:BitSet[size])=\n        for i in 0..<len(y.bits):\n            varor(x.bits[i],y.bits[i])\n    \n    proc `^`*[size](x,y:BitSet[size]):BitSet[size]=\n        for i in 0..<len(y.bits):\n            result.bits[i] = x.bits[i] xor y.bits[i]\n    \n    proc `^=`*[size](x:var BitSet[size],y:BitSet[size])=\n        for i in 0..<len(y.bits):\n            varxor(x.bits[i],y.bits[i])\n    \n    proc `>>`*[size](bitset:BitSet[size],x:int):BitSet[size]=\n        if x >= size:\n            return\n        for i in 0..<len(bitset.bits):\n            if i+(x div 64) < len(result.bits):\n                result.bits[i] = bitset.bits[i+(x div 64)]\n        var tmp = 0u\n        var mod64 = x mod 64\n        if mod64 != 0:\n            for i in countdown(len(bitset.bits)-1,0,1):\n                var msk = result.bits[i] and ((1u shl mod64) - 1)\n                result.bits[i].varshr(mod64)\n                result.bits[i].varor(tmp shl (64-mod64))\n                tmp = msk\n    \n    proc `<<`*[size](bitset:BitSet[size],x:int):BitSet[size]=\n        if x >= size:\n            return\n        for i in 0..<len(bitset.bits):\n            if i-(x div 64) >= 0:\n                result.bits[i] = bitset.bits[i-(x div 64)]\n        var tmp = 0u\n        var mod64 = x mod 64\n        if mod64 != 0:\n            for i in 0..<len(bitset.bits):\n                var msk = result.bits[i] and bitnot((1u shl mod64) - 1)\n                result.bits[i].varshl(mod64)\n                result.bits[i].varor(tmp shr (64-mod64))\n                tmp = msk\n        result.trim()\n    \n    proc andpopcount*[size](x,y:BitSet[size]):int=\n        for i in 0..<min(len(x.bits),len(y.bits)):\n            result += (x.bits[i] and y.bits[i]).popcount()\n    \n    proc orpopcount*[size](x,y:BitSet[size]):int=\n        for i in 0..<min(len(x.bits),len(y.bits)):\n            result += (x.bits[i] or y.bits[i]).popcount()\n    \n    proc xorpopcount*[size](x,y:BitSet[size]):int=\n        for i in 0..<min(len(x.bits),len(y.bits)):\n            result += (x.bits[i] xor y.bits[i]).popcount()\n    \n    proc `~`*[size](x:BitSet[size]):BitSet[size]=\n        for i in 0..<len(x.bits)-1:\n            result.bits[i] = bitnot(x.bits[i])\n        var mod64 = size mod 64\n        if mod64 == 0:\n            result.bits[^1] = bitnot(x.bits[^1])\n        else:\n            result.bits[^1] = x.bits[^1] xor ((1u shl mod64) - 1)\n    proc popcount*[size](x:BitSet[size]):int=\n        for i in 0..<len(x.bits):\n            result += x.bits[i].popcount()\n\n    iterator items*[size](bitset:BitSet[size]):int=\n        for wordIndex in 0..<len(bitset.bits):\n            var word = bitset.bits[wordIndex]\n            while word != 0:\n                let bitIndex = word.countTrailingZeroBits()\n                let index = wordIndex * 64 + bitIndex\n                if index >= size:\n                    break\n                yield index\n                word = word and (word - 1)\n\n    proc lowestBit*[size](bitset:BitSet[size]):int=\n        for wordIndex in 0..<len(bitset.bits):\n            if bitset.bits[wordIndex] != 0:\n                let index = wordIndex * 64 + bitset.bits[wordIndex].countTrailingZeroBits()\n                if index < size:\n                    return index\n        -1\n    \n    proc `[]`*[size](bitset:BitSet[size],idx:Natural):bool=\n        return bitset.bits[idx shr 6].testBit(idx and 63)\n\n    proc `[]=`*[size](bitset:var BitSet[size],idx:Natural,x:bool)=\n        if x:\n            bitset.bits[idx shr 6].setBit((idx and 63))\n        else:\n            bitset.bits[idx shr 6].clearBit((idx and 63))\n    \n    proc `[]=`*[size](bitset:var BitSet[size],idx:Natural,x:int)=\n        if x == 1:\n            bitset.bits[idx shr 6].setBit((idx and 63))\n        elif x == 0:\n            bitset.bits[idx shr 6].clearBit((idx and 63))\n    \n    proc `$`*[size](bitset:BitSet[size]):string=\n        var tmp : seq[char]\n        for i in 0..<size:\n            if bitset[i]:\n                tmp.add '1'\n            else:\n                tmp.add '0'\n        return tmp.reversed().join(\"\")\n"


{.checks:off.}

var N,M = ii()
var P = lii(N)
var G = initWeightedDirectedGraph(N)

for _ in range(M):
    var u,v,t = ii()
    G.add_edge(u-1,v-1,t)

var dist = newseqwith(N,[INF,INF])
var bits = newseqwith(N,[initBitSet[2500](2500),initBitSet[2500](2500)])

proc change(u,v,t:int)=
    for k in range(2):
        var now = dist[u][k]
        if now+t < dist[v][0]:
            var bit = bits[u][k]
            bit[v] = 0
            if bit != bits[v][0]:
                bits[v][1] = bits[v][0]
                dist[v][1] = dist[v][0]
            if bit.popcount() != 0:
                dist[v][0] = now+t
                bits[v][0] = bit
        elif now+t == dist[v][0]:
            var bit = bits[u][k]
            bit[v] = 0
            bits[v][0] |= bit
        elif now+t < dist[v][1]:
            var bit = bits[u][k]
            bit[v] = 0
            if bit.popcount() != 0:
                dist[v][1] = now+t
                bits[v][1] = bit
        elif now+t == dist[v][1]:
            var bit = bits[u][k]
            bit[v] = 0
            bits[v][1] |= bit


for u in range(N):
    for (v,t) in G[u]:
        var now = P[u]
        if now+t < dist[v][0]:
            dist[v][1] = dist[v][0]
            bits[v][1] = bits[v][0]
            dist[v][0] = now+t
            bits[v][0] = initBitSetFromIndexes(@[u],2500)
        elif now+t == dist[v][0]:
            bits[v][0][u] = 1
        elif now+t < dist[v][1]:
            dist[v][1] = now+t
            bits[v][1] = initBitSetFromIndexes(@[u],2500)
        elif now+t == dist[v][1]:
            bits[v][1][u] = 1

for _ in range(N):
    for u in range(N):
        for (v,t) in G[u]:
            change(u,v,t)
    
var mn = INF
for i in range(N):
    mn.min = dist[i][0] + P[i]

var cnt = 0

for i in range(N):
    if dist[i][0] + P[i] == mn:
        cnt += bits[i][0].popcount()


echo mn," ",cnt