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.

2, 6, ['S', 'y', '2729', '9935', 'T', 'H', '3063', '9587']
12664

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

4, 9, ['3713', 'e', 'X', '9517', '9387', '6653', 'V', 'l', 't', 'V', '3463', 'n', '8477', 'Q', '7935', '9897', 'l', 'q', '4791', 'Z', 'p', '2195', '3223', 'k', 'E', '2065']

25557