1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23

template<typename T> class fenwick_tree_2d {
private: int N, M; vector<vector<T>> FT;
public:
	fenwick_tree_2d(int n, int m) {
		N = n + 1, M = m + 1;
		FT.resize(N);
		for (int i = 0; i < N; i++) FT[i].resize(M, 0);
	}
	void update(int x, int y, T val) {
		for (int i = x; i < N; i += i & -i) {
			for (int j = y; j < M; j += j & -j) FT[i][j] += val;
		}
	}
	T query(int x, int y) {
		T ret = 0;
		for (int i = x; i > 0; i -= i & -i) {
			for (int j = y; j > 0; j -= j & -j) ret += FT[i][j];
		}
		return ret;
	}
	T query(int xl, int xr, int yl, int yr) {
		return query(xr, yr) - query(xl - 1, yr) - query(xr, yl - 1) + query(xl - 1, yl - 1);
	}
};