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: 3, 6, ['w', 'V', '7413', '5027', 's', '7037', 'S', '763', 'D', 'U', 'x', 'l', '9331', 'S', 'k', '8369', 'D', 'A', 'e', 'A', 'r', '5113', '1367', '4197', 'm']

A: 19477
****
Q: 3, 4, ['F', '7341', 'P', '3315']

A: 3315
****
Q: 6, 8, ['U', 'L', '261', '3957', '7933', 'K', 'X', '2557', 'I', 'e', '7791', 'f', '2737', '4865', '4615', 'F', 'r', 'l', '2381', 'd', '3971', '3035', '2353', '6319', '2271', '297', '969']

A:
2557
****