A simple approach to obtain all solutions for the hari extension problem for a given performance level γ is introduced. Using an embedding idea [7],[6], we reduce the four-block General Distance Problem (GDP) to the one-block problem, and in this manner we obtain a novel characterization of all solutions for the four-block GDP.