diff --git a/123vivekr/divisiblesumpairs.py b/123vivekr/divisiblesumpairs.py
new file mode 100644
index 0000000..4b9586b
--- /dev/null
+++ b/123vivekr/divisiblesumpairs.py
@@ -0,0 +1,18 @@
+#!/bin/python3
+
+import sys
+
+def divisibleSumPairs(n, k, ar):
+    c = 0
+    for i in range(n):
+        for j in range(n):
+            if i < j and (ar[i] + ar[j]) % k == 0:
+                c += 1
+    return c
+
+n, k = input().strip().split(' ')
+n, k = [int(n), int(k)]
+ar = list(map(int, input().strip().split(' ')))
+result = divisibleSumPairs(n, k, ar)
+print(result)
+
diff --git a/AjeshKumarS/a-very-big-sum b/123vivekr/migratorybirds.py
similarity index 50%
rename from AjeshKumarS/a-very-big-sum
rename to 123vivekr/migratorybirds.py
index 65b5e81..56e732a 100644
--- a/AjeshKumarS/a-very-big-sum
+++ b/123vivekr/migratorybirds.py
@@ -2,13 +2,11 @@
 
 import sys
 
-def aVeryBigSum(n, ar):
-    s = 0
-    for x in range(n):
-        s+=ar[x]
-    return s
-
+def migratoryBirds(n, ar):
+    return max(set(ar), key=ar.count)
+    
 n = int(input().strip())
 ar = list(map(int, input().strip().split(' ')))
-result = aVeryBigSum(n, ar)
+result = migratoryBirds(n, ar)
 print(result)
+
diff --git a/AjeshKumarS/birthday-cake-candles.py b/AjeshKumarS/birthday-cake-candles.py
deleted file mode 100644
index 0157f43..0000000
--- a/AjeshKumarS/birthday-cake-candles.py
+++ /dev/null
@@ -1,18 +0,0 @@
-#!/bin/python3
-
-import sys
-
-def birthdayCakeCandles(n, ar):
-    n1=n2=0
-    for i in range(n):
-        if(ar[i]>n1):
-            n1 = ar[i]
-    for f in ar:
-        if(f==n1):
-            n2+=1
-    return n2
-
-n = int(input().strip())
-ar = list(map(int, input().strip().split(' ')))
-result = birthdayCakeCandles(n, ar)
-print(result)
\ No newline at end of file
diff --git a/AjeshKumarS/compare-the-triplets b/AjeshKumarS/compare-the-triplets
deleted file mode 100644
index 2f596c0..0000000
--- a/AjeshKumarS/compare-the-triplets
+++ /dev/null
@@ -1,22 +0,0 @@
-#!/bin/python3
-
-import sys
-
-def solve(a0, a1, a2, b0, b1, b2):
-    ar = [a0, a1, a2]
-    br = [b0, b1, b2]
-    a = 0
-    b = 0
-    for x in range(3):
-        if(ar[x] > br[x]):
-            a+=1
-        elif(ar[x] < br[x]):
-            b+=1
-    return str(a) + str(b)
-
-a0, a1, a2 = input().strip().split(' ')
-a0, a1, a2 = [int(a0), int(a1), int(a2)]
-b0, b1, b2 = input().strip().split(' ')
-b0, b1, b2 = [int(b0), int(b1), int(b2)]
-result = solve(a0, a1, a2, b0, b1, b2)
-print (" ".join(map(str, result)))
diff --git a/AjeshKumarS/diagonal-difference b/AjeshKumarS/diagonal-difference
deleted file mode 100644
index 542cd51..0000000
--- a/AjeshKumarS/diagonal-difference
+++ /dev/null
@@ -1,18 +0,0 @@
-#!/bin/python3
-
-import sys
-
-def result(x,ar):
-    d1=d2 = 0
-    for i in range(x):
-        d1+=ar[i][i]
-        d2+=ar[i][x-i-1]
-    return abs(d1-d2)
-        
-
-n = int(input().strip())
-a = []
-for a_i in range(n):
-    a_t = [int(a_temp) for a_temp in input().strip().split(' ')]
-    a.append(a_t)
-print(result(n, a))
\ No newline at end of file
diff --git a/AjeshKumarS/mini-max-sum.py b/AjeshKumarS/mini-max-sum.py
deleted file mode 100644
index d7e217a..0000000
--- a/AjeshKumarS/mini-max-sum.py
+++ /dev/null
@@ -1,12 +0,0 @@
-#!/bin/python3
-
-import sys
-
-arr = list(map(int, input().strip().split(' ')))
-ar = sorted(arr)
-s1 = 0
-s2 = 0
-for i in range(len(arr)-1):
-    s1+=ar[i]
-    s2+=ar[i+1]
-print(s1, s2)
\ No newline at end of file
diff --git a/AjeshKumarS/plus-minus.py b/AjeshKumarS/plus-minus.py
deleted file mode 100644
index da6cb09..0000000
--- a/AjeshKumarS/plus-minus.py
+++ /dev/null
@@ -1,19 +0,0 @@
-#!/bin/python3
-
-import sys
-
-def result(x, ar):
-    a=b=c=0
-    for i in range(x):
-        if(ar[i]<0):
-            a+=1
-        elif(ar[i]>0):
-            b+=1
-        else:
-            c+=1
-    print("{}\n{}\n{}".format(b/x,a/x,c/x))
-
-
-n = int(input().strip())
-arr = [int(arr_temp) for arr_temp in input().strip().split(' ')]
-result(n, arr)
\ No newline at end of file
diff --git a/AjeshKumarS/readme.md b/AjeshKumarS/readme.md
deleted file mode 100644
index 9c96877..0000000
--- a/AjeshKumarS/readme.md
+++ /dev/null
@@ -1 +0,0 @@
-Hi, I am Ajesh Kumar S. I am from CSA. I love programming as well as web development. My favourite language is PHP. But now I am focusing on Python. I love Open Source Initiatives. And I am looking forward to be a part of FOSS MEC.
\ No newline at end of file
diff --git a/AjeshKumarS/simple-array-sum.py b/AjeshKumarS/simple-array-sum.py
deleted file mode 100644
index d0b1eed..0000000
--- a/AjeshKumarS/simple-array-sum.py
+++ /dev/null
@@ -1,14 +0,0 @@
-#!/bin/python3
-
-import sys
-
-def simpleArraySum(n, ar):
-    s = 0
-    for x in range(n):
-        s+=ar[x]
-    return s
-
-n = int(input().strip())
-ar = list(map(int, input().strip().split(' ')))
-result = simpleArraySum(n, ar)
-print(result)
\ No newline at end of file
diff --git a/AjeshKumarS/solve-me-first.py b/AjeshKumarS/solve-me-first.py
deleted file mode 100644
index 46a60b2..0000000
--- a/AjeshKumarS/solve-me-first.py
+++ /dev/null
@@ -1,8 +0,0 @@
-def solveMeFirst(a,b):
-   return a+b
-  
-
-num1 = int(input())
-num2 = int(input())
-res = solveMeFirst(num1,num2)
-print(res)
\ No newline at end of file
diff --git a/AjeshKumarS/staircase.py b/AjeshKumarS/staircase.py
deleted file mode 100644
index 99d0b73..0000000
--- a/AjeshKumarS/staircase.py
+++ /dev/null
@@ -1,8 +0,0 @@
-#!/bin/python3
-
-import sys
-
-
-n = int(input().strip())
-for x in range(n):
-    print(" "*(n-x-1) + "#"*(x+1))
\ No newline at end of file
diff --git a/AjeshKumarS/time-conversion.py b/AjeshKumarS/time-conversion.py
deleted file mode 100644
index 1a62302..0000000
--- a/AjeshKumarS/time-conversion.py
+++ /dev/null
@@ -1,25 +0,0 @@
-#!/bin/python3
-
-import sys
-
-def timeConversion(s):
-    hh = int(s[0:2])
-    p = s[8:]
-    y = '00'
-    if(p == 'PM'):
-        if(hh == 12):
-            return str(hh) + s[2:8]
-        else:
-            return str(hh+12) + s[2:8]
-    elif(p == 'AM'):
-        if(hh == 12):
-            y == '00' 
-        elif(hh<11):
-            y = '0' + str(hh)
-        else:
-            y = str(hh)
-        return y + s[2:8]
-
-s = input().strip()
-result = timeConversion(s)
-print(result)
\ No newline at end of file
diff --git a/JoyalAJohney/readme.md b/JoyalAJohney/readme.md
deleted file mode 100644
index 23141a6..0000000
--- a/JoyalAJohney/readme.md
+++ /dev/null
@@ -1,4 +0,0 @@
-Hiii I'm Joyal A Johney of CS1A.
-I love programming and love to contribute to open source.
-I'm actually a beginner, So i'm looking forward to learn and grow along with other fellow programmers.
-Looking forward to be an active member in FossMec.
diff --git a/KowalskiA/readme.md b/KowalskiA/readme.md
deleted file mode 100644
index f2d2183..0000000
--- a/KowalskiA/readme.md
+++ /dev/null
@@ -1 +0,0 @@
-I am Atul A of CS-B. I am interested in coding and would love to contribute to open source. Looking forward to become a active member of Foss.
diff --git a/README.md b/README.md
deleted file mode 100644
index 89313ec..0000000
--- a/README.md
+++ /dev/null
@@ -1,64 +0,0 @@
-
-![FOSSMEC](http://i.imgur.com/k9Tv4zR.jpg)
-
-# Welcome!
-
-#### Who are we?
-
-FOSS MEC consists of a group of bright individuals from all different fields who came together to bring forward tech and Open Source Software at MEC. From people who are working on Government funded Machine Learning Projects to doing Summer of code with Google, to people having their own start-ups and Mentoring in Google Code-In, our club has become a hub of knowledge working for the common goal of bringing forth the importance of Open Source in our college, which is all happening by people volunteering.
-
-#### Humble Beginning.
-
-As the most young club at MEC, only 6 months old, we have considerable achievments even though we are a quite young club. From teaching over 70 people to use Git and Github, and conducting an Ethical Hacking workshop by bring the renowned team Bi0s into the college, and taking over college projects to be done using Open Source, we have quite a few acheivements to boast about and we don't plan to stop.
-
-#### Okay, cool! But how do I get in?
-
-So coming back to our point of this article. Last year when we began, we had no organised way to select people, we had to manually select the best people from over 200 tech oriented people. We needed determined people who were willing to work for this organisation with their heart and soul. We needed people who were passionate about learning and who were willing to volunteer for Open Source. We needed smart, young minds who were keen on learning and who were always looking for opportunities to move ahead. 
-
-This article is actually a tutorial for selecting a 10-20 able, working students from a pool of over 300 students. Don't worry if you aren't familiar with anything, if you are ready to work for Open Source, you'll have all the oppertunities in the world open for you and people ready to mentor and guide you to achieve it.
-
-#### What can Open Source offer me?
-
-* Good Placements? Working for Open Source will make your resume stand out when applying for a job. It'll without no doubt give a boost to your career.
-
-* Work during college? Working for Open Source organisation can sometimes even land you in a job. If you start contributing to Open Source Organisations, and if you're a good enough developer it can land you in a job, even before your final year. And you don't have to be programmer, if you're good with content writing and a good manager, it could also get you in.
-
-* Money? Have you heard of Google Summer of Code? Working for Open Source Organisation for a mere 60 days can get you a sum of Rs. 2,00,000. Over 1200 students participate out of which 600 students are from India and there had been GSoC Students from MEC in the past, working for reputed Organisations like Debian and Fedora, which FOSSMEC can get you in touch with. There had been a Ex-MECian, who participated in Google Summer of Code for all of his four years, and when the stipend was Rs 3,50,000. So just imagine four years!! That's 4 X 3,50,000 that's approximately Rs 14,00,000 from working a few months for different Open Source Organisation during college!!!
-So first year is not too early to start. Okay, so know the importance of Open Source now? Let's go!
-
-[Read more about Summer of Code](https://summerofcode.withgoogle.com/)
-
-## Task
-
-* Enroll in the task by adding your details to [This sheet](https://goo.gl/jSZX2b). For reference, we have added a sample task of how we expect the task to be done.
-
-### Additional help for this task, you want a helping hand for this tasks?
-#### Follow through with this [Small Tutorial](https://www.pluralsight.com/courses/get-involved)
-##### Caution: The instructions are very vague, and the task is excruciatingly hard for beginner, take your time, seek for help to complete it.(Warning: only Algorithmic questions will be valued) You'll have to do group discussions and work together as a team for finishing it. The people who complete this will be considered for entry into FOSS MEC and the top winner will get exciting FOSS MEC Prizes!
-
-
-
-##### Time Required: 1-3 Days (Optional Step).
-
-* It is best to follow this task on a Linux Machine, which already comes with Git Installed, it's best to install it first and then coming back to do this task. Always remember that  this task is not to see who is first but to learn about various aspects of Open Source and Tech and also learn about one Programming Language of your choice along the line.
-
-###### Fill in the following sheet, as  you move up the task. goo.gl/jSZX2b
-
-##### Time Required: 3 hours - 3 Days.
-
-* Create a Github Account and fill in the details and set up Git on your local machine and configure it. Learn basic Github commands. (Linux preferred, but can be done on any operating system) 
-
-##### Time Required: 30 minutes - 2 days.
-
-* Fork this repository onto your local machine. (This part of the task is given as a full on tutorial [here](https://github.com/FossMec/Practice-Git))
-*  In the folder you've just forked create a folder with the folder name as your GitHub Username, as an addition for us to know who you are, create a `README.md` and add something about yourself and why you'd like to work for FOSS MEC and Open Source and a bit about yourself with your Class and section. And commit this file and give a Pull Request to our official Repository, add the link to the Pull Request in the Google Sheet.
-
-##### Time Required: 1 week - 1 month.
-
-* For completing this part of the task, you should be required to have knowledge of at least one programming language and a HackerRank account. This task should be done simultaneously as you learn a language.
-
-* There are a set of problems which are given at https://www.hackerrank.com/domains/algorithms/warmup. Take your time and try to learn a language of your own choice by using any book, any online course and solve the set of problems. Remember it's not about who comes first, it is about what all you learn along the way. The questions will start from easy and will become very hard, you can complete as much as you want, but completing more will give you an edge over the competition. Start from `Warm Up` section in HackerRank and move up difficulty. 
-
-* Each time a challenge is solved, update in the Google Sheet in the `Link to your Submissions` section, add the link to your own submission. Remember the sheet is public and everyone can see your submissions. Also take the solved challenge and add it to a file in your own folder and commit and do a Pull Request to our main repo. The sample task can be seen in carrotss folder, who has tried the task.
-
-#### The Selection will be done when the majority of the people who have completed the tasks or after Excel 2017, which ever comes first, and we'll go through each and every one of your submissions (We'll be giving more weightage to harder algorithmic questions and not the number of questions solved.) for conducting selection.
diff --git a/agzuniverse/readme.md b/agzuniverse/readme.md
deleted file mode 100644
index a255eba..0000000
--- a/agzuniverse/readme.md
+++ /dev/null
@@ -1,2 +0,0 @@
-Hi, I am Aswin G a.k.a "A G Z" currently in CS1A. I enjoy programming very much, and my favorite language is JavaScript.
-Looking forward to contributing to open source and hopefully becoming an active member of FOSSMEC.
\ No newline at end of file
diff --git a/aswin1999/README.md b/aswin1999/README.md
deleted file mode 100644
index 90af7eb..0000000
--- a/aswin1999/README.md
+++ /dev/null
@@ -1 +0,0 @@
-I am Aswin.M.Prabhu from CS1A. Coding is my passion. I would like to actively contribute to FOSS if selected.
diff --git a/carrotss/README.md b/carrotss/README.md
deleted file mode 100644
index 8e59f5a..0000000
--- a/carrotss/README.md
+++ /dev/null
@@ -1,3 +0,0 @@
-### Carrotss
-
-I'm John Doe from CS-Doe A. I'm passionate about Python and please give me entry to FOSS MEC.
\ No newline at end of file
diff --git a/carrotss/simple-array-sum.py b/carrotss/simple-array-sum.py
deleted file mode 100644
index dc543ab..0000000
--- a/carrotss/simple-array-sum.py
+++ /dev/null
@@ -1,8 +0,0 @@
-#!/bin/python3
-
-import sys
-
-
-n = int(input().strip())
-arr = [int(arr_temp) for arr_temp in input().strip().split(' ')]
-print(sum(arr))
diff --git a/carrotss/solve-me-first.py b/carrotss/solve-me-first.py
deleted file mode 100644
index e25d08d..0000000
--- a/carrotss/solve-me-first.py
+++ /dev/null
@@ -1,8 +0,0 @@
-def solveMeFirst(a,b):
-   # Hint: Type return a+b below 
-  return a+b
-
-num1 = int(input())
-num2 = int(input())
-res = solveMeFirst(num1,num2)
-print(res)
diff --git a/steevjames/readme.md b/steevjames/readme.md
deleted file mode 100644
index 80ee462..0000000
--- a/steevjames/readme.md
+++ /dev/null
@@ -1 +0,0 @@
-I am Steev James, interested in development of Open source softwares. I am currently studying in CS1A. I wish to be a member of FOSSMEC. :)