using System;

​

public static class Program

{

    // Position count

    public static int posCnt = 7;

    // vector length

    public static int vecLen = 3;

    // Vector count

    static int vecCnt;

    // Vector position

    static int[] VecFirstpos;

    static int[] VecLastpos;

    public static void Main()

    {

        if (vecLen > posCnt)

            return;

        // vector count

        vecCnt = posCnt / vecLen;

        VecFirstpos = new int[vecCnt];

        VecLastpos = new int[vecCnt];

        ArrangeVectors(0, 0);

    }

​

    // Generate all vector combinations recursively

    static void ArrangeVectors(int idx, int pos)

    {

        VecFirstpos[idx] = pos;

        VecLastpos[idx] = pos + vecLen - 1;

        if (idx < vecCnt - 1)

        {

            int nextIdx = idx + 1;

            for (int l = pos; l <= posCnt - (vecCnt - idx) * vecLen; l++)           

                ArrangeVectors(nextIdx, VecLastpos[idx] + l + 1);

        }

        else

        {

            for (int k = VecFirstpos[idx]; k < posCnt - vecLen + 1; k++)

            {

                VecFirstpos[idx] = k;

                VecLastpos[idx] = VecFirstpos[idx] + vecLen - 1;

                PrintArrangement();

            }

        }

    }

​

    // Show arrangement

    static void PrintArrangement()

    {

        for (int i = 0; i < posCnt; i++)

        {

            bool matchFound = false;

            for (int j = 0; j < vecCnt; j++)

                if ((VecFirstpos[j] <= i) && (i <= VecLastpos[j]))

                {

                    matchFound = true;

                    Console.Write("*");

                    break; // vectors do not overlap so we can move to the next position

                }

​

            if (!matchFound)

                Console.Write("-");

        }

​

        Console.WriteLine();

    }

}