#include <bits/stdc++.h>
using namespace std;
long long int expo_fast(long long int a, long long int b) {
  a = a;
  long long int result = 1;
  while (b) {
    if (b & 1) result = (result * a);
    b >>= 1;
    a = (a * a);
  }
  return (result);
}
void take_in(vector<long long int>* arr) {
  for (int i = 0; i < arr->size(); i++) cin >> (*(arr))[i];
}
void disp_arr(vector<long long int>* arr) {
  for (int i = 0; i < arr->size(); i++) cout << (*(arr))[i] << " ";
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, l, r;
  cin >> n >> l >> r;
  vector<long long int> a(n), cmp(n);
  take_in(&a);
  take_in(&cmp);
  vector<pair<long long int, int>> help(n);
  for (int i = 0; i < n; i++) {
    help[i] = make_pair(cmp[i], i);
  }
  sort(help.begin(), help.end());
  vector<long long int> ans_arr(n);
  long long int prev = LLONG_MIN;
  bool f = true;
  for (int i = 0; i < n; i++) {
    long long int lb = l, ub = r, ans = -1;
    while (lb <= ub) {
      long long int mid = (lb + ub) / 2;
      if (mid - a[help[i].second] > prev) {
        ans = mid;
        ub = mid - 1;
      } else
        lb = mid + 1;
    }
    if (ans == -1) {
      f = false;
      break;
    }
    prev = ans - a[help[i].second];
    ans_arr[help[i].second] = ans;
  }
  if (f)
    for (long long int x : ans_arr) cout << x << " ";
  else
    cout << -1;
}
