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, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']

Output: 23119


Input: Consider Input: 14, 17, ['Q', '7681', '8379', '2569', 'D', '5179', 'M', 'M', 'k', '187', '9275', 'V', 'L', 'F', '6397', '6385', 'O', '4823', '8655']

Output: 12782


Input: Consider Input: 9, 13, ['C', 'n', 'C', '6587', '1575', '1795', 'n', 'j', '6559', '109', 'r', '7557', 'l', 'a', '9199', 'o', '9197', '3705', '1283', 'V', 'v', 'v', '21', 'J', 'P', 'U']


Output: 14225