Derive the integer power bag bound from the original separator hypothesis. On every remainder larger than two thirds of the original graph, apply the registered split solver and rule out its high-flow branch. Labeling preserves shore sizes and costs; orient the cut to discard the smaller exclusive piece. The repeated-cut theorem gives a balanced separator, and the global load scale converts its cumulative cost bound into delta*k.