eolymp
bolt
Try our new interface for solving problems
Problems

The talking Galcian

The talking Galcian

\textit{"Ur-a-a! Earned!" - Matroskin joyfully exclaimed, hearing the first words uttered Galchonkom.} \textit{E. Uspenskiy "Three of Prostokvashino"} \includegraphics{https://static.e-olymp.com/content/bc/bc54378582b14e788a51183eabacaf7207c78381.jpg} As you all know, Galcian from the cartoon "Three from Prostokvashino" at the knock in the door always asks: "Who's there?". Statistics, like all mathematics, is a fine science, and it argues that Galcian can remember individual words and whole sentences, but only if the word was uttered at least \textbf{N} times, and the sentence - at least \textbf{M} times (\textbf{N} ≤ \textbf{M}). By the given text you must determine the number of words and sentences that Galcian remembered. \InputFile The first line contains two positive integers \textbf{N} and \textbf{M} (\textbf{N}, \textbf{M} ≤ \textbf{100}). The second line is the actual text. The text is written grammatically correctly. \OutputFile Two numbers, separated with spaces: the number of memorized words \textbf{S}, and the number of memorized sentences \textbf{P}.
Time limit 1 second
Memory limit 64 MiB
Input example #1
2 3
Kto tam? It is Pechkin. Kto tam? My name is Fedor. Kto tam? Pechkin!
Output example #1
4 1