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, 19, ['Y', 'r', 't', '2931', '9519', '1071', '2417', 'p', 'F', '7509', 'l', '3451', '1907', 'z', 'E', 'n', '1251', 'k', 'p']

A: 6609
****
Q: 2, 3, ['3335', '3451', 'f', 'M']

A: 3451
****
Q: 6, 13, ['5611', '3439', '3329', '7133', '8153', 'O', '7215', '3589', '8571', 'U', '8703', 'X', 'L', '4279', '7327']

A:
28078
****