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: 23, 25, ['v', 'J', 'B', 'y', 'G', 'z', 'f', '1651', 'T', 'X', '8701', '701', 'T', 'V', '1037', '4095', '8297', '2733', 'P', 'J', '7759', 'Z', '8153', 'q', '7619']
Example Output: 15772

Example Input: 13, 14, ['6693', 'J', '2765', 'P', 'h', '755', 'z', '7483', 'W', '6895', '1293', '3479', 'Y', '1667', '9635']
Example Output: 1667

Example Input: 8, 18, ['k', '8719', '2575', '4277', 'L', 'C', '5071', 'o', 'R', 'E', 'g', '8043', 'g', 'b', 'A', '8503', 'w', 'F', 'c', 'C', 'M', '4707', 'C', 'U', '5731', '1025', '4981', 'o']
Example Output:
16546