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: 1, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']

A: 28546
****
Q: 3, 4, ['L', 'D', 'T', 'b', 'i', 'X', '7319', '8655', '3183', '1833']

A: 0
****
Q: 1, 24, ['G', 'c', '9497', 'v', '5161', 'e', '1355', 'V', 'Q', '3125', '2367', '7221', '2357', 'I', '9343', 'a', '5955', '9977', '1', '1807', '4041', 'H', 'h', '1823', 'l', 'J', 'I', '5825', '9671']

A:
64030
****