Spirally traversing a matrix

#include <bits/stdc++.h> 
using namespace std; 

 // } Driver Code Ends

class Solution
{   
    public: 
    //Function to return a list of integers denoting spiral traversal of matrix.
    vector<int> spirallyTraverse(vector<vector<int> > matrix, int r, int c) 
    {
        vector<int>v;
        int sr=0,sc=0,er=r-1,ec=c-1;
        while(sr<=er && sc<=ec)
        {
            for(int i=sc;i<=ec;i++)
            v.push_back(matrix[sr][i]);
           sr++;
            if(sr<=er && sc<=ec)
            {
            for(int i=sr;i<=er;i++)
            v.push_back(matrix[i][ec]);
           ec--;
            }
             if(sr<=er && sc<=ec)
             {
            for(int i=ec;i>=sc;i--)
            v.push_back(matrix[er][i]);
            er--;
             }
              if(sr<=er && sc<=ec)
              {
            for(int i=er;i>=sr;i--)
            v.push_back(matrix[i][sc]);
            sc++;
              }
        }
        return v;
    }
};

// { Driver Code Starts.
int main() {
    int t;
    cin>>t;
    
    while(t--) 
    {
        int r,c;
        cin>>r>>c;
        vector<vector<int> > matrix(r); 

        for(int i=0; i<r; i++)
        {
            matrix[i].assign(c, 0);
            for( int j=0; j<c; j++)
            {
                cin>>matrix[i][j];
            }
        }

        Solution ob;
        vector<int> result = ob.spirallyTraverse(matrix, r, c);
        for (int i = 0; i < result.size(); ++i)
                cout<<result[i]<<" ";
        cout<<endl;
    }
    return 0;
}  // } Driver Code Ends