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:
5, 9, ['1523', 'C', 'd', 'I', '6913', '5553', '2769', '767', 'v', '231', 'I', 'p', '9033', 'H', '2007', 'g', '5837', 'Z']

Ex Output:
16002


Ex Input:
1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']

Ex Output:
0


Ex Input:
5, 21, ['h', '5369', 'B', '1175', '4661', '4057', '6671', '1991', 's', 'E', '6833', 'a', 'F', 'Q', 'F', 's', '2639', '3621', 'G', 'n', '8965', '7777', '4221', 'q', '6649', 'R', 'f', '9851', 'm', 'g']

Ex Output:

39438