int search(int sl, int sr, int p, int l, int r) {
if (sl <= l && r <= sr)
return t[p];
int mid = l + r >> 1;
int lc = p << 1;
int rc = lc | 1;
int sum = 0;
if (sl <= mid)
sum += search(sl, sr, lc, l, mid);
if (sr > mid)
sum += search(sl, sr, rc, mid + 1, r);
return sum;
}