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, 16, ['8617', '6133', '5505', '6601', 'y', 'a', '1019', 'r', 'P', 'd', 'P', '9647', '9831', 'I', 'z', 'k', '749', '8975']

A: 19478
****
Q: 1, 2, ['E', 'z']

A: 0
****
Q: 13, 28, ['8417', '5755', '621', 'F', 'c', 'p', 'K', '6705', '8631', 'O', '5603', 'd', '7355', 'b', 'b', '411', 'j', '3789', 'j', '4833', 'N', '2001', 'K', 'N', '6699', '4293', '3147', '9425', 'H']

A:
41953
****