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: 3, 15, ['q', '3851', '3631', 'z', '6681', 'Z', '461', 'K', 'P', 'i', '9039', '5929', '1415', 'o', 'O', 'H', '4047', 'B', '7073', '2087', 'I', '6857', '5751', '3633', 'U', '869', 'n', 'h', '7807', '469']

Output: 27156


Input: Consider Input: 16, 20, ['8615', '8269', 'k', 'R', 'l', '9823', '6879', '7777', 'w', '8443', 'W', '6951', 'Q', '8251', 'M', 'g', 'F', 'w', 'C', '7267', 's', '973', '4703', '8921']

Output: 7267


Input: Consider Input: 3, 3, ['e', 'y', 'Y', 'j']


Output: 0