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: 6, 7, ['6261', 'l', 'T', 't', 'X', 'G', 'Y', 'f']

Output: 0


Input: Consider Input: 1, 4, ['7771', '6243', 's', 'n', '4775']

Output: 14014


Input: Consider Input: 10, 14, ['4081', '8381', '1145', '9169', 'e', '7171', 'p', 'K', 'j', '9977', '6281', '9403', '9891', 'y', '2807', 'q', 'D', '3337', '2601', '7079', 'R', '1797', 'x']


Output: 35552