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:
6, 7, ['6261', 'l', 'T', 't', 'X', 'G', 'Y', 'f']

Ex Output:
0


Ex Input:
1, 6, ['B', 'N', 'b', '9383', '4711', 'K']

Ex Output:
14094


Ex Input:
8, 13, ['T', 'R', 'n', '3887', '7911', 'K', '6141', '8327', 'Q', '2661', 'j', '2243', 'b', 'E', '2825', 'b', '2989']

Ex Output:

13231