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, 4, ['3757', 'z', '9029', '6903', '7185']
[A]: 19689


[Q]: 3, 6, ['l', 'C', '6183', 'd', '6519', 'm']
[A]: 12702


[Q]: 17, 20, ['7805', '5011', '3701', '9501', '9509', '5813', '5249', 'H', '933', '4893', '8229', '2463', 'I', 'S', 'c', 'F', 'e', 'p', 'M', '8579', '2693']
[A]:
8579