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:
16, 23, ['N', '3357', '919', '9963', 'u', '137', '5633', '2999', 't', '1583', '2217', 'p', '1087', '7219', '61', 'p', 'L', '5745', '4431', 'T', '4369', 'G', '1511', 'p', 'M', '4277', '6683', 'C', 'D']

Ex Output:
16056


Ex Input:
2, 11, ['N', '3963', 'O', 'T', '8551', '3099', '577', '9273', '9849', '2593', '4693', 'A', 'O', '7381', 'o', 'P', 'g', 'H', '3927']

Ex Output:
42598


Ex Input:
1, 2, ['7321', '6233']

Ex Output:

13554