D. Dasha and Very Difficult Problem

D. Dasha and Very Difficult Problem

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Dasha logged into the system and began to solve problems. One of them is as follows:

Given two sequences a and b of length n each you need to write a sequence c of length n, the i-th element of which is calculated as follows: ci = bi - ai.

About sequences a and b we know that their elements are in the range from l to r. More formally, elements satisfy the following conditions: l ≤ ai ≤ r and l ≤ bi ≤ r. About sequence c we know that all its elements are distinct.

Dasha wrote a solution to that problem quickly, but checking her work on the standard test was not so easy. Due to an error in the test system only the sequence a and the compressed sequence of the sequence c were known from that test.

Let's give the definition to a compressed sequence. A compressed sequence of sequence c of length n is a sequence p of length n, so that pi equals to the number of integers which are less than or equal to ci in the sequence c. For example, for the sequence c = [250, 200, 300, 100, 50] the compressed sequence will be p = [4, 3, 5, 2, 1]. Pay attention that in c all integers are distinct. Consequently, the compressed sequence contains all integers from 1 to n inclusively.

Help Dasha to find any sequence b for which the calculated compressed sequence of sequence c is correct.

Input

The first line contains three integers n, l, r (1 ≤ n ≤ 105, 1 ≤ l ≤ r ≤ 109) — the length of the sequence and boundaries of the segment where the elements of sequences a and b are.

The next line contains n integers a1,  a2,  ...,  an (l ≤ ai ≤ r) — the elements of the sequence a.

The next line contains n distinct integers p1,  p2,  ...,  pn (1 ≤ pi ≤ n) — the compressed sequence of the sequence c.

Output

If there is no the suitable sequence b, then in the only line print "-1".

Otherwise, in the only line print n integers — the elements of any suitable sequence b.

Examples

input

5 1 5
1 1 1 1 1
3 1 5 4 2

output

3 1 5 4 2 

input

4 2 9
3 4 8 9
3 2 1 4

output

2 2 2 9 

input

6 1 5
1 1 1 1 1 1
2 3 5 4 1 6

output

-1

Note

Sequence b which was found in the second sample is suitable, because calculated sequence c = [2 - 3, 2 - 4, 2 - 8, 9 - 9] = [ - 1,  - 2,  - 6, 0] (note that ci = bi - ai) has compressed sequence equals to p = [3, 2, 1, 4].

题意：给你一个序列a和c的相对大小的序列p让你求出符合条件的序列b。其中存在关系c[i]=b[i]-a[i]。于是我们可以得到b[i]=a[i]+c[i],然后我们知道p是c相对大小序列。那么我们可以得到b[i]=a[i]+p[i]+k。

然后我们一开始得到的b[i]就是a[i]+p[i]，如果当前的b[i]的区间长度超过了lr的区间长度，那么你的k怎么找都是找不到合适的值的，因为我们在加k的过程中实质上就是移动区间。

如果长度比lr的区间小，那么我们把它移动到区间lr里面就可以了。

#include <bits/stdc++.h>
using namespace std;
const int MAXN=1e5+7;
const int inf =0x3f3f3f3f;
int n,m,l,r;
int a[MAXN],p[MAXN],b[MAXN];

int main()
{
    int i;
    scanf("%d%d%d",&n,&l,&r);
    for(i=0; i<n; ++i)scanf("%d",&a[i]);
    int MAX=0,MIN=inf;
    for(i=0; i<n; ++i)
    {
        scanf("%d",&p[i]);
        b[i]=a[i]+p[i];
        MAX=max(MAX,b[i]);
        MIN=min(MIN,b[i]);
    }
    if(MAX-MIN+1>r-l+1)puts("-1");
    else
    {
        int x;
        if(MIN<l)x=l-MIN;
        else x=r-MAX;
        for(i=0; i<n; ++i)
        {
            b[i]+=x;
        }
        for(i=0; i<n; ++i)printf(i==n-1?"%d\n":"%d ",b[i]);
    }
    return 0;
}