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.

8, 26, ['n', '9063', 'c', 'k', '7515', 'm', '2261', '4297', '9817', '7599', '1669', 'l', '9837', '3021', 'Q', '3991', 'r', 'B', '8615', 'J', '5641', '7637', '469', '3571', '2265', '3969']
72398

2, 2, ['8149', '7123', 'c', 'X', '1659']
7123

12, 16, ['2607', 'N', 'g', 'x', 'i', 'H', 'B', 'S', '6087', '8799', 's', '157', '9573', 'o', '3723', '777', '4619', '3415']

14230