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: 1, 5, ['O', '4521', 'w', '6745', 'W', '7743', '4113', '7179', '9751', '2365', '9161', 'j', '1339', '6927']

Output: 11266


Input: Consider Input: 1, 7, ['Y', 'n', '8993', 'X', '7211', 's', 't', 'R', 'm', 'L', '9559', 'K', 'j', '791']

Output: 16204


Input: Consider Input: 2, 6, ['F', 'P', 'K', '8273', 'S', 'V', '9265', 'u', 'K', '3827', '4231', '5213', 'C', '473', 'd', 'v']


Output: 8273