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.
16, 17, ['4113', 'W', 'f', 'b', '4613', 'V', '7803', 't', '3425', '1367', 'l', '1039', 'i', '5423', 'T', 'x', 'D', 'e', 'h', 'R', '7369', '4495', '4367', '5805']