/// <summary>
/// C# Implementation of KMP Algorithm
/// </summary>
/// <param name="w">Search String</param>
/// <param name="s">Main String</param>
/// <returns></returns>
public int SearchKMP(char[] w, char[] s)
{
	int m = 0;
	int i = 0;
	int[] t = new int[w.Length];
 
	while (((m + i) < s.Length) && (i < w.Length))
	{
		if (s[m + i] == w[i]) i++;
		else
		{
			m += i - t[i];
			if (i > 0) i = t[i];
			i++;
		}
	}
	if (i == w.Length) return m;
	else return -1;
}

static void Main(string[] args)
{
	int foundPosition=SearchKMP("eXclusiveMinds".ToCharArray() ,"01eXclusiveMinds".ToCharArray() );
	Console.WriteLine(foundPosition);
}