Under construction

Still being built. Things may change

Mode

Interview

Time limit2sMemory limit512 MB

Summary
Count how many times each value from 1 to M appears in the sequence and print the largest count.
Level

Easy1 of 10

Topics
Implementation, Array
Solved
No attempts yet

Problem

A sequence A1, A2, ..., AN of length N is given. Each term of this sequence is an integer between 1 and M, inclusive.

Define a new sequence B1, B2, ..., BM of length M as follows.

  • For each j (1 ≦ j ≦ M), the value of Bj equals the number of integers i (1 ≦ i ≦ N) such that Ai = j.

Find the maximum value among B1, B2, ..., BM.

Input

The input is given from standard input in the following format.

N M
A1 A2 … AN

Output

Print the maximum value among B1, B2, ..., BM on one line.

Constraints

  • 1 ≦ N ≦ 100.
  • 1 ≦ M ≦ 100.
  • 1 ≦ Ai ≦ M (1 ≦ i ≦ N).

Examples2

  1. Example 1

    Input
    4 3
    1 1 2 3
    
    Expected output
    2
    
  2. Example 2

    Input
    6 5
    3 3 2 1 2 3
    
    Expected output
    3