consider follow game playersthere array b_1 b_2 b_k consist positive integer Initially chip place cell array b_1 decrease 1 Players turn each turn current player follow index cell chip currently place x choose index y x mink x m b_y 0 chip cell y decrease b_y 1 if impossible valid current player lose gameYour task follow give array consist n positive integer q query there type query 1 l r d l r increase a_i d 2 l r tell winner game play subarray index l index r inclusive Assume player choose optimal strategy