10183_JobProcessing

A factory is running a production line that requires two operations to be performed on each job: first operation "A" then operation "B". Only a certain number of machines are capable of performing each operation.

Figure 1 shows the organization of the production line that works as follows. A type "A" machine takes a job from the input container, performs operation "A" and puts the job into the intermediate container. A type "B" machine takes a job from the intermediate container, performs operation "B" and puts the job into the output container. All machines can work in parallel and independently of each other, and the size of each container is unlimited. The machines have different performance characteristics, a given machine requires a given processing time for its operation.

Give the earliest time operation "A" can be completed for all N jobs provided that the jobs are available at time 0. Compute the minimal amount of time that is necessary to perform both operations (successively, of course) on all N jobs.

Multiple test cases. For each case:

Line 1:   Three space-separated integers:

• N, the number of jobs (1 ≤ N ≤ 1000).

• M₁, the number of type "A" machines (1 ≤ M₁ ≤ 30)

• M₂, the number of type "B" machines (1 ≤ M₂ ≤ 30)

Line 2..etc: M₁ integers that are the job processing times of each type "A" machine (1..20) followed by M₂ integers, the job processing times of each type "B" machine (1..20).

For each case, output a single line containing two integers: the minimum time to perform all "A" tasks and the minimum time to perform all "B" tasks (which require "A" tasks, of course).

5 2 3
1 1 3 1 4

3 5