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: 2, 6, ['S', 'y', '2729', '9935', 'T', 'H', '3063', '9587']

Output: 12664


Input: Consider Input: 9, 9, ['8073', 'i', '5725', 'j', '4631', 'h', '245', '2191', '2445', '267', 'V', 'D', '3385', 'W']

Output: 2445


Input: Consider Input: 8, 8, ['o', '6605', '7151', '7569', '8905', '923', 's', 'o', 'Q', 'L', 'y', '2107', 'h', 'R', '2761']


Output: 0