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, ['5605', '6415']
[A]: 12020


[Q]: 1, 2, ['m', 'E']
[A]: 0


[Q]: 2, 5, ['L', 'g', '495', 'O', '4385', '9855', '5823', 'Q', '4283', '5583', '8657', 'f', '8079', 'R', '7449', '781', '7089', '4407', '9019', '5085', 'R', '4663', '3689']
[A]:
4880