Optical Character Recognition

The well-known company Maple is preparing to release its newest mobile phone, myPhone. Among other features, myPhone scans text with a built-in camera.

The phone must recognize $n$ different characters. A sample of a character is a rectangular table of $w \times h$ cells. Each cell contains $1$ if ink should be present at that position of the character, and $0$ otherwise.

The scanning program splits the photographed image into rectangles of $w \times h$ pixels (each pixel is either black, written as $1$, or white, written as $0$) and compares them with the character samples.

To score a comparison, Maple's special department for Font Criteria by Finite Automata (КОШКА) defined the similarity of two tables. Similarity is the number of cells where the sample and the image have equal values.

Write a program that, given a set of characters and an image, finds the character most similar to the image by the КОШКА criterion, that is, the character with the greatest similarity.

The first line contains three natural numbers $n$, $w$, and $h$ ($n, w, h \le 100$). Then come $n$ blocks describing the character samples. Each block consists of $h$ lines of zeros and ones, with $w$ characters in each line. The image follows in the same format.

Print one number, the index of the most similar character. Characters are numbered from 1 in the order they appear in the input. If several characters are tied, print any of them.