#include <bits/stdc++.h>
#ifdef SHARAELONG
#include "../../cpp-header/debug.hpp"
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

void solve() {
    int n, w, l;
    cin >> n >> w >> l;
    // bool swapped = false;
    // if (w < l) {
    //     swap(w, l);
    //     swapped = true;
    // }
    vector<int> arr(n);
    for (int& r: arr) cin >> r;
    sort(arr.rbegin(), arr.rend());

    int h = 0;
    vector<pii> ans;
    int cur = 0;
    while (cur < n) {
        int R = arr[cur];
        int accum = R;
        ans.push_back({ 0, h });
        cur++;
        while (cur < n && accum + arr[cur] <= w) {
            int x = accum + arr[cur];
            int y = h + arr[cur];
            ans.push_back({ x, h });
            accum += 2*arr[cur];
            cur++;
            while (cur < n && y + 2*arr[cur] <= min(l, h+R)) {
                ans.push_back({ x, y+arr[cur] });
                y += 2*arr[cur];
                cur++;
            }
        }
        if (cur < n) h += R + arr[cur];
    }

    for (int i=0; i<n; ++i) {
        for (int j=i+1; j<n; ++j) {
            auto[x1, y1] = ans[i];
            auto[x2, y2] = ans[j];
            ll dsq = (ll)(x1-x2)*(x1-x2) + (ll)(y1-y2)*(y1-y2);
            assert(dsq >= (ll)(arr[i]+arr[j])*(arr[i]+arr[j]));
        }
    }
    for (int i=0; i<n; ++i) {
        auto[x, y] = ans[i];
        assert(0 <= x && x <= w && 0 <= y && y <= l);
        // if (swapped) swap(x, y);
        cout << x << ' ' << y;
        if (i < n-1) cout << ' ';
    }
    cout << '\n';
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int cases;
    cin >> cases;
    for (int tc=1; tc<=cases; ++tc) {
        cout << "Case #" << tc << ": ";
        solve();
    }
}