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:
4, 9, ['9557', '1661', 'E', '5173', 'o', '4963', '2811', '5471', '3853']

Ex Output:
22271


Ex Input:
1, 14, ['n', 'v', '7825', '5951', 'k', '1733', 'c', 'u', 'C', 'c', 'D', 'g', '9231', 'G']

Ex Output:
24740


Ex Input:
2, 12, ['2873', '259', 'b', '2009', 'T', '6161', '8637', 'V', 'Z', 'Z', 'q', '6935', '5311']

Ex Output:

24001