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]: 16, 17, ['Z', '8799', 'Z', 'P', '3413', 'X', '939', 's', 'G', 'x', '6911', 'v', '1183', '3507', 'r', 'C', 'k', 'Z', '4247']
[A]: 0


[Q]: 2, 2, ['M', 'I', 'G', '3747']
[A]: 0


[Q]: 25, 30, ['A', 'm', 'Y', '3307', 'h', '2097', '7927', '667', 'm', '1663', '2663', '59', 'O', 'F', 'm', '113', 'C', '2477', 'E', 'H', 'x', 'n', 'w', 'o', 'G', 'g', 'd', '8401', '1927', '6977']
[A]:
17305