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:
2, 8, ['743', '3417', '5979', 'J', 'f', '4707', 'k', 'i', '2167', 'V', 'g']

Ex Output:
14103


Ex Input:
3, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']

Ex Output:
45165


Ex Input:
2, 7, ['5839', 'K', 'g', '885', 'Z', 'A', '5147', '2329', 'L', 'R', 'q', 'y', 'U', 'A', '6079', '3419', '263', '2839']

Ex Output:

6032