diff --git a/solution/3600-3699/3653.XOR After Range Multiplication Queries I/README.md b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/README.md
index ecaab1da620bc..b3d21d8228663 100644
--- a/solution/3600-3699/3653.XOR After Range Multiplication Queries I/README.md	
+++ b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/README.md	
@@ -90,32 +90,123 @@ tags:
 
 <!-- solution:start -->
 
-### 方法一
+### 方法一：模拟
+
+我们可以直接模拟题目中的操作，遍历每个查询并更新数组 $\textit{nums}$ 中的对应元素。最后计算数组中所有元素的按位异或结果并返回。
+
+时间复杂度 $O(q \times \frac{n}{k})$，其中 $n$ 是数组 $\textit{nums}$ 的长度，而 $q$ 是查询的数量。空间复杂度 $O(1)$。
 
 <!-- tabs:start -->
 
 #### Python3
 
 ```python
-
+class Solution:
+    def xorAfterQueries(self, nums: List[int], queries: List[List[int]]) -> int:
+        mod = 10**9 + 7
+        for l, r, k, v in queries:
+            for idx in range(l, r + 1, k):
+                nums[idx] = nums[idx] * v % mod
+        return reduce(xor, nums)
 ```
 
 #### Java
 
 ```java
-
+class Solution {
+    public int xorAfterQueries(int[] nums, int[][] queries) {
+        final int mod = (int) 1e9 + 7;
+        for (var q : queries) {
+            int l = q[0], r = q[1], k = q[2], v = q[3];
+            for (int idx = l; idx <= r; idx += k) {
+                nums[idx] = (int) (1L * nums[idx] * v % mod);
+            }
+        }
+        int ans = 0;
+        for (int x : nums) {
+            ans ^= x;
+        }
+        return ans;
+    }
+}
 ```
 
 #### C++
 
 ```cpp
-
+class Solution {
+public:
+    int xorAfterQueries(vector<int>& nums, vector<vector<int>>& queries) {
+        const int mod = 1e9 + 7;
+        for (const auto& q : queries) {
+            int l = q[0], r = q[1], k = q[2], v = q[3];
+            for (int idx = l; idx <= r; idx += k) {
+                nums[idx] = 1LL * nums[idx] * v % mod;
+            }
+        }
+        int ans = 0;
+        for (int x : nums) {
+            ans ^= x;
+        }
+        return ans;
+    }
+};
 ```
 
 #### Go
 
 ```go
+func xorAfterQueries(nums []int, queries [][]int) int {
+	const mod = int(1e9 + 7)
+	for _, q := range queries {
+		l, r, k, v := q[0], q[1], q[2], q[3]
+		for idx := l; idx <= r; idx += k {
+			nums[idx] = nums[idx] * v % mod
+		}
+	}
+	ans := 0
+	for _, x := range nums {
+		ans ^= x
+	}
+	return ans
+}
+```
+
+#### TypeScript
+
+```ts
+function xorAfterQueries(nums: number[], queries: number[][]): number {
+    const mod = 1e9 + 7;
+    for (const [l, r, k, v] of queries) {
+        for (let idx = l; idx <= r; idx += k) {
+            nums[idx] = (nums[idx] * v) % mod;
+        }
+    }
+    return nums.reduce((acc, x) => acc ^ x, 0);
+}
+```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn xor_after_queries(mut nums: Vec<i32>, queries: Vec<Vec<i32>>) -> i32 {
+        let modv: i64 = 1_000_000_007;
+        for q in queries {
+            let (l, r, k, v) = (q[0] as usize, q[1] as usize, q[2] as usize, q[3] as i64);
+            let mut idx = l;
+            while idx <= r {
+                nums[idx] = ((nums[idx] as i64 * v) % modv) as i32;
+                idx += k;
+            }
+        }
+        let mut ans = 0;
+        for x in nums {
+            ans ^= x;
+        }
+        return ans;
+    }
+}
 ```
 
 <!-- tabs:end -->
diff --git a/solution/3600-3699/3653.XOR After Range Multiplication Queries I/README_EN.md b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/README_EN.md
index e06091403ccf1..b25f2e74a5705 100644
--- a/solution/3600-3699/3653.XOR After Range Multiplication Queries I/README_EN.md	
+++ b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/README_EN.md	
@@ -88,32 +88,123 @@ tags:
 
 <!-- solution:start -->
 
-### Solution 1
+### Solution 1: Simulation
+
+We can directly simulate the operations described in the problem by iterating through each query and updating the corresponding elements in the array $\textit{nums}$. Finally, we calculate the bitwise XOR of all elements in the array and return the result.
+
+The time complexity is $O(q \times \frac{n}{k})$, where $n$ is the length of the array $\textit{nums}$ and $q$ is the number of queries. The space complexity is $O(1)$.
 
 <!-- tabs:start -->
 
 #### Python3
 
 ```python
-
+class Solution:
+    def xorAfterQueries(self, nums: List[int], queries: List[List[int]]) -> int:
+        mod = 10**9 + 7
+        for l, r, k, v in queries:
+            for idx in range(l, r + 1, k):
+                nums[idx] = nums[idx] * v % mod
+        return reduce(xor, nums)
 ```
 
 #### Java
 
 ```java
-
+class Solution {
+    public int xorAfterQueries(int[] nums, int[][] queries) {
+        final int mod = (int) 1e9 + 7;
+        for (var q : queries) {
+            int l = q[0], r = q[1], k = q[2], v = q[3];
+            for (int idx = l; idx <= r; idx += k) {
+                nums[idx] = (int) (1L * nums[idx] * v % mod);
+            }
+        }
+        int ans = 0;
+        for (int x : nums) {
+            ans ^= x;
+        }
+        return ans;
+    }
+}
 ```
 
 #### C++
 
 ```cpp
-
+class Solution {
+public:
+    int xorAfterQueries(vector<int>& nums, vector<vector<int>>& queries) {
+        const int mod = 1e9 + 7;
+        for (const auto& q : queries) {
+            int l = q[0], r = q[1], k = q[2], v = q[3];
+            for (int idx = l; idx <= r; idx += k) {
+                nums[idx] = 1LL * nums[idx] * v % mod;
+            }
+        }
+        int ans = 0;
+        for (int x : nums) {
+            ans ^= x;
+        }
+        return ans;
+    }
+};
 ```
 
 #### Go
 
 ```go
+func xorAfterQueries(nums []int, queries [][]int) int {
+	const mod = int(1e9 + 7)
+	for _, q := range queries {
+		l, r, k, v := q[0], q[1], q[2], q[3]
+		for idx := l; idx <= r; idx += k {
+			nums[idx] = nums[idx] * v % mod
+		}
+	}
+	ans := 0
+	for _, x := range nums {
+		ans ^= x
+	}
+	return ans
+}
+```
+
+#### TypeScript
+
+```ts
+function xorAfterQueries(nums: number[], queries: number[][]): number {
+    const mod = 1e9 + 7;
+    for (const [l, r, k, v] of queries) {
+        for (let idx = l; idx <= r; idx += k) {
+            nums[idx] = (nums[idx] * v) % mod;
+        }
+    }
+    return nums.reduce((acc, x) => acc ^ x, 0);
+}
+```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn xor_after_queries(mut nums: Vec<i32>, queries: Vec<Vec<i32>>) -> i32 {
+        let modv: i64 = 1_000_000_007;
+        for q in queries {
+            let (l, r, k, v) = (q[0] as usize, q[1] as usize, q[2] as usize, q[3] as i64);
+            let mut idx = l;
+            while idx <= r {
+                nums[idx] = ((nums[idx] as i64 * v) % modv) as i32;
+                idx += k;
+            }
+        }
+        let mut ans = 0;
+        for x in nums {
+            ans ^= x;
+        }
+        return ans;
+    }
+}
 ```
 
 <!-- tabs:end -->
diff --git a/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.cpp b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.cpp
new file mode 100644
index 0000000000000..4714e928a343c
--- /dev/null
+++ b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.cpp	
@@ -0,0 +1,17 @@
+class Solution {
+public:
+    int xorAfterQueries(vector<int>& nums, vector<vector<int>>& queries) {
+        const int mod = 1e9 + 7;
+        for (const auto& q : queries) {
+            int l = q[0], r = q[1], k = q[2], v = q[3];
+            for (int idx = l; idx <= r; idx += k) {
+                nums[idx] = 1LL * nums[idx] * v % mod;
+            }
+        }
+        int ans = 0;
+        for (int x : nums) {
+            ans ^= x;
+        }
+        return ans;
+    }
+};
diff --git a/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.go b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.go
new file mode 100644
index 0000000000000..b305a62015624
--- /dev/null
+++ b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.go	
@@ -0,0 +1,14 @@
+func xorAfterQueries(nums []int, queries [][]int) int {
+	const mod = int(1e9 + 7)
+	for _, q := range queries {
+		l, r, k, v := q[0], q[1], q[2], q[3]
+		for idx := l; idx <= r; idx += k {
+			nums[idx] = nums[idx] * v % mod
+		}
+	}
+	ans := 0
+	for _, x := range nums {
+		ans ^= x
+	}
+	return ans
+}
diff --git a/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.java b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.java
new file mode 100644
index 0000000000000..ea492fb6bbba5
--- /dev/null
+++ b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.java	
@@ -0,0 +1,16 @@
+class Solution {
+    public int xorAfterQueries(int[] nums, int[][] queries) {
+        final int mod = (int) 1e9 + 7;
+        for (var q : queries) {
+            int l = q[0], r = q[1], k = q[2], v = q[3];
+            for (int idx = l; idx <= r; idx += k) {
+                nums[idx] = (int) (1L * nums[idx] * v % mod);
+            }
+        }
+        int ans = 0;
+        for (int x : nums) {
+            ans ^= x;
+        }
+        return ans;
+    }
+}
diff --git a/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.py b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.py
new file mode 100644
index 0000000000000..daf904c338a2e
--- /dev/null
+++ b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.py	
@@ -0,0 +1,7 @@
+class Solution:
+    def xorAfterQueries(self, nums: List[int], queries: List[List[int]]) -> int:
+        mod = 10**9 + 7
+        for l, r, k, v in queries:
+            for idx in range(l, r + 1, k):
+                nums[idx] = nums[idx] * v % mod
+        return reduce(xor, nums)
diff --git a/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.rs b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.rs
new file mode 100644
index 0000000000000..e587ba4432f98
--- /dev/null
+++ b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.rs	
@@ -0,0 +1,18 @@
+impl Solution {
+    pub fn xor_after_queries(mut nums: Vec<i32>, queries: Vec<Vec<i32>>) -> i32 {
+        let modv: i64 = 1_000_000_007;
+        for q in queries {
+            let (l, r, k, v) = (q[0] as usize, q[1] as usize, q[2] as usize, q[3] as i64);
+            let mut idx = l;
+            while idx <= r {
+                nums[idx] = ((nums[idx] as i64 * v) % modv) as i32;
+                idx += k;
+            }
+        }
+        let mut ans = 0;
+        for x in nums {
+            ans ^= x;
+        }
+        return ans;
+    }
+}
diff --git a/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.ts b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.ts
new file mode 100644
index 0000000000000..d7e6ed0685f0a
--- /dev/null
+++ b/solution/3600-3699/3653.XOR After Range Multiplication Queries I/Solution.ts	
@@ -0,0 +1,9 @@
+function xorAfterQueries(nums: number[], queries: number[][]): number {
+    const mod = 1e9 + 7;
+    for (const [l, r, k, v] of queries) {
+        for (let idx = l; idx <= r; idx += k) {
+            nums[idx] = (nums[idx] * v) % mod;
+        }
+    }
+    return nums.reduce((acc, x) => acc ^ x, 0);
+}