The Two-dimensional kingdom is going through hard times... This morning the Three-Dimensional kingdom declared war on the Two-dimensional one. This (possibly armed) conflict will determine the ultimate owner of the straight line. The Two-dimensional kingdom has a regular army of n people. Each soldier registered himself and indicated the desired size of the bulletproof vest: the i -th soldier indicated size a i . The soldiers are known to be unpretentious, so the command staff assumes that the soldiers are comfortable in any vests with sizes from a i - x to a i + y , inclusive (numbers x , y ≥ 0 are specified). The Two-dimensional kingdom has m vests at its disposal, the j -th vest's size equals b j . Help mobilize the Two-dimensional kingdom's army: equip with vests as many soldiers as possible. Each vest can be used only once. The i -th soldier can put on the j -th vest, if a i - x ≤ b j ≤ a i + y . The first input line contains four integers n , m , x and y ( 1 ≤ n , m ≤ 10 5 , 0 ≤ x , y ≤ 10 9 ) — the number of soldiers, the number of vests and two numbers that specify the soldiers' unpretentiousness, correspondingly. The second line contains n integers a 1 , a 2 , ..., a n ( 1 ≤ a i ≤ 10 9 ) in non-decreasing order, separated by single spaces — the desired sizes of vests. The third line contains m integers b 1 , b 2 , ..., b m ( 1 ≤ b j ≤ 10 9 ) in non-decreasing order, separated by single spaces — the sizes of the available vests. In the first line print a single integer k — the maximum number of soldiers equipped with bulletproof vests. In the next k lines print k pairs, one pair per line, as " u i v i " (without the quotes). Pair ( u i , v i ) means that soldier number u i must wear vest number v i . Soldiers and vests are numbered starting from one in the order in which they are specified in the input. All numbers of soldiers in the pairs should be pairwise different, all numbers of vests in the pairs also should be pairwise different. You can pri