using System;

public class Program

{

    public static void Main()

    {

        try

        {

​

        int N,K,L;

        int temp=0;

            int[] A = new int[8]{6,1,4,6,3,2,7,4};

        Console.WriteLine("Enter the total no of trees");

        N= Convert.ToInt32( Console.ReadLine());

            Console.WriteLine("Enter K Value");

            K=Convert.ToInt32(Console.ReadLine());

            Console.WriteLine("Enter L Value");

            L=Convert.ToInt32(Console.ReadLine());

            if((L+K)>N)

            {

                Console.WriteLine("Invalid -1");

                return;

            }

            if((L+K) ==N)

            {

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

                {

                    temp=temp+A[i];

                }

                Console.WriteLine("Maximum apples collected by K and L "+ temp);

                return;

            }

            int mk=0,mtemp=0,mkindex=0;

            for(int i =0;i<=N-K;i++)

            {

                mtemp =0;

                for(int j=i;j<i+K;j++)

                    {

                        mtemp=mtemp+A[j];

                    }

                if(mtemp>mk)

                    {

                    mk=mtemp;

                    mkindex=i;

                    }

            }

            Console.WriteLine("Maximum apples coollected by k"+mk);

            Console.WriteLine("mkindex"+mkindex);

            int ml=0,ltemp=0,mlindex=0;

            if(L<= mkindex)

            {

                for(int i=0;i<=mkindex-L;i++)

                {

                    ltemp=0;

                    for(int j=i;j<i+L;j++)

                    {

                        ltemp=ltemp+A[j];

                    }

                    if(ltemp>ml)

                    {

                        ml=ltemp;

                        mlindex=i;

                    }

                }

            }

            int tmpval=N-(mkindex+K);

            int tmpval1=mkindex+K;

            if(L <= tmpval)

            {

                for(int i=tmpval1;i<=N-L;i++)

                {

                    ltemp=0;

                    for(int j=i;j<i+L;j++)

                    {

                        ltemp = ltemp+A[j];

                    }

                    if(ltemp>ml)

                    {

                        ml=ltemp;

                        mlindex=i;

                    }

                }

            }

            Console.WriteLine("Maximum apples collected by L"+ml);

            Console.WriteLine("mlindex"+mlindex);

            Console.WriteLine("Maximum apples collected by K and L"+(mk+ml));

        }

        catch(Exception ex)

        {

            Console.WriteLine("Invalid input"+ex.ToString());

        }

    }

}