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, 19, ['4723', 'r', 'b', 'I', '7639', 'x', 'j', '1697', '8525', '4083', 'i', '1337', 'Q', '3705', '4229', 'L', '3721', 'g', '2569', 'j', '447', '2421', '9513', 'p', '6663']

A: 37505
****
Q: 1, 1, ['d', '6481']

A: 0
****
Q: 4, 12, ['A', '6321', '8055', '2565', 'x', '6645', '7707', 'M', 'v', 'O', '4881', 'G']

A:
21798
****