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, 6, ['7233', '7997', 'a', '727', '8387', 'Q', '1313', 'E']

Output: 9114


Input: Consider Input: 11, 18, ['7053', '4271', '3175', '3997', '4153', '3255', 'd', '4507', 'q', 'm', 'V', '9999', 'Q', 'v', '8543', '2835', '1545', '3549']

Output: 26471


Input: Consider Input: 2, 5, ['3095', 'E', 'e', '6237', '4081', 'p']


Output: 10318