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, ['D', 'W', '5783']
[A]: 0


[Q]: 2, 8, ['147', 'w', 'Z', 'T', '4591', 'p', 'M', 'O', 'K']
[A]: 4591


[Q]: 3, 16, ['3613', 'Y', '4279', '261', '1203', 'A', '5425', 'i', 'I', '7747', '9359', '8689', 'c', 'B', '5699', 'E', 'O', '4685', 'M', '8843', '2895', '3781', 'o', 'U', 'P']
[A]:
42662