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]: 6, 18, ['6619', 'W', '8541', '1049', '3973', '6575', 'C', '4961', '2469', '3553', '6905', 'p', 'c', 'K', '2663', 'm', 'B', '4379', 'D', '6557', 'r', 'N', '4875', 'u', 'X', '3133', '6353', '1635']
[A]: 31505


[Q]: 2, 10, ['1711', '201', '6463', 'J', 'z', 'D', 'I', 's', '2161', 'I', '2479', '4475', '2519', '7511']
[A]: 8825


[Q]: 2, 9, ['p', 'y', 'Q', '4475', '4029', '697', 'b', '7841', '351', 'c', '1153', '8591', 'J', '9569', '5253', 'Q', 'm', 'b', 'X', 'o', '195', '379', '4501', '815', 'p', 'i', 'i', '4641']
[A]:
17393