Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible. Output FormatFor each query, output one line containing the length of the last movie Richie watches, without the credits, given the strategy described in the problem statement. If Richie can't watch any movie, output -1.Sample Input 08148 116157 100169 15188 9891 68165 70145 211 632 6 52 122 6 13 70 4 2 3Sample Output 090154-1 The actual coden = int(input())movies = []for i in range(n): r,c = list(map(int,input().rstrip().split(" "))) movies.append([r,c])q = int(input())for cc in range(q): s,e,a,k = list(map(int,input().rstrip().split(" "))) # solve for answer here Richie likes to watch movies at the local cineplex. Pretty much all his savings go to movies. His only complaintwith the universe right now seems to be that there simply aren't enough hours in a day watch, like, 107movies in one day for example. That all changed the day Richie found the Monkey's Paw.Richie was sitting in the park when the Monkey's Paw spoke in a low voice."You have three wishes."He looked around and saw it on the ground beside him. Perplexed he picked it up."What did you say?" Richie asked."Three wishes," The Paw replied."I wish for more wishes," Richie said, obviously."I see you are not pure of heart," The Paw replied angrily. "Any mortal who is greedy enough to wish for morewishes wastes one wish. You now have two...""Okay, okay... ummm... I wish the day was long enough to show a lot of movies...""Hmmm... define 'a lot'.""Like N movies maybe?""Done!" The Paw said, and Richie felt tomorrow was going to be a long day. "Tomorrow will last as long as Nmovies. You have one wish left.""I want to be able to stay awake to watch all of them!""Done. Our contract is sealed. Enjoy tomorrow."And at that, the Monkey's Paw crumbled to dust. It was getting late so Richie went home to get rested fortomorrow's Ultimate Movie Marathon.The next day, Richie went to the ticket counter at the cineplex. There were a lot of movies showing that day.Richie went to the counter and said "I'd like a ticket for all the movies please.""That will be K pesos per ticket." "Crap," Richie thought. He didn't wish for enough money. In fact, he only hadA pesos. "Okay... okay... let's improvise.""All the movies have the same ticket price?" Richie asked. "Yes, sir!" "I'll buy the tickets for the longest moviethen!" "I can't find that for you sir. You have to tell me the title." "You don't have a database?" "Nope. Here's alist."She hands him a list. To save time, Richie rips out a range of movies then picks the longest movie in thatrange. Richie proceeds to do this until he's out of money, only picking movies from the range he ripped out tosave time.Basically, given N films each with their runtimes, you must answer queries. For each query, you are given a non-empty range of indices, Richie budget A and the price per ticket K. Richiekeeps watching the longest film he hasn't seen yet, spending K pesos per ticket, until his A pesos areinsufficient to buy another ticket. For each query, please print the runtime of the last film Richie is able to see.You can assume that the Monkey's Paw made it so that all the movies showing have not been watched byRichie before.Input FormatInput starts with a line containing a single integer N denoting the number of movies showing in the theater.N lines follow, the ith of which contains two space-separated integers R and C. R is the runtime of thefilm. C'; is the length of the credits. Richie always leaves before the credits, so you can subtract the creditsfrom the runtime when computing for the answer.This is followed by a line containing a single integer Q denoting the number of queries.Qlines follow, each containing 4 space-separated integers S. E. A. and K denoting the start index, endindex, Richie's budget, and the cost of a single ticket respectively. Indices are 0-based.Constraints1≤N≤ 1061 ≤ C;

Question

Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible. Output FormatFor each query, output one line containing the length of the last movie Richie watches, without the credits, given the strategy described in the problem statement. If Richie can't watch any movie, output -1.Sample Input 08148 116157 100169 15188 9891 68165 70145 211 632 6 52 122 6 13 70 4 2 3Sample Output 090154-1 The actual coden = int(input())movies = []for i in range(n):    r,c = list(map(int,input().rstrip().split(&#34; &#34;)))    movies.append([r,c])q = int(input())for cc in range(q):    s,e,a,k = list(map(int,input().rstrip().split(&#34; &#34;)))    # solve for answer here Richie likes to watch movies at the local cineplex. Pretty much all his savings go to movies. His only complaintwith the universe right now seems to be that there simply aren't enough hours in a day watch, like, 107movies in one day for example. That all changed the day Richie found the Monkey's Paw.Richie was sitting in the park when the Monkey's Paw spoke in a low voice.&#34;You have three wishes.&#34;He looked around and saw it on the ground beside him. Perplexed he picked it up.&#34;What did you say?&#34; Richie asked.&#34;Three wishes,&#34; The Paw replied.&#34;I wish for more wishes,&#34; Richie said, obviously.&#34;I see you are not pure of heart,&#34; The Paw replied angrily. &#34;Any mortal who is greedy enough to wish for morewishes wastes one wish. You now have two...&#34;&#34;Okay, okay... ummm... I wish the day was long enough to show a lot of movies...&#34;&#34;Hmmm... define 'a lot'.&#34;&#34;Like N movies maybe?&#34;&#34;Done!&#34; The Paw said, and Richie felt tomorrow was going to be a long day. &#34;Tomorrow will last as long as Nmovies. You have one wish left.&#34;&#34;I want to be able to stay awake to watch all of them!&#34;&#34;Done. Our contract is sealed. Enjoy tomorrow.&#34;And at that, the Monkey's Paw crumbled to dust. It was getting late so Richie went home to get rested fortomorrow's Ultimate Movie Marathon.The next day, Richie went to the ticket counter at the cineplex. There were a lot of movies showing that day.Richie went to the counter and said &#34;I'd like a ticket for all the movies please.&#34;&#34;That will be K pesos per ticket.&#34; &#34;Crap,&#34; Richie thought. He didn't wish for enough money. In fact, he only hadA pesos. &#34;Okay... okay... let's improvise.&#34;&#34;All the movies have the same ticket price?&#34; Richie asked. &#34;Yes, sir!&#34; &#34;I'll buy the tickets for the longest moviethen!&#34; &#34;I can't find that for you sir. You have to tell me the title.&#34; &#34;You don't have a database?&#34; &#34;Nope. Here's alist.&#34;She hands him a list. To save time, Richie rips out a range of movies then picks the longest movie in thatrange. Richie proceeds to do this until he's out of money, only picking movies from the range he ripped out tosave time.Basically, given N films each with their runtimes, you must answer queries. For each query, you are given a non-empty range of indices, Richie budget A and the price per ticket K. Richiekeeps watching the longest film he hasn't seen yet, spending K pesos per ticket, until his A pesos areinsufficient to buy another ticket. For each query, please print the runtime of the last film Richie is able to see.You can assume that the Monkey's Paw made it so that all the movies showing have not been watched byRichie before.Input FormatInput starts with a line containing a single integer N denoting the number of movies showing in the theater.N lines follow, the ith of which contains two space-separated integers R and C. R is the runtime of thefilm. C'; is the length of the credits. Richie always leaves before the credits, so you can subtract the creditsfrom the runtime when computing for the answer.This is followed by a line containing a single integer Q denoting the number of queries.Qlines follow, each containing 4 space-separated integers S. E. A. and K denoting the start index, endindex, Richie's budget, and the cost of a single ticket respectively. Indices are 0-based.Constraints1≤N≤ 1061 ≤ C;

Accepted Answer

For each query, slice the movie list to a temp list.
Subtract the price of the movie from the total…