import java.io.InputStream; import java.io.IOException; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.BitSet; import java.util.Comparator; import java.util.Collections; import java.util.Deque; import java.util.HashMap; import java.util.HashSet; import java.util.InputMismatchException; import java.util.Map; import java.util.NoSuchElementException; import java.util.PriorityQueue; import java.util.TreeMap; import java.util.TreeSet; import java.math.BigDecimal; import java.math.BigInteger; public class Main{ static PrintWriter out; static InputReader ir; static final int INF=Integer.MAX_VALUE; static final long LINF=Long.MAX_VALUE; static void solve(){ int n=ir.nextInt(); int s=ir.nextInt(); int[] p=ir.nextIntArray(n); int r=n/2; int l=n-r; ArrayList list=new ArrayList(); ArrayList right=new ArrayList(); ArrayList left=new ArrayList(); for(int i=0;i<1<0){ for(int j=lb;j(){ public int compare(Long a,Long b){ for(int i=0;i X_ORDER=new Comp1(); public static Comparator Y_ORDER=new Comp2(); private static class Comp1 implements Comparator{ public int compare(Pair p1,Pair p2){ return (p1.x>p2.x)?1:(p1.x{ public int compare(Pair p1,Pair p2){ return (p1.y>p2.y)?1:(p1.y=val) return fromIndex; if(a[toIndex]1){ int mid=(ub+lb)/2; if(a[mid]>=val){ ub=mid; } else{ lb=mid; } } return ub; } public static int upper_bound(int[] a,int fromIndex,int toIndex,int val){ if(a[fromIndex]>val) return fromIndex; if(a[toIndex]<=val) return toIndex+1; int lb=fromIndex-1,ub=toIndex; while(ub-lb>1){ int mid=(ub+lb)/2; if(a[mid]>val){ ub=mid; } else{ lb=mid; } } return ub; } static class InputReader { private InputStream in; private byte[] buffer=new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;} public boolean hasNextByte() { if(curbuf>=lenbuf){ curbuf= 0; try{ lenbuf=in.read(buffer); }catch(IOException e) { throw new InputMismatchException(); } if(lenbuf<=0) return false; } return true; } private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;} private boolean isSpaceChar(int c){return !(c>=33&&c<=126);} private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;} public boolean hasNext(){skip(); return hasNextByte();} public String next(){ if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb=new StringBuilder(); int b=readByte(); while(!isSpaceChar(b)){ sb.appendCodePoint(b); b=readByte(); } return sb.toString(); } public int nextInt() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } int res=0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } long res = 0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public double nextDouble(){return Double.parseDouble(next());} public BigInteger nextBigInteger(){return new BigInteger(next());} public BigDecimal nextBigDecimal(){return new BigDecimal(next());} public int[] nextIntArray(int n){ int[] a=new int[n]; for(int i=0;i