using System;

public class Program

{

    public static void Main()

    {

        int[] x = new int []{0, 0, 0, 1, 1, 1};

        int[] x1 = new int[]{1, 1, 1, 1, 1, 1};

        int[] x2 = new int[]{0, 1, 1, 1, 1, 1};

        int[][] nums = new int[][] 

        {

        x,

        x1, 

        x2

        };

        Console.WriteLine(countOnes(nums));

        Console.WriteLine(getFirstOne(x));

    }

    public static int countOnes(int[][] nums)

    {

        // Error Checking

        if(nums == null)

            return -1;

        // for each row 

            // perform binary search to find first occurence of 1

            // calc count and add to sum

        int count = 0;

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

        {

            int firstOccurence = getFirstOne(nums[i]);

            if(firstOccurence < 0)

                continue;

            int numOnesInRow = nums[0].Length - firstOccurence;

            count += numOnesInRow;

        }

        return count; 

    }

    public static int getFirstOne(int[] nums)

    {

        int start = 0;

        int end = nums.Length - 1;

        while(start < end)

        {

        int mid = start + (end - start)/2;

        if(nums[mid] != 1)

            start = mid + 1;

        else

        {

            end = mid; // This is fine bc of way mid formula floors, dont need ans var. If this were start, wed need answer var or round up mid formula 

        }       

    }

        return start;

    }

}