For problem statement at 2000-2999/2100-2199/2150-2159/2157/problemB.txt this is a correct solution, but verifier at 2000-2999/2100-2199/2150-2159/2157/verifierB.go ends with Passed 100/100 test cases. can you fix the verifier? ```go
package main

import (
	"bufio"
	"fmt"
	"os"
)

func main() {
	in := bufio.NewReader(os.Stdin)
	out := bufio.NewWriter(os.Stdout)
	defer out.Flush()

	var t int
	if _, err := fmt.Fscan(in, &t); err != nil {
		return
	}

	for i := 0; i < t; i++ {
		var n int
		var x, y int64
		fmt.Fscan(in, &n, &x, &y)
		var s string
		fmt.Fscan(in, &s)

		var k4, k8 int64
		for _, c := range s {
			if c == '4' {
				k4++
			} else {
				k8++
			}
		}

		// The set of reachable black cells is the Minkowski sum of:
		// 1. An L_infinity ball (square) of radius k8 (from '8' operations)
		// 2. An L_1 ball (diamond) of radius k4 (from '4' operations)
		// A point (x, y) is black iff its L_1 distance to the square [-k8, k8] x [-k8, k8]
		// is less than or equal to k4.

		if x < 0 {
			x = -x
		}
		if y < 0 {
			y = -y
		}

		// Calculate L1 distance from (abs(x), abs(y)) to the box [-k8, k8]^2.
		// Since we work with absolute values, we check distance to range [0, k8] in each dimension.
		
		dx := x - k8
		if dx < 0 {
			dx = 0
		}

		dy := y - k8
		if dy < 0 {
			dy = 0
		}

		if dx+dy <= k4 {
			fmt.Fprintln(out, "YES")
		} else {
			fmt.Fprintln(out, "NO")
		}
	}
}
```