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: 5, 6, ['W', '4759', '7861', '321', '5573', 'O', 'N', '157']

A: 5573
****
Q: 6, 16, ['P', 'X', 'U', 'R', 'd', 'x', '1023', '8693', 'B', 'R', 'u', '3445', 'M', 'C', '3655', 'Z', 'i', 'V', 'F']

A:
16816
****