After receiving advertisements from local restaurants, María decides to spend the afternoon doing her favorite hobby: removing unwanted advertisements from mailboxes. For this reason, she decides to go with a group of friends to Badajoz to eliminate the spam mail. The location of the mailboxes can be modeled as a one-dimensional line. The mailboxes are located at positions $$$l_i$$$, while María's friends are initially at positions $$$p_i$$$. Every second, María's friends can move one unit to the right or to the left. If their position coincides with that of a mailbox, they can instantly remove the advertisement from that mailbox. Your goal is to find the minimum time that María and her friends need to remove all the advertisements if they distribute the work optimally. At the same time, there can be two people in the same position, and there can also be more than one mailbox at the same position.

Case 1: $$$n = 1$$$, $$$1 \leq m \leq 10^5$$$, $$$0 \leq l_i, p_i \leq 10^{18}$$$ (7 points)

Case 2: $$$1 \leq n \leq 10^5$$$, $$$m = 1$$$, $$$0 \leq l_i, p_i \leq 10^{18}$$$ (12 points)

Case 3: $$$1 \leq n \leq 20$$$, $$$1 \leq m \leq 20$$$, $$$0 \leq l_i, p_i \leq 10^9$$$ (21 points)

Case 4: $$$1 \leq n \leq 500$$$, $$$1 \leq m \leq 500$$$, $$$0 \leq l_i, p_i \leq 10^9$$$ (26 points)

Case 5: $$$1 \leq n \leq 10^5$$$, $$$1 \leq m \leq 10^5$$$, $$$0 \leq l_i, p_i \leq 10^{18}$$$ (34 points)