#include <iostream>
#include <algorithm>
#include <vector>
#include <map>

std::map<int, std::vector<std::vector<int>>> enumerate(int n) {
    std::vector<int> xs(n);
    for (auto& x : xs) std::cin >> x;

    std::map<int, std::vector<std::vector<int>>> dp;

    for (int b = 0; b < (1 << n); ++b) {
        std::vector<int> is;
        int sum = 0;

        for (int i = 0; i < n; ++i) {
            if (!((b >> i) & 1)) continue;
            is.push_back(i);
            sum += xs[i];
        }

        dp[sum].push_back(is);
    }

    return dp;
}

void solve() {
    int n, sum;
    std::cin >> n >> sum;

    auto fdp = enumerate(n / 2),
         bdp = enumerate(n - n / 2);

    std::vector<std::vector<int>> ans;
    for (auto& [fsum, fiss] : fdp) {
        int bsum = sum - fsum;
        if (!bdp.count(bsum)) continue;

        auto& biss = bdp[bsum];

        for (auto& fis : fiss) {
            for (auto& bis : biss) {
                std::vector<int> is;
                for (auto i : fis) is.push_back(i);
                for (auto i : bis) is.push_back(i + n / 2);
                ans.push_back(is);
            }
        }
    }

    std::sort(ans.begin(), ans.end());
    for (auto& is : ans) {
        for (auto i : is) std::cout << i + 1 << " ";
        std::cout << "\n";
    }
}

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

    solve();

    return 0;
}