!> 追加する順番が大事になりそうだから, bitDPでがんばる.
program yukicoder_2364
  use, intrinsic :: iso_fortran_env
  implicit none
  integer(int32) :: n, m, max_w
  integer(int32), allocatable :: ws(:)
  integer(int64), allocatable :: vs(:)
  integer(int64), allocatable :: dp(:, :)
  read(input_unit, *) n, m, max_w
  allocate(ws(n+m), vs(n+m))
  read(input_unit, *) ws(1:n)
  read(input_unit, *) vs(1:n)
  read(input_unit, *) ws(n+1:n+m)
  read(input_unit, *) vs(n+1:n+m)
  ws(n+1:n+m) = - ws(n+1:n+m)
  vs(n+1:n+m) = - vs(n+1:n+m)
  ! write(error_unit, '(*(i0, 1x))') ws(:)
  ! write(error_unit, '(*(i0, 1x))') vs(:)
  allocate(dp(0:max_w, 0:ishft(1_int32, n + m)-1), source = -1_int64)
  dp(0, 0) = 0_int64
  ! write(error_unit, '(*(i0, 1x))') dp(:, :)
  call bit_dp(0, 0, dp)
  write(output_unit, '(i0)') maxval(dp(:, :))
contains
  impure recursive subroutine bit_dp(state, weight, dp)
    integer(int32), intent(in) :: state
    integer(int32), intent(in) :: weight
    integer(int64), intent(inout) :: dp(0:, 0:)
    integer(int32) :: next_state
    integer(int32) :: v, next_w
    ! if (dp(weight, state) /= -1) return
    ! if (weight == 0 .and. state == 0) &
    !      dp(0, 0) = 0_int64
    do v = 1, n + m
       if (btest(state, v - 1)) cycle
       next_w = weight + ws(v)
       if (next_w < 0 .or. next_w > max_w) cycle
       next_state = ibset(state, v - 1)
       ! write(error_unit, '(2(i0, 1x), 2(b15.15, 1x), i0)') v, weight, state, next_state, dp(next_w, next_state)
       if (dp(next_w, next_state) < dp(weight, state) + vs(v)) then
          dp(next_w, next_state) = dp(weight, state) + vs(v)
          call bit_dp(next_state, next_w, dp)
       end if
    end do
  end subroutine bit_dp
end program yukicoder_2364