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:
12, 17, ['3889', 'F', 'E', '8903', '2149', '2549', '5827', '7333', '1321', '3', 's', 'e', '2009', '711', 'Q', '7555', 'T', '8479', '8685', 'Y', 'W']

Ex Output:
10275


Ex Input:
1, 2, ['8895', 't', '5739']

Ex Output:
8895


Ex Input:
18, 20, ['V', 'x', 'y', 'E', 'Q', 'r', 'B', 'c', 'W', 'f', '247', '2351', 'F', 't', 'A', '8455', '8097', 'O', '5183', 's', '5407', '9857']

Ex Output:

5183