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:
5, 14, ['r', '5851', '5957', '1951', '9761', '6805', '2323', 'J', '703', '9479', '6653', 'L', '513', 'A', 'v', '4273', '391', 'b']

Ex Output:
36237


Ex Input:
1, 14, ['T', 'y', 'L', 'l', '5307', 'j', '2235', '9617', 'e', '7687', 't', '4357', '1745', 'X', '8485', 'a', '1387', '1351', '6437', 'u']

Ex Output:
30948


Ex Input:
9, 17, ['u', 'p', '2281', 'X', 'l', '7241', '6445', '7847', '1015', 'R', 'A', '1517', 'j', 'Z', 'X', 'z', '623', '4609', 'm', 'l', '3947', 'U', 'b']

Ex Output:

3155