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: 3, 10, ['x', '5071', '6421', '5701', 'l', '5659', 'P', '7975', 'z', 'p', 'B', 'q', '1275', 'v', '6471', 'o', 'Q', 'F', '1845', '6063', '3277', '9039', '4209', '2869', '2293', '4517', '577', '3375']

Output: 25756


Input: Consider Input: 2, 12, ['2873', '259', 'b', '2009', 'T', '6161', '8637', 'V', 'Z', 'Z', 'q', '6935', '5311']

Output: 24001


Input: Consider Input: 8, 20, ['F', 'J', 'h', 'f', '1483', 'p', 'p', 'T', '5167', 'i', 'l', '2185', 'E', 'z', 'e', '1225', 'P', 'n', 'O', '2915', 'V', 'g', '2627', 'X', 't']


Output: 11492