Problem: There are n piles of pebbles on the table, the i-th pile contains ai pebbles. Your task is to paint each pebble using one of the k given colors so that for each color c and any two piles i and j the difference between the number of pebbles of color c in pile i and number of pebbles of color c in pile j is at most one.

In other words, let's say that bi, c is the number of pebbles of color c in the i-th pile. Then for any 1 ≤ c ≤ k, 1 ≤ i, j ≤ n the following condition must be satisfied |bi, c - bj, c| ≤ 1. It isn't necessary to use all k colors: if color c hasn't been used in pile i, then bi, c is considered to be zero.

Input

The first line of the input contains positive integers n and k (1 ≤ n, k ≤ 100), separated by a space — the number of piles and the number of colors respectively.

The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 100) denoting number of pebbles in each of the piles.

Output

If there is no way to paint the pebbles satisfying the given condition, output "NO" (without quotes) .

Otherwise in the first line output "YES" (without quotes). Then n lines should follow, the i-th of them should contain ai space-separated integers. j-th (1 ≤ j ≤ ai) of these integers should be equal to the color of the j-th pebble in the i-th pile. If there are several possible answers, you may output any of them.

Examples

Input

4 4
1 2 3 4


Output

YES
1
1 4
1 2 4
1 2 3 4


Input

5 2
3 2 4 1 3


Output

NO


Input

5 4
3 2 4 3 5


Output

YES
1 2 3
1 3
1 2 3 4
1 3 4
1 1 2 3 4

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Main {
    FastScanner in = new FastScanner();
    PrintWriter out;

    private int N, K;
    private List pebbles[];
    
    public void solve() throws IOException {
        N = in.nextInt();
        K = in.nextInt();
       
        final int piles[] = new int[N];
        Integer ids[] = new Integer[N];
        pebbles = new List[N];

        for (int n = 0; n < N; n++) {
            ids[n] = n;
            piles[n] = in.nextInt();
            pebbles[n] = new LinkedList();
        }

        Arrays.sort(ids, new Comparator<Integer>() {

            @Override
            public int compare(Integer i1, Integer i2) {
                return Integer.compare(piles[i1], piles[i2]);
            }

        });

        boolean onlyOne = false;
        int c = 0;
        for (int i = 0; i < N; i++) {
            int id = ids[i];

            while (piles[id] > 0) {
                c++;
                if (c > K) {
                    System.out.println("NO");
                    return;
                }

                int min = piles[id];

                for (int j = i; j < N; j++) {
                    int id2 = ids[j];

                    int kToFill;
                    if (onlyOne) {
                        kToFill = 1;
                    } else {
                        kToFill = Math.min(min + 1, piles[id2]);
                    }

                    for (int k = 0; k < kToFill; k++) {
                        pebbles[id2].add(c);
                    }
                    piles[id2] -= kToFill;
                }
                onlyOne = true;    
            }   

                                        
        }

        System.out.println("YES");
        for (int n = 0; n < N; n++) {
            for (Object k: pebbles[n]) {
                System.out.print((Integer)k + " ");
            }
            System.out.println();
        }
    }

    public void run() {
        try {
            solve();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    class FastScanner {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st;

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }


        int read() throws IOException {
            return br.read();
        }
    }

    // http://stackoverflow.com/questions/521171/a-java-collection-of-value-pairs-tuples
    public class Pair<L,R> {

      private final L left;
      private final R right;

      public Pair(L left, R right) {
        this.left = left;
        this.right = right;
    }

    public L getLeft() { return left; }
    public R getRight() { return right; }

    @Override
    public int hashCode() { return left.hashCode() ^ right.hashCode(); }

    @Override
    public boolean equals(Object o) {
        if (o == null) return false;
        if (!(o instanceof Pair)) return false;
        Pair pairo = (Pair) o;
        return this.left.equals(pairo.getLeft()) &&
        this.right.equals(pairo.getRight());
    }

}

public static void main(String[] arg) {
    new Main().run();
}
}