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.

Ex Input:
6, 15, ['U', 'E', '6873', '7621', '9241', '147', '4503', 'z', '3805', 'n', '4331', '4031', '2585', '9029', 'a', '7537', '975']

Ex Output:
28431


Ex 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']

Ex Output:
7267


Ex Input:
7, 10, ['1025', '7591', '5781', '7395', 'a', 'V', 'j', '7345', '703', '3981']

Ex Output:

12029