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: 9, 9, ['G', '9137', 'G', '2393', '9383', 'r', '6897', '547', 'W', 'h', 'p', '4557']

A: 0
****
Q: 11, 16, ['8617', '6133', '5505', '6601', 'y', 'a', '1019', 'r', 'P', 'd', 'P', '9647', '9831', 'I', 'z', 'k', '749', '8975']

A: 19478
****
Q: 2, 8, ['R', 'I', 'L', 'l', '3465', 'i', 'D', '8497', '715', '1743', 'I', 'a', '7061']

A:
11962
****