<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def biclique(self, xmin, xmax, ymin, ymax):
 """Compute a maximum-sized complete bipartite graph contained in the rectangle defined by ``xmin, xmax, ymin, ymax`` where each chain of qubits is either a vertical line or a horizontal line. INPUTS: xmin,xmax,ymin,ymax: integers defining the bounds of a rectangle where we look for unbroken chains. These ranges include both endpoints. OUTPUT: (A_side, B_side):
 a tuple of two lists containing lists of qubits. the lists found in ``A_side`` and ``B_side`` are chains of qubits. These lists of qubits are arranged so that and are lists of valid couplers. """


        Aside = sum((self.maximum_hline_bundle(y, xmin, xmax)
                     for y in range(ymin, ymax + 1)), [])
        Bside = sum((self.maximum_vline_bundle(x, ymin, ymax)
                     for x in range(xmin, xmax + 1)), [])
        return Aside, Bside