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.
13, 14, ['N', 'W', '8947', '5129', 'T', '717', 'o', '4983', 'B', 'J', '607', '8107', 'D', '5565', 'I', '9893', '939', '2009', '8305', '1231', 'A', '8995', '8281', '2653', '7767', 'v', '5367']