Problem: Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have different coordinates.

Let's define a total cleanup as the following process. The goal of this process is to collect all the piles in no more than two different x coordinates. To achieve this goal, Vova can do several (possibly, zero) moves. During one move, he can choose some x and move all piles from x to x+1 or x-1 using his broom. Note that he can't choose how many piles he will move.

Also, there are two types of queries:

  * 0 x — remove a pile of trash from the coordinate x. It is guaranteed that there is a pile in the coordinate x at this moment. 
  * 1 x — add a pile of trash to the coordinate x. It is guaranteed that there is no pile in the coordinate x at this moment. 



Note that it is possible that there are zero piles of trash in the room at some moment.

Vova wants to know the minimum number of moves he can spend if he wants to do a total cleanup before any queries. He also wants to know this number of moves after applying each query. Queries are applied in the given order. Note that the total cleanup doesn't actually happen and doesn't change the state of piles. It is only used to calculate the number of moves.

For better understanding, please read the Notes section below to see an explanation for the first example.

Input

The first line of the input contains two integers n and q (1 ≤ n, q ≤ 10^5) — the number of piles in the room before all queries and the number of queries, respectively.

The second line of the input contains n distinct integers p_1, p_2, ..., p_n (1 ≤ p_i ≤ 10^9), where p_i is the coordinate of the i-th pile.

The next q lines describe queries. The i-th query is described with two integers t_i and x_i (0 ≤ t_i ≤ 1; 1 ≤ x_i ≤ 10^9), where t_i is 0 if you need to remove a pile from the coordinate x_i and is 1 if you need to add a pile to the coordinate x_i. It is guaranteed that for t_i = 0 there is such pile in the current set of piles and for t_i = 1 there is no such pile in the current set of piles.

Output

Print q+1 integers: the minimum number of moves Vova needs to do a total cleanup before the first query and after each of q queries.

Examples

Input


5 6
1 2 6 8 10
1 4
1 9
0 6
0 10
1 100
1 50


Output


5
7
7
5
4
8
49


Input


5 8
5 1 2 4 3
0 1
0 2
0 3
0 4
0 5
1 1000000000
1 1
1 500000000


Output


3
2
1
0
0
0
0
0
499999999

Note

Consider the first example.

Initially, the set of piles is [1, 2, 6, 8, 10]. The answer before the first query is 5 because you can move all piles from 1 to 2 with one move, all piles from 10 to 8 with 2 moves and all piles from 6 to 8 with 2 moves.

After the first query, the set becomes [1, 2, 4, 6, 8, 10]. Then the answer is 7 because you can move all piles from 6 to 4 with 2 moves, all piles from 4 to 2 with 2 moves, all piles from 2 to 1 with 1 move and all piles from 10 to 8 with 2 moves.

After the second query, the set of piles becomes [1, 2, 4, 6, 8, 9, 10] and the answer is the same (and the previous sequence of moves can be applied to the current set of piles).

After the third query, the set of piles becomes [1, 2, 4, 8, 9, 10] and the answer is 5 because you can move all piles from 1 to 2 with 1 move, all piles from 2 to 4 with 2 moves, all piles from 10 to 9 with 1 move and all piles from 9 to 8 with 1 move.

After the fourth query, the set becomes [1, 2, 4, 8, 9] and the answer is almost the same (the previous sequence of moves can be applied without moving piles from 10).

After the fifth query, the set becomes [1, 2, 4, 8, 9, 100]. You can move all piles from 1 and further to 9 and keep 100 at its place. So the answer is 8.

After the sixth query, the set becomes [1, 2, 4, 8, 9, 50, 100]. The answer is 49 and can be obtained with almost the same sequence of moves as after the previous query. The only difference is that you need to move all piles from 50 to 9 too.

Solution (in JAVA):

Solution:
import java.util.*;

public class T4  {
    public static void main(String[] args) {

        Scanner s = new Scanner(System.in);
        int n = 1;
        for (int i=0;i<n;i++) {
            mainPrint(s);
        }
//        MyAVLTree myAVLTree = new MyAVLTree();
//        long time =System.currentTimeMillis();
//
//        for(int i=0;i<100000;i++){
//            myAVLTree.add(i);
//        }
//        System.out.println(System.currentTimeMillis()-time);
    }
    public static void mainPrint(Scanner s){
        int n = s.nextInt();
        int q = s.nextInt();
        int[] nums = new int[n];
//        TreeSet treeSet = new TreeSet();
//        MyAVLTree myAVLTree = new MyAVLTree();
        MyRBTree myRBTree = new MyRBTree();
        int max = 1,min = (int) 1e9;
        for(int i=0;i<n;i++){
            nums[i] = s.nextInt();
            max = Math.max(max,nums[i]);
            min = Math.min(min,nums[i]);
            myRBTree.add(nums[i]);
        }
//        Arrays.sort(nums);
        nums = Arrays.stream(nums).boxed().sorted().mapToInt($->$).toArray();
//        Queue<Integer> dis = new PriorityQueue<>((i1,i2)->{return i2-i1;});
        TreeMap<Integer, Integer> m = new TreeMap<>();
        for (int i=0;i<n-1;i++) add(nums[i+1]-nums[i],m);
        int peek;
        if(n>=2) {
            peek = m.lastKey();
            System.out.println(max - min - peek);
        }
        else System.out.println(0);
//        System.out.println(max+" "+min+" "+peek);
        boolean delete;
        int num;
        int next,last;
        for (int i=0;i<q;i++){
            delete = s.nextInt() == 0;
            num = s.nextInt();
            if(delete){
                n--;
                next = myRBTree.queryNext(num);
                last = myRBTree.queryLast(num);
                myRBTree.delete(num);
                if(next != Integer.MAX_VALUE) remove(next - num,m);
                else if(last != Integer.MIN_VALUE) max = last;
                else max = 1;
                if(last != Integer.MIN_VALUE) remove(num - last,m);
                else if(next != Integer.MAX_VALUE) min = next;
                else min = (int) 1e9;
                if(next != Integer.MAX_VALUE && last != Integer.MIN_VALUE) add(next - last,m);
            }else {
                n++;
                myRBTree.add(num);
                next = myRBTree.queryNext(num);
                last = myRBTree.queryLast(num);
                if(next == Integer.MAX_VALUE ) {
                    max = num;
                    if(last != Integer.MIN_VALUE) add(num - last,m);
                    else min = num;
                }else if (last == Integer.MIN_VALUE){
                    min = num;
                    if(next != Integer.MAX_VALUE) add(next - num,m);
                }else {
                    remove(next - last,m);
                    add(num - last,m);
                    add(next - num,m);
                }
            }
            if(n>=2) {
                peek = m.lastKey();
                System.out.println(max - min - peek);
            }else {
                System.out.println(0);
            }
//            System.out.println(max+" "+min+" "+peek);
        }
    }
    public static void add(int val,TreeMap<Integer,Integer> m){
        m.put(val,m.getOrDefault(val,0)+1);
    }
    public static void remove(int val,TreeMap<Integer,Integer> m) {
        int k = m.get(val) - 1;
        if (k == 0)
            m.remove(val);
        else
            m.put(val, k);
    }
}

class MyAVLTree {

    private static class AVLTreeNode{
        int val;
        int height;
        AVLTreeNode left;
        AVLTreeNode right;
        AVLTreeNode parent;

        public AVLTreeNode(int val) {
            this.val = val;
        }

        public AVLTreeNode() {

        }
    }
    AVLTreeNode root;

    public boolean query(int val){
        return queryNode(val)!=null;
    }

    public int queryNext(int val){
        AVLTreeNode node = queryNode(val);
        if(node.right!=null){
            AVLTreeNode next = node.right;
            while (next.left!=null) next = next.left;
            return next.val;
        }else if(node.parent != null){
            AVLTreeNode parent = node.parent;
            AVLTreeNode child = node;
            while (parent.left != child && parent.parent != null){
                child = parent;
                parent = parent.parent;
            }
            if(parent.left == child) return parent.val;
            else return Integer.MAX_VALUE;
        }else {
            return Integer.MAX_VALUE;
        }
    }

    public int queryLast(int val){
        AVLTreeNode node = queryNode(val);
        if(node.left!=null){
            AVLTreeNode next = node.left;
            while (next.right!=null) next = next.right;
            return next.val;
        }else if(node.parent != null ){
            AVLTreeNode parent = node.parent;
            AVLTreeNode child = node;
            while (parent.right != child && parent.parent != null){
                child = parent;
                parent = parent.parent;
            }
            if(parent.right == child) return parent.val;
            else return Integer.MIN_VALUE;
        }else {
            return Integer.MIN_VALUE;
        }
    }

    AVLTreeNode queryNode(int val){
        AVLTreeNode p = root;
        if(p==null) return null;
        while (p.val != val){
            if(p.val>val && p.left!=null){
                p=p.left;
                continue;
            }else if(p.val<val && p.right!=null){
                p=p.right;
                continue;
            }
            return null;
        }
        return p;
    }

    private void lRotate(AVLTreeNode node)  {
//        System.out.println("lRotate");
        if(node.right==null){
            try {
                throw new Exception("right child of the Node which lRotate can't be null");
            } catch (Exception e) {
                e.printStackTrace();
            }
            return;
        }
        AVLTreeNode nodeNew = node.right;
        AVLTreeNode parent = node.parent;
        AVLTreeNode a1 = node.left;
        AVLTreeNode a2 = nodeNew.left;
        AVLTreeNode a3 = nodeNew.right;
        if(parent==null){
            root = nodeNew;
        } else {
            if(parent.left==node) parent.left=nodeNew;
            else parent.right=nodeNew;
        }
        node.parent = nodeNew;
        node.right = a2;
        nodeNew.left = node;
        nodeNew.parent = parent;
        if(a2!=null){
            a2.parent = node;
        }
        countHeight(node);
        countHeight(nodeNew);
    }

    private boolean countHeight(AVLTreeNode node){
        int oldH = node.height;
        node.height=Math.max(height(node.left),height(node.right))+1;
        return oldH == node.height;
    }

    private void rRotate(AVLTreeNode node){
//        System.out.println("rRotate");
        if(node.left==null){
            try {
                throw new Exception("left child of the Node which lRotate can't be null");
            } catch (Exception e) {
                e.printStackTrace();
            }
            return;
        }
        AVLTreeNode nodeNew = node.left;
        AVLTreeNode parent = node.parent;
        AVLTreeNode a1 = nodeNew.left;
        AVLTreeNode a2 = nodeNew.right;
        AVLTreeNode a3 = node.right;
        if(parent==null){
            root = nodeNew;
        } else {
            if(parent.left==node) parent.left=nodeNew;
            else parent.right=nodeNew;
        }
        node.parent = nodeNew;
        node.left = a2;
        nodeNew.right = node;
        nodeNew.parent = parent;
        if(a2!=null){
            a2.parent = node;
        }
        countHeight(node);
        countHeight(nodeNew);
    }

    public void add(int val){
        if(root==null) {
            root = new AVLTreeNode(val);
            return;
        }
        AVLTreeNode p = root;
        while ((p.val>val && p.left!=null) || (p.val<val && p.right!=null)){
            if(p.val>val) p = p.left;
            else p = p.right;
        }
        if(p.val>val) {
            p.left = new AVLTreeNode(val);
            p.left.parent = p;
        }else if(p.val<val){
            p.right = new AVLTreeNode(val);
            p.right.parent = p;
        }
        balance(p);
    }

    private void balance(AVLTreeNode p){
        while (p!=null){
            int leftHeight = height(p.left),rightHeight = height(p.right);
            if(leftHeight-rightHeight>1) {
                if(height(p.left.right)-height(p.left.left)==1) {
                    lRotate(p.left);
                }
                rRotate(p);
            }else if(rightHeight - leftHeight>1){
                if(height(p.right.left)-height(p.right.right)==1){
                    rRotate(p.right);
                }
                lRotate(p);
            }
            boolean b = countHeight(p);
            if(b) break;
            p=p.parent;
        }

    }

    private int height(AVLTreeNode node){
        return node==null?-1:node.height;
    }

    public void delete(int val){
        AVLTreeNode node = queryNode(val);
        if (node==null){
            try {
                throw new Exception("the AVLTree don't contain the value");
            } catch (Exception e) {
                e.printStackTrace();
            }
        }else {
            delete(node);
        }
    }

    private void delete(AVLTreeNode node){
        if(node.left==null){
            delete1(node);
        }else if(node.left.right==null){
            delete2(node);
        }else {
            delete3(node);
        }
    }

    private void delete1(AVLTreeNode node){
        AVLTreeNode nodeNew = node.right;
        delete(node,nodeNew);
    }

    private void delete2(AVLTreeNode node){
        AVLTreeNode nodeNew = node.left;
        AVLTreeNode parent = node.parent;
        AVLTreeNode right = node.right;

        nodeNew.parent = parent;
        nodeNew.right = right;
        if(right!=null) right.parent = nodeNew;
        if(parent == null) {
            root = nodeNew;
            nodeNew.parent = null;
        } else {
            if (parent.left == node) {
                parent.left = nodeNew;
            }else {
                parent.right = nodeNew;
            }
        }
        balance(nodeNew);
    }

    private void delete3(AVLTreeNode node){
        AVLTreeNode p = node.left.right;
        while (p.right!=null) p=p.right;
        node.val = p.val;
        delete(p,p.left);
    }

    private void delete(AVLTreeNode node,AVLTreeNode nodeNew){
        AVLTreeNode parent = node.parent;
        if(nodeNew != null) nodeNew.parent = parent;
        if(parent==null) {
            root = nodeNew;
        }
        else {
            if(parent.right == node) parent.right = nodeNew;
            else parent.left = nodeNew;
            balance(parent);
        }
    }

    @Override
    public String toString() {
        if(root==null) return "nullVal";
        if(root.parent!=null) System.out.println("error");
        Queue<AVLTreeNode> q = new LinkedList<>();
        Queue<AVLTreeNode> q1 = new LinkedList<>();
        q.add(root);
        StringBuilder s = new StringBuilder();
        boolean flag;
        do {
            flag = false;
            while (!q.isEmpty()) {
                AVLTreeNode get = q.poll();
                if (get != null && get.parent == null && get != root) System.out.println("error");
                if (get != null) {
                    q1.add(get.left);
                    q1.add(get.right);
                    if(get.left!=null || get.right!=null) flag = true;
                    if((get.left != null && get.left.parent!=get) || (get.right != null && get.right.parent !=get)) System.out.println("error");
                    s.append(" ").append(get.val);
                } else {
                    q1.add(null);
                    q1.add(null);
                    s.append(" null");
                }
            }
            s.append("\n");
            q = q1;
            q1 = new LinkedList<>();
        } while (flag);
        return s.toString();
    }
}

class MyRBTree {

    static class RBTreeNode {
        int val;
        RBTreeNode left;
        RBTreeNode right;
        RBTreeNode parent;
        boolean red = true;

        public RBTreeNode(int val) {
            this.val = val;
        }
    }

    RBTreeNode root;

    public int queryNext(int val){
        RBTreeNode node = queryNode(val);
        if(node.right!=null){
            RBTreeNode next = node.right;
            while (next.left!=null) next = next.left;
            return next.val;
        }else if(node.parent != null){
            RBTreeNode parent = node.parent;
            RBTreeNode child = node;
            while (parent.left != child && parent.parent != null){
                child = parent;
                parent = parent.parent;
            }
            if(parent.left == child) return parent.val;
            else return Integer.MAX_VALUE;
        }else {
            return Integer.MAX_VALUE;
        }
    }

    public int queryLast(int val){
        RBTreeNode node = queryNode(val);
        if(node.left!=null){
            RBTreeNode next = node.left;
            while (next.right!=null) next = next.right;
            return next.val;
        }else if(node.parent != null ){
            RBTreeNode parent = node.parent;
            RBTreeNode child = node;
            while (parent.right != child && parent.parent != null){
                child = parent;
                parent = parent.parent;
            }
            if(parent.right == child) return parent.val;
            else return Integer.MIN_VALUE;
        }else {
            return Integer.MIN_VALUE;
        }
    }

    public boolean query(int val){
        return queryNode(val)!=null;
    }

    RBTreeNode queryNode(int val){
        RBTreeNode p = root;
        if(p==null) return null;
        while (p.val != val){
            if(p.val>val && p.left!=null){
                p=p.left;
                continue;
            }else if(p.val<val && p.right!=null){
                p=p.right;
                continue;
            }
            return null;
        }
        return p;
    }

    public void add(int val) {
        if (query(val)) return;
        if (root == null) {
            root = new RBTreeNode(val);
            root.red = false;
            return;
        }
        RBTreeNode p = root;
        while ((p.val > val && p.left != null) || (p.val < val && p.right != null)) {
            if (p.val > val) p = p.left;
            else p = p.right;
        }
        if (p.val > val) {
            p.left = new RBTreeNode(val);
            p.left.parent = p;
            if(p.red) insertBalance(p.left);
        } else {
            p.right = new RBTreeNode(val);
            p.right.parent = p;
            if(p.red) insertBalance(p.right);
        }
    }

    private void insertBalance(RBTreeNode node){
        RBTreeNode parent = node.parent;
        RBTreeNode grandParent = parent.parent;
        RBTreeNode uncle = grandParent.left == parent ? grandParent.right:grandParent.left;
        if(uncle == null || !uncle.red){
            balance1(node,parent,grandParent,uncle);
        }else {
            balance2(node,parent,grandParent,uncle);
        }
    }

    private void balance1(RBTreeNode node,RBTreeNode parent,RBTreeNode grandParent,RBTreeNode uncle){
        if(node == parent.left && parent == grandParent.left){
            rRotate(grandParent);
            grandParent.red = true;
            parent.red = false;
        }else if(node == parent.right && parent == grandParent.left){
            lRotate(parent);
            rRotate(grandParent);
            grandParent.red = true;
            node.red = false;
        }else if(node == parent.left && parent == grandParent.right){
            rRotate(parent);
            lRotate(grandParent);
            grandParent.red = true;
            node.red = false;
        }else {
            lRotate(grandParent);
            grandParent.red = true;
            parent.red = false;
        }
    }

    private void balance2(RBTreeNode node,RBTreeNode parent,RBTreeNode grandParent,RBTreeNode uncle){
        grandParent.red = true;
        parent.red = false;
        uncle.red = false;
        if(grandParent == root) grandParent.red = false;
        else if(grandParent.parent.red) insertBalance(grandParent);
    }

    private void lRotate(RBTreeNode node){
        if(node.right==null){
            try {
                throw new Exception("right child of the Node which lRotate can't be null");
            } catch (Exception e) {
                e.printStackTrace();
            }
            return;
        }
        RBTreeNode nodeNew = node.right;
        RBTreeNode parent = node.parent;
        RBTreeNode a1 = node.left;
        RBTreeNode a2 = nodeNew.left;
        RBTreeNode a3 = nodeNew.right;
        if(parent==null){
            root = nodeNew;
        } else {
            if(parent.left==node) parent.left=nodeNew;
            else parent.right=nodeNew;
        }
        node.parent = nodeNew;
        node.right = a2;
        nodeNew.left = node;
        nodeNew.parent = parent;
        if(a2!=null){
            a2.parent = node;
        }
    }

    private void rRotate(RBTreeNode node){
        if(node.left==null){
            try {
                throw new Exception("left child of the Node which lRotate can't be null");
            } catch (Exception e) {
                e.printStackTrace();
            }
            return;
        }
        RBTreeNode nodeNew = node.left;
        RBTreeNode parent = node.parent;
        RBTreeNode a1 = nodeNew.left;
        RBTreeNode a2 = nodeNew.right;
        RBTreeNode a3 = node.right;
        if(parent==null){
            root = nodeNew;
        } else {
            if(parent.left==node) parent.left=nodeNew;
            else parent.right=nodeNew;
        }
        node.parent = nodeNew;
        node.left = a2;
        nodeNew.right = node;
        nodeNew.parent = parent;
        if(a2!=null){
            a2.parent = node;
        }
    }

    public void delete(int val){
        RBTreeNode node = queryNode(val);
        if (node==null){
            try {
                throw new Exception("the RBTree don't contain the value");
            } catch (Exception e) {
                e.printStackTrace();
            }
            return;
        }
        if(node.left == null && node.right == null && node.red){
            justDelete(node);
        }else if(node.left == null && node.right == null && !node.red){
            delete1(node);
        }else if(node.left == null){
            delete2(node,node.right);
        }else if(node.right == null){
            delete2(node,node.left);
        }else {
            delete3(node);
        }
    }

    private void justDelete(RBTreeNode node){
        if(node.parent == null) {
            root = null;
            return;
        }
        RBTreeNode parent = node.parent;
        if(parent.left == node) parent.left = null;
        else parent.right = null;
    }

    private void delete1(RBTreeNode node){
        balanceForDelete1(node);
        justDelete(node);
    }

    private void balanceForDelete1(RBTreeNode node){
        RBTreeNode parent = node.parent;
        if(parent == null) {
            return;
        }
        RBTreeNode brother = parent.left == node ? parent.right:parent.left;
        if(!brother.red){
            if((brother.left == null || !brother.left.red) && (brother.right == null || !brother.right.red)){
                if(!parent.red){
                    brother.red = true;
                    balanceForDelete1(parent);
                }
                else {
                    brother.red = true;
                    parent.red = false;
                }
            }
            else {
                if(brother==parent.left && brother.left!=null && brother.left.red){
                    brother.left.red = false;
                    brother.red = parent.red;
                    parent.red = false;
                    rRotate(parent);

                }else if(brother==parent.left && brother.right!=null && brother.right.red) {
                    brother.right.red = false;
                    brother.red =true;
                    lRotate(brother);
                    balanceForDelete1(node);
                }else if(brother==parent.right && brother.right!=null && brother.right.red){
                    brother.right.red = false;
                    brother.red = parent.red;
                    parent.red = false;
                    lRotate(parent);
                }else {
                    brother.left.red =false;
                    brother.red = true;
                    rRotate(brother);
                    balanceForDelete1(node);
                }
            }
        }
        else {
            if(brother == parent.left){
                rRotate(parent);
            }
            else {
                lRotate(parent);

            }
            parent.red = true;
            brother.red = false;
            balanceForDelete1(node);
        }
    }

    private void delete2(RBTreeNode node,RBTreeNode newNode){
        RBTreeNode parent = node.parent;
        if(parent == null){
            root = newNode;
        }else {
            if(parent.left == node) {
                parent.left = newNode;
            }else {
                parent.right = newNode;
            }
        }
        newNode.parent = parent;
        newNode.red = false;
    }

    private void delete3(RBTreeNode node){
        RBTreeNode p = node.left;
        while (p.right != null) p = p.right;
        node.val = p.val;
        if(p.left!=null) delete2(p,p.left);
        else if(p.red) justDelete(p);
        else delete1(p);
    }

    @Override
    public String toString() {
        if(root==null) return "nullVal";
        if(root.parent!=null) System.out.println("error");
        Queue<RBTreeNode> q = new LinkedList<>();
        Queue<RBTreeNode> q1 = new LinkedList<>();
        q.add(root);
        StringBuilder s = new StringBuilder();
        boolean flag;
        do {
            flag = false;
            while (!q.isEmpty()) {
                RBTreeNode get = q.poll();
                if (get != null && get.parent == null && get != root) System.out.println("error");
                if (get != null) {
                    q1.add(get.left);
                    q1.add(get.right);
                    if(get.left!=null || get.right!=null) flag = true;
                    if((get.left != null && get.left.parent!=get) || (get.right != null && get.right.parent !=get)) System.out.println("error");
                    s.append(" ").append(get.val).append(get.red ? "red":"black");
                } else {
                    q1.add(null);
                    q1.add(null);
                    s.append(" null");
                }
            }
            s.append("\n");
            q = q1;
            q1 = new LinkedList<>();
        } while (flag);
        return s.toString();
    }
}

class MyHeap {
    private int[] c = new int[16];
    private int size=0;
    public void add(int val){
        if(size == c.length) grow();
        c[size] = val;
        up(size++);
    }

    public int deleteMin(){
        int ans = c[0];
        c[0] = c[size-1];
        down(0);
        return ans;
    }

    private void down(int index){
        while ((2*index+1<size && c[index]>c[2*index+1])||(2*index+2<size && c[index]>c[2*index+2])){
            if(2*index+2<size && c[index]>c[2*index+2]){
                if(c[2*index+2]<c[2*index+1]) {
                    swap(2 * index + 2, index);
                    index = 2*index + 2;
                }
                else {
                    swap(2 * index + 1, index);
                    index = 2*index + 1;
                }
            }else {
                swap(2*index+1,index);
                index = 2*index + 1;
            }
        }
    }

    public int peek(){
        return c[0];
    }

    private void up(int index){
        while (c[index]<c[(index-1)/2]) {
            swap(index,(index-1)/2);
            index = index/2;
        }
    }

    private void swap(int index1,int index2){
        c[index1]^=c[index2];
        c[index2]^=c[index1];
        c[index1]^=c[index2];
    }

    private void grow() {
        if(c.length>Integer.MAX_VALUE>>2) {
            try {
                throw new Exception("Can't create so large Heap!");
            }catch (Exception e){

            }
        }
        int[] newC = new int[c.length<<1];
        System.arraycopy(c,0,newC,0,c.length);
        c = newC;
    }

}