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:
2, 10, ['9653', '3845', 'm', 'K', 'j', '5041', 'W', 's', 'j', 'A', 'G']

Ex Output:
8886


Ex Input:
1, 20, ['A', '4859', 's', '8007', '547', '4531', '6111', '4177', 'L', 's', '3375', '3381', 'k', 'V', 'u', '7191', '8617', '1521', 'b', 'E', 'j', '7519', 'Q', '2813', '8863', 'L', '9405', '1335', '6355']

Ex Output:

52317