Problem

You are given a 2D grid of characters '0' and '1', where '1' represents land and '0' represents water. An island is defined as a maximal group of horizontally or vertically (4-directionally) adjacent land cells.

The size of an island is the total number of land cells within that island.

You are also provided with an integer array queries, where each element represents a specific island size to query.

Your task is to return an integer array ans of the same length as queries. For each i, ans[i] should be equal to the number of islands in the grid whose size is exactly queries[i].

Example

If the grid contains:

• 2 islands of size 10
• 0 islands of size 1
• 5 islands of size 2
• 0 islands of size 3

Then for queries = [10, 1, 2, 3], the expected output ans would be [2, 0, 5, 0].

Constraints

• 1 <= rows, cols <= 2000
• grid[r][c] ∈ {'0','1'}
• 1 <= queries.length <= 2e5
• Query sizes are positive integers

Notes

• Use 4-directional adjacency only (no diagonals).
• queries may contain duplicates; return counts for each position.