  We consider a database separated into blocks. Blocks containing target items
are called target blocks. Blocks without target items are called non-target
blocks. We consider a case, when each target block has the same number of
target items. We present a fast quantum algorithm, which finds one of the
target blocks. Our algorithm is based on Grover-Radhakrishnan algorithm of
partial search. We minimize the number of queries to the oracle.
