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, 7, ['J', 'l', '9145', '5805', '4377', '2851', '8781', '7353', '145']
[A]: 30959


[Q]: 2, 5, ['m', 'o', 't', 'c', 'S', 'R', 'I', '4937', '1127', '1611', '285', '3653', '309', 'y', '513', 'i', '8005', 'n', '6915', '8585', 'G', 'A', '1921', 'd']
[A]: 0


[Q]: 2, 6, ['m', 'q', '4069', '4487', 'c', '4639']
[A]:
13195