def read_input(filename):
    with open(filename, 'r') as file:
        lines = file.readlines()
    return [list(map(int, line.split())) for line in lines]

def write_output(filename, data):
    with open(filename, 'w') as file:
        file.write(str(data) + '\n')

class SegmentTree:
    def __init__(self, size):
        self.size = size
        self.tree = [0] * (4 * size)
        self.lazy = [0] * (4 * size)
    
    def update_range(self, node, start, end, l, r, val):
        if self.lazy[node] != 0:
            self.tree[node] += (end - start + 1) * self.lazy[node]
            if start != end:
                self.lazy[node*2] += self.lazy[node]
                self.lazy[node*2+1] += self.lazy[node]
            self.lazy[node] = 0
        if start > end or start > r or end < l:
            return
        if start >= l and end <= r:
            self.tree[node] += (end - start + 1) * val
            if start != end:
                self.lazy[node*2] += val
                self.lazy[node*2+1] += val
            return
        mid = (start + end) // 2
        self.update_range(node*2, start, mid, l, r, val)
        self.update_range(node*2+1, mid+1, end, l, r, val)
        self.tree[node] = self.tree[node*2] + self.tree[node*2+1]
    
    def query_range(self, node, start, end, l, r):
        if start > end or start > r or end < l:
            return 0
        if self.lazy[node] != 0:
            self.tree[node] += (end - start + 1) * self.lazy[node]
            if start != end:
                self.lazy[node*2] += self.lazy[node]
                self.lazy[node*2+1] += self.lazy[node]
            self.lazy[node] = 0
        if start >= l and end <= r:
            return self.tree[node]
        mid = (start + end) // 2
        p1 = self.query_range(node*2, start, mid, l, r)
        p2 = self.query_range(node*2+1, mid+1, end, l, r)
        return p1 + p2

def main():
    input_data = read_input('bird.in')
    n, k = input_data[0]
    events = input_data[1:]
    
    # Logic to process events and use segment tree for range updates and queries
    
    # Placeholder for the actual logic that processes the events and updates/queries the segment tree
    # This needs to be replaced with the actual logic based on the C++ code above
    
    # For demonstration, let's just write a placeholder result
    result_placeholder = 42
    write_output('bird.out', result_placeholder)