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:
3, 6, ['7233', '7997', 'a', '727', '8387', 'Q', '1313', 'E']

Ex Output:
9114


Ex Input:
3, 4, ['9567', '9317', 'l', 'n', 'i', '6993', '2775', '2651', '1311', '2955', '6271', 'b', '7333', 'U', 'd', '6455', 'n', 'o', '1871', 'u']

Ex Output:
0


Ex Input:
14, 24, ['5849', 'j', 'D', '4423', 'z', 'g', '5491', 'd', '8979', 'J', '1275', 'm', '5733', 'h', '737', 's', 'w', 'V', '1607', '6967', '7579', 'R', '4571', 'y', '2273', '5643']

Ex Output:

21461