## B. Harvest of Apples

### 题意

There are n apples on a tree, numbered from 1 to n.

Count the number of ways to pick at most m apples.

$1 \leq T \leq 1e5, 1 \leq n,m \leq 1e5$

## E. Matrix from Arrays

### 分析

$M[i][k] = A[\frac{(1+i+k)(i+k)}{2} + 2 \quad mod \quad L] = M[i+2L][k] = M[i][k+2L]$

### 代码

Thank you for your support!