diff --git a/Dynamic Programming/The Coin Change Problem/aravind.java b/Dynamic Programming/The Coin Change Problem/aravind.java
index c8e98c4..556d176 100644
--- a/Dynamic Programming/The Coin Change Problem/aravind.java	
+++ b/Dynamic Programming/The Coin Change Problem/aravind.java	
@@ -11,7 +11,7 @@ public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int N = scan.nextInt();
         int M = scan.nextInt();
-        int[] coins = new int[M];
+        long[] coins = new long[M];
         for(int i = 0; i < M; i++) {
             coins[i] = scan.nextInt();
         }
@@ -28,4 +28,4 @@ public static int max(int[] coins, int N) {
         }
         return numCoins[N];
     }
-}
\ No newline at end of file
+}