CF803G Periodic RMQ Problem

You are given an array $ a $ consisting of positive integers and $ q $ queries to this array. There are two types of queries: - $ 1 $ $ l $ $ r $ $ x $ — for each index $ i $ such that $ l

The first line contains two integers $ n $ and $ k $ ( $ 1

For each query of type $ 2 $ print the answer to this query — the minimum on the corresponding segment.