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: 6, 15, ['U', 'G', '4461', '7163', '5651', 'x', '4017', 'W', '7237', 'k', 'b', 'k', 'h', '9147', 'T', '9035', '537', 'Y', 'Q']
Example Output: 20401

Example Input: 4, 7, ['7463', '6237', 'v', '9817', '969', '6317', 'N', 'k', '2023']
Example Output: 17103

Example Input: 3, 22, ['4549', 'e', 'F', 'Z', 'p', '3927', 'r', 'P', 'r', 'A', '6523', 'N', '6801', 'Q', '9035', 'L', 'v', 'F', '2191', '2479', '4051', '3717']
Example Output:
38724