#include <bits/stdc++.h>
using namespace std;
int n, l, r;
int *a;
int *c;
int *p;
void solve() {
  for (int i = 0; i < n; i++) {
    if (c[i] > r) {
      cout << -1;
      return;
    }
  }
  for (int i = 0; i < n; i++) cout << c[i] << " ";
}
int main() {
  cin >> n >> l >> r;
  a = new int[n];
  c = new int[n];
  p = new int[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) cin >> p[i];
  for (int i = 0; i < n; i++) c[i] = a[i] + p[i];
  int minimal = c[0];
  for (int i = 1; i < n; i++) minimal = min(minimal, c[i]);
  int delta = minimal - l;
  for (int i = 0; i < n; i++) c[i] -= delta;
  solve();
  return 0;
}
