Description

Soon a school Olympiad in Informatics will be held in Berland, n schoolchildren will participate there.

At a meeting of the jury of the Olympiad it was decided that each of the n participants, depending on the results, will get a diploma of the first, second or third degree. Thus, each student will receive exactly one diploma.

They also decided that there must be given at least min₁ and at most max₁ diplomas of the first degree, at least min₂ and at most max₂ diplomas of the second degree, and at least min₃ and at most max₃ diplomas of the third degree.

After some discussion it was decided to choose from all the options of distributing diplomas satisfying these limitations the one that maximizes the number of participants who receive diplomas of the first degree. Of all these options they select the one which maximizes the number of the participants who receive diplomas of the second degree. If there are multiple of these options, they select the option that maximizes the number of diplomas of the third degree.

Choosing the best option of distributing certificates was entrusted to Ilya, one of the best programmers of Berland. However, he found more important things to do, so it is your task now to choose the best option of distributing of diplomas, based on the described limitations.

It is guaranteed that the described limitations are such that there is a way to choose such an option of distributing diplomas that all n participants of the Olympiad will receive a diploma of some degree.

Input

The first line of the input contains a single integer n (3 ≤ n ≤ 3·10⁶) — the number of schoolchildren who will participate in the Olympiad.

The next line of the input contains two integers min₁ and max₁ (1 ≤ min₁ ≤ max₁ ≤ 10⁶) — the minimum and maximum limits on the number of diplomas of the first degree that can be distributed.

The third line of the input contains two integers min₂ and max₂ (1 ≤ min₂ ≤ max₂ ≤ 10⁶) — the minimum and maximum limits on the number of diplomas of the second degree that can be distributed.

The next line of the input contains two integers min₃ and max₃ (1 ≤ min₃ ≤ max₃ ≤ 10⁶) — the minimum and maximum limits on the number of diplomas of the third degree that can be distributed.

It is guaranteed that min₁ + min₂ + min₃ ≤ n ≤ max₁ + max₂ + max₃.

Output

In the first line of the output print three numbers, showing how many diplomas of the first, second and third degree will be given to students in the optimal variant of distributing diplomas.

The optimal variant of distributing diplomas is the one that maximizes the number of students who receive diplomas of the first degree. Of all the suitable options, the best one is the one which maximizes the number of participants who receive diplomas of the second degree. If there are several of these options, the best one is the one that maximizes the number of diplomas of the third degree.

Sample Input

Input

6 1 5 2 6 3 7

Output

1 2 3

Input

10 1 2 1 3 1 5

Output

2 3 5

Input

6 1 3 2 2 2 2

Output

2 2 2

#include 
        
         #include 
         
          int main(){    int x,y,n,a[10],b[10];    scanf("%d",&n);    for(int i=1;i<=3;i++)    {        scanf("%d%d",&a[i],&b[i]);    }    if(n-a[2]-a[3]>b[1])    {        x=b[1];//先保证二三等奖最小值，用n减得一等奖最大值；    }    else        x=n-a[2]-a[3];    n=n-x;    if(n-a[3]>b[2])    {        y=b[2];//先保证三等奖最小值，用剩余的数减得二等奖最大值；    }    else        y=n-a[3];    printf("%d %d %d\n",x,y,n-y);    return 0;}