function binarySimulation(s, q) {
  const result = []
  for (const val of q) {
    const [mode, fr, to = s.length] = val
    switch (mode) {
      case 'I':
        const re = new RegExp(`^([01]{${fr - 1}})([01]{${to - fr + 1}})([01]{${s.length - to}})$`)
        const [, a, b, c] = s.match(re)
        s = `${a}${b.replace(/[01]/g, (n) => 1 - n)}${c}`
        break
      case 'Q':
        result.push(s[fr - 1])
        break
    }
  }
  return result
}