Mr. F. wants to get a document be signed by a minister. A minister signs a document only if it is approved by his ministry. The ministry is an M-floor building with floors numbered from 1 to M. Each floor has N rooms numbered from 1 to N. In each room there is one (and only one) official.

A document is approved by the ministry only if it is signed by at least one official from the M-th floor. An official signs a document only if at least one of the following conditions is satisfied:

Each official collects a fee for signing a document. The fee is a positive integer not exceeding 10⁹.

You should find the cheapest way to approve the document.

The first line contains integers M and N representing the number of floors in the building and the number of rooms per floor (1 ≤ M ≤ 100; 1 ≤ N ≤ 500). Each of the next M lines contains N integers that describe fees (the j-th integer at i-th line is the fee required by the official working in the j-th room at the i-th floor).

Output the numbers of rooms in the order they should be visited to approve the document in the cheapest way. If there are more than one way leading to the cheapest cost you may print any of them.

You can assume that for each official there always exists a way to get the approval of a document (from the first floor to this official inclusively) paying no more than 10⁹.