Given a binary array and an integer k, find the position of zeroes flipping which creates maximum number of consecutive 1s in array.\n\n**Example 1:**\n```\nInput: arr = [1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1], m = 2\nOutput: [5, 7]\nExplanation:\nWe are allowed to flip maximum 2 zeroes. If we flip arr[5] and arr[7], we get 8 consecutive 1\'s which is\nmaximum possible under given constraints \n```\n\n**Example 2:**\n```\nInput: arr = [1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1], m = 1\nOutput: [7]\n```\n\n**Example 3:**\n```\nInput: arr = [0, 0, 0, 1], m = 4\nOutput: [0, 1, 2]\n```\n\nRelated questions:\n* https://leetcode.com/problems/max-consecutive-ones-iii

Given a binary array and an integer k, find the position of zeroes flipping which creates maximum number of consecutive 1s in array.\n\nExample 1:\n\nInput: arr