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: 2, 5, ['4311', 'E', 'q', '123', 'K', 'N', '7531', 'x', 'h', 'H', '9919', '705', '3025']
Example Output: 123

Example Input: 3, 23, ['F', 'p', '5701', 'a', '4845', 'n', '3685', 'G', 't', '5251', 'O', '9655', '2757', 'r', '4273', 'b', 'e', '8593', '4633', '2053', 'c', '8537', 'S', '6253', '2815', 'A', '5717']
Example Output:
59983