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, 2, ['2333', '6101']

A: 8434
****
Q: 3, 20, ['u', '5631', '6297', 's', '5839', 'l', '6967', '4097', '4643', '9645', 'q', 'i', '2963', 'R', '9539', 'j', 'M', '5607', '2651', '907', 'z', 'C', 'O']

A: 59155
****
Q: 2, 6, ['7669', '6753', '6695', '5473', '5715', '5795', '1103', 'U', '299', 'Q', 'i', '2419', '927', 'Q', '907', '2731', '105', 'b', '3717', '3521', 'U', 'K']

A:
30431
****