Description

Assembly line
Input (Standard input)
In first line, the integer N is given, which means the number of station (1 ≤ N ≤ 100).
In second line, the two integers e1, e2 are given (1 ≤ ei ≤ 100).
In third line, the two integers x1, x2 are given.
In fourth line, the N integers a1,1, a1,2, … , a1,n are given (1 ≤ a1,j ≤ 100).
In fifth line, the N integers a2,1, a2,2, … , a2,n are given (1 ≤ a2,j ≤ 100). In sixth line, the N integers t1,1, t1,2, … , t1,n-1 are given (1 ≤ t1,j ≤ 100). In seventh line, the N integers t2,1, t2,2, … , t2,n-1 are given (1 ≤ t2,j ≤ 100).
Output (Standard output)
In first line, print the fastest assembly time.
If results of first line and second line are same, the first line must be selected.
In the next N line, print each process. Print with the output form given below:
Print the ith line’s jth station as ‘i j’, and print as increasing order of the station.

[Example]

Sample Input Sample Output
6
2 4
3 2
7 9 3 4 8 4
8 5 6 4 5 7
2 3 1 3 4
2 1 2 2 1 38
1 1
2 2
1 3
2 4
2 5
1 6

Description
1. File name must be Assembly_line.cpp
2. Make a comment of your student ID, name and class in the first line of the source code. ex) 2014601028_Honggildong_A
3. Please keep the source code that you have submitted for some unexpected accident.