The Saratov State University Olympiad Programmers Training Center (SSU OPTC) has n students. For each student you know the number of times he/she has participated in the ACM ICPC world programming championship. According to the ACM ICPC rules, each person can participate in the world championship at most 5 times.

The head of the SSU OPTC is recently gathering teams to participate in the world championship. Each team must consist of exactly three people, at that, any person cannot be a member of two or more teams. What maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least k times?

Input

The first line contains two integers, n and k (1 ≤ n ≤ 2000; 1 ≤ k ≤ 5). The next line contains n integers: y1, y2, ..., yn (0 ≤ yi ≤ 5), where yi shows the number of times the i-th person participated in the ACM ICPC world championship.

Output

Print a single number — the answer to the problem.

Examples

Input

5 2
0 4 5 1 0


Output

1


Input

6 4
0 1 2 3 4 5


Output

0


Input

6 5
0 0 0 0 0 0


Output

2

Note

In the first sample only one team could be made: the first, the fourth and the fifth participants.

In the second sample no teams could be created.

In the third sample two teams could be created. Any partition into two teams fits.
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.ObjectInputStream.GetField;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

public class AllMeth{
    static long MOD = 1000000007;
    static boolean b[];
    static ArrayList<Integer>[] amp;
    static int sum[],dist[];
    static long ans = 0;
    static int p = 0;
    static FasterScanner sc = new FasterScanner();
    static Queue<Integer> q = new LinkedList<>();
    static ArrayList<String>[] arr;
    static ArrayList<Integer> parent = new ArrayList<>();
    static BufferedWriter log;
    static HashMap<Long,Long> hm;
    static HashSet<Integer> hs = new HashSet<>();
    static Stack<Integer> s = new Stack<>();
    static Pair prr[];







    public static void main(String[] args) throws IOException {
        log = new BufferedWriter(new OutputStreamWriter(System.out));

        int size=sc.nextInt();
        int playersize= sc.nextInt();
        int count=0;
        for(int i=0;i<size;i++)
        {
            parent.add(sc.nextInt());

        }
        for(int i=0;i<size;i++)
        {
            if(5-parent.get(i) >=playersize)
            {
                count++;
            }

        }
        System.out.println(count/3);


        log.close();
    }







    static int sum(int n){
        String str = Integer.toString(n);
        int cnt = 0;
        for(int i = 0; i< str.length();i++){
            cnt+=(str.charAt(i)-'0');
        }
        return cnt;
    }
    static void KMPSearch(String pat, String txt)
    {
        int M = pat.length();
        int N = txt.length();

        // create lps[] that will hold the longest
        // prefix suffix values for pattern
        int lps[] = new int[M];
        int j = 0;  // index for pat[]

        // Preprocess the pattern (calculate lps[]
        // array)
        computeLPSArray(pat,M,lps);

        int i = 0;  // index for txt[]
        while (i < N)
        {
            if (pat.charAt(j) == txt.charAt(i))
            {
                j++;
                i++;
            }
            if (j == M)
            {
                parent.add((i-j));
                j = lps[j-1];
            }

            // mismatch after j matches
            else if (i < N && pat.charAt(j) != txt.charAt(i))
            {
                // Do not match lps[0..lps[j-1]] characters,
                // they will match anyway
                if (j != 0)
                    j = lps[j-1];
                else
                    i = i+1;
            }
        }
    }
    static void computeLPSArray(String pat, int M, int lps[])
    {
        // length of the previous longest prefix suffix
        int len = 0;
        int i = 1;
        lps[0] = 0;  // lps[0] is always 0

        // the loop calculates lps[i] for i = 1 to M-1
        while (i < M)
        {
            if (pat.charAt(i) == pat.charAt(len))
            {
                len++;
                lps[i] = len;
                i++;
            }
            else  // (pat[i] != pat[len])
            {
                // This is tricky. Consider the example.
                // AAACAAAA and i = 7. The idea is similar
                // to search step.
                if (len != 0)
                {
                    len = lps[len-1];

                    // Also, note that we do not increment
                    // i here
                }
                else  // if (len == 0)
                {
                    lps[i] = len;
                    i++;
                }
            }
        }
    }
    private static void permutation(String prefix, String str) {
        int n = str.length();
        if (n == 0); //hs.add(prefix);
        else {
            for (int i = 0; i < n; i++)
                permutation(prefix + str.charAt(i), str.substring(0, i) + str.substring(i+1, n));
        }
    }
    public static char give(char c1,char c2){
        if(c1!='a' && c2!='a') return 'a';
        if(c1!='b' && c2!='b') return 'b';
        return 'c';
    }
    static class Graph{
        int vertex;
        long weight;
    }
    public static void buildTree(int n){
        int arr[] = sc.nextIntArray(n);
        for(int i = 0;i<n;i++){
            int x = arr[i]-1;
            amp[i+1].add(x);
            amp[x].add(i+1);
        }
    }
    public static void bfs(int x,long arr[]){

        b[x] = true;
        q.add(x);
        while(!q.isEmpty()){
            int y = q.poll();
            for(int i = 0;i<amp[y].size();i++) {
                if(!b[amp[y].get(i)]){
                    q.add(amp[y].get(i));
                    b[amp[y].get(i)] = true;
                }
            }
        }
    }

    public static void buildGraph(int n){

        for(int i =0;i<n;i++){
            int x = sc.nextInt(), y = sc.nextInt();
            amp[--x].add(--y);
            amp[y].add(x);
        }
    }

    public static void dfs(int x){
        b[x] = true;
        for(int i =0 ;i<amp[x].size();i++){
            if(!b[amp[x].get(i)]){
                dfs(amp[x].get(i));
            }
        }

    }
    static class Pair implements Comparable<Pair> {
        int u;
        int v;
        public Pair(){

        }
        public Pair(int u, int v) {
            this.u = u;
            this.v = v;
        }

        public int hashCode() {
            int hu = (int) (u ^ (u >>> 32));
            int hv = (int) (v ^ (v >>> 32));
            return 31*hu + hv;
        }

        public boolean equals(Object o) {
            Pair other = (Pair) o;
            return (u == other.u && v == other.v);
        }

        public int compareTo(Pair other) {
            return Integer.compare(u, other.u) != 0 ? (Integer.compare(u, other.u)) : (Integer.compare(v, other.v));
        }

        public String toString() {
            return "[u=" + u + ", v=" + v + "]";
        }
    }
    static class Pair2 implements Comparable<Pair> {
        int u;
        String v;
        public Pair2(){

        }
        public Pair2(int u, String v) {
            this.u = u;
            this.v = v;
        }
        public boolean equals(Object o) {
            Pair other = (Pair) o;
            return (u == other.u && v.equals(other.v));
        }
        public int compareTo(Pair other) {
            return Integer.compare(u, other.u);
        }

        public String toString() {
            return "[u=" + u + ", v=" + v + "]";
        }
    }
    static class SegmentTree{
        int st[];
        SegmentTree(int arr[], int n){
            int size = 4*n+1;
            st = new int[size];
            build(arr,0,n-1,0);
        }
        int build(int arr[], int ss, int se, int si){
            if(ss==se){
                st[si] = arr[ss];
                return st[si];
            }
            int mid = (ss+se)/2;
            st[si] = build(arr,ss,mid,si*2+1)^build(arr,mid+1,se,si*2+2);
            return st[si];
        }
        int getXor(int qs, int qe, int ss, int se, int si){
            if(qe<ss || qs>se){
                return 0;
            }
            if(qs<=ss && qe>=se) return st[si];
            int mid = (ss+se)/2;
            return getXor(qs,qe,ss,mid,2*si+1)^getXor(qs,qe, mid+1, se, 2*si+2);
        }
        void print(){
            for(int i = 0;i<st.length;i++){
                System.out.print(st[i]+" ");
                System.out.println("----------------------");
            }
        }
    }
    static int convert(int x){
        int cnt = 0;
        String str = Integer.toBinaryString(x);
        //System.out.println(str);
        for(int i = 0;i<str.length();i++){
            if(str.charAt(i)=='1'){
                cnt++;
            }
        }
        int ans = (int) Math.pow(3, 6-cnt);
        return ans;
    }
    static class Node2{
        Node2 left = null;
        Node2 right = null;
        Node2 parent = null;
        int data;
    }
    static class BinarySearchTree{
        Node2 root = null;
        int height = 0;
        int max = 0;
        int cnt = 1;
        ArrayList<Integer> parent = new ArrayList<>();
        HashMap<Integer, Integer> hm = new HashMap<>();
        public void insert(int x){
            Node2 n = new Node2();
            n.data = x;
            if(root==null){
                root = n;
            }
            else{
                Node2 temp = root,temp2 = null;
                while(temp!=null){
                    temp2 = temp;
                    if(x>temp.data) temp = temp.right;
                    else temp = temp.left;
                }
                if(x>temp2.data) temp2.right = n;
                else temp2.left = n;
                n.parent = temp2;
                parent.add(temp2.data);
            }
        }
        public Node2 getSomething(int x, int y, Node2 n){
            if(n.data==x || n.data==y) return n;
            else if(n.data>x && n.data<y) return n;
            else if(n.data<x && n.data<y) return getSomething(x,y,n.right);
            else return getSomething(x,y,n.left);
        }
        public Node2 search(int x,Node2 n){
            if(x==n.data){
                max = Math.max(max, n.data);
                return n;
            }
            if(x>n.data){
                max = Math.max(max, n.data);
                return search(x,n.right);
            }
            else{
                max = Math.max(max, n.data);
                return search(x,n.left);
            }
        }
        public int getHeight(Node2 n){
            if(n==null) return 0;
            height = 1+ Math.max(getHeight(n.left), getHeight(n.right));
            return height;
        }
    }
    static long findDiff(long[] arr, long[] brr, int m){
        int i = 0, j = 0;
        long fa = 1000000000000L;
        while(i<m && j<m){
            long x = arr[i]-brr[j];
            if(x>=0){
                if(x<fa) fa = x;
                j++;
            }
            else{
                if((-x)<fa) fa = -x;
                i++;
            }
        }
        return fa;
    }
    public static long max(long x, long y, long z){
        if(x>=y && x>=z) return x;
        if(y>=x && y>=z) return y;
        return z;
    }

    public static void seive(long n){
        b = new boolean[(int) (n+1)];
        Arrays.fill(b, true);
        for(int i = 2;i*i<=n;i++){
            if(b[i]){
                for(int p = 2*i;p<=n;p+=i){
                    b[p] = false;
                }
            }
        }
    }
    static long modInverse(long a, long mOD2){
        return  power(a, mOD2-2, mOD2);
    }
    static long power(long x, long y, long m)
    {
        if (y == 0)
            return 1;
        long p = power(x, y/2, m) % m;
        p = (p * p) % m;

        return (y%2 == 0)? p : (x * p) % m;
    }
    static long power2(long x,BigInteger y,long m){
        long ans = 1;
        BigInteger two = new BigInteger("2");
        while(y.compareTo(BigInteger.ZERO)>0){
            if(y.getLowestSetBit()==y.bitCount()){
                x = (x*x)%MOD;
                y = y.divide(two);
            }
            else{
                ans = (ans*x)%MOD;
                y = y.subtract(BigInteger.ONE);
            }
        }
        return ans;
    }
    static BigInteger power2(BigInteger x, BigInteger y, BigInteger m){
        BigInteger ans = new BigInteger("1");
        BigInteger one  = new BigInteger("1");
        BigInteger two  = new BigInteger("2");
        BigInteger zero  = new BigInteger("0");
        while(y.compareTo(zero)>0){
            //System.out.println(y);
            if(y.mod(two).equals(one)){
                ans = ans.multiply(x).mod(m);
                y = y.subtract(one);
            }
            else{
                x = x.multiply(x).mod(m);
                y = y.divide(two);
            }
        }
        return ans;
    }
    static BigInteger power(BigInteger x, BigInteger y, BigInteger m)
    {
        if (y.equals(0))
            return (new BigInteger("1"));
        BigInteger p = power(x, y.divide(new BigInteger("2")), m).mod(m);
        p = (p.multiply(p)).mod(m);

        return (y.mod(new BigInteger("2")).equals(0))? p : (p.multiply(x)).mod(m);
    }
    static long d,x,y;
    public static void extendedEuclidian(long a, long b){
        if(b == 0) {
            d = a;
            x = 1;
            y = 0;
        }
        else {
            extendedEuclidian(b, a%b);
            int temp = (int) x;
            x = y;
            y = temp - (a/b)*y;
        }
    }

    public static long gcd(long n, long m){
        if(m!=0) return gcd(m,n%m);
        else return n;
    }


    public static class FasterScanner {
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = System.in.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public String nextLine() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isEndOfLine(c));
            return res.toString();
        }

        public String nextString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public long nextLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public int[] nextIntArray(int n) {
            return nextIntArray(n, 0);
        }

        public int[] nextIntArray(int n, int off) {
            int[] arr = new int[n + off];
            for (int i = 0; i < n; i++) {
                arr[i + off] = nextInt();
            }
            return arr;
        }

        public long[] nextLongArray(int n) {
            return nextLongArray(n, 0);
        }

        public long[] nextLongArray(int n, int off) {
            long[] arr = new long[n + off];
            for (int i = 0; i < n; i++) {
                arr[i + off] = nextLong();
            }
            return arr;
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        private boolean isEndOfLine(int c) {
            return c == '\n' || c == '\r' || c == -1;
        }
    }
}
