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.

Example Input: 22, 23, ['H', '5147', '9429', 'v', '7687', 'r', '847', '1305', '483', '5113', '3175', 'N', '6195', 'A', '9111', '7507', '9639', 'W', '6673', 'T', '7525', 'g', 'O', '8593', 'g', '5257']
Example Output: 0

Example Input: 1, 7, ['173', '5875', 'C', '7417', '3565', '1949', '537', '7707', 'o', 'y']
Example Output: 19516

Example Input: 2, 8, ['417', '3979', '2149', 'Y', 'O', '5091', '7083', 'K', '6185', '8123', 'b', '6401', 'h', '415', 's', 'K', 'C', 'Z']
Example Output:
18302