请你实现三个 API append，addAll 和 multAll 来实现奇妙序列。 请实现 Fancy 类 ：

Write an API that generates fancy sequences using the append, addAll, and multAll operations. Implement the Fancy class:

有一条无限长的数轴，原点在 0 处，沿着 x 轴 正 方向无限延伸。 给你一个二维数组 queries ，它包含两种操作：

There exists an infinite number line, with its origin at 0 and extending towards the positive x-axis. You are given a 2D array queries, which contains two types of queries:

给你一个长度为 n 的整数数组 nums 和一个整数 k。

You are given an integer array nums of length n and an integer k. You must select exactly k distinct non-empty subarrays nums[l..r] of nums. Subarrays may overlap, but the exact same subarray (same l and r) cannot be chosen more than once. The value of a…

给你一个整数数组 nums 和一个整数 target。

You are given an integer array nums and an integer target. Return the number of subarrays of nums in which target is the majority element. The majority element of a subarray is the element that appears strictly more than half of the times in that subarray.…

给你一个整数数组 nums 和一个整数 target。

You are given an integer array nums and an integer target. Return the number of subarrays of nums in which target is the majority element. The majority element of a subarray is the element that appears strictly more than half of the times in that subarray.…

给你一个长度为 n 的二进制字符串 s ，其中：

You are given a binary string s of length n, where:

给你一个下标从 0 开始的字符串 s 。另给你一个下标从 0 开始、长度为 k 的字符串 queryCharacters ，一个下标从 0 开始、长度也是 k 的整数 下标 数组 queryIndices ，这两个都用来描述 k 个查询。 第 i 个查询会将 s 中位于下标 queryIndices[i] 的字符更新为 queryCharacters[i] 。 返回一个长度为 k 的数组 lengths ，其中 lengths[i] 是在执行第 i 个查询 之后 s 中仅由 单个字符重复 组成的 最长子字符串…

You are given a 0-indexed string s. You are also given a 0-indexed string queryCharacters of length k and a 0-indexed array of integer indices queryIndices of length k, both of which are used to describe k queries. The ith query updates the character in s…