Count Strings With Length Divisible By K

You are given a list words of strings and a positive integer k.

Return an int: the number of strings in words whose length is divisible by k (that is, len(s) % k == 0).

Note that a string of length 0 (the empty string) is divisible by every k, so it counts. The order of the list does not matter.

NOTE: This is a function-type question — you only write the function. Do not read input or print anything; a hidden checker calls your function and checks its return value.

Example

Arguments

['apple', 'pie', 'cat', 'hello']
3

Returns

2