solve the following in java please

Due to the outbreak of unknown virus in 2029 in the mountains of Timbet, all the monks at Senpou Temple are required to do physical checkups at losefka's Clinic. All checkups are scheduled on the same day. Each monk gets instructions in which he is given 1. his unique patient number from the set { 1 ... n} 2. the time of the day when he is supposed to show up at losefka's Clinic 3. a list of doctors' offices that he is to visit in the specified order Doctors' offices in losefka's Clinic are numbered with numbers from the set { 1 ... m}. Since a doctor can only check one monk at a time, if several people show up to a doctor's office at time t, they form a queue in increasing order of their numbers and join the end of the queue already formed by monks who arrived earlier. If at time t in front of office x there is a queue of people who arrived earlier or at time t, then the first monk from the queue enters offic x. This monk exits the office after one time unit and at time t+1 appears at the next office from his list of offices to visit. At that time the next person from the queue enters office x. If a monk was supposed to show up at the clinic at time t, then at time the shows up at the first doctors' office on his list. If a visit at office x at time t was for the given monk the last visit on his list, then at time t+1 this monk leaves the clinic. Your task is to find the time when the last monk leaves the losefka's Clinic. Input The first line of input contains 2 natural numbers n and m, 1