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


[Q]: 10, 11, ['A', 'H', 's', '8033', 'M', '7393', '1231', 'T', '5025', '1739', 'q', '4233']
[A]: 1739


[Q]: 17, 20, ['t', 's', 'm', '6173', '4083', 'y', 'w', 'S', 'm', '5457', '5067', '3053', 'U', 'M', '2363', '3959', '9535', 'n', 'K', 'v', 'F', '6847', 't', '6151', '3467', '895', '3725']
[A]:
9535