import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;

	static void solve() {
		int n = ir.nextInt();
		long l = ir.nextLong();
		String[] s = new String[n];
		for (int i = 0; i < n; i++)
			s[i] = ir.next();
		Arrays.sort(s);
		int[] g = grundy(l + 1 - s[0].length(), l);
		// tr(g);
		for (int i = 1; i < n; i++) {
			int cl = cl(s[i - 1], s[i]);
			g = convert(g, grundy(l - cl, l - cl));
			if (l - s[i].length() + 1 <= l - cl - 1)
				g = convert(g, grundy(l - s[i].length() + 1, l - cl - 1));
			// tr(g);
		}
		for (int i = 0; i < 61; i++)
			if (g[i] != 0) {
				out.println("Alice");
				return;
			}
		out.println("Bob");
	}

	static int cl(String s, String t) {
		int l = Math.min(s.length(), t.length());
		if (s.substring(0, l).equals(t.substring(0, l)))
			return l;
		int lb = 0, ub = l;
		while (ub - lb > 1) {
			int mid = (lb + ub) / 2;
			if (s.substring(0, mid).equals(t.substring(0, mid)))
				lb = mid;
			else
				ub = mid;
		}
		return lb;
	}

	static int[] grundy(long l, long r) {
		if (l != 0) {
			int[] lg = grundy(0, l - 1);
			int[] rg = grundy(0, r);
			return convert(lg, rg);
		}
		int[] ret = new int[61];
		int tx = 0;
		for (int i = 60; i >= 0; i--) {
			ret[i] = (int) ((r / (1L << (long) i) ^ tx) & 1);
			tx ^= ret[i];
		}
		return ret;
	}

	static int[] convert(int[] a, int[] b) {
		int[] ret = new int[61];
		for (int i = 0; i < 61; i++)
			ret[i] = a[i] ^ b[i];
		return ret;
	}

	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

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

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

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

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}

	static void tr(Object... o) {
		out.println(Arrays.deepToString(o));
	}
}


Measured memory_bytes: 40916