public static int ackermann2 (int in_n, int in_m) {
		int[] m = new int[100000];
		int[] n = new int[100000];
		n[1] = in_n;
		m[1] = in_m;
		int i = 1;
		while (i > 0) {
			while (n[i] > 0) {
				while (m[i] > 0) {
					n[i + 1] = n[i];
					m[i + 1] = m[i] - 1;
					i++;
				}
				n[i] = n[i] - 1;
				m[i] = 1;
			}
			i--;
			n[i] = n[i] - 1;
			m[i] = m[i+1] + 1;
		}
		return m[0];
	}