using System;

//using System.Collections.Generic;

​

namespace ConsoleApp3

{

    class Dispencer {

        public int litters_left;

        public string name;

        public int next_available_time;

        public Dispencer(int _litters_left, string _name, int _next_available_time)

        {

            litters_left = _litters_left;

            name = _name;

            next_available_time = _next_available_time;

        }

        public bool CanServerCar(int car_litters){

            return (next_available_time == 0 && car_litters <= litters_left);

        }

    }

​

    class Program

    {   

        public static int solution1(int[] A, int X, int Y, int Z){

            int total_time = X + Y + Z; // max possible time to wait

            Dispencer x = new Dispencer(X, "X", 0);

            Dispencer y = new Dispencer(Y, "Y", 0);

            Dispencer z = new Dispencer(Z, "Z", 0);

            int sec_passed = 0;

            int car_idx = 0;

            while(sec_passed < total_time && car_idx < A.Length){

                // check if some dispencers have finished and are now free

                if (sec_passed > 0){                    

                    if (x.next_available_time == sec_passed){

                        x.next_available_time = 0;

                    }

                    if (y.next_available_time == sec_passed){

                        y.next_available_time = 0;

                    }

                    if (z.next_available_time == sec_passed){

                        z.next_available_time = 0;

                    }

                }

                if (x.CanServerCar(A[car_idx])){ // X pump is free and can fuel the car

                    x.next_available_time = sec_passed + A[car_idx];

                    x.litters_left -= A[car_idx];

                    car_idx++;

                }

                else

                {           

                    if (y.CanServerCar(A[car_idx])){ // Y pump is free and can fuel the car

                        y.next_available_time = sec_passed + A[car_idx];

                        y.litters_left -= A[car_idx];

                        car_idx++;

                    }

                    else 

                    {                                       

                        if (z.CanServerCar(A[car_idx])){ // Z pump is free and can fuel the car

                            z.next_available_time = sec_passed + A[car_idx];

                            z.litters_left -= A[car_idx];

                            car_idx++;

                        }

                        else {

                            // all dispencer are occupied at the moment

                        }

                    }   

                }

                sec_passed++; // one seccond has passed

            }       

            if (car_idx == 0){ // all cars were unable to refuel                

                return -1;

            }

            return sec_passed - A[A.Length-1]; // without the time that took to fuel the last car

        }

​

        static void Main(string[] args)

        {

            Console.WriteLine("Hello World!");

            Console.WriteLine(solution1(new int[] { 2, 8, 4, 3, 2 }, 7, 11, 3));        

            /**int[] arr = solution(new int[] { 3, 8, 9, 7, 6 }, 3);

            Console.WriteLine("[{0}]", string.Join(", ", arr));

            arr = solution(new int[] { 1, 2, 3, 4 }, 4);

            Console.WriteLine("[{0}]", string.Join(", ", arr));

            arr = solution(new int[] { 1, 2, 3, 4 }, 16);

            Console.WriteLine("[{0}]", string.Join(", ", arr));

            arr = solution(new int[] { 3, 8, 9, 7, 6 }, 1);

            Console.WriteLine("[{0}]", string.Join(", ", arr));

            arr = solution(new int[] { 3, 8, 9, 7, 6 }, 20);

            Console.WriteLine("[{0}]", string.Join(", ", arr));**/

        }

        public static int[] solution(int[] A, int K)

        {

            int N = A.Length;

            int[] result = new int[N];

            if (K % N == 0) // elements remain in their original locations

            {

                result = A;         

            }

            else

            {

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

                {

                    int new_idx = (i + K) % N;

                    result[new_idx] = A[i];                     

                }   

            }

            return result;      

        }

    }

}

​