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: 10, 16, ['Q', '931', 'P', '6777', 'X', '3855', 'i', '1055', 'd', 'p', '7947', 'z', 'X', 'h', 'g', 'w', 'r', 'T']

Output: 7947


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: 3, 4, ['O', '6141', '1209', 'y', 'l']


Output: 1209