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, 8, ['6901', '3901', '5101', '4297', '1099', 'q', 'z', '6615', 'z', '6859']
[A]: 21013


[Q]: 13, 18, ['3475', 'o', '3353', '3225', 'I', '3297', 'Z', 'i', '7995', '5299', '7275', '3123', '1975', '4599', 's', '2489', '8733', 'N', '4563']
[A]: 17796


[Q]: 1, 16, ['1463', 'g', 'q', '7495', 'B', 'e', '8245', '6433', '4181', 'G', 'o', 'A', 'v', '8289', 'B', '387']
[A]:
36493