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]: 1, 1, ['1449', '1257']
[A]: 1449


[Q]: 1, 2, ['1907', '1489', 'm', '4571', 'a']
[A]: 3396


[Q]: 5, 10, ['6757', 'q', 'a', '3211', 'B', '4533', 'Y', 'c', 'Y', '2767', '313', 'l', '275', 'I', '7391', 't', '7341', '8433', 'D', 'D', '4379', '8401', 'j', 'Z', 'V', '4747', 'N', '6617']
[A]:
7300