package main import ( "fmt" "sort" "strconv" "strings" ) type priceAndItem struct { p int i int32 } type priceAndItemS []priceAndItem func (p priceAndItemS) Len() int { return len(p) } func (p priceAndItemS) Swap(i, j int) { p[i], p[j] = p[j], p[i] } func (p priceAndItemS) Less(i, j int) bool { return p[i].p < p[j].p } func conv(l int32) string { s := make([]string, 0, 32) for i := uint(0); i < 32; i++ { if (l & (1 << i)) == 0 { continue } s = append(s, strconv.Itoa(int(i+1))) } return strings.Join(s, " ") } func price(P []int, l int32) int { p := 0 for i := uint(0); i < uint(len(P)); i++ { if (l & (1 << i)) == 0 { continue } p += P[i] } return p } func search(S int, fh, lh priceAndItemS) []int32 { var res []int32 for i := range fh { j := sort.Search(len(lh), func(j int) bool { return fh[i].p+lh[j].p >= S }) if fh[i].p+lh[j].p == S { for k := 0; lh[j].p == lh[j+k].p; k++ { res = append(res, fh[i].i|lh[j+k].i) } } } return res } func main() { var N, S int fmt.Scan(&N, &S) P := make([]int, N) for i := range P { fmt.Scan(&P[i]) } fh := make(priceAndItemS, 0, 1<