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, 3, ['h', 'w', '3397']
[A]: 3397


[Q]: 1, 7, ['J', 'l', '9145', '5805', '4377', '2851', '8781', '7353', '145']
[A]: 30959


[Q]: 1, 10, ['X', '5141', 'B', 'm', 't', 'j', '3387', '1657', '1431', '9329']
[A]:
20945