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, 8, ['g', 'D', 'W', 'q', '7817', '9295', '2385', 'V', 'c', '7761']

Ex Output:
19497


Ex Input:
2, 8, ['743', '3417', '5979', 'J', 'f', '4707', 'k', 'i', '2167', 'V', 'g']

Ex Output:
14103


Ex Input:
2, 3, ['8641', '6301', 'e', '6089', '5219', 'a', 'l', 'y', 'Q', 'x', 'J', 'j', 'W', '8259', '6077', '2389', '7571', '3989', 'I', 'n', '7103', '1057', '4015']

Ex Output:

6301