Problem:
Problem Statement

AtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.

The satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.

Holding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.

If a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \sum _{i=1}^{26}c_i \times (d-\mathrm{last}(d,i)).

Please schedule contests on behalf of AtCoder.
If the satisfaction at the end of day D is S, you will get a score of \max(10^6 + S, 0).
There are 50 test cases, and the score of a submission is the total scores for each test case.
You can make submissions multiple times, and the highest score among your submissions will be your score.

Constraints

D = 365

Each c_i is an integer satisfying 0\leq c_i \leq 100.

Each s_{d,i} is an integer satisfying 0\leq s_{d,i} \leq 20000.

Input

Input is given from Standard Input in the following format:

D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}

Output

Let t_d (1\leq t_d \leq 26) be the type of the contest that will be held at day d.
Print D integers t_d to Standard Output in the following format:

t_1
t_2
\vdots
t_D

Any output that does not follow the above format may result in 0 pointsWA for that test case.

Input Generation

Each integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.

Sample Input 1

5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192

Sample Output 1

1
17
13
14
13

Note that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.

Input generator, score calculator, and visualizer

Beginner's Guide

If you don't know what to do, proceed to problem B or C.

Solution in Kotlin (1.3.71) (judge verdict: Accepted)

@file:Suppress("NOTHING_TO_INLINE", "EXPERIMENTAL_FEATURE_WARNING", "OVERRIDE_BY_INLINE")
//@file:OptIn(ExperimentalStdlibApi::class)

import java.io.File
import java.io.PrintWriter
import java.util.Arrays
import java.util.NoSuchElementException
import java.util.TreeSet
import kotlin.math.*
import kotlin.random.Random
import kotlin.collections.sort as _sort
import kotlin.collections.sortDescending as _sortDescending
import kotlin.io.println as iprintln


/** @author Spheniscine */
fun main() { _writer.solve(); _writer.flush() }

fun PrintWriter.solve() {
    val startTime = System.nanoTime()

    val numCases = 1//readInt()
    case@ for(case in 1..numCases) {
        //print("Case #$case: ")

        object {
            val D = readInt()

            val C = readIntArray(26)
            val S = Array(D) { readIntArray(26) }

            var v = 0L
            val last = IntArray(26)
            val L = Array(26) {
                IntTreeSet().also {
                    it.add(-1)
                    it.add(D)
                }
            }
            val T = IntArray(D) { random.nextInt(26) }.also { T ->
                repeat(D) { d ->
                    val t = T[d]

                    v += S[d][t]
                    last[t] = d + 1
                    for (i in 0 until 26) {
                        v -= C[i] * (d + 1 - last[i])
                    }

                    L[t].add(d)
                }
            }

            fun update(d: Int, q: Int) {
                val t = T[d]
                v += S[d][q] - S[d][t]

                L[t].remove(d)
                var a = L[t].floor(d)
                var b = L[t].ceiling(d)
                v -= C[t] * (d - a) * (b - d)

                a = L[q].floor(d)
                b = L[q].ceiling(d)
                v += C[q] * (d - a) * (b - d)
                L[q].add(d)

                T[d] = q
            }

            var score = max(0, 1e6.toLong() + v)
            var best = T.copyOf()

            fun prob(e0: Long, e1: Long, temp: Double) = if (e1 < e0) 1.0
            else exp(-(e1 - e0).toDouble() / (temp))

            init {
                while(true) {
                    val time = System.nanoTime() - startTime
                    if(time >= timeLimit) break
                    val d = random.nextInt(D)
                    val q = random.nextInt(26)
                    val t = T[d]

                    val e0 = -v
                    update(d, q)

                    val temp = T0 - (T0 - T1) * time / timeLimit
                    if(random.nextDouble() >= prob(e0, -v, temp)) {
                        update(d, t)
                    }

                    val newScore = max(0, 1e6.toLong() + v)
                    if(newScore > score) {
                        score = newScore
                        best = T.copyOf()
                    }
                }

                //System.err.println("Score: ${score}")
                for(t in best) println(t+1)
            }
        }
    }

//    iprintln("Time: ${(System.nanoTime() - startTime) / 1000000} ms")
}

const val T0 = 2e4
const val T1 = 6e2
const val timeLimit = 1.8e9.toLong()

typealias IntTreeSet = _Ez_Int_TreeSet

class _Ez_Int_TreeSet @JvmOverloads constructor(capacity: Int = DEFAULT_CAPACITY) {
    // Arrays are 1-indexed. Index 0 is a null node.
    private /*C*/  var key: IntArray
    private var left: IntArray
    private var right: IntArray
    private var p: IntArray
    private var color: BooleanArray
    private var size = 0
    private var root = 0
    private var returnedNull = false

    constructor( /*C*/
        srcArray: IntArray
    ) : this(srcArray.size) {
        for ( /*C*/
        /*C*/element in srcArray) {
            add(element)
        }
    }

    fun size(): Int {
        return size
    }

    val isEmpty: Boolean
        get() = size == 0

    operator fun contains( /*C*/
        /*C*/element: Int
    ): Boolean {
        var x = root
        while (x != NULL) {
            x = if (element < key[x]) {
                left[x]
            } else if (element > key[x]) {
                right[x]
            } else {
                return true
            }
        }
        return false
    }

    operator fun iterator() = _Ez_Int_TreeSetIterator() as IntIterator

    /*C*/   fun toArray(): IntArray {
        /*C*/
        val result = IntArray(size)
        var i = 0
        var x = firstNode()
        while (x != NULL) {
            result[i] = key[x]
            x = successorNode(x)
            i++
        }
        return result
    }

    fun add( /*C*/
        /*C*/element: Int
    ): Boolean {
        var y = NULL
        var x = root
        while (x != NULL) {
            y = x
            x = if (element < key[x]) {
                left[x]
            } else if (element > key[x]) {
                right[x]
            } else {
                return false
            }
        }
        if (size == color.size - 1) {
            enlarge()
        }
        val z = ++size
        key[z] = element
        p[z] = y
        if (y == NULL) {
            root = z
        } else {
            if (element < key[y]) {
                left[y] = z
            } else {
                right[y] = z
            }
        }
        left[z] = NULL
        right[z] = NULL
        color[z] = RED
        fixAfterAdd(z)
        return true
    }

    fun remove( /*C*/
        /*C*/element: Int
    ): Boolean {
        var z = root
        while (z != NULL) {
            z = if (element < key[z]) {
                left[z]
            } else if (element > key[z]) {
                right[z]
            } else {
                removeNode(z)
                return true
            }
        }
        return false
    }

    private fun removeNode(z: Int) {
        val y =
            if (left[z] == NULL || right[z] == NULL) z else successorNode(
                z
            )
        val x = if (left[y] != NULL) left[y] else right[y]
        p[x] = p[y]
        if (p[y] == NULL) {
            root = x
        } else {
            if (y == left[p[y]]) {
                left[p[y]] = x
            } else {
                right[p[y]] = x
            }
        }
        if (y != z) {
            key[z] = key[y]
        }
        if (color[y] == BLACK) {
            fixAfterRemove(x)
        }
        // Swap with last
        if (y != size) {
            // copy fields
            key[y] = key[size]
            left[y] = left[size]
            right[y] = right[size]
            p[y] = p[size]
            color[y] = color[size]
            // fix the children's parents
            p[left[size]] = y
            p[right[size]] = y
            // fix one of the parent's children
            if (left[p[size]] == size) {
                left[p[size]] = y
            } else {
                right[p[size]] = y
            }
            // fix root
            if (root == size) {
                root = y
            }
        }
        size--
    }

    private fun successorNode(x: Int): Int {
        var x = x
        return if (right[x] != NULL) {
            x = right[x]
            while (left[x] != NULL) {
                x = left[x]
            }
            x
        } else {
            var y = p[x]
            while (y != NULL && x == right[y]) {
                x = y
                y = p[y]
            }
            y
        }
    }

    private fun fixAfterAdd(z: Int) {
        var z = z
        while (color[p[z]] == RED) {
            if (p[z] == left[p[p[z]]]) {
                val y = right[p[p[z]]]
                if (color[y] == RED) {
                    color[p[z]] = BLACK
                    color[y] = BLACK
                    color[p[p[z]]] = RED
                    z = p[p[z]]
                } else {
                    if (z == right[p[z]]) {
                        z = p[z]
                        rotateLeft(z)
                    }
                    color[p[z]] = BLACK
                    color[p[p[z]]] = RED
                    rotateRight(p[p[z]])
                }
            } else {
                val y = left[p[p[z]]]
                if (color[y] == RED) {
                    color[p[z]] = BLACK
                    color[y] = BLACK
                    color[p[p[z]]] = RED
                    z = p[p[z]]
                } else {
                    if (z == left[p[z]]) {
                        z = p[z]
                        rotateRight(z)
                    }
                    color[p[z]] = BLACK
                    color[p[p[z]]] = RED
                    rotateLeft(p[p[z]])
                }
            }
        }
        color[root] = BLACK
    }

    private fun fixAfterRemove(x: Int) {
        var x = x
        while (x != root && color[x] == BLACK) {
            if (x == left[p[x]]) {
                var w = right[p[x]]
                if (color[w] == RED) {
                    color[w] = BLACK
                    color[p[x]] = RED
                    rotateLeft(p[x])
                    w = right[p[x]]
                }
                if (color[left[w]] == BLACK && color[right[w]] == BLACK) {
                    color[w] = RED
                    x = p[x]
                } else {
                    if (color[right[w]] == BLACK) {
                        color[left[w]] = BLACK
                        color[w] = RED
                        rotateRight(w)
                        w = right[p[x]]
                    }
                    color[w] = color[p[x]]
                    color[p[x]] = BLACK
                    color[right[w]] = BLACK
                    rotateLeft(p[x])
                    x = root
                }
            } else {
                var w = left[p[x]]
                if (color[w] == RED) {
                    color[w] = BLACK
                    color[p[x]] = RED
                    rotateRight(p[x])
                    w = left[p[x]]
                }
                if (color[left[w]] == BLACK && color[right[w]] == BLACK) {
                    color[w] = RED
                    x = p[x]
                } else {
                    if (color[left[w]] == BLACK) {
                        color[right[w]] = BLACK
                        color[w] = RED
                        rotateLeft(w)
                        w = left[p[x]]
                    }
                    color[w] = color[p[x]]
                    color[p[x]] = BLACK
                    color[left[w]] = BLACK
                    rotateRight(p[x])
                    x = root
                }
            }
        }
        color[x] = BLACK
    }

    private fun rotateLeft(x: Int) {
        val y = right[x]
        right[x] = left[y]
        if (left[y] != NULL) {
            p[left[y]] = x
        }
        p[y] = p[x]
        if (p[x] == NULL) {
            root = y
        } else {
            if (x == left[p[x]]) {
                left[p[x]] = y
            } else {
                right[p[x]] = y
            }
        }
        left[y] = x
        p[x] = y
    }

    private fun rotateRight(x: Int) {
        val y = left[x]
        left[x] = right[y]
        if (right[y] != NULL) {
            p[right[y]] = x
        }
        p[y] = p[x]
        if (p[x] == NULL) {
            root = y
        } else {
            if (x == right[p[x]]) {
                right[p[x]] = y
            } else {
                left[p[x]] = y
            }
        }
        right[y] = x
        p[x] = y
    }

    fun clear() {
        color[NULL] = BLACK
        size = 0
        root = NULL
    }

    private fun enlarge() {
        val newLength =
            Math.max(color.size + 1, (color.size * ENLARGE_SCALE).toInt())
        key = Arrays.copyOf(key, newLength)
        left = Arrays.copyOf(left, newLength)
        right = Arrays.copyOf(right, newLength)
        p = Arrays.copyOf(p, newLength)
        color = Arrays.copyOf(color, newLength)
    }

    private fun firstNode(): Int {
        var x = root
        while (left[x] != NULL) {
            x = left[x]
        }
        return x
    }

    private fun lastNode(): Int {
        var x = root
        while (right[x] != NULL) {
            x = right[x]
        }
        return x
    }

    /*C*/  /*C*/
    val first: Int
        get() {
            if (root == NULL) {
                returnedNull = true
                return DEFAULT_NULL_ELEMENT
            }
            val x = firstNode()
            returnedNull = false
            return key[x]
        }

    /*C*/  /*C*/
    val last: Int
        get() {
            if (root == NULL) {
                returnedNull = true
                return DEFAULT_NULL_ELEMENT
            }
            val x = lastNode()
            returnedNull = false
            return key[x]
        }

    /*C*/   fun  /*C*/removeFirst(): Int {
        if (root == NULL) {
            returnedNull = true
            return DEFAULT_NULL_ELEMENT
        }
        val x = firstNode()
        returnedNull = false
        val   /*C*/removedElement = key[x]
        removeNode(x)
        return removedElement
    }

    /*C*/   fun  /*C*/removeLast(): Int {
        if (root == NULL) {
            returnedNull = true
            return DEFAULT_NULL_ELEMENT
        }
        val x = lastNode()
        returnedNull = false
        val   /*C*/removedElement = key[x]
        removeNode(x)
        return removedElement
    }

    /*C*/   fun  /*C*/floor( /*C*/
        /*C*/element: Int
    ): Int {
        var x = root
        while (x != NULL) {
            if (element > key[x]) {
                if (right[x] != NULL) {
                    x = right[x]
                } else {
                    returnedNull = false
                    return key[x]
                }
            } else if (element < key[x]) {
                if (left[x] != NULL) {
                    x = left[x]
                } else {
                    var y = p[x]
                    while (y != NULL && x == left[y]) {
                        x = y
                        y = p[y]
                    }
                    return if (y == NULL) {
                        returnedNull = true
                        DEFAULT_NULL_ELEMENT
                    } else {
                        returnedNull = false
                        key[y]
                    }
                }
            } else {
                returnedNull = false
                return key[x]
            }
        }
        returnedNull = true
        return DEFAULT_NULL_ELEMENT
    }

    /*C*/   fun  /*C*/ceiling( /*C*/
        /*C*/element: Int
    ): Int {
        var x = root
        while (x != NULL) {
            if (element < key[x]) {
                if (left[x] != NULL) {
                    x = left[x]
                } else {
                    returnedNull = false
                    return key[x]
                }
            } else if (element > key[x]) {
                if (right[x] != NULL) {
                    x = right[x]
                } else {
                    var y = p[x]
                    while (y != NULL && x == right[y]) {
                        x = y
                        y = p[y]
                    }
                    return if (y == NULL) {
                        returnedNull = true
                        DEFAULT_NULL_ELEMENT
                    } else {
                        returnedNull = false
                        key[y]
                    }
                }
            } else {
                returnedNull = false
                return key[x]
            }
        }
        returnedNull = true
        return DEFAULT_NULL_ELEMENT
    }

    /*C*/   fun  /*C*/lower( /*C*/
        /*C*/element: Int
    ): Int {
        var x = root
        while (x != NULL) {
            if (element > key[x]) {
                if (right[x] != NULL) {
                    x = right[x]
                } else {
                    returnedNull = false
                    return key[x]
                }
            } else {
                if (left[x] != NULL) {
                    x = left[x]
                } else {
                    var y = p[x]
                    while (y != NULL && x == left[y]) {
                        x = y
                        y = p[y]
                    }
                    return if (y == NULL) {
                        returnedNull = true
                        DEFAULT_NULL_ELEMENT
                    } else {
                        returnedNull = false
                        key[y]
                    }
                }
            }
        }
        returnedNull = true
        return DEFAULT_NULL_ELEMENT
    }

    /*C*/   fun  /*C*/higher( /*C*/
        /*C*/element: Int
    ): Int {
        var x = root
        while (x != NULL) {
            if (element < key[x]) {
                if (left[x] != NULL) {
                    x = left[x]
                } else {
                    returnedNull = false
                    return key[x]
                }
            } else {
                if (right[x] != NULL) {
                    x = right[x]
                } else {
                    var y = p[x]
                    while (y != NULL && x == right[y]) {
                        x = y
                        y = p[y]
                    }
                    return if (y == NULL) {
                        returnedNull = true
                        DEFAULT_NULL_ELEMENT
                    } else {
                        returnedNull = false
                        key[y]
                    }
                }
            }
        }
        returnedNull = true
        return DEFAULT_NULL_ELEMENT
    }

    fun returnedNull(): Boolean {
        return returnedNull
    }

    override fun equals(o: Any?): Boolean {
        if (this === o) return true
        if (o == null || javaClass != o.javaClass) return false
        val that = o as _Ez_Int_TreeSet
        if (size != that.size) {
            return false
        }
        var x = firstNode()
        var y = that.firstNode()
        while (x != NULL) {
            if (key[x] != that.key[y]) {
                return false
            }
            x = successorNode(x)
            y = that.successorNode(y)
        }
        return true
    }

    override fun toString(): String {
        val sb = StringBuilder()
        sb.append('[')
        var x = firstNode()
        while (x != NULL) {
            if (sb.length > 1) {
                sb.append(", ")
            }
            sb.append(key[x])
            x = successorNode(x)
        }
        sb.append(']')
        return sb.toString()
    }

    private inner class _Ez_Int_TreeSetIterator constructor() : IntIterator() {
        private var x: Int
        override fun hasNext(): Boolean {
            return x != NULL
        }

        /*C*/   override fun  /*C*/nextInt(): Int {
            if (x == NULL) {
                throw NoSuchElementException("Iterator doesn't have more elements")
            }
            val   /*C*/result = key[x]
            x = successorNode(x)
            return result
        }

        init {
            x = firstNode()
        }
    }

    companion object {
        private const val DEFAULT_CAPACITY = 10
        private const val ENLARGE_SCALE = 2.0
        private const val HASHCODE_INITIAL_VALUE = -0x7ee3623b
        private const val HASHCODE_MULTIPLIER = 0x01000193
        private const val BLACK = false
        private const val RED = true
        private const val NULL = 0
        private  /*C*/ val   /*C*/DEFAULT_NULL_ELEMENT = IntArray(1)[0]
    }

    init {
        var capacity = capacity
        require(capacity >= 0) { "Capacity must be non-negative" }
        capacity++
        key = IntArray(capacity)
        left = IntArray(capacity)
        right = IntArray(capacity)
        p = IntArray(capacity)
        color = BooleanArray(capacity)
        color[NULL] = BLACK
        size = 0
        root = NULL
        returnedNull = false
    }
}

/** IO */
//@JvmField val INPUT = File("input.txt").inputStream()
//@JvmField val OUTPUT = File("output.txt").outputStream()
@JvmField val INPUT = System.`in`
@JvmField val OUTPUT = System.out

const val _BUFFER_SIZE = 1 shl 16
@JvmField val _buffer = ByteArray(_BUFFER_SIZE)
@JvmField var _bufferPt = 0
@JvmField var _bytesRead = 0

tailrec fun readChar(): Char {
    if(_bufferPt == _bytesRead) {
        _bufferPt = 0
        _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)
    }
    return if(_bytesRead < 0) Char.MIN_VALUE
    else {
        val c = _buffer[_bufferPt++].toChar()
        if (c == '\r') readChar()
        else c
    }
}

fun readLine(): String? {
    var c = readChar()
    return if(c == Char.MIN_VALUE) null
    else buildString {
        while(c != '\n' && c != Char.MIN_VALUE) {
            append(c)
            c = readChar()
        }
    }
}
fun readLn() = readLine()!!

fun read() = buildString {
    var c = readChar()
    while(c <= ' ') {
        if(c == Char.MIN_VALUE) return@buildString
        c = readChar()
    }
    do {
        append(c)
        c = readChar()
    } while(c > ' ')
}
fun readInt() = read().toInt()
fun readDouble() = read().toDouble()
fun readLong() = read().toLong()
fun readStrings(n: Int) = List(n) { read() }
fun readLines(n: Int) = List(n) { readLn() }
fun readInts(n: Int) = List(n) { read().toInt() }
fun readIntArray(n: Int) = IntArray(n) { read().toInt() }
fun readDoubles(n: Int) = List(n) { read().toDouble() }
fun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }
fun readLongs(n: Int) = List(n) { read().toLong() }
fun readLongArray(n: Int) = LongArray(n) { read().toLong() }

@JvmField val _writer = PrintWriter(OUTPUT, false)

/** shuffles and sort overrides to avoid quicksort attacks */
private inline fun <T> _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {
    // Fisher-Yates shuffle algorithm
    for (i in size - 1 downTo 1) {
        val j = rnd.nextInt(i + 1)
        val temp = get(i)
        set(i, get(j))
        set(j, temp)
    }
}

@JvmField var _random: Random? = null
val random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }

fun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)
fun IntArray.sort() { shuffle(); _sort() }
fun IntArray.sortDescending() { shuffle(); _sortDescending() }

fun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)
fun LongArray.sort() { shuffle(); _sort() }
fun LongArray.sortDescending() { shuffle(); _sortDescending() }

fun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)
fun DoubleArray.sort() { shuffle(); _sort() }
fun DoubleArray.sortDescending() { shuffle(); _sortDescending() }

fun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)
inline fun CharArray.sort() { _sort() }
inline fun CharArray.sortDescending() { _sortDescending() }

inline fun <T: Comparable<T>> Array<out T>.sort() = _sort()
inline fun <T: Comparable<T>> Array<out T>.sortDescending() = _sortDescending()
inline fun <T: Comparable<T>> MutableList<out T>.sort() = _sort()
inline fun <T: Comparable<T>> MutableList<out T>.sortDescending() = _sortDescending()

fun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }

/** additional commons */
inline fun <T> Iterable<T>.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }
inline fun <T> Sequence<T>.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }
inline fun <T> Array<T>.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }
fun IntArray.sumLong() = fold(0L, Long::plus)