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:
1, 7, ['v', '8881', '2711', '7569', 'C', '6117', '1569', '1257', 'h', '5407']

Ex Output:
26847


Ex Input:
14, 20, ['4221', '2381', 'i', 'm', 'c', 'F', '9703', '3529', 'a', '83', 'D', '1023', 'I', 'c', 'W', '7163', '341', 'w', '7855', '2317', '8989', '3629', 'b']

Ex Output:
17676


Ex Input:
7, 13, ['Q', 'L', 'x', 'D', 'd', 'v', 'c', '7731', 'Z', 'k', '6071', '5793', '1017', 'V']

Ex Output:

20612