static boolean KMP(char[] p, char[] t, int size) {
		int i = 0, j = 0, m = p.length, n = size, c = 0;
		while (i < n) {
			while (j >= 0 && p[j] != t[i])
				j = b[j];
			i++;
			if (++j == m) {
				j = b[j];
				if (i == m)
					return false;
			}
		}
		return true;
	}