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.

5, 14, ['r', '5851', '5957', '1951', '9761', '6805', '2323', 'J', '703', '9479', '6653', 'L', '513', 'A', 'v', '4273', '391', 'b']
36237

4, 12, ['E', '6343', 'f', '541', '7361', '9993', 'g', '3185', 's', 'w', 'Q', 'I', 'e', 's']
21080

6, 17, ['7283', '327', 'v', 'h', 'H', 'J', '5349', '1779', 'a', 'k', 'e', 'n', '1933', 'D', 'x', 'w', '3953', 'd', '7935']

13014