Winning ICPC

Time limit2sMemory limit512 MB

Summary

Count how many problems each team fully solved (S = T), then report the team with the most solves, breaking ties by smallest index.

Level: Easy1 of 10
Topics: Array, Implementation
Solved: No attempts yet

Problem

There are $N$ teams numbered $1$ to $N$ and $M$ problems numbered $1$ to $M$ . Problem $j$ has $T_j$ test cases. Every team submitted exactly one solution to every problem, and team $i$ passed $S_{i,j}$ test cases on problem $j$ .

A team is counted as having solved problem $j$ only when it passed all of its test cases, that is when $S_{i,j} = T_j$ . The winning team is the team that solved the largest number of problems. If two or more teams tie for the largest number, the winner is the one with the smallest index among them.

Determine the index of the winning team.

Input

The first line contains two integers $N$ and $M$ , separated by a space ( $1 \le N, M \le 100$ ), denoting the number of teams and the number of problems.

The second line contains $M$ integers $T_1, T_2, \dots, T_M$ , separated by spaces ( $0 \le T_j \le 100$ ), denoting the number of test cases of each problem.

Each of the following $N$ lines contains $M$ integers. The $j$ -th integer on the $i$ -th of these lines is $S_{i,j}$ ( $0 \le S_{i,j} \le T_j$ ), the number of test cases passed by team $i$ on problem $j$ .

Output

Print the index of the winning team on one line.

Hint

A problem with no test cases counts as solved when the passed count is $0$ . That is, if $T_j = 0$ then a team with $S_{i,j} = 0$ has solved problem $j$ .

If every team solved the same number of problems, team $1$ wins. The limits are small, so comparing every $S_{i,j}$ with $T_j$ directly fits easily.

Examples3

Example 1
Input
```
3 2
10 20
0 19
10 0
9 19
```
Expected output
```
2
```
Example 2
Input
```
3 2
10 20
0 20
10 0
9 19
```
Expected output
```
1
```
Example 3
Input
```
1 1
1
0
```
Expected output
```
1
```