using System;

using System.Collections;

using System.Collections.Generic;

public class Program

{

    /// finds all the different patterns in a string based on the given length of occurance

    /// str: input string ; k: substring length

    /// prints the substring and how many times it occured.

    public static void fiddle(string str, int k){

        /// k cannot be larger than the length of the string

        if(str.Length < k) Console.WriteLine("The input substring is larger than the length of the string");

        /// Dictionary containing the name pair value of the substring based on their occurance

        /// KEY: substring ; VALUE: number of occurance of that substring

        Dictionary<string, int> hash = new Dictionary<string, int>();

        for (int i = 0; i<=(str.Length - k); i++){

            /// sub is used for shortening the code and not re-calculating the substring for each use

            string sub = str.Substring(i, k);

            if (hash.ContainsKey(sub)){

                hash[sub]++;

            }

            else{

                hash[sub] = 1;

            }

        }

        /// print each key and value if the occurance of it in string is bigger that one

        foreach (KeyValuePair<string, int> keyVal in hash){

            if (keyVal.Value > 1){

                Console.WriteLine("string = {0}, occurance = {1}", keyVal.Key, keyVal.Value);

            }

            /// assuming that if there are no recurrings, we don't print anything

        }   

    }

    public static void Main()

    {

        Console.WriteLine("Submission for Nikki Motevaselolhagh");

        fiddle("123222564===85123===", 1);

    }

}