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:
14, 18, ['y', '4021', '9011', '3447', '6467', '5599', 'T', 'g', '1441', 'e', '2857', '7251', 'D', '619', '6413', '3145', '9355', 'O', 'Z', '6521', '5005', 'Q']

Ex Output:
19532


Ex Input:
4, 5, ['b', 'u', '5279', '6945', '6631']

Ex Output:
13576


Ex Input:
6, 9, ['n', 'u', '1887', 'C', 'g', 'H', 'L', 'U', 'p', 'M', 'G', '8791', 'N', '3879', '7779', '7469', '3319', '8401', '4781']

Ex Output:

0