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:
1, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']

Ex Output:
4866


Ex Input:
8, 12, ['v', 'N', '8123', '1677', '5743', '8657', 'S', '5073', 'Y', 'R', '2781', '6583', 'A', '1989', 'S', '9301', 'y', 'j', '1759', 'U', '9951', 'W', '5967', 'a', 'c']

Ex Output:
14437


Ex Input:
2, 7, ['Q', 'p', 'P', 'f', '3979', '9303', 'n', 'I', '8565', '1425']

Ex Output:

13282