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.

Q: 2, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']

A: 22725
****
Q: 1, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']

A: 28546
****
Q: 6, 12, ['b', '5451', '7635', '9293', 'u', '5451', '2045', '721', '5111', 's', 'w', '7765', '1321', 'b', '9365', '9843', '113', 'v', '121', '4045', 's', '4869', 'M', 'w', 'x', '9049', '5563']

A:
21093
****