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.

1, 3, ['x', '971', '3029']
4000

8, 9, ['3587', '5903', 'B', '9671', 's', 'A', '7259', '6961', '2601', '9719']
9562

4, 15, ['E', 'Q', '7635', '1645', '9839', 'I', 'W', 'z', '6867', '9419', '6109', 'L', '821', 'q', '4305', 'F', '3651', 'B']

39005