using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication1
{
   class Program
    {
        static void Main(string[] args)
        {
           
            int[,] arr = new int[,] { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 }, { 13, 14, 15, 16 }, { 17, 18, 19, 20 } };
            int rowLength = arr.GetLength(0);
            int colLength = arr.GetLength(1);
            for (int a = 0; a < rowLength; a++)
            {
                for (int b = 0; b < colLength; b++)
                {
                    Console.Write(arr[a, b] + "\t");
                }
                Console.WriteLine();
            }
            Console.WriteLine("Output Is:");
            //Taken m*n matrix 5*4
            int m = rowLength;
            int n = colLength;
            int i; int k = 0; int l = 0;
             m--;
             n--;

            while (k <= m && l <= n)
            {
                // It prints the row left to right up to column length 
                for (i = l; i <= n; ++i)
                {
                    Console.Write(arr[k, i]+" ");
                }

                // Prints the column top to bottom
                k++;
                for (i = k; i <= m; ++i)
                {
                    Console.Write(arr[i, n]+" ");
                }

                // Prints the row right to left
                n--;
                if (m >= k)
                {
                    for (i = n; i >= l; --i)
                    {
                        Console.Write(arr[m, i]+" ");
                    }
                    m--;
                }

                // Prints the column bottom to top
                for (i = m; i >= k; --i)
                {
                    Console.Write(arr[i, l] + " ");
                }

                l++;
            }

            Console.ReadLine();
        }

    }
}

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
       
        vector<int> answer;

        if (matrix.empty()) return answer;

        recurse(matrix, 0, 0 , matrix[0].size(), matrix.size(), answer);
        return answer;

    }

   void recurse(const vector<vector<int>> &matrix, int row, int col, int cLen, int rLen, vector<int>& answer) {
                if (cLen <= 0 || rLen <= 0) return;
                
                if (cLen == 1) {
                    for (int r = row; r < row + rLen; r++) {
                        answer.push_back(matrix[r][col]);
                    }
                    
                    return ;
                }
                
                if (rLen == 1) {
                    for (int c = col; c < col + cLen; c++) {
                        answer.push_back(matrix[row][c]);
                    }
                    
                    return ;
                }

               //go full length across      
                for (int c = col; c < col + cLen; c++)
                answer.push_back(matrix[row][c]);

              //go row+1 downto rLen + row
              for (int r = row + 1; r < row + rLen; ++r)
                  answer.push_back(matrix[r][col + cLen - 1]);

             //go last col - 1 down to col
             for (int c = col + cLen - 2; c >= col; --c)
                  answer.push_back(matrix[row+rLen -1][c]);

            //go last row - 1 up to row + 1
             for (int r = row + rLen - 2; r >= row + 1; r--)
                   answer.push_back(matrix[r][col]);

            recurse(matrix, row + 1, col + 1, cLen - 2, rLen - 2, answer);           
   }
};