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]: 7, 17, ['149', 'O', 'h', '7873', '9227', '5655', '8945', 'I', 'c', 'V', 'Z', 'I', 'L', '1153', 'L', 'Y', '2031', 'B', 'S', 'x', 'u', '2483', 'M', '2469', '4991']
[A]: 12129


[Q]: 2, 3, ['9773', 'e', 'G', 'm', '1859']
[A]: 0


[Q]: 3, 21, ['R', 'D', '9331', '4731', '299', '837', '4723', 't', 'L', '997', '413', '9857', 'g', '859', '2597', 'g', 'M', 'V', '9605', 'D', 'b', 'i', 'J']
[A]:
44249