diff --git a/9.Two Dimensional Lists/Largest Row or Column.ipynb b/9.Two Dimensional Lists/Largest Row or Column.ipynb
index 7b90b01..84de9c3 100644
--- a/9.Two Dimensional Lists/Largest Row or Column.ipynb	
+++ b/9.Two Dimensional Lists/Largest Row or Column.ipynb	
@@ -63,42 +63,55 @@
    "metadata": {},
    "outputs": [],
    "source": [
-    "min_value=-2147483648\n",
-    "def findlargest(arr,nrow,ncol):\n",
-    "    isrow=True\n",
-    "    largetsum=min_value\n",
+    "#Remove All Code From Coding Ninjas then apply\n",
+    "from sys import stdin\n",
+    "MIN_VALUE=-2147483648\n",
+    "def findLargest(arr, nRows, mCols):\n",
+    "    #Your code goes here\n",
+    "    isRow =True\n",
+    "    largestSum=MIN_VALUE\n",
     "    num=0\n",
-    "    for i in range(nrow):\n",
-    "        rowsum=0\n",
-    "        for j in range(ncol):\n",
-    "            rowsum+=arr[i][j]\n",
-    "            if rowsum>largetsum:\n",
-    "                largetsum=rowsum\n",
-    "                num=i\n",
-    "        for j in range(ncol):\n",
-    "            colsum=0\n",
-    "            for i in range(nrow):\n",
-    "                colsum+=arr[i][j]\n",
-    "                if colsum>largetsum:\n",
-    "                    largetsum=colsum\n",
-    "                    num=j\n",
-    "                    isrow=False\n",
-    "    if isrow:\n",
-    "        print(f\"row {num} {largetsum}\")\n",
+    "    for i in range(nRows):\n",
+    "        rowSum=0\n",
+    "        for j in range(mCols):\n",
+    "            rowSum+=arr[i][j]\n",
+    "        if rowSum>largestSum:\n",
+    "            largestSum=rowSum\n",
+    "            num=i\n",
+    "    for j in range(mCols):\n",
+    "        colSum=0\n",
+    "        for i in range(nRows):\n",
+    "            colSum+=arr[i][j]\n",
+    "        if colSum>largestSum:\n",
+    "            largestSum=colSum\n",
+    "            num=j\n",
+    "            isRow=False\n",
+    "    if isRow:\n",
+    "        print(\"row \"+str(num)+\" \"+str(largestSum))\n",
     "    else:\n",
-    "        print(f\"column {num} {largetsum}\")\n",
-    "#taking input\n",
+    "        print(\"column \"+str(num)+\" \"+str(largestSum))\n",
+    "#Taking Input Using Fast I/O\n",
+    "def take2DInput() :\n",
+    "    li = stdin.readline().rstrip().split(\" \")\n",
+    "    nRows = int(li[0])\n",
+    "    mCols = int(li[1])\n",
+    "    \n",
+    "    if nRows == 0 :\n",
+    "        return list(), 0, 0\n",
+    "    \n",
+    "    mat = [list(map(int, input().strip().split(\" \"))) for row in range(nRows)]\n",
+    "    return mat, nRows, mCols\n",
+    "\n",
+    "\n",
     "#main\n",
-    "loop=int(input())\n",
-    "for i in range(loop):\n",
-    "    str=input().split()\n",
-    "    nrow,ncol=int(str[0]),int(str[1])\n",
-    "    arr=[]\n",
-    "    for j in range(nrow):\n",
-    "        b=input().split()\n",
-    "        li=[int(x) for x in b]\n",
-    "        arr.append(li)\n",
-    "    findlargest(arr,nrow,ncol)"
+    "t = int(stdin.readline().rstrip())\n",
+    "\n",
+    "while t > 0 :\n",
+    "\n",
+    "    mat, nRows, mCols = take2DInput()\n",
+    "    findLargest(mat, nRows, mCols)\n",
+    "\n",
+    "    t -= 1"
    ]
   }
  ],