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:
9, 13, ['6195', 'k', '6835', 'u', '4049', '3063', 'N', 'q', 'R', 'Y', '8573', 'r', '2037', 'w', 'D', 'Y', '9849', 'T', '2245', '6999']

Ex Output:
10610


Ex Input:
21, 24, ['6903', '3349', '4585', 'C', 'w', 'I', 'U', 'n', '2689', 'W', '6601', '7357', '5063', 'y', '5779', 'L', '4257', 'd', '653', 'k', '8349', 'r', 'Y', '3019', 'E', '797', 'm']

Ex Output:
11368


Ex Input:
4, 19, ['v', 'U', '389', 'S', '6813', '4047', 'w', 'U', 'i', '2111', 'm', '9713', '5413', 'l', 'B', 'H', 'c', 'k', 'l', '5477', 'L', 'e', '5135', 'Y', 'b']

Ex Output:

28097