import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Collections;
import java.util.TreeSet;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Ribhav
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        DMEXMaximizing solver = new DMEXMaximizing();
        solver.solve(1, in, out);
        out.close();
    }

    static class DMEXMaximizing {
        public void solve(int testNumber, FastReader s, PrintWriter out) {
            int q = s.nextInt(), x = s.nextInt();

            TreeSet<Integer> set = new TreeSet<>();
            HashMap<Integer, ArrayList<Integer>> map = new HashMap<>();
            for (int i = 0; i <= q + 5; i++) {
                set.add(i);
                ArrayList<Integer> list = map.getOrDefault(i % x, new ArrayList<>());
                list.add(i);
                map.put(i % x, list);
            }

            for (int i = 0; i < x; i++) {
                if (map.containsKey(i)) {
                    ArrayList<Integer> list = map.get(i);
                    Collections.reverse(list);
                    map.put(i, list);
                }
            }

            for (int i = 0; i < q; i++) {
                int curr = s.nextInt();
                ArrayList<Integer> lis = map.get(curr % x);
                if (lis != null && lis.size() > 0) {
                    Integer integer = lis.get(lis.size() - 1);
                    if (integer != null) {
                        lis.remove(lis.size() - 1);
                        set.remove(integer);
                    }
                }
                out.println(set.first());
            }
        }

    }

    static class FastReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private FastReader.SpaceCharFilter filter;

        public FastReader(InputStream stream) {
            this.stream = stream;
        }

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

        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 boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}

