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, 15, ['r', '3527', 'Z', '9011', 'm', '879', '5305', '7153', 'c', '3567', 'd', '2319', 'M', 'y', '7703', '4899', 'G']

Ex Output:
39464


Ex Input:
12, 19, ['x', 'Z', 'm', '3819', 'D', 'P', '4815', 'D', 'V', '1409', 'u', 'N', 'E', 'A', 'v', 'k', '553', '1869', '6203', '803', '4061']

Ex Output:
8625


Ex Input:
4, 20, ['v', 'C', 'w', 's', 'S', '1757', 'd', 'V', 'y', 'N', '9139', 'N', 'B', '4867', '4509', 't', '3247', '3339', '895', 'i', '8261', 'a', 'a', 'Y', '831', 'j', '3555']

Ex Output:

27753