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.

[EX Q]: 2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']
[EX A]: 10497

[EX Q]: 5, 9, ['9069', 'U', '6879', 'q', '8619', '5335', '8765', '7825', '9621', 'H', '9769', 'E', 'v', '1921']
[EX A]: 40165

[EX Q]: 10, 24, ['r', 'L', '8261', 'Y', '4583', 'X', 'f', '7639', 'Y', '9319', 'U', '8923', 'N', '5041', '2845', 'Z', 'r', '9101', 'L', '4875', 'a', '1113', 'V', '3789', 't', '9643', '8269', '4891', '573']
[EX A]:
45006