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, 4, ['261', '6237', '3809', '1857']

Ex Output:
12164


Ex Input:
9, 9, ['V', 'x', '3763', '8367', '3369', '6695', 'p', 'P', 'L', 'g', 's', '5117', 'n', '5097', '2407', '6337', '5437', 'o', '3023', 'D', 'g']

Ex Output:
0


Ex Input:
6, 11, ['A', '3811', 'n', 'R', '9593', '2001', 'c', 'f', '1337', '8171', 'K', '1583', 'h', 'W']

Ex Output:

11509