In the case of ordinary identification coding, a code is devised to identify one object among N objects. But, in this paper, we consider an identification coding problem to identify M objects at once among N objects in the both cases that M objects are or are not ranked. By combining Kurosawa-Yoshida scheme with Moulin-Koetter scheme, an efficient identification code is proposed, which can attain high coding rate and error exponents compared with the case that an ordinary identification code is used M times.