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]: 2, 2, ['E', 'i']
[A]: 0


[Q]: 3, 5, ['6621', 'A', '3201', '9737', '7957', 'v', 'x', 'q', 'b', 'X', 'v', 'B', 'h', '3985', 'M', '3037', 'V']
[A]: 20895


[Q]: 1, 7, ['2435', '6999', 'E', 'X', '1537', '6541', 'X', 'V', '4021', 'G', 'l', 'u']
[A]:
17512