class Result {
    private static final int[][] queenDirections = {{0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}, {-1, 0}, {-1, 1}};

    public static int queensAttack(int n, int k, int r_q, int c_q, List<List<Integer>> obstacles) {
        Set<List<Integer>> obstaclesSet = new HashSet<>();
        for (List<Integer> obstacle : obstacles) {
            obstaclesSet.add(obstacle);
        }
        int attackableSquares = -8;
        for (int[] queenDirection : queenDirections) {
            int r = r_q;
            int c = c_q;
            List<Integer> checkedPosition = List.of(r, c);
            while (r <= n && c <= n && r >= 1 && c >= 1 && !obstaclesSet.contains(checkedPosition)) {
                r += queenDirection[0];
                c += queenDirection[1];
                checkedPosition = List.of(Integer.valueOf(r), Integer.valueOf(c));
                attackableSquares++;
            }
        }
        return attackableSquares;
    }
}