题号：NC273393
时间限制：C/C++/Rust/Pascal 3秒，其他语言6秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 3秒，其他语言6秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
You are given a labeled full ternary tree with depth 
, containing labels from 
to %20%2F%202)
, with the root labeled as . For a node labeled as 
, with a depth not exceeding 
, its three children nodes are labeled as 
, 
, and 
.
The tree will undergo
operations in order. Each operation will remove the subtree rooted at node labeled as 
(if the node has already been removed, this operation will be ignored). You task is to compute how many nodes remain in the tree after each operations.
The tree will undergo
输入描述:
The first line contains two single integersand
, representing the depth of the full ternary tree and the number of operations, respectively.
In the nextlines, each line contains a single integer
, representing an operation that removes the subtree rooted at node labeled as
.
输出描述:
For each operation, output an integer in a single line that represents the number of nodes remaining in the tree after this operation.
