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:
3, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']

Ex Output:
22632


Ex Input:
13, 27, ['1823', '1893', '1273', 'S', '121', '5845', 'h', '7453', '5541', 'b', '6307', '8151', 'G', '5447', 'b', 'l', 't', '137', '8685', '1539', 'c', '175', '5763', 'l', 'D', '1257', 'y']

Ex Output:

23003