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: 3, 6, ['l', 'C', '6183', 'd', '6519', 'm']

A: 12702
****
Q: 1, 6, ['2249', '5839', '8759', 'w', '2203', 'b', '2169', 'G', '8741']

A:
19050
****