
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Main {

    public static void main(String[] args) {
        InputStream inputStream;
        if (args.length > 0 && args[0].equals("devTesting")) {
            try {
                inputStream = new FileInputStream(args[1]);
            } catch (FileNotFoundException e) {
                throw new RuntimeException(e);
            }
        } else {
            inputStream = System.in;
        }
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskE solver = new TaskE();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskE {
        int n, m;
        int[] l, r;
        
        class PairII implements Comparable<PairII> {
            int a, b;
            
            PairII (int a, int b) {
                this.a = a;
                this.b = b;
            }
            
            public int compareTo(PairII other) {
                if (this.a != other.a) {
                    return this.a - other.a;
                }
                return this.b - other.b;
            }
        }
        
        void solve(int testNumber, InputReader in, PrintWriter out) {
            n = in.nextInt();
            m = in.nextInt();
            l = new int[n];
            r = new int[n];
            PairII[] supp = new PairII[n];
            for (int i = 0; i < n; ++i) {
                l[i] = in.nextInt();
                r[i] = in.nextInt();
                supp[i] = new PairII(l[i], i);
            }
            Arrays.sort(supp);
            for (int d = 1; d <= m; ++d) {
                int ans = 0;
                Set<Integer> set = new TreeSet<>();
                int ptr = 0;
                Deque<Integer> toremove = new ArrayDeque<>();
                for (int i = 0; i <= m; i += d) {
                    while (ptr < n && supp[ptr].a <= i) {
                        set.add(supp[ptr].b);
                        ++ptr;
                    }
                    for (int x : set) {
                        if (l[x] <= i && r[x] >= i) {
                            toremove.add(x);
                            ++ans;
                        } else {
                            if (r[x] < i) {
                                toremove.add(x);
                            }
                        }
                    }
                    while (!toremove.isEmpty()) {
                        set.remove(toremove.poll());
                    }
                }
                out.println(ans);
            }
        }

        int i(long x) {
            return (int) x;
        }

        <T> void heapsort(T[] a, int s, int e) {
            Queue<T> queue = new PriorityQueue<>();
            for (int i = s; i <= e; ++i) {
                queue.add(a[i]);
            }
            for (int i = s; i <= e; ++i) {
                a[i] = queue.poll();
            }
        }

    }

    static class InputReader {

        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public String nextLine() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }

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

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public boolean hasInput() {
            try {
                if (tokenizer != null && tokenizer.hasMoreTokens()) {
                    return true;
                }
                reader.mark(1);
                int ch = reader.read();
                if (ch != -1) {
                    reader.reset();
                    return true;
                }
                return false;
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }

    }
}
