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.

Input: Consider Input: 23, 25, ['v', 'J', 'B', 'y', 'G', 'z', 'f', '1651', 'T', 'X', '8701', '701', 'T', 'V', '1037', '4095', '8297', '2733', 'P', 'J', '7759', 'Z', '8153', 'q', '7619']

Output: 15772


Input: Consider Input: 8, 9, ['1329', '3107', 's', 'z', '2013', '1633', 'i', '1229', '4201', 'M', '3127']

Output: 5430


Input: Consider Input: 6, 19, ['4273', 'Y', 'q', 'X', '1365', '5013', '4179', 'y', '5657', '5613', 'W', 's', 'u', '5473', '7729', 'k', '8727', '8825', 'Z', '1107', '2017', 'p', 'L', '6961']


Output: 51216