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: 7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']

A: 0
****
Q: 2, 5, ['601', '9381', '2073', '5113', '9595', 'P', '9499', '7561', '9343']

A: 26162
****
Q: 20, 21, ['4367', 'l', '2469', '3449', '4601', '4027', 'X', '9215', '473', 'O', 'y', 't', '4411', 's', 'M', '7973', 'l', 'K', '5413', 'f', '8735', 'j', 'Y', '8575', '6231', 'e']

A:
8735
****