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:
9, 13, ['x', '4589', 'q', 'X', 'Q', 'e', '8007', '5779', 'Z', '8503', 's', '6425', '133', '5389', 'e', '9477', '3763', 'Q', 'B', 'r', 'P']

Ex Output:
15061


Ex Input:
18, 27, ['1757', 'B', '5165', 'v', 'c', '2699', '9861', '3935', 'p', 'A', '6855', '5233', '1543', 'A', 'H', 'o', 'P', '6749', '2411', 'B', 'U', 'G', '1645', '1543', 'x', '7271', '4383', 'n', '2725', 'n']

Ex Output:
24002


Ex Input:
6, 10, ['w', '4387', 'R', '5205', 'g', '917', 'r', '6053', 'B', '3177', '7935', 'l', 'w', '6569', 'd', '5403', '9421', 'O']

Ex Output:

10147