diff --git a/1849B Monsters/1849B.cpp b/1849B Monsters/1849B.cpp
new file mode 100644
index 0000000..5ebd76f
--- /dev/null
+++ b/1849B Monsters/1849B.cpp	
@@ -0,0 +1,93 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+// Short forms
+#define int                 long long
+#define ll                  long long
+#define endl                '\n'
+#define ff                  first
+#define ss                  second
+#define pb                  push_back
+#define all(x)              x.begin(), x.end()
+#define sz(x)               (int)(x).size()
+
+// Outputs
+#define yes                 cout<<"YES"<<endl
+#define no                  cout<<"NO"<<endl
+
+// Constants
+#define PI                  3.141592653589793238
+#define INF                 LONG_LONG_MAX
+#define MOD                 1e9+7
+
+// Faster Input Output
+#define FAST_IO             (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+// Maths
+ll fact(ll n)          { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
+ll nPr(ll n, ll r)     { return fact(n) / fact(n - r); }
+ll nCr(ll n, ll r)     { return fact(n) / (fact(r) * fact(n - r)); }
+ll gcd(ll a, ll b)     { if (b == 0) return a; return gcd(b, a % b); }
+ll lcm(ll a, ll b)     { return (a * b) / gcd(a, b);}
+ll mypow(ll a, ll b)   { ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n)     { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true; }
+
+//Debugging
+#ifndef ONLINE_JUDGE
+#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
+#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
+#else
+#define dbg(x)
+#define dbgin(x)
+#endif
+ 
+void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
+void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
+template <class T, class V> void _print(pair <T, V> p);
+template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
+template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
+template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
+template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
+
+/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+bool cmp(pair<int,int>a, pair<int,int>b)
+{
+    if(a.ff==b.ff)
+        return a.ss<b.ss;
+    return a.first>b.first;
+}
+
+
+void solve()
+{
+    int n,k;
+    cin>>n>>k;
+    vector<pair<int,int>>v;
+    for(int i=1; i<=n; ++i)
+    {
+        int x;
+        cin>>x;
+        if(x%k)
+            x%=k;
+        else
+            x=k;
+        v.pb({x,i});
+    }
+    sort(all(v),cmp);
+    for(auto it:v)
+        cout<<it.second<<" ";
+    cout<<endl;
+}
+
+int32_t main()
+{
+    FAST_IO;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) 
+        solve();
+}
\ No newline at end of file
diff --git a/Readme.md b/Readme.md
index d4f08b1..56bcfdf 100644
--- a/Readme.md
+++ b/Readme.md
@@ -141,6 +141,7 @@ Feel free to check these codes out.
 | 1846C | Rudolf and the Another Competition | [Question](https://codeforces.com/contest/1846/problem/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/blob/master/1846C%20Rudolf%20and%20the%20Another%20Competition/1846C.cpp)
 | 1848A | Vika and Her Friends | [Question](https://codeforces.com/contest/1848/problem/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/blob/master/1848A%20Vika%20and%20Her%20Friends/1848A.cpp)
 | 1849A | Morning Sandwich | [Question](https://codeforces.com/problemset/problem/1849/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/blob/master/1849A%20Morning%20Sandwich/1849A.cpp)
+| 1849B | Monsters | [Question](https://codeforces.com/problemset/problem/1849/B) | [Solution]
 | 1850A | To My Critics | [Question](https://codeforces.com/contest/1850/problem/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/blob/master/1850A%20To%20My%20Critics/1850A.cpp)
 | 1850B | Ten Words of Wisdom | [Question](https://codeforces.com/contest/1850/problem/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/blob/master/1850B%20Ten%20Words%20of%20Wisdom/1850B.cpp)
 | 1850C | Word on the Paper | [Question](https://codeforces.com/contest/1850/problem/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/blob/master/1850C%20Word%20on%20the%20Paper/1850C.cpp)