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: 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']

Output: 14437


Input: Consider Input: 2, 10, ['N', 'K', '4585', 'd', '8219', '3831', 'e', '7037', 'h', 'd', 'c', '577', 'c', '3559', '4059', 'M', '5349', 'V', 'L', '1807']

Output: 23672


Input: Consider Input: 5, 11, ['C', 'n', '3663', '6759', '3261', 's', 'S', '9673', 'O', '8619', 'R', 'm', 'X']


Output: 21553