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, 7, ['Y', 'n', '8993', 'X', '7211', 's', 't', 'R', 'm', 'L', '9559', 'K', 'j', '791']

A: 16204
****
Q: 4, 4, ['2107', 'l', '7551', '4907']

A: 4907
****
Q: 1, 7, ['8773', 'v', 'U', '9861', '7807', '7829', '6651', 'k', 'Z', 'X']

A:
40921
****