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: 16, 18, ['o', '3669', 'M', 'M', 'R', 'r', 'o', 'P', 'q', '9939', '1807', 'F', 'J', 'a', '7773', 'I', 'A', '475', 'W', 'E', '417']

A: 475
****
Q: 14, 15, ['N', 'u', '4633', '5481', '2469', 'y', '2253', '4629', '8399', 'q', 'H', '8507', '1789', 'A', '5085', 'G', '9679', 'G', 'u', '9381']

A: 5085
****
Q: 7, 14, ['L', 'c', 'f', '5569', '3819', '2135', '7559', 'S', 'X', '3427', '7019', 's', 'e', 'j', '1139', '5181', '8697', 'h', 'b', 'u', '2719', '4859']

A:
18005
****