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: 4, 8, ['6669', 'G', 'y', '129', 'y', 'x', 'w', 'C', 'J']

A: 129
****
Q: 2, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']

A: 10176
****
Q: 3, 15, ['8815', 'w', '5613', 'm', '9515', '9741', 'O', 'U', '7197', '5237', 'M', '9899', '8289', 'l', '3', '9313', '4467', 'K', 'k', '637']

A:
55494
****