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: 3, 18, ['h', 'x', '371', 'i', '8545', '7767', '5033', '1041', 'A', '4643', 'L', '187', '5017', 'x', 'R', '7891', '3919', '9721', '8625', '5817', 'D', '4825', 'S']
Example Output: 54135

Example Input: 16, 29, ['1431', 'a', '7223', '5743', '4571', 'q', 'Z', '3415', '6237', '1537', '5403', 'Y', 'K', '1949', 'p', '2641', '3307', 'X', 'O', 'q', 'T', 'n', '845', '1489', '161', '8515', '8735', '5065', '4973', '9287']
Example Output: 35731

Example Input: 1, 19, ['t', '5515', '5821', 'S', 'F', '3243', 'b', 's', '1845', 'r', 'A', '421', '7647', 'J', 'z', 'G', 'H', 'Q', 'e', '1727', '5287']
Example Output:
24492