Definition: 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.
Input: 5, 16, ['5687', '649', '6785', '4477', '5367', 'Z', '7817', '4935', '3205', 'b', 'k', '4413', 'b', '7511', 'b', '2739', 'T', '2339', 'Q', 'j', '9499', 'k', '1477', '1849', '4783', '2397', 'z', '1871', 'm', '1081']

35987