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, 9, ['r', 'P', 'r', 'g', '5077', 'T', '2819', 'f', 'p', '6449', '8509', '8915', 'I', 'Z', 'N', '8657', 'R', '3739']

Ex Output:
7896


Ex Input:
1, 2, ['m', 'E']

Ex Output:
0


Ex Input:
9, 10, ['z', 'h', 'h', '4621', 'H', '7635', '5341', 's', '297', 'r', '2725', 'g', 'Y', 'a', '9857', '4333', '7375']

Ex Output:

297