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: 11, 18, ['7053', '4271', '3175', '3997', '4153', '3255', 'd', '4507', 'q', 'm', 'V', '9999', 'Q', 'v', '8543', '2835', '1545', '3549']

A: 26471
****
Q: 3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']

A: 4477
****
Q: 10, 12, ['8313', 'U', '781', 'F', '3427', '8401', 'J', '3799', 'h', 'N', '4757', 'p', 'F', '659', 'a', '3919', '4873', '7799', '2971', '875', '3637', 'E', '4017', 'E', 'X', 'x', 'h', '3455', '6169']

A:
4757
****