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: 16, 17, ['Z', '8799', 'Z', 'P', '3413', 'X', '939', 's', 'G', 'x', '6911', 'v', '1183', '3507', 'r', 'C', 'k', 'Z', '4247']

A: 0
****
Q: 10, 17, ['479', '9493', '9061', '5585', 's', '9653', '5741', '7451', '2141', '9547', 'r', 'Z', '8915', '8289', '9281', '561', 'J', '3029', '3595', '7279', '7641']

A: 36593
****
Q: 8, 23, ['s', 'X', '8165', '9581', '1555', 'a', '8651', '3019', '8729', '213', 'z', '4215', 'Y', 'E', '2989', '2833', '9271', '4885', 'G', '1007', 'v', '1455', 'R', '9975', 'H', 'P', '6451']

A:
38616
****