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:
6, 15, ['U', 'E', '6873', '7621', '9241', '147', '4503', 'z', '3805', 'n', '4331', '4031', '2585', '9029', 'a', '7537', '975']

Ex Output:
28431


Ex Input:
14, 15, ['B', 'i', 'F', 'F', '7361', 'U', '6625', 'x', '7875', 'm', '5637', '9533', 'y', 'e', '5049', '3809', '1', '8269', '435', '2363', '1679', 'e', '8775', 'A', 'l', '161']

Ex Output:
5049


Ex Input:
2, 3, ['W', '1239', '8339', 't', 'Y', '1159', 'r', '1735', '6673', 'K']

Ex Output:

9578