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.

Ex Input:
10, 15, ['n', '4807', 'a', 'Q', '3781', 'h', '1553', 'n', 'J', 'L', 'M', '3781', '6375', '2429', 'O', '1687', 'L', 'S', '607', '9433']

Ex Output:
12585


Ex Input:
6, 6, ['I', '8721', '6901', '737', '5767', '9771', 'h']

Ex Output:
9771


Ex Input:
20, 23, ['O', '5523', 'm', 'U', '1891', '1041', 'V', '7297', '3295', '895', 'B', '1493', 'p', 'j', 'O', 'd', '1377', 'R', 'i', '281', 'c', 'D', 'l']

Ex Output:

281