#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
const int N = 2e3;
int hd[N], to[N * N], nxt[N * N], num = 0;
void add(int x, int y) {
    num++;
    to[num] = y;
    nxt[num] = hd[x];
    hd[x] = num;
}
int a[N], b[N], w[N], dis[N];
bool vis[N];
int main() {
    freopen("tioj_communication.in", "r", stdin);
    freopen("tioj_communication.out", "w", stdout);
    int n, l, r;
    cin >> n >> l >> r;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> w[i];
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (a[i] + b[j] >= l && a[i] + b[j] <= r) {
                add(i, j);
            }
        }
    }
    memset(dis, 0x3f, sizeof(dis));
    dis[1] = w[1];
    priority_queue<pair<int, int>> p;
    p.push(make_pair(-w[1], 1));
    while (!p.empty()) {
        int u = p.top().second;
        p.pop();
        if (vis[u]) continue;
        vis[u] = 1;
        for (int i = hd[u]; i; i = nxt[i]) {
            int v = to[i];
            if (dis[v] > dis[u] + w[v]) {
                dis[v] = dis[u] + w[v];
                p.push(make_pair(-dis[v], v));
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        if (dis[i] >= 0x3f3f3f3f)
            cout << "-1 ";
        else
            cout << dis[i] << " ";
    }
    return 0;
}