Simple C project (algorithm)

Description: Bees are storing honey in honeycombs ever day,honeycombs are a mesh of cells and every cell is a hexagon,cells are sorted like a regular matrix. Over the night all of the honey is eaten and every honeycomb is empty. The bees do not store honey in random cells,but honey storage is directly dependent on the previous day(it is important to note what cells were filled the day before). The honey will be stored in a cell only if these conditions are met: -the number of adjacent cells(to the cell that we are checking for storage) that contained honey the day before must be odd,if that number is not in fact odd the cell will remain empty. Input: In the first row there are 3 natural numbers,n m k,(2≤n,m≤10,1≤k≤263−1),n->number of rows,m->number of columns and k->number of days. In the next "n" rows there are "m" amount of signs("#" and "."),"#" is used to mark the cells that have honey and "." is used to mark the empty cells(used to set the initial honeycomb). Expected output: How is the honeycomb going to be filled after k days. Test example: Input: 4 4 3 .... .... ..#. .... Output: #... .### .#.. #... 2nd example: Input: 3 10 8 #.##..#... #.##.#.... ...#..#... Output: #..#...##. .#.#...### #..##.##..