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.

Input: Consider 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']

Output: 54135


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

Output: 57104


Input: Consider Input: 6, 17, ['R', 'w', '9223', '2745', 'n', '2035', 'Q', 'e', 'd', '1137', '7349', 'v', 'S', '2715', 'Y', 'L', 'Y', 'R', 'o', '2869', '8585', '7855', 'g', 'E', 'G']


Output: 13236