Find Number of Islands

You are provided with a 2-dimensional array/list of size N rows by M columns, containing ones (1) and zeroes (0). Here, 1 represents land, and 0 represents water.

A cell is considered connected to another if it is immediately adjacent in any of the eight possible directions: two vertical, two horizontal, and four diagonal.

Your task is to determine the number of islands in the matrix, where an island is defined as a group of connected 1s.

Input:

The first line of input includes two integers, 'N' and 'M', separated by a space, representing the number of rows and columns of the matrix.
The subsequent 'N' lines each contain 'M' integer values separated by a space, signifying each row of the matrix.

Output:

A single integer that denotes the total count of islands within the 2-dimensional array.

Example:

Input:

4 5
1 1 0 0 0
0 1 0 0 1
1 0 0 1 1
0 0 0 0 0

Output:

3

Explanation:

The given matrix contains three islands.

Constraints:

• 1 <= N <= 10^3
• 1 <= M <= 10^3
• 0 <= ARR[i][j] <= 1
• Time limit: 1 sec

Note:

You're not required to print anything directly as it is handled by the implementation of the function. Just ensure the function returns the correct number of islands.