There are $N$ student in a class each of them are given two fair dice,   first dice contains $1,4,7,10,13,16$  whereas other dice contains, $2,5,8,11,14,17$.  All student are asked to roll thier both dices $M$ number of times.

Let define $sum_{i}$ for a student as sum of number on both the dice on thier $i_{ith}$ throw. 

Now you asked each student at end of thier final throw $\sum\limits _{i=1}^{M} sum_{i}$ (that is total sum of all $sum_i$ over all $M$ throws). Some of students are lying you have to find the number of honest students.

Input format

• First line will contain integers $N,M$ where $N$ denoting the number of students and $M$ denotes the total number of throw.
• Second line will contain $N$ separated integers $A_1,A_2,...A_i,..,A_N$where   $A_i$  denotes the total sum of all $M$ throws for $i_{th}$ student that he told to you.

Output format

• Print a single integer that is total number honest students.

Constraints

• $1 \le N \le 10^5$
• $1 \le M \le 10^6$
• $1 \le A_i \le 10^9$