program knapsack_queries_on_a_tree
  implicit none
  integer :: n, q, u(100000,3) = 0, p(0:18) = -1, m, r, h, i, j, k
  integer, dimension(262144) :: v = 0, w = 0
  integer(8) :: dp(0:18,100000) = 0, ans(100000) = 0
  read(*,*) n
  do i = 1, n
    read(*,*) v(i), w(i)
  end do
  read(*,*) q
  do i = 1, q
    read(*,*) u(i,1:2)
    u(i,3) = i
  end do
  call merge_sort(u(1:q,1:3),1)
  p(0) = 1
  dp(0,w(1):100000) = v(1)
  do i = 1, q
    m = u(i,1)
    h = headbit(m)
    do j = 1, h
      r = rshift(m,h-j)
      if (p(j) == r) cycle
      p(j) = r
      dp(j,:) = 0
      do k = 100000, w(r), -1
        dp(j,k) = max(dp(j-1,k),dp(j-1,k-w(r))+v(r))
      end do
    end do
    ans(u(i,3)) = dp(h,u(i,2))
  end do
  do i = 1, q
    write(*,'(i0)') ans(i)
  end do
contains
  integer function headbit(n)
    integer, intent(in) :: n
    integer :: i
    do i = 18, 0, -1
      if (btest(n,i)) then
        headbit = i
        return
      end if
    end do
  end
  subroutine merge_sort(a,k)
    integer, intent(inout) :: a(:,:)
    integer, intent(in) :: k
    integer :: n, m, l, i, u
    n = size(a,1)
    m = n
    l = 1
    do while (m > 1)
      do i = 1, m/2
        u = min(2*i*l,n)
        call merger(a(2*(i-1)*l+1:(2*i-1)*l,:),a((2*i-1)*l+1:u,:),k)
      end do
      l = 2*l
      m = (m+1)/2
    end do
  end
  subroutine merger(a1,a2,k)
    integer, intent(inout) :: a1(:,:), a2(:,:)
    integer, intent(in) :: k
    integer :: a(size(a1,1)+size(a2,1),size(a1,2))
    integer :: i1, i2, n1, n2
    i1 = 1
    i2 = 1
    n1 = size(a1,1)
    n2 = size(a2,1)
    do while (i1 <= n1 .and. i2 <= n2)
      if (a1(i1,k) <= a2(i2,k)) then
        a(i1+i2-1,:) = a1(i1,:)
        i1 = i1+1
      else
        a(i1+i2-1,:) = a2(i2,:)
        i2 = i2+1
       end if
    end do
    if (i1 <= n1) then
      a(i1+i2-1:n1+n2,:) = a1(i1:n1,:)
    else
      a(i1+i2-1:n1+n2,:) = a2(i2:n2,:)
    end if
    a1 = a(1:n1,:)
    a2 = a(n1+1:n1+n2,:)
  end
end program knapsack_queries_on_a_tree