CMO 2015 Problem 6

Let $a_1,a_2,...$ be a sequence of non-negative integers such that for any $m,n$ $$\sum_{i=1}^{2m} a_{in} \leq m.$$ Show that there exist $k,d$ such that $$\sum_{i=1}^{2k} a_{id} = k-2014.$$