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]: 9, 13, ['x', '4589', 'q', 'X', 'Q', 'e', '8007', '5779', 'Z', '8503', 's', '6425', '133', '5389', 'e', '9477', '3763', 'Q', 'B', 'r', 'P']
[A]: 15061


[Q]: 8, 9, ['1329', '3107', 's', 'z', '2013', '1633', 'i', '1229', '4201', 'M', '3127']
[A]: 5430


[Q]: 13, 16, ['f', '2489', 'x', '6215', 'Y', 'y', '7015', 'E', '921', 'j', 'V', 'k', '4999', 'w', '4011', '5237', '9725', 't', '4795', '7463', '4295', 'S', '9843', 'p']
[A]:
14247