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:
12, 14, ['U', '5071', 'V', '9887', 'E', '3913', '3459', 'l', 'V', 'n', 'B', '655', 'L', 's', '2687', '9761', '2477', 'D', '8385', 'U', 'm', 'q', '4365', 'j']

Ex Output:
655


Ex Input:
4, 4, ['2227', '1525', 'g', 'l', 'R']

Ex Output:
0


Ex Input:
3, 9, ['I', 'P', '215', '9817', '4181', 'S', 'V', '5581', '5919', '4537', '7127', 'h', '8431', 'c', '8391', '9233', '9221', 'b', '685', '1701', 'D', '3641', 'm', '1623', '7095']

Ex Output:

25713