Definition: 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: 18, 30, ['2693', '6571', '7831', '5969', '9397', 'Z', 'r', 'A', 'x', 'J', 'c', '7073', '8129', 'Y', '3437', 'p', 'H', 'g', '5895', 'q', '9349', '141', 'V', '1435', '3249', 'P', '8781', 'n', 'M', '7347']

36197