Leetcode 2906. Construct Product Matrix

Given an n×m grid, produce p where p[i][j] is the product of all grid elements except grid[i][j], taken modulo 12345. With up to 1e5 elements, the key is to output all values in linear time by precomputing total product and zero counts (or using prefix/suffix products), noting 12345 is not prime so modular inverses may not always apply.