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: 5, 6, ['2277', 'k', 'S', '6367', 'q', '5455']

Output: 5455


Input: Consider Input: 6, 15, ['p', '5005', 't', '4175', '7529', 'p', 'O', '2559', '1149', 'o', 'o', 'm', '3027', 'R', '8127', '5739']


Output: 14862