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, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']

Output: 4866


Input: Consider Input: 10, 13, ['z', 'h', '141', '7351', '3683', '2199', '1981', '107', 'Y', 'E', 'G', 'P', '9677', 'O', 'e', '1661', 'f', '1367', 'b', '8531']

Output: 9677


Input: Consider Input: 2, 6, ['l', 'n', 'J', 'X', '5189', 'z']


Output: 5189