import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;

import static java.lang.Math.*;

public class Solution implements Runnable {
	static class InputReader {
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;
		private SpaceCharFilter filter;
		private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		public InputReader(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 String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}

		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 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 double nextDouble() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			double res = 0;
			while (!isSpaceChar(c) && c != '.') {
				if (c == 'e' || c == 'E')
					return res * Math.pow(10, nextInt());
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			}
			if (c == '.') {
				c = read();
				double m = 1;
				while (!isSpaceChar(c)) {
					if (c == 'e' || c == 'E')
						return res * Math.pow(10, nextInt());
					if (c < '0' || c > '9')
						throw new InputMismatchException();
					m /= 10;
					res += (c - '0') * m;
					c = read();
				}
			}
			return res * sgn;
		}

		public String readString() {
			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 boolean isSpaceChar(int c) {
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		public String next() {
			return readString();
		}

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

	public static void main(String args[]) throws Exception {
		new Thread(null, new Solution(), "Main", 1 << 27).start();
	}

	public void run() {
		InputReader in = new InputReader(System.in);
		PrintWriter w = new PrintWriter(System.out);
		int n=in.nextInt();
		int x=in.nextInt();
		int miss=0,max=Integer.MIN_VALUE;
		HashSet<Integer> h=new HashSet<Integer>();
		while(n-->0)
		{
			int a=in.nextInt();
			if(a==miss)
			{
				h.add(miss);
				if(max<miss)
					max=a;
			}
			else if(a>miss)
			{
				if((a-miss)%x==0)
				{
					h.add(miss);
					if(max<miss)
						max=miss;
				}
				else if(!h.contains(a-x*((a-miss)/x)))
				{
					h.add(a-x*((a-miss)/x));
					if(max<a-x*((a-miss)/x))
						max=a-x*((a-miss)/x);
				}
				else if(!h.contains(a))
				{
					h.add(a);
					if(max<a)
						max=a;
				}
				else
				{
					int b=a+x;
					while(h.contains(b))
					{
						b+=x;
					}
					h.add(b);
					if(max<b)
						max=b;
				}
			}
			else
			{
				if((miss-a)%x==0)
				{
					h.add(miss);
					if(max<miss)
						max=miss;
				}
				else if(!h.contains(a+x*((miss-a)/x)))
				{
					h.add(a+x*((miss-a)/x));
					if(max<a+x*((miss-a)/x))
						max=a+x*((miss-a)/x);
				}
				else if(!h.contains(a))
				{
					h.add(a);
					if(max<a)
						max=a;
				}
				else
				{
					int b=a+x;
					while(h.contains(b))
					{
						b+=x;
					}
					h.add(b);
					if(max<b)
						max=b;
				}
			}
			while(h.contains(miss))
			{
				miss++;
			}
			w.println(miss);
		}
		w.flush();
		w.close();
	}
}
