Alternating Groups III

Maintain counts of contiguous alternating-color segments in a circular binary array while supporting point color updates and queries that ask how many length-k alternating groups exist. The challenge is to handle wraparound and update counts efficiently (up to ~5e4 operations) by tracking maximal alternating runs and their contributions to fixed-length subsegments.