using System;

public class Program

{

    public static void Main()

    {

    //  int N = Int32.Parse(Console.ReadLine());

        int K = 3;//Int32.Parse(Console.ReadLine());

        int[] array = { 1, 4, 1, 5, 2, 4, 6, 7, 5, 8 };//new int[N];

        /*for (int i = 0; i < N; i++)

        {

            array[i] = Int32.Parse(Console.ReadLine());

        }*/

        int bestSum = 0;

        for (int i = 0; i < array.Length; i++)

        {

            int sum = 0;

            for (int j = i; j <= i + K-1 && j < array.Length; j++)

            {

                sum = array[j] + sum;

            }

            Console.WriteLine(sum);

            if (sum > bestSum)

            {

                bestSum = sum;

            }

        //  Console.WriteLine(bestSum);

        }

    //  Console.Write(bestSum);

    }

}

​

/*Write a program, which reads from the console two integer numbers N

and K (K<N) and array of N integers. Find those K consecutive

elements in the array, which have maximal sum.*/