In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
10, 13, ['8963', '5521', 'D', '4521', '8701', '7877', '3093', 't', 'd', '573', '9345', 'I', '6571', '8613', 'U', 'Y', 'Q', 'q', '7965', '2507', 'M', '3775', 'y', 'h', 'V', '8423', 'N', '8417', 'v']