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, ['R', 'k', '4813', '655', '3185', 'M', '4199', '1857', '9829', '6389', 'X', '3405', 'P', 'x']

A: 30927
****
Q: 1, 6, ['H', '7937', '9919', 'G', 's', '1929', '8585', 'n', 'u', 'J', 'C', '387']

A: 19785
****
Q: 3, 15, ['X', '8895', '6073', '7299', 'R', '8203', 'n', 'P', '2377', 's', '2767', 'g', 'v', 'Z', 'W', 'O', 'H', 'v', 'q', 'u']

A:
26719
****