Given a list of intervals `calendar` and a number of available conference `rooms`. For each query, return `true` if the meeting can be added to the calendar successfully without causing a conflict, otherwise `false`. A conference room can only hold one meeting at a time.\n\n**Example 1:**\n```\nInput: calendar = [[1, 2], [4, 5], [8, 10]], rooms = 1, queries = [[2, 3], [3, 4]]\nOutput: [true, true]\n```\n\n**Example 2:**\n```\nInput: calendar = [[1, 2], [4, 5], [8, 10]], rooms = 1, queries = [[4, 5], [5, 6]]\nOutput: [false, true]\n```\n\n**Example 3:**\n```\nInput:\ncalendar = [[1, 3], [4, 6], [6, 8], [9, 11], [6, 9], [1, 3], [4, 10]]\nrooms = 3\nqueries = [[1, 9], [2, 6], [7, 9], [3, 5], [3, 9], [2, 4], [7, 10], [5, 9], [3, 10], [9, 10]]\nOutput: [false, true, false, true, false, true, false, false, false, true]\n```\n\n----\nRelated problems:\n* https://leetcode.com/problems/meeting-rooms-ii/

Given a list of intervals calendar and a number of available conference rooms. For each query, return true if the meeting can be added to the calendar successfu