diff --git a/generators/igen.cpp b/generators/igen.cpp
index 38be107..5dee1f8 100644
--- a/generators/igen.cpp
+++ b/generators/igen.cpp
@@ -13,5 +13,5 @@ using namespace std;
 int main(int argc, char *argv[]) {
     registerGen(argc, argv, 1);
 
-    println(rnd.next(1, 1000000));
+    println(rnd.next(1, 1'000'000));
 }
diff --git a/generators/iwgen.cpp b/generators/iwgen.cpp
index 617b7bb..3d1d023 100644
--- a/generators/iwgen.cpp
+++ b/generators/iwgen.cpp
@@ -7,16 +7,16 @@
  *
  * If parameter "weight" > 0 then you can think about it as code like this:
  * <code>
- * result = rnd.next(1, 1000000);
+ * result = rnd.next(1, 1'000'000);
  * for (int i = 0; i < weight; i++)
- *     result = max(result, rnd.next(1, 1000000));
+ *     result = max(result, rnd.next(1, 1'000'000));
  * </code> 
  * 
  * If parameter "weight" < 0 then you can think about it as code like this:
  * <code>
- * result = rnd.next(1, 1000000);
+ * result = rnd.next(1, 1'000'000);
  * for (int i = 0; i < -weight; i++)
- *     result = min(result, rnd.next(1, 1000000));
+ *     result = min(result, rnd.next(1, 1'000'000));
  * </code> 
  *
  * It is typical behaviour of "wnext" methods to use this strategy to 
@@ -30,5 +30,5 @@ using namespace std;
 int main(int argc, char *argv[]) {
     registerGen(argc, argv, 1);
 
-    println(rnd.wnext(1, 1000000, opt<int>(1)));
+    println(rnd.wnext(1, 1'000'000, opt<int>(1)));
 }
diff --git a/tests/test-001_run-sval-case-nval/src/case-nval.cpp b/tests/test-001_run-sval-case-nval/src/case-nval.cpp
index 928b49c..d525aff 100644
--- a/tests/test-001_run-sval-case-nval/src/case-nval.cpp
+++ b/tests/test-001_run-sval-case-nval/src/case-nval.cpp
@@ -17,7 +17,7 @@ int main(int argc, char *argv[]) {
 
     for (int testCase = 1; testCase <= testCaseCount; testCase++) {
         setTestCase(testCase);
-        int n = inf.readInt(1, 10000, "n");
+        int n = inf.readInt(1, 10'000, "n");
         inf.readEoln();
         inf.readInts(n, -1000, 1000, "a");
         inf.readEoln();
diff --git a/validators/case-nval.cpp b/validators/case-nval.cpp
index 928b49c..d525aff 100644
--- a/validators/case-nval.cpp
+++ b/validators/case-nval.cpp
@@ -17,7 +17,7 @@ int main(int argc, char *argv[]) {
 
     for (int testCase = 1; testCase <= testCaseCount; testCase++) {
         setTestCase(testCase);
-        int n = inf.readInt(1, 10000, "n");
+        int n = inf.readInt(1, 10'000, "n");
         inf.readEoln();
         inf.readInts(n, -1000, 1000, "a");
         inf.readEoln();
diff --git a/validators/nval.cpp b/validators/nval.cpp
index 8a6648d..4d594ef 100644
--- a/validators/nval.cpp
+++ b/validators/nval.cpp
@@ -11,10 +11,10 @@ using namespace std;
 int main(int argc, char *argv[]) {
     registerValidation(argc, argv);
 
-    int n = inf.readInt(1, 100000, "n");
+    int n = inf.readInt(1, 100'000, "n");
     inf.readEoln();
 
-    inf.readLongs(n, -1000000000LL * 1000000LL, 1000000000LL * 1000000LL, "a");
+    inf.readLongs(n, -1'000'000'000LL * 1'000'000LL, 1'000'000'000LL * 1'000'000LL, "a");
     inf.readEoln();
 
     inf.readEof();
diff --git a/validators/undirected-graph-validator.cpp b/validators/undirected-graph-validator.cpp
index 747d7ba..b196304 100644
--- a/validators/undirected-graph-validator.cpp
+++ b/validators/undirected-graph-validator.cpp
@@ -9,7 +9,7 @@ int main(int argc, char *argv[]) {
 
     int n = inf.readInt(1, 1000, "n");
     inf.readSpace();
-    int m = inf.readInt(0, 100000, "m");
+    int m = inf.readInt(0, 100'000, "m");
     inf.readEoln();
 
     set<pair<int, int>> edges;
diff --git a/validators/undirected-tree-validator.cpp b/validators/undirected-tree-validator.cpp
index bd064f6..256d51b 100644
--- a/validators/undirected-tree-validator.cpp
+++ b/validators/undirected-tree-validator.cpp
@@ -26,7 +26,7 @@ bool merge(vector<int> &dsu, int a, int b) {
 int main(int argc, char *argv[]) {
     registerValidation(argc, argv);
 
-    int n = inf.readInt(2, 100000, "n");
+    int n = inf.readInt(2, 100'000, "n");
     inf.readEoln();
 
     vector<int> dsu(n);