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:
7, 11, ['n', '851', '1155', '5763', 'k', 'f', '3761', '1167', 'E', 'h', '1261']

Ex Output:
6189


Ex Input:
1, 18, ['1137', '7521', '1291', 'o', '391', '5329', 'X', '391', 'i', '6893', '8547', '9361', 'Z', 'O', '9701', '4097', '9273', '3877', '1589', '9097']

Ex Output:
67809


Ex Input:
6, 15, ['2429', 'X', 'n', '329', 's', '9313', '395', 'r', '2635', 'z', '6985', 'l', 'N', '4197', 'l', '8795', '6625']

Ex Output:

23525