#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<cstdlib>
#define MAX_OF_ST 100
void traceRoute(bool from1, int l1[], int l2[],int n, int Route[])
{
for (int i = n - 1; i >= 1; --i) {
Route[i] = from1 ? 1 : 2;
if (from1)
from1 = l1[i] == 1;
else
from1 = l2[i] == 1;
}
Route[0] = from1 ? 1 : 2;
return;
}
int main(void)
{
int ret, n;
while ((ret = scanf("%d", &n)) == 1 && ret != EOF) {
int a1[MAX_OF_ST],
t1[MAX_OF_ST],
a2[MAX_OF_ST],
t2[MAX_OF_ST];
//input param.
int e1, x1, e2, x2;
scanf("%d%d%d%d", &e1, &x1, &e2, &x2);
//input table.
for (int i = 0; i < n; ++i)
scanf("%d", &a1[i]);
for (int i = 0; i < n-1; ++i)
scanf("%d", &t1[i]);
for (int i = 0; i < n; ++i)
scanf("%d", &a2[i]);
for (int i = 0; i < n-1; ++i)
scanf("%d", &t2[i]);
//dp and find ways, record ways by recording which line cars come from.
int f1[MAX_OF_ST], f2[MAX_OF_ST];
int l1[MAX_OF_ST], l2[MAX_OF_ST];
f1[0] = e1 + a1[0];
f2[0] = e2 + a2[0];
for (int i = 1; i < n; ++i)
{
//nf1.
if (f1[i - 1] + a1[i] <= f2[i - 1] + t2[i - 1] + a1[i]) {
f1[i] = f1[i - 1] + a1[i];
l1[i] = 1;
}
else {
f1[i] = f2[i - 1] + t2[i - 1] + a1[i];
l1[i] = 2;
}
//nf2.
if (f2[i - 1] + a2[i] <= f1[i - 1] + t1[i - 1] + a2[i]) {
f2[i] = f2[i - 1] + a2[i];
l2[i] = 2;
}
else{
f2[i] = f1[i - 1] + t1[i - 1] + a2[i];
l2[i] = 1;
}
}
int minT1 = f1[n - 1] + x1,
minT2 = f2[n - 1] + x2;
//show the result.
int Route[MAX_OF_ST];
if (minT1 <= minT2){
printf("The minimum time used: %d\n", minT1);
traceRoute(true, l1, l2, n, Route);
}
else {
printf("The minimum time used: %d\n", minT2);
traceRoute(false, l1, l2, n, Route);
}//output minimum time and trace route.
printf("debug.\n");
for (int i = 1; i < n; i++)
printf("%d ", l1[i]);
putchar('\n');
for (int i = 1; i < n; ++i)
printf("%d ", l2[i]);
putchar('\n');
for (int i = 0; i < n; ++i){
printf("Line: %d, Station: %d.\n", Route[i], i + 1);
}//output route.
}
system("pause");
return 0;
}