There is an n*n grid with some lights randomly distributed. A lit light is represented by 1, and an unlit light is represented by 0. There are some buttons which can change the state of the lights in certain positions when they are pressed, like turning some lights on or off. Different buttons may control the state of the same light.
Given n=5 and the number of buttons=3, the initial network is:
01110
10001
00010
11111
00100

Button A controls the lights at ["4", "5"], ["1", "3"], ["5", "2"], ["4", "1"], ["2", "4"], ["2", "2"], ["4", "2"], ["2", "1"], ["4", "3"], ["3", "1"]
Button B controls the lights at ["1", "2"], ["4", "2"], ["3", "1"], ["3", "2"], ["3", "3"], ["4", "1"], ["5", "1"], ["3", "5"], ["2", "5"]
Button C controls the lights at ["2", "5"], ["2", "2"], ["4", "5"]

Round 1: Button B
Round 2: Button B
Round 3: Button B
Round 4: Button C

Please write the result after all rounds of operation based on the lights controlled by the button.
For example, <<<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0>>> represents a fully unlit light network.