René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Mirko at construction site (python,cpp,java)","articleBody":"Mirko is monitoring a construction site. He monitors  buildings enumerated from  to , starting from the left. For each building, he knows the current number of floors and the number of floors built on each day. He needs to know the answer to  queries. The answer to each query is the index of the tallest building after  days, as defined by the query. Your task is to help Mirko find the answers to these queries.\r\n\r\nInput Format\r\n\r\nThe first line consists of the numbers  and . The second line consists of  integers, where the  integer represents the initial height of the  building. The third line consists of  integers, where the  integer represents the number of floors erected in one day for the  building. The following  lines consist of the integer, , representing the day in the query.\r\n\r\nOutput Format\r\n\r\nFor each query, output one number which represents the index of the tallest building after  days. If there is more than one building, output the building with the greatest index in the input array (with indexes starting at 1).\r\n\r\nConstraints:\r\n-\u003e   1\u003c= N\u003c= 10^5\r\n-\u003e   1\u003c= Q\u003c= 10^5\r\n\r\nEvery other integer in the input will fit in a 32-bit signed integer. And they will be non-negative integers.\r\nSample Input\r\n\r\n3 6\r\n7 5 1\r\n1 2 3\r\n0\r\n1\r\n2\r\n3\r\n4\r\n5\r\nSample Output\r\n\r\n1\r\n1\r\n2\r\n2\r\n3\r\n3  ","author":{"url":"https://github.com/ArmanKumar21","@type":"Person","name":"ArmanKumar21"},"datePublished":"2022-10-15T07:37:35.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":8},"url":"https://github.com/109/python-cpp-html-programs-projects/issues/109"}