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: 2, 15, ['4175', '6415', 'U', '8883', 'J', '5843', '3923', '8991', 'P', 'm', 'S', 'T', '5819', 'q', '7405']

Output: 47279


Input: Consider Input: 1, 6, ['8527', '3499', 'M', 'f', 'V', 'B']

Output: 12026


Input: Consider Input: 3, 12, ['C', '189', '2621', 'p', 'k', 'e', 'f', '6957', '971', '5621', 'e', '177']


Output: 16347