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]: 8, 9, ['1329', '3107', 's', 'z', '2013', '1633', 'i', '1229', '4201', 'M', '3127']
[A]: 5430


[Q]: 4, 12, ['k', '7775', '1099', '1507', '7609', 'X', 'O', '521', 'u', 'V', 't', '1935', '8171', '2063', 'h', '2961', 'z', '4955', '1359', 'm', '2137']
[A]: 11572


[Q]: 6, 17, ['W', '7357', 'B', 'i', 'H', '6115', '2061', '2613', 'V', 'a', 'I', 'R', '2067', 'L', '1513', 'A', '1557', 'd', 'G', '8703', 'b', 'B', 'V', 'M', 'A', '7437', 'G', '5685', 'P', '1355']
[A]:
15926