Longest Chain in a Hash Table

Keys are inserted into a hash table with m buckets using h(k) = k mod m and separate chaining. Print the length of the longest chain.

1 <= n <= 10^5 1 <= m <= 10^5