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]: 13, 18, ['3475', 'o', '3353', '3225', 'I', '3297', 'Z', 'i', '7995', '5299', '7275', '3123', '1975', '4599', 's', '2489', '8733', 'N', '4563']
[A]: 17796


[Q]: 2, 7, ['E', 'e', '5585', 'g', '4971', '8891', '811', 'l', '527', '4299', 'b', 'N', '5079', 'j', '5555', '4789']
[A]: 20258


[Q]: 20, 22, ['i', 'b', '7297', '8771', '5147', '4403', '9897', 'e', 'A', 'l', '2535', '8607', '1615', 'I', '3867', 'X', '6793', '4209', '5349', 'j', 'D', '7185', '285']
[A]:
7185