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, 3, ['5437', '8521', '9081', 'h', '5453', '5065', '2949', 'P', 'Q', '2853', '7857', 'l', '5217', 'O', 'V', '3585', 't', '2593', 'V']

Output: 23039


Input: Consider Input: 1, 4, ['2025', '6689', '1227', '3943', 'z', '719', '8941', 'b', 'V', 'w', '5267', '2403', 'N', '5771']

Output: 13884


Input: Consider Input: 10, 11, ['D', '8083', '6375', '9351', '1029', '8013', '8085', 'u', '8299', '1739', '5815', 'W', '9425', 'o']


Output: 7554