diff --git a/dbms/src/Processors/Merges/IMergingTransform.cpp b/dbms/src/Processors/Merges/IMergingTransform.cpp
index 92ad592e11f..ac8f6b947a6 100644
--- a/dbms/src/Processors/Merges/IMergingTransform.cpp
+++ b/dbms/src/Processors/Merges/IMergingTransform.cpp
@@ -99,7 +99,7 @@ IProcessor::Status IMergingTransform::prepareInitializeInputs()
         if (input.isFinished())
             continue;
 
-        if (!input_states[i].is_initialized)
+        if (input_states[i].is_initialized)
         {
             // input.setNotNeeded();
             continue;
diff --git a/dbms/src/Processors/Merges/MergingSortedTransform.cpp b/dbms/src/Processors/Merges/MergingSortedTransform.cpp
index d371d623746..22b8673c4f5 100644
--- a/dbms/src/Processors/Merges/MergingSortedTransform.cpp
+++ b/dbms/src/Processors/Merges/MergingSortedTransform.cpp
@@ -116,7 +116,7 @@ void MergingSortedTransform::merge(TSortingHeap & queue)
             return false;
         }
 
-        return merged_data.hasEnoughRows();
+        return !merged_data.hasEnoughRows();
     };
 
     /// Take rows in required order and put them into `merged_data`, while the rows are no more than `max_block_size`
@@ -218,7 +218,7 @@ void MergingSortedTransform::onFinish()
     if (quiet)
         return;
 
-    auto * log = &Logger::get("MergingSortedBlockInputStream");
+    auto * log = &Logger::get("MergingSortedTransform");
 
     double seconds = total_stopwatch.elapsedSeconds();