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: 4, 6, ['X', '7577', 'N', 'F', '2783', 'a', 'u', 'R', '9877', 'x', 'f', 'J', '6343']
Example Output: 2783

Example Input: 3, 26, ['5141', 'c', 'c', 'K', '3639', '4487', 'G', '8839', 'F', '6699', '9171', '9409', 'm', 'N', 'E', '6055', '6819', 'c', 'r', 'u', '2475', 'q', 'F', '319', 'g', '2923', 'o', '6315', '8335']
Example Output: 60835

Example Input: 11, 25, ['8611', 'X', '1163', '4557', 'Q', 'E', '7861', '6559', 'W', '5725', '105', '5523', '3505', '2349', '8045', 'J', 'I', '4221', 'P', '3847', '2509', '7591', '9561', '4859', '4281']
Example Output:
56396