#include<iostream>
#include<vector>
using namespace std;
void solve(int i,int n,int arr[],vector<int>subset,int target){
    if(target==0){
        for(int x:subset){
            cout<<x<<}" ";
        }
        cout<<endl;
        return;
    }
    if(i==n){
        return;
    }
    solve(i+1,n,arr,subset,target);
    subset.push_back(i);
    solve(i+1,n,arr,subset,target-arr[i]);
    subset.pop_back();
}
int main(){
    int n;
    cin>>n;
    int arr[n];
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    int target;
    cin>>target;
    vector<int>subset;
    solve(0,n,arr,subset,target);
    return 0;
}