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: 1, 8, ['O', 's', '3399', '1813', 'T', '4477', '7161', 'z', '1173', 'Y', '6051', '7509', 'i', '9765', '809', '6191', 'f', '1983', 'm', '1043', '8465', '9511', 'i', 'p', '4891', 'K', 'W', 'W', '239']
Example Output: 16850

Example Input: 1, 20, ['N', '3757', '4835', '557', 'n', '3381', '3229', '9715', 'O', 'J', '5215', 'Q', '7867', 'W', '5159', '1571', '2911', '8907', 'J', 'b']
Example Output: 57104

Example Input: 15, 25, ['l', '1131', 'x', 'F', 'h', '7969', '4179', 'L', 'V', '5221', 'f', 'C', '5993', 'u', '9115', '8645', '1201', 'R', 'J', 'J', '3175', 'V', 'f', 'l', '7495', '665', '9373', '2743', 'D', '9285']
Example Output:
29631