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:
5, 9, ['r', 'P', 'r', 'g', '5077', 'T', '2819', 'f', 'p', '6449', '8509', '8915', 'I', 'Z', 'N', '8657', 'R', '3739']

Ex Output:
7896


Ex Input:
5, 11, ['5641', 'c', 'z', '5969', 'w', '9149', 'r', 'B', 'y', '3315', 'M', '8087', 'j', '1159', '9365', 'b', 'a', 'y', '6957', '5735', '9739', '133', 'm', '4887']

Ex Output:
12464


Ex Input:
14, 15, ['B', 'i', 'F', 'F', '7361', 'U', '6625', 'x', '7875', 'm', '5637', '9533', 'y', 'e', '5049', '3809', '1', '8269', '435', '2363', '1679', 'e', '8775', 'A', 'l', '161']

Ex Output:

5049