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:
4, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']

Ex Output:
439


Ex Input:
7, 17, ['n', '1023', '2743', 'r', '5855', 'd', '4425', '3381', 'x', '9609', 'f', 'o', '8513', 'e', '7331', 'N', '7949', 'O']

Ex Output:
41208


Ex Input:
8, 9, ['2131', 'a', '5973', 'm', 'l', 'S', '4283', 'g', 'O', '3381', '7793', '2251']

Ex Output:

0