diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/111962.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/111962.png
new file mode 100644
index 0000000000000000000000000000000000000000..9ba6901a1fbe6d881b61dd5c6ae7d74b8a870edd
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/111962.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7a2f0be2d1dbfcb4094460675104128b1e2dadc5ecd635422da37933749d36be
+size 1476846
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/898.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/898.png
new file mode 100644
index 0000000000000000000000000000000000000000..c9aebb67af6812b06f04dc92b5730beba2926969
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/898.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3b2598410790d3981f61a3e9fd0436d862854ff2c4fa0d1cb216e919a3267a13
+size 1438690
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/899.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/899.png
new file mode 100644
index 0000000000000000000000000000000000000000..976f3ec0a62403d51a893d02d006b9dbfa0e9a72
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/899.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7c842971e95653b224de364e9d18bf20fcf5eb0a05760efcfeeb1d2c0a7b4f85
+size 2406054
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/900.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/900.png
new file mode 100644
index 0000000000000000000000000000000000000000..59921e1774acd78c46396fcd502cbb19c758c46b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/900.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:97c1b1b4b4724f33d9fefcee239201ecaee2009d5bacb6663678b54e3fec9946
+size 1499328
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/901.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/901.png
new file mode 100644
index 0000000000000000000000000000000000000000..2f0e1f46c765eadb4191c2a4da8876518b750331
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/901.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:043d311ab1baf5b41ec76e9484c8240d202cca3a3c14edc7d44a4b9b71175ca7
+size 1590370
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/902.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/902.png
new file mode 100644
index 0000000000000000000000000000000000000000..80416ba2639e98614fdb7d42cc7893a5924867d2
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/902.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2c8da70576a51f49e06e85daabacfe192dc1d35d9ffe151fb341901f82b74626
+size 2076983
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/903.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/903.png
new file mode 100644
index 0000000000000000000000000000000000000000..c413a41af5cd29f0b1757f4e5798f182dcf0977d
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/903.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d36e9f485bc6aeb1965dadf498909b5a9bb0f10ac017b9fa0e15524da7870c57
+size 1573708
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/904.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/904.png
new file mode 100644
index 0000000000000000000000000000000000000000..2bb292b34b14716218096bd4d20287c61dc9aed4
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/904.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bf78bcd822757f3fa59355bb0f0e97b011f82fab32515385113d3e23b89412f2
+size 1244607
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/905.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/905.png
new file mode 100644
index 0000000000000000000000000000000000000000..e24b8adf4dcbf15aa4fe16f4d273af9a5cca5b93
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/905.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:aa8257682d54d9c6a131dae90999ac523384ad699a60755915ae2e94b13cca75
+size 1261663
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/906.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/906.png
new file mode 100644
index 0000000000000000000000000000000000000000..8bb01f9662adbac7d11aa697eb76bc76655e40f4
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/906.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:43b72a8c94dcb6953cbdfe007dfdca2d0b67e7d68d41a0ec19218ec5581ca62a
+size 1569769
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/907.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/907.png
new file mode 100644
index 0000000000000000000000000000000000000000..d237ce692bb12bd691a4006318acd21e518147e1
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/907.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c4d82873b71feb0627eeb413b1b4a423e741bc4ab9a5043884b77af8e0953abd
+size 1383732
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/908.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/908.png
new file mode 100644
index 0000000000000000000000000000000000000000..95309a26987525ca7edc3e601e11690547baed8e
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/908.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a1e8a19cb0774354ba7694efdad45d883ba3a1bf8746c87bb569d1ccac52284b
+size 1427220
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/909.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/909.png
new file mode 100644
index 0000000000000000000000000000000000000000..5f53e76e7f575dfb444898f5d05618be8f0438db
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/909.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:14171dfd95160e641442045e66c87aca763fe94a3b6884a46744f7e3dfaa4e74
+size 1405802
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/910.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/910.png
new file mode 100644
index 0000000000000000000000000000000000000000..75e7c67765ad3dc4cc5d4e87e3c102a120a15bfd
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/910.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fdddcbd219b93b5cf0c9b98343bc61952c7616f89088ccd020b10418b17d9b6a
+size 1544358
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/911.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/911.png
new file mode 100644
index 0000000000000000000000000000000000000000..117e070af794bf2ebf1df773a916059a200bc823
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/911.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8ff6f4f2ff108925515d3f5d2ca826905a235cc9fd29b4985f80fe5f05e913d7
+size 699966
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/912.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/912.png
new file mode 100644
index 0000000000000000000000000000000000000000..aa4958dc2f1053f4312bc0711fd54cf3b5b3e2c5
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/912.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4522902b801833d74fba290c6af8bf447640519f42f5502d3e6f550aeac6eab7
+size 1292878
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/915.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/915.png
new file mode 100644
index 0000000000000000000000000000000000000000..bc50a10322eca84a00249f8f170d70ed56ca2025
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/915.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5f9c045edd4de8a76f50dd16f762a993c18608c5c9706e4c83db892425b7b6de
+size 1294232
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/916.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/916.png
new file mode 100644
index 0000000000000000000000000000000000000000..20a126d0cb31f053cca85e996918e41fb3c5c88e
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/916.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:345e4dfe5e6abc262dff80a77b59624777bcb5076e2bc4437b0a85215b8087b1
+size 1587472
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/917.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/917.png
new file mode 100644
index 0000000000000000000000000000000000000000..2a59d836780145da8a372a0f3e751048a295f04b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/917.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:710de6968c2de38f5098924e968d6cbfebc3e9e2d65ae530af1f23439c60ae1c
+size 1371238
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/918.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/918.png
new file mode 100644
index 0000000000000000000000000000000000000000..f9e6d6014415cf6890fc3aaf2214163e554eab23
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/918.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e6f2cf54c1ba5efc9601986878d60c49386ea0bfb39c961a0d317883b5c6b736
+size 1448891
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/919.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/919.png
new file mode 100644
index 0000000000000000000000000000000000000000..77a06f5cc89cdc9e412e51c6c393b419a7fc05cb
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/919.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1edf5c942e659a64aaf5ccd063f0e6b4c05b696a6a164551f25c4a6776398649
+size 1310278
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/920.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/920.png
new file mode 100644
index 0000000000000000000000000000000000000000..f36afc847f0704b5d556fd4ceb165b1851c4a513
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/920.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:61b2e98ad08358201cd5dc00cf01b2892b6080943ba7c1bbb532e53719fbf04e
+size 1985760
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/921.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/921.png
new file mode 100644
index 0000000000000000000000000000000000000000..e6ca5d2f434a8584fb87136b9ee459df2ced08cc
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/921.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6da303ff2e6bd513dfd1832a41bfe55709e59b36bbe330b4e5194b8176417c73
+size 1654161
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/922.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/922.png
new file mode 100644
index 0000000000000000000000000000000000000000..178d09a320e82ac49fb12eea0adb9fe03d589eb7
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/922.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b4443ff187f5150b99cceb925c7902d6ec25995c719c1eea7a98d619798ac63a
+size 915002
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/923.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/923.png
new file mode 100644
index 0000000000000000000000000000000000000000..c7f3c682e8d12af75aaac98426bbebb896ddb495
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/923.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6007e9a071d29959d57cc0b4d4eab51204ef12f97db655bde512ac882c8d1fff
+size 1467007
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/924.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/924.png
new file mode 100644
index 0000000000000000000000000000000000000000..7dd6a117a5beea0c9dbd4dc56e9149b1c25807fd
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/924.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6a6483382a3a4266d7022ece21e773f21c2c46d1e35310a31cf2023755c7abd7
+size 1583048
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/925.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/925.png
new file mode 100644
index 0000000000000000000000000000000000000000..f0bb021cf1e9aeaf4364197c19667c1a104f432c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/925.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b37a896457fa80e763f6585e7dbe87831d780323ca4a560fd01df74b457a6601
+size 1849498
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/926.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/926.png
new file mode 100644
index 0000000000000000000000000000000000000000..031fab3d078a945ecd3797500b5f3d009f6e22a7
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/926.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:39cfe9887dbe8008a4bc19bdca2c616c60feea729a910d66703ce0845e8e4681
+size 1671010
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/927.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/927.png
new file mode 100644
index 0000000000000000000000000000000000000000..80cb151702018fefa2c2e4f137549c9d5ac6edf1
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/927.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3ec1d3c06f7a7931140017eb1f8dc8ffe05d68d25631784ce3629763ae835ec4
+size 1485609
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/928.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/928.png
new file mode 100644
index 0000000000000000000000000000000000000000..f1fce9ff9db24c60c9bb48703a2a684deaf54b33
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/928.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:13e0809164cd1502365a4133d5b472fadb1c00744f5baa2620590e4faf2c6309
+size 1643626
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/929.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/929.png
new file mode 100644
index 0000000000000000000000000000000000000000..7f45eb70096536023700e79466f6b4512a19aaf2
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/929.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8e57da5fb01bf675d99940984cbc0773aedfb5700186517d8692d862745efda6
+size 1429968
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/930.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/930.png
new file mode 100644
index 0000000000000000000000000000000000000000..eadf39a6c892bcc4bad367eeff96f61f39e0b002
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/930.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:81986c936f75bc5fc54a6adabf58f99bbf56f101219929486752e7c3b0e2d93e
+size 1420909
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/931.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/931.png
new file mode 100644
index 0000000000000000000000000000000000000000..21e94fa6fc51023114b83568a1bd96ab5537704d
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/931.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0c6d39c47c0b4c5c6d3432c55dcd9eb67f83ff6fac51a6985e9cb73a81b8846c
+size 1388745
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/932.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/932.png
new file mode 100644
index 0000000000000000000000000000000000000000..ec9004c5ea6a230d1c1191c2669fb28d974927c4
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/932.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0182b7b23a9c3c045c9409a2338409bfac41849f7a7fceb07c66b2e71bf885d4
+size 1288628
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/933.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/933.png
new file mode 100644
index 0000000000000000000000000000000000000000..2d81000887715cec9580ec2d94afe3a381f2deb1
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/933.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:08786ce9ef20155d7d2d53421f8e376deaa6a702f467daee2d1a90b58f928fcc
+size 1917583
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/934.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/934.png
new file mode 100644
index 0000000000000000000000000000000000000000..0c1100fa29316eada8fad7e4d7009ee3330e3ce7
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/934.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:07a8266d6988eb052ec413e3da02b88dfc18dac8a3c05f05778182e0cb54937d
+size 1447920
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/935.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/935.png
new file mode 100644
index 0000000000000000000000000000000000000000..35dd6e4e3f59694a67d44950f085da8010b2d810
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/935.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:76ea836eb8ddb0df4c8a3eb21b93b167bfebdd30c7cd15524bd2e2e759efc999
+size 1498302
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/936.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/936.png
new file mode 100644
index 0000000000000000000000000000000000000000..59d8a22e613e5714d41bfe9e69b01e8d8d1426e0
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/936.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a39ec9a6062a7f1e41413c01a97edfa92718abf52fe4d1357c2a8d3379e85216
+size 1471282
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/937.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/937.png
new file mode 100644
index 0000000000000000000000000000000000000000..1d0efd30903944fcb77828b008d8b3ef03ace238
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/937.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:69ca29b86cacf51b85487fc952f2654bf8818111bebb74a116e4886925925776
+size 1649853
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/938.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/938.png
new file mode 100644
index 0000000000000000000000000000000000000000..db3965ae13f5a8b02be4f1996e889060cb15a345
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/938.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c6c82feab00f16d745d6e89b85e7cda1e507545f71312867d80d4c8f5a3918e0
+size 1613289
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/939.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/939.png
new file mode 100644
index 0000000000000000000000000000000000000000..ce7953f47cf8f83d0c1c947cc471221523a21519
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/939.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b8d8491b63b0524a98bde19bb0bc01fa6ed391a604b64e461f9959c65c630ffb
+size 1292704
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/940.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/940.png
new file mode 100644
index 0000000000000000000000000000000000000000..f5e714d75f69f310b0f3cd5232c3527e84364399
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/940.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a3957e72d0af2f59d26e22bd80c226f077e99d4a351052d168c37609c3c14889
+size 1829855
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/941.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/941.png
new file mode 100644
index 0000000000000000000000000000000000000000..2bdfd5b629962c9dcfdafc455f021489afe4fcfd
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/941.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:59939925555946c0015f12121af0da9d6be0d47ad0f6c5ba4d70f7616046d599
+size 1539135
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/942.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/942.png
new file mode 100644
index 0000000000000000000000000000000000000000..5a7cae68b15db7914df4d7899308d74617db8faf
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/942.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1248803b372b012f45f73a5a32170d16d00d140fb7faa2e61ce5a133e9c50bf7
+size 1541411
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/943.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/943.png
new file mode 100644
index 0000000000000000000000000000000000000000..5c49c3d3dcb4784e0075fa544aa22ca13e81e43f
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/943.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4682ec8d50bcbc99b4a15351adc25391a020f69e7f30cb8ccb5c5924c3f273a4
+size 1530174
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/944.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/944.png
new file mode 100644
index 0000000000000000000000000000000000000000..d5daac35b9ffcbd4df05f2ff32a97bc6753cecc5
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/944.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3ca725af4bc9e141730e0c7a4a120a2f0f601474b64ab88a6d94254b54a3d2c8
+size 1815138
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/945.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/945.png
new file mode 100644
index 0000000000000000000000000000000000000000..f3cccbb5bac1eded3cd7ead11c35d37c28fd6257
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/945.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ea1f6d9c86003b06b3d4a9ec1601afab7454cdaef5c010e3c3bb9c1581d7e831
+size 1532743
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/946.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/946.png
new file mode 100644
index 0000000000000000000000000000000000000000..f24780cf3cba9e33d501d8ba7fdb16dccfb7d66d
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/946.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1774ef4fe118951feea48de3ec0667e75ab8c6c72c8a9d5383c5b260e9ec3e38
+size 1804583
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/947.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/947.png
new file mode 100644
index 0000000000000000000000000000000000000000..6a7f9900b8e290746da8d75ff0f8dac78205a34a
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/947.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ba40469ad856f4cbfadcbf14b924f54a68d235472f51ca954d5c026d86ef415c
+size 1558816
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/948.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/948.png
new file mode 100644
index 0000000000000000000000000000000000000000..499fc73b49e60eaf63d824d99e0056ce6e3841e9
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/948.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6aa99229901277c86f10cf99c0f56121f86b4ef649c5b84dd763531aa8951f4e
+size 1282916
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/949.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/949.png
new file mode 100644
index 0000000000000000000000000000000000000000..057670732b1dce49454edaa7986a4f7802f67a1c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/949.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a1fbd8050371b9f075a3f4b76682aa725f3b3e1d935cc4a458a797b9ebe95967
+size 1540196
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/950.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/950.png
new file mode 100644
index 0000000000000000000000000000000000000000..edc75fd5a97bd1a1d8332ab6478318cab757018c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/950.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:17832a57061672b35909e489c7f0626550272e951694270007471132106db942
+size 1187304
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/951.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/951.png
new file mode 100644
index 0000000000000000000000000000000000000000..76e89f920e50f85ef35403dde9c5049b23e0765b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/951.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6443360e54f0d9405437d05ea34dc2d480e610817844ab627b7ca851a8f56224
+size 1317097
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/952.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/952.png
new file mode 100644
index 0000000000000000000000000000000000000000..441054704bfd580c4f995764bd43b66f13fc7c9e
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/952.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a99f286eceae084a3634fef4b0a6bc8229075db1525b494db0435767c5fbfc02
+size 1153541
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/953.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/953.png
new file mode 100644
index 0000000000000000000000000000000000000000..1e2e51dd9cf29f96cf6851f3d7609592d5a4cb6f
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/953.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2eb68df1199c98ce5a7ca1339aca60ea3062327c1f1f810630f669d753d59289
+size 1370367
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/954.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/954.png
new file mode 100644
index 0000000000000000000000000000000000000000..528f2f57e3089b45be47b92ac9ea5bb508db6b6b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/954.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:21a3f35a8b74535ff72167ddf5f9d0bba7bd30cb3310803ee74cea3c237dd644
+size 2002120
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/955.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/955.png
new file mode 100644
index 0000000000000000000000000000000000000000..b9c3bbdb3fc051cb29b0e476522f051ec456f60f
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/955.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:71037a1676e9b5ae4f7e799bc481adfdc34d8790bce079ce8e15907af23feb42
+size 1528974
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/956.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/956.png
new file mode 100644
index 0000000000000000000000000000000000000000..4a1ee63dbe4b495fb7eb7376065d65d667580e1f
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/956.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3c23cbc6eeb251d7144330bd8bb4140bb7d07608ea746a889977798c3b5e7c6f
+size 1551683
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/957.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/957.png
new file mode 100644
index 0000000000000000000000000000000000000000..420780352b028cc49bdf34f7925f642cdd5821f7
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/957.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bbcb83ea7b54f5864411fa497be8a6dd6f074e545ba7c0cee834bf5164bbad15
+size 1667365
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/958.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/958.png
new file mode 100644
index 0000000000000000000000000000000000000000..f1c76bdb38b5c3719a3acf5766985d76b2686c88
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/958.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8b70ed01ebbc1c525d3abe34902ef67f4c6f90cc4ce0fbad8cc1f6bdcd4b86d0
+size 1389955
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/959.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/959.png
new file mode 100644
index 0000000000000000000000000000000000000000..b80bd030c3acc4d9fbcf532395cdb6af108f8047
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/959.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5946db4630c1136dd2b7e0697e708f7cf22e27b600dd5c53833f35adbac2e683
+size 1829255
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/960.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/960.png
new file mode 100644
index 0000000000000000000000000000000000000000..6a9cf3baa47833cf41862fd1e7c630405809707a
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/960.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c6ffbdddce7e6f85e622d0c32c108e76c976f3ff51b6e2aa688ac9d4bbffd3f3
+size 1553413
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/961.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/961.png
new file mode 100644
index 0000000000000000000000000000000000000000..d243545f749b98c7fde62fe508a541cdeb03f234
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/961.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:84c28e6b09774146061f08ee4b217776fcf395e4f92e680b9a6eb48da4521f83
+size 1562643
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/962.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/962.png
new file mode 100644
index 0000000000000000000000000000000000000000..9a7ea6d302137cf58a97a433c845849aa3acb9f7
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/962.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:08ebac9d9aa1dd19d8386aec57b6a2551687560c66aa8c376b535a2dfd866a5d
+size 1610549
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/963.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/963.png
new file mode 100644
index 0000000000000000000000000000000000000000..24a34c3bb2930d4b3efd3892fa25204b2da95671
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/963.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4f86e9702ec4af99e80cc2d0645f6cea1ea38513ce9e5ea2117fd87ca56afd88
+size 1555853
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/964.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/964.png
new file mode 100644
index 0000000000000000000000000000000000000000..975ac793b52da3672fa66989f2e6530c21d52fd8
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/964.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a12ea4c891c1c658af245de70f0594c6f863ae71e1495ffa1e5b88ddddda5029
+size 1542683
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/965.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/965.png
new file mode 100644
index 0000000000000000000000000000000000000000..17324f08364f66ec265de5ff58c9a6add3f76a3d
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/965.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fa61f497ccc0b708c916c9f76f6c3371e01a42d36ed6d51cfbfac158f7cd922d
+size 1587474
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/966.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/966.png
new file mode 100644
index 0000000000000000000000000000000000000000..f15d5d0e7e73c8ff3f1bd327bff979946623752b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Action/966.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3f0e87565b3a68f76dbdd43e44804659177ec2c045559e1907f8afa52103977e
+size 1771421
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1107.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1107.png
new file mode 100644
index 0000000000000000000000000000000000000000..ffe1e3c479f10470483864d7459bc03285b5ea5f
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1107.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:763a6a39fa6338aa105b1a609ffc96dbecc07ca31c9e88614160ad6a9661a941
+size 1388594
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1112.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1112.png
new file mode 100644
index 0000000000000000000000000000000000000000..aff080ce5d3626ede9d8e46104985fc89af11af1
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1112.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fe110ab24fa324c3a55169aa5f99480131cf9a96f4913eeec6cc8e7ead4b633c
+size 1598269
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1117.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1117.png
new file mode 100644
index 0000000000000000000000000000000000000000..6197c576dcf7927ec63252b264e5cdac6036f2dd
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1117.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c8e97744bc2f4b381d9062015e3872c6b5a57a7e4805f8ebc1f0e2eea4290ab6
+size 1471474
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/11178.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/11178.png
new file mode 100644
index 0000000000000000000000000000000000000000..1acf0f7766172cbdf5702303d1d910a9e924008a
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/11178.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e0ef186bd16652e17e4b0f9b84bbc479dcf8b805bdbcd10ace7cae379e4adbba
+size 1498188
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1128.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1128.png
new file mode 100644
index 0000000000000000000000000000000000000000..119c94080c28d2fd73d8220da88b1e242cbb7a67
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1128.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0f44ea5919e792b52c44f34cd973d0cee0f3e86837a68426cfab3b95b0b30081
+size 1626358
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1131.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1131.png
new file mode 100644
index 0000000000000000000000000000000000000000..f4e67810d5cdbdea5c1bd3551e11fe9c5fe2bfb5
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1131.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9f10c728d59270ef7f52f6b1e1d0ef6ec96ab63939af8d4e96febe38f34156eb
+size 1650890
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1145.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1145.png
new file mode 100644
index 0000000000000000000000000000000000000000..ae020a9b6671f30557a6b711509748949fa5735d
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1145.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:292641b8fa336c71ff98b1b35497abd1e078f6cc9cbad94001de276b4b5a5b47
+size 1418576
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1152.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1152.png
new file mode 100644
index 0000000000000000000000000000000000000000..b49146b400af3a91c6e2f5a34433d89549d8b6e1
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1152.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:da504736caf5c46bff80f219260bf83b891759b1d32533c4a242557d586b00a4
+size 1483884
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1155.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1155.png
new file mode 100644
index 0000000000000000000000000000000000000000..38a1d0dd7d098c5eff2169959e19efe9fbb7689e
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1155.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:554bfc0de7c0b362cebb5323b2c40541b9f524da7961680627ddf10cdd6200c3
+size 1868685
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1160.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1160.png
new file mode 100644
index 0000000000000000000000000000000000000000..6304fb4d2feb68ba48ae975e4db4303a910da279
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1160.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:56293437f66e42f471b781da62e6c1f1c06e86a61e47dd231e8aee2f16ee9ad8
+size 2046608
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1165.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1165.png
new file mode 100644
index 0000000000000000000000000000000000000000..cec2b2c727711143a836e4c09ec315e89920b1d0
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1165.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:864b79079ff5c0152da856b55e0ab9d327ce87ec275b07767f6540ed110adda5
+size 1556233
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1171.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1171.png
new file mode 100644
index 0000000000000000000000000000000000000000..5d241d9626c12a2e250486d5b049bc94a7f87f0c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1171.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8b1480cdce8fe67c2d04ea1ba74688072ba1a94adf04bccb87fcd72f012addd9
+size 1596232
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1172.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1172.png
new file mode 100644
index 0000000000000000000000000000000000000000..2653df6ab98b2a8400d67a88ff0f82dddbac27c7
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1172.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0b07cdd735f5c896769f0cba6c3eb3c488551947d699e48e301d3aa714b7865b
+size 1661636
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1174.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1174.png
new file mode 100644
index 0000000000000000000000000000000000000000..a23e08acddd73185baf5d77af5e2ed40fbf2df61
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1174.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a6cda3a21ce83338ed29ab8bfea069fcbe1cfe66f9ded6666491bb11213bbb1e
+size 1818852
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1177.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1177.png
new file mode 100644
index 0000000000000000000000000000000000000000..7108bd8b710ee16d4882818dd76388ad2032e2a4
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part2/Object_Interaction/1177.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b02526ae88cbef27a8cef40701d0d93448e62f38ea81f67b24fa31cab552530f
+size 1481724
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2884.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2884.png
new file mode 100644
index 0000000000000000000000000000000000000000..5b18e0b6b7caf4f75b98e723f1bdd5ec83a98be7
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2884.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:170ef11d1080eb2e97616c5a9745f498ca9ef9a1939d48d7bc52a9d4277bebf2
+size 1468139
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2885.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2885.png
new file mode 100644
index 0000000000000000000000000000000000000000..9c92cf79b130d4455453c00e05ead2d648e6a783
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2885.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cc1b23e1401fb546426fd0c92dffbfda30935ef9119901378b25dd33aa85e6a6
+size 1818175
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2886.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2886.png
new file mode 100644
index 0000000000000000000000000000000000000000..6d170f939ecad52997b35a55273d6784f887c2b3
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2886.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ca4eef28265e4e07d61f66323e79c2ea77be067b77721fcdbffe279f09b05d70
+size 2021438
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2887.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2887.png
new file mode 100644
index 0000000000000000000000000000000000000000..cc7cc0737ec35535248205096149476b82ba9d1a
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2887.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d0aa6af88a7eb213883c41d68f35e8e8e038fd6ecdc5e57ea618531e86db0cac
+size 1141124
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2888.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2888.png
new file mode 100644
index 0000000000000000000000000000000000000000..fadba1f0d479595bfeb403287a84755a1eb58ef4
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2888.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d9cdf72861877c2f782f78ab4c8e8d4f33044c8893c04be40e36191e6ddc5894
+size 1601248
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2889.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2889.png
new file mode 100644
index 0000000000000000000000000000000000000000..ef65ef0a69962383998ba5ded5d72bce90808331
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2889.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cb1f6ceaa2a9e4a3495d4514f284101103c5a40c84bdf8c83040748233370a7d
+size 1377417
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2890.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2890.png
new file mode 100644
index 0000000000000000000000000000000000000000..c5af97525ebe4761dff2f20f70d09c67c39e492f
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2890.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b73e76479491c6420283d9a27b0b81af337fe77a5e21995a626c749b247ce187
+size 903652
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2891.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2891.png
new file mode 100644
index 0000000000000000000000000000000000000000..aaafd042fd0870237e3dac41165aa39be58a1688
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2891.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a4e4e11adeda7c19966add72a149d11a3d0dfabfd9c7135252d628a39adef176
+size 1011466
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2892.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2892.png
new file mode 100644
index 0000000000000000000000000000000000000000..6f0d560fb97de21a6ed2771c6735c21cb5a4d4c0
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2892.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c82c417796f03d7bbd109a46646d22ba22c52dd83740a75fefbb3438199a0e57
+size 1764864
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2893.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2893.png
new file mode 100644
index 0000000000000000000000000000000000000000..1df7211eb078c81c28a44cd44c53ef9773c96cdc
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2893.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3dd7923ac6330b610dc84f2270b13e1c70c6408ca7e18789da82fc714d155e5f
+size 1164325
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2894.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2894.png
new file mode 100644
index 0000000000000000000000000000000000000000..45656b125b1ab07252d9946fd48a5e10a5311f39
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2894.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9c80218fb0c4b13f82a8b634b8e7f63907275de3bacf73e1965dfd58939c62fb
+size 1629564
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2895.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2895.png
new file mode 100644
index 0000000000000000000000000000000000000000..69a54d705ae692df1eb71cc3bd03f69c770eb3ab
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2895.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3b3585344c4a27c08fe1c202f4949dd881c820913568cc568c6ba6e98a343b8a
+size 1192688
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2896.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2896.png
new file mode 100644
index 0000000000000000000000000000000000000000..b049b5cb2e64ee2d9a08994429ff2955b51265e8
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2896.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9b72b86d08e081c547b0823c0973845b17f63cbf48cb0b569f14030d6132df47
+size 2087694
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2897.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2897.png
new file mode 100644
index 0000000000000000000000000000000000000000..e249d86ce1dc03e65e3e9b923fd9024ed2aa31ef
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2897.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9f91ed2ae36853fae380da21a01a3b01f0b4eb08c0a87ca30c162c508f5b3e96
+size 1490246
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2898.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2898.png
new file mode 100644
index 0000000000000000000000000000000000000000..011d3251c18b264ae813b56e9bd42d3162a2262b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2898.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:eab83efce73c9900902feccaf8312334b9a6d397c7fee5c08b5298813ec7575f
+size 1415811
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2899.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2899.png
new file mode 100644
index 0000000000000000000000000000000000000000..d3b282e7689fde0bc12ff188e5cdb3d98f2eba66
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2899.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:580cf518d6efde83ff3f5b5ac0123382891166628ee51175ac78787aa0752a67
+size 1024993
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2900.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2900.png
new file mode 100644
index 0000000000000000000000000000000000000000..22a61cc79db8e0ed6d05580535ebe17cfd1c4e2c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2900.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a58525e0eeba1d56f93c6102caa4058a519b4ae12a836b631feee1dfc2edbc26
+size 993152
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2901.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2901.png
new file mode 100644
index 0000000000000000000000000000000000000000..47ef7e54e79737233a756aca790c9b6e019083de
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2901.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3a2e65b30dad4db45387384aabf5e03622327dbd3da227f3e1642d53cc61bd72
+size 1141391
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2902.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2902.png
new file mode 100644
index 0000000000000000000000000000000000000000..556edfe2185de091cdd47cd2c91f8b9ae62fead3
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2902.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ad6b22b5064693f643540c74ceabe04bfe63aa2dbc1ff80491d7818daeaedf01
+size 2039263
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2903.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2903.png
new file mode 100644
index 0000000000000000000000000000000000000000..c327dfcdd9d6818884db357f19a91b031fd737e5
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2903.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:25684ba5d2631b72ceeb31d122f0c3c2e93937def593706156d3c24fb6eb8fbe
+size 1412863
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2904.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2904.png
new file mode 100644
index 0000000000000000000000000000000000000000..8a9e9a4ab5302b30337a4438dc15e2d67a3f57ed
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2904.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:93ab08a70ca2f28b8ce590de098cea9c28ce5b3e8ed29fb0b4c2dd177cb6c232
+size 1525424
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2905.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2905.png
new file mode 100644
index 0000000000000000000000000000000000000000..7d48c63b31d40ca6f5bc85e3ae580deab4e2b2ff
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2905.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3565d89e96a36609fc5256f66f14f3a95e41c0ed61bfdf1e83e9c18f893c016d
+size 1715783
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2908.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2908.png
new file mode 100644
index 0000000000000000000000000000000000000000..b373c203b4e29deb9c6912844498a3dcd00ac314
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2908.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7a0fba3401c77493b9366ff0149ece07c36fc417eb0208b16df71ad5b511cbaf
+size 1493477
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2909.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2909.png
new file mode 100644
index 0000000000000000000000000000000000000000..0aab9ba87d9ed1457a04c61fd746972a2f393768
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2909.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:62bba0f5e16da9a2c5ebe9846a7492c3bc36987e31c201e2b121c49dae337ac9
+size 1336094
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2910.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2910.png
new file mode 100644
index 0000000000000000000000000000000000000000..19316d17e2c1b7763adb5c378cccd4413a456ad8
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2910.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a409473e1b5b5da3500ffd38517a879253195bb7c13576c73351a2e9b8c5b2b3
+size 1572708
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2911.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2911.png
new file mode 100644
index 0000000000000000000000000000000000000000..d1f7f2f8edcb3167ebf3eb8a9c87d6e10c96d325
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2911.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d26a6c5ea5bb059927c3c128eafebe4233abaaf2798a9fedd573f0f2645a70e6
+size 1756320
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2912.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2912.png
new file mode 100644
index 0000000000000000000000000000000000000000..40bd8d848838cbab478ff79ed9754382dc3d48d6
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2912.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:387ceb89ba2e05d1838681ce93507a26eb768fdb75ad55f66100d208b6a9ca96
+size 1663790
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2913.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2913.png
new file mode 100644
index 0000000000000000000000000000000000000000..e7db82a3d5a8ab66f1bec1eb862c71bea10dff7e
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2913.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:08d904f564e5aca6cec12c1458a6a1613233863303eccd4a2387703447922573
+size 1445682
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2914.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2914.png
new file mode 100644
index 0000000000000000000000000000000000000000..19af00c15451d813896938905210291c267b4d16
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2914.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f116164d2ac47b09faba09da2f4b0cf2c68882460eefe4cea4b10bc9b70df793
+size 1842726
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2915.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2915.png
new file mode 100644
index 0000000000000000000000000000000000000000..4a74251633fe672c0ef226a4fb6127fc68493520
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2915.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2226300a71c0d0dec31661868a2f0cc01d95f60a11ff5117aa0e36a8c23ce49d
+size 1831024
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2916.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2916.png
new file mode 100644
index 0000000000000000000000000000000000000000..29b191e6ce9f2a4cbb5c263157483f77bb31320a
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2916.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:23baa64394d9400705d6817f93509d51d7cf9397512370969f371f89b0228b0d
+size 1375188
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2917.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2917.png
new file mode 100644
index 0000000000000000000000000000000000000000..2fe1acb8ccba29fe4af80f0d5284da3538e0edb4
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2917.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b8906d750b0502bc4ce8a3ef37d616a19001b977900ece65994f80de6438fb30
+size 1513032
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2918.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2918.png
new file mode 100644
index 0000000000000000000000000000000000000000..7f9cec9fa3e4b09b9c24091dc88505dc4e3bf97c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2918.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ba49de7475e6d1ff314f57be5562c9e005807f5cf4bfbc4fe3923056f54ab854
+size 1196796
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2919.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2919.png
new file mode 100644
index 0000000000000000000000000000000000000000..16d4fd650fec21bf3c87ce40a9963b6d9237a314
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2919.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ed4176f007ae0fc592c36abae15f946e65f66f7ade4c4c96031f6d9e20fdab13
+size 1405603
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2920.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2920.png
new file mode 100644
index 0000000000000000000000000000000000000000..a3f8de880c38df34ef2585bffe0ed12926970b8b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2920.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:19536ed809b64aa0091f15f83015956fb89c202a392e4185b9445b4f278072ea
+size 1506621
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2921.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2921.png
new file mode 100644
index 0000000000000000000000000000000000000000..f6be85ca6c24f45925af45176344c11e5dd244ed
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2921.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c41ce963916ea9cf65c3444fbb23d76124e7739086e4ba7408894f3414ea1496
+size 1510235
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2922.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2922.png
new file mode 100644
index 0000000000000000000000000000000000000000..733055433815f6325ad6670ca41cccba076e7f49
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2922.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f6755bbfc432cd09451f954719c6cae3771205374d2f827aacf1cac6474c344a
+size 1371423
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2923.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2923.png
new file mode 100644
index 0000000000000000000000000000000000000000..23bb0922067864edad2e0af1175a746625762432
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2923.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b4bde0f32ca9adeb9ccafffd2b40c01a4a51fdd5d27042b27716efdae2d51ea7
+size 1872815
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2924.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2924.png
new file mode 100644
index 0000000000000000000000000000000000000000..33491211f3706d9c6c301089abbd46febad47de3
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2924.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a27c2157e76e22648eba15feb8a3ec2abd5713a9972774ff3f6f6e5eb462fc0a
+size 1564048
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2925.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2925.png
new file mode 100644
index 0000000000000000000000000000000000000000..75201e9013c4beebf83c43674af6877ee24ae626
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2925.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1312677ccdfed17729ae701374080f769a4cb74c63f9d1c327dab858ba1a15b1
+size 1519745
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2926.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2926.png
new file mode 100644
index 0000000000000000000000000000000000000000..e5a4a558bb346568c995ec003e787d4052ab5731
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2926.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dc336baf2c7609d77cf7e360daff1c05dc32b3146cd973baa154e1599d1b3bd5
+size 1260759
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2927.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2927.png
new file mode 100644
index 0000000000000000000000000000000000000000..34b3feb1d8c4e388e5d66ac55f715c3d6b5d00c6
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2927.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d04e451b8356872b10bde9a1daa7fcdbccebfb026dfcb931be972c40c3c3d158
+size 1518641
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2928.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2928.png
new file mode 100644
index 0000000000000000000000000000000000000000..926ff33bf9e83fa1029acc537a12fb1ef904b40a
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2928.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:52a2a3ccf9bc6588aa8f16eed0faffcd8f3fca8e99cced9cbc5ee641d824c7b4
+size 1643725
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2929.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2929.png
new file mode 100644
index 0000000000000000000000000000000000000000..6eab863990308052d1496547c4dfe0d412cdebad
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2929.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:41a28e12e64acef13d7a2f0cf5c268eedfde1122daa22d360c8cb82818731549
+size 1585307
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2930.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2930.png
new file mode 100644
index 0000000000000000000000000000000000000000..3d8f9c4c8cd97c963002f22452de7d8b54c0939e
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2930.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a04c87cfafc6968027bc82e7e7d7a40e4bfc2ee56fc9ea13979910988d13edbd
+size 1380044
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2931.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2931.png
new file mode 100644
index 0000000000000000000000000000000000000000..c78dbe530cd26b0d87f1415fb635bb51a381a741
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2931.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bbdd194fc561f8dd4a904f8951a2d22aaf2766822faa764641d799f4fabc39f1
+size 1367296
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2932.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2932.png
new file mode 100644
index 0000000000000000000000000000000000000000..e5670e32480738edadda3248b251109c3c2d9bcf
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2932.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1a843d6e858cda646323194be94831b6b69869781a15a6c992f0eeff3f1c6799
+size 2140544
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2933.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2933.png
new file mode 100644
index 0000000000000000000000000000000000000000..13aa20b0335750236beec3dab4df2288df7c2ab8
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/2933.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a723ced5feaea8e28d28896a5a0b142eb29af49152b36eabced840817d32bcb8
+size 1576476
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3100.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3100.png
new file mode 100644
index 0000000000000000000000000000000000000000..0607bd78340324aed6509aa376b99a7b52eeca1d
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3100.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:023a765452a16581472021ee7b6c33937e6173fe9c99c100dcac9d512b6e63e4
+size 1564540
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3101.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3101.png
new file mode 100644
index 0000000000000000000000000000000000000000..7538472af099b0363c11fbd843e64440dd0ae0ae
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3101.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cf514ef6942bf35b833df0bc68784cbdf4afad18656fc8c2cced155e14a79ac1
+size 1286010
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3102.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3102.png
new file mode 100644
index 0000000000000000000000000000000000000000..617c3f4afc3140895ccc2aad1827a4ac99cdb8da
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3102.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e40ab70342bfd2f1edee8b93d1a489bb97dc9c13bc5c34e35e5b7a04e1720efa
+size 1584318
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3103.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3103.png
new file mode 100644
index 0000000000000000000000000000000000000000..074bbeb5a70a56f7d36a7c98b702a5f6add8dbd0
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3103.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d8750e95eba48f2962cb7359eaabc4345c1f01dc1db3496ec3008c8a9e541b59
+size 1204903
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3104.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3104.png
new file mode 100644
index 0000000000000000000000000000000000000000..baf61d996c23b667b363c457d56ef7d2c990f836
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3104.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9fe305739ba12a9449167d9499a6662c8b686ee37f6e8414f400178fa11d4a95
+size 1501917
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3105.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3105.png
new file mode 100644
index 0000000000000000000000000000000000000000..e004c9429658b9de788232cbebc9526e680821f8
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3105.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:18d1bf7a8d806a6e01844a2a3b33729810595e9f0b9a1640d472b67639cd645f
+size 1387715
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3106.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3106.png
new file mode 100644
index 0000000000000000000000000000000000000000..2adbe4b97648190fc1063d6b499fad05cae9c832
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3106.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2fac02064648db4ef719ee318ad20c572bc996284e6c7a49d1ad1f71d77969f7
+size 1691820
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3107.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3107.png
new file mode 100644
index 0000000000000000000000000000000000000000..65d2f9ed32f8f8304461086cf928195ad1f88009
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3107.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b04a9981a3f58d778330e062c3f6a270b85501f51b6943092bcd1a61e336268e
+size 1243641
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3108.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3108.png
new file mode 100644
index 0000000000000000000000000000000000000000..b8d64608c19cbd6f881958c80973dc1d0dc888f3
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3108.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5d67731dc4d1d268b5b5ae5c48eaf05a10657bca220840f43f4372289790d348
+size 1445907
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3109.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3109.png
new file mode 100644
index 0000000000000000000000000000000000000000..ce502fe5cf0bb31e1fd1d104b65d39e1037a8e5b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3109.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d8689787124d4fabc36ca1d69a8a4753a1aab83406efb607ac445b06d98b25db
+size 1929071
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3110.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3110.png
new file mode 100644
index 0000000000000000000000000000000000000000..37b2a3d2446ae19c9194718778210023264be65e
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3110.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5f244d2443f5bc83a46f561dedf4509fbb61dbe9a10f4fdeebfe56bf6c591a36
+size 1275928
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3111.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3111.png
new file mode 100644
index 0000000000000000000000000000000000000000..615656fe2c6aa4c7fb1a6db9508c34456ff40c56
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3111.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:621c46b7bdd016453c843462c8a138fd6e67a5f754f7cdd7240879558b33a872
+size 1776345
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3112.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3112.png
new file mode 100644
index 0000000000000000000000000000000000000000..b783c2cf902cd05b6efa9830b25ca59a6e41106b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3112.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3def87f5193f4b10951be03993bb299a28cf17c77ddd7b0d4ba790e78db355c3
+size 1613157
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3113.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3113.png
new file mode 100644
index 0000000000000000000000000000000000000000..7480dc17b2000e16d2ece0e1b83cd83273d0ddcd
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3113.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:91847acdfbc9f38bf5bc2a6125fb60802fafb3f65ba0a9963ca4df258fe6d796
+size 1488042
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3114.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3114.png
new file mode 100644
index 0000000000000000000000000000000000000000..b7da6b903e115a219daa9ed583abbc4d76f22494
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3114.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:756deb821144a924d8450e04d22f1db01cdd78f634d82968fd22c5013b18f5ec
+size 1739567
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3115.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3115.png
new file mode 100644
index 0000000000000000000000000000000000000000..ff8e1dca99ca37884e74edba166e54b6008cd7b9
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3115.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2c60bac29a144646d18af542298fcb00260ebc51205e196cf5920f3b8a93aa92
+size 1489453
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3116.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3116.png
new file mode 100644
index 0000000000000000000000000000000000000000..eea61a5d3d9231dde34cf4de4b21804df51cb63b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3116.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:54e6f4d9c0465fdfb4161ae62fcef797069ee084a331693a1635b814af0e84f9
+size 1407251
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3117.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3117.png
new file mode 100644
index 0000000000000000000000000000000000000000..c5d872e8940881b23194ab6076389eaccf0537b2
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3117.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:eeb9b5a89aa835164defa508b818dc1b20fdd2d3bb06bfe27214f3abc811e017
+size 1541063
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3118.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3118.png
new file mode 100644
index 0000000000000000000000000000000000000000..5b84f7efe362cb91ae2315022206027160845c5e
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3118.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3d4e7d238c04610cad84ed1b68e28c7e4ef4fe5cdb0edcb37a1c30fbda7bfb9c
+size 1307454
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3119.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3119.png
new file mode 100644
index 0000000000000000000000000000000000000000..f1782073c2c61a007c093ab9937b136c7d8e9526
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3119.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6eaa9db3f4df3d87831a92015f8e5c802b1b1acc02fc3d30545c25bbcc4826fa
+size 1162697
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3120.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3120.png
new file mode 100644
index 0000000000000000000000000000000000000000..863734d9dabf238c9855749e6ff75c56c2d2684c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3120.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:62af23a836eed67ace9b415bb79765964b40bc3a9a85a673dc5e1d3ac0a2fc27
+size 1319871
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3121.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3121.png
new file mode 100644
index 0000000000000000000000000000000000000000..803d365a0314b90175b65c8772a2b17033b3c5bb
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3121.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:29f64781e3c11fa181ccaf795e89a5f2149dcfac93774948327f36c19540efa8
+size 1790688
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3122.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3122.png
new file mode 100644
index 0000000000000000000000000000000000000000..3592395ed327e951efaec073becedd7fb4295706
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3122.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fc77234c483426b124a2dec5f30772880b9dffb81fcaf911017500f791a86a56
+size 1285796
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3123.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3123.png
new file mode 100644
index 0000000000000000000000000000000000000000..ddcebf74e9dde174624283ba6b09bca49b463b5c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3123.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a2deaa1ffaa79a822eedd3bc958a9385b5a0689e7722d53ebfb0a68d95c56978
+size 1585977
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3124.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3124.png
new file mode 100644
index 0000000000000000000000000000000000000000..ad98d3060d166028dbfda84c367b326045d8d3b6
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3124.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:92c431909ff60de92c21c3e5c6391d94586d0e1ad8babdc2124617e0d8bec26c
+size 1279572
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3125.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3125.png
new file mode 100644
index 0000000000000000000000000000000000000000..6ef729a27d666426caa8ed979c702ec6ebc8de99
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3125.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7791a41b153d3ca6220cb2227b137dcf1219eb7c5dfa4cf9b8d83a4c260c253f
+size 1640331
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3126.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3126.png
new file mode 100644
index 0000000000000000000000000000000000000000..26451e9cee201c019c97b944bdd2138905187f39
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3126.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8ffa1ef0c70656f4341a91f41db107728af2f1a39bd960a30c467906cc0aaee7
+size 1339646
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3127.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3127.png
new file mode 100644
index 0000000000000000000000000000000000000000..2eccd4307384d6f219dba9d82a02b4b65aa7d1a7
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3127.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cd4701376fc0f1eab75e7fd37749c7321c5b78f3bc17b960cd62523b292b4139
+size 1457181
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3128.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3128.png
new file mode 100644
index 0000000000000000000000000000000000000000..c91b647b600b0be1db308478cf8dfbecae422a0d
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3128.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b9f189858505e26d1d9704750de56c6662f36ff6d4b7e99296eee983ec3698a4
+size 1471896
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3129.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3129.png
new file mode 100644
index 0000000000000000000000000000000000000000..a1f406027f4571f0535f5deb05072e7c56dcd7cd
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Image_Aware/3129.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f7bf81f432228cf8a2d5a908407c083bf8fe4385f17e5e59f77e0dbdac3984d6
+size 1481876
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2934.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2934.png
new file mode 100644
index 0000000000000000000000000000000000000000..39faa1c1e49682f16a9b0e461fc38ffe6cf1f6fa
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2934.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ad4575766a0d82cf0902e752c1e6c2cbd7be74bcec4b0ac2052150051e85c52f
+size 1412983
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2935.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2935.png
new file mode 100644
index 0000000000000000000000000000000000000000..ad6bb7b127475702425f5c43643195f40bfaa571
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2935.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cd458f08c1e92423678611688dbab7fe706dead723c6e80a6778aaa5dddbd142
+size 1301304
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2936.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2936.png
new file mode 100644
index 0000000000000000000000000000000000000000..c6799501f59c512edb0348aca808bc9e530787e9
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2936.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bb4f253de0c9714694e3afa65f334ee22cd3c3fc458d22c333a2c657431d7b3b
+size 1649411
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2937.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2937.png
new file mode 100644
index 0000000000000000000000000000000000000000..8b34331dd73c0f11234ed424247f9633c33f1558
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2937.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:21ac0f7eb294697b28d57ad1c4bf0e3399c56e56229f0fca5ed6b5d9ae878280
+size 1434611
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2938.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2938.png
new file mode 100644
index 0000000000000000000000000000000000000000..e5880372424e74f0c0b6128176bd3e926ae78c8f
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2938.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:efc1ebb48cb3f2bad2dd874c6fd4cb87e4e7d84cea7d77000802deac3f1f50da
+size 1243436
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2941.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2941.png
new file mode 100644
index 0000000000000000000000000000000000000000..2058f9d4ea58289563942582da10d0f9833a379b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2941.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f4a9b23edb0df17f3ecc8fa371cca40c81683e3de1d163239762966fe1f3d934
+size 997168
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2942.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2942.png
new file mode 100644
index 0000000000000000000000000000000000000000..8318bc14eed35c339cba9ed66f7aeda0e071de53
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2942.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a9737938dad7b28e63057dfef69a45e3ecc167c9713f1a1364378ed71e1c26fb
+size 1125523
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2943.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2943.png
new file mode 100644
index 0000000000000000000000000000000000000000..fa2864c9e51fe14e445391676e6d0bb4920f02e8
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2943.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dfab77408e8e3acaf08c99192d16f041411393724994cb5e37c045a22e3a2ec6
+size 1294260
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2944.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2944.png
new file mode 100644
index 0000000000000000000000000000000000000000..ad2d6971517dc0286a080b6aa1e8b9fdd8cbd491
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2944.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:93284c801f02e525b696b9d52e1fce931f202980332427111972384c33fc7978
+size 887707
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2945.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2945.png
new file mode 100644
index 0000000000000000000000000000000000000000..cb043e756326499fa381d3fd091eaec505bc1324
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2945.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ddf251d6a1778019b78cc9af5e5be5773889229936cc18d00daca3d2987a4267
+size 1426656
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2948.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2948.png
new file mode 100644
index 0000000000000000000000000000000000000000..dcd399c34834e6cbc66807b059a96e1131d4fbea
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2948.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0df6cae10682421cd96b53b76a3545d3af9e3d8fc197ff1ccca7236c1976546b
+size 1086481
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/29498.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/29498.png
new file mode 100644
index 0000000000000000000000000000000000000000..e385824a455a4e0ad5ebb56f6f843100aaf7cab8
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/29498.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:57f2990be2fd9c5c55cc5d9750fe53d33699ac86c8f520465d2a69d3437d6ae7
+size 1413651
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2951.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2951.png
new file mode 100644
index 0000000000000000000000000000000000000000..6ec8d2ad3f19bb8021adad5482b64b7f9456f285
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2951.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:73632c4f6d2c5ff4ec1f78098169f770a9740d7f231c7a7b54ec9b863a4d850c
+size 1273066
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2952.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2952.png
new file mode 100644
index 0000000000000000000000000000000000000000..4e4065d467adf8b4bbb48542452503255495aaa3
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2952.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3a2a277f3c68bc549df111db3a48b956096f9a0513accc845fac5d0c92c7a521
+size 1751789
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2953.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2953.png
new file mode 100644
index 0000000000000000000000000000000000000000..421bca02f99faed8185e7b0a57ab375fe2ee8509
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2953.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0a5dc148b709aa1c102bf7675547c94b004a49e222f609616033ca232f291da3
+size 1007993
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2954.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2954.png
new file mode 100644
index 0000000000000000000000000000000000000000..e03482ec3d1c51ab2f9330b48b2aec6a77e9857f
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2954.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a96b57330a7d9ccd11ca8c3b7c0c96f845db705fee7d5bf9400b0f16e231247c
+size 1165171
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2955.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2955.png
new file mode 100644
index 0000000000000000000000000000000000000000..28500f661331110e3ccb2bdfb4d84b2d8d51ee6f
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2955.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d7b222c21d30ca33b4aeb513d600fa67e2fd11c67c68ca889b78a9fef1d36259
+size 1267608
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2956.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2956.png
new file mode 100644
index 0000000000000000000000000000000000000000..6012b19a6ecbbd414d8b71b9cea26f82373c7b5d
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2956.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:03471eab3233069bdaf7d7f7c13ad601c4bb88f8db4a6f70ab933838e9624319
+size 1337024
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2958.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2958.png
new file mode 100644
index 0000000000000000000000000000000000000000..075c42d1d90cf87302de9e48ecfa73bc978b3c07
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2958.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:48d5b1e07ab34cb320abe869130a83604b5a86ce2456bfd10cfcaf10cfaa1b94
+size 1699342
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2961.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2961.png
new file mode 100644
index 0000000000000000000000000000000000000000..8c27a0c037fee87d846f95f183f00c6a9f1ffb25
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2961.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4146e5b80c31047a1dc393522efea253c210d5262b45e7fe01393fed85f34045
+size 1379590
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2963.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2963.png
new file mode 100644
index 0000000000000000000000000000000000000000..b995c64bf7384370fd25e4eafd0227724f66f79c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2963.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a16d7659d22c71f87d7d4184d6e4c939a38226854819fe371d5d965831f4cc96
+size 1160630
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2964.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2964.png
new file mode 100644
index 0000000000000000000000000000000000000000..8f48cf8475adeb6db0b788a811ad7f87e13ab468
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2964.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e90c94eac14c082f99053189d2f59e734bafdbf22b7e0c372d84da3d9a6819fd
+size 1073321
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2965.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2965.png
new file mode 100644
index 0000000000000000000000000000000000000000..e7ca905fbf184bd25cd7943b884f5c00860f8672
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2965.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:42cff5dbebefa3c0c2a87ff24034d5b1b8151d9b9894b8399d1fd243701ce84c
+size 1540359
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2967.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2967.png
new file mode 100644
index 0000000000000000000000000000000000000000..00ed526b941d4de39ad168aaea3a8e5ef86abb70
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2967.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:65c3d292d01d6e876148e7ef5942678470327c2ccde9c24b4d20168cde055f14
+size 1420959
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2968.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2968.png
new file mode 100644
index 0000000000000000000000000000000000000000..d0662cb0013efbaa8a915381e9e834a97ba0961c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2968.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:02309c847fe5fa367407dac7ddbfeed63c8367457cabb6f32641bfa619fde6da
+size 1408424
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2973.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2973.png
new file mode 100644
index 0000000000000000000000000000000000000000..838ef053139b1626cf14c97b5124b19eac4841cb
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2973.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:647c018f00c591b19fdce6f535b2e884055a8fb5fb4c1b7ab0e6150a3cd3000b
+size 1409168
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2975.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2975.png
new file mode 100644
index 0000000000000000000000000000000000000000..7de36c26181a4d0d862118482c59e9781084b9b1
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2975.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:028543d3a909162777eb9a00d72367b8aa1167cd68435dd7c02ac87b5f2c3bd8
+size 1431494
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2976.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2976.png
new file mode 100644
index 0000000000000000000000000000000000000000..2a8c44dfd9407d1553faab969d91d1cc54e450d6
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2976.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:05c23b227f8796e682ab1e8225ad0970642017c1dd3c59ccce4a1be24d283851
+size 1755351
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2977.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2977.png
new file mode 100644
index 0000000000000000000000000000000000000000..430328261a7b23637b2da98671c9bc294a447cd8
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2977.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:87e0737de0b1544c973f6864c5d225a2db956e4d462d0788883f9de4d9b0fbbf
+size 1461507
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2978.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2978.png
new file mode 100644
index 0000000000000000000000000000000000000000..39518c6ebf135ab305a74e3eaa5e442d97b3f7ef
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2978.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f90d2afc77139fdc7568dd391cf1dcf2b43b3868bfc5fd40cb58895e736f30f6
+size 1706467
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2979.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2979.png
new file mode 100644
index 0000000000000000000000000000000000000000..96d4a7944d10a63132bf7687fe2fa711ce8d4155
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2979.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1e3b029d62e54fe88290c1fd0310dea8c1edc58fb1bad6c71f73c49e8ae34281
+size 1330637
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2980.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2980.png
new file mode 100644
index 0000000000000000000000000000000000000000..898aa0aa8eae8dfada3fd8912384bc46640219ce
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2980.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8eab2310698658fc490e3bbebfa791a05cda590e8d5040c90907acc4a510ad76
+size 1358777
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2982.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2982.png
new file mode 100644
index 0000000000000000000000000000000000000000..486b2006cf6c21386c7d2d00b93ba3b53cd311de
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2982.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:178b64024fe5e463197a1f9362a8f6252adbd4dc42f0dda5eb911902c5c1357f
+size 1451332
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2983.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2983.png
new file mode 100644
index 0000000000000000000000000000000000000000..767ec40be66c8aa4905e20756031ad4c7cf4997f
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2983.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8db0568e307c4692805e05b1fd725e33808e7334f385c45df46c018a38e6bf58
+size 1512063
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2984.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2984.png
new file mode 100644
index 0000000000000000000000000000000000000000..029bd70b0e3be35e9a11cfd6a230c24df55a0a4b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Multi_Ref/2984.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:da606f8a5058625b546d44c44e33c0055cfbb94fc75dd7f1ed772bd41521c096
+size 1918856
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2985.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2985.png
new file mode 100644
index 0000000000000000000000000000000000000000..5a2b7142731df75553088fcf272247ab8a4e4d26
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2985.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c3d17e5c4dca5c3734b99ca5758a215b0d50ac4a8d48ea73a6fdd7b548074495
+size 1202464
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2986.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2986.png
new file mode 100644
index 0000000000000000000000000000000000000000..ac837326efda1ede87543a93fcf3c08b2a100388
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2986.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8b819c30f9720dbe4af5da9d761465b93bc23341b823035268f16cbddfacfaec
+size 915984
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2987.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2987.png
new file mode 100644
index 0000000000000000000000000000000000000000..f07591fb0293f9b688f8f59ac8dc82aeda1768c9
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2987.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d0958149dd93b2121c6f41da5ab10619859593a5d4404847f67c030a9e642521
+size 1028778
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2988.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2988.png
new file mode 100644
index 0000000000000000000000000000000000000000..03ee30b55a17ddae9584964cfe8fec255b737b92
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2988.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:498301d7c552fdce0d8d18a75717296f34e5d4890231504927ab37168739bcae
+size 1197521
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2989.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2989.png
new file mode 100644
index 0000000000000000000000000000000000000000..74d768ede8904de77cc43a76310c777a6c492f03
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2989.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f0ff3e3bd7985eb24e7d571c0aced82d28aec2e0cd901a795425f2e06326f877
+size 1113266
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2990.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2990.png
new file mode 100644
index 0000000000000000000000000000000000000000..f9793ee548780f7eda641d44f4b1168a70558b30
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2990.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:75a327286a61640cbf7cef50353fbd332f1e166ee8fae8bbb4683def81808587
+size 1255249
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2991.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2991.png
new file mode 100644
index 0000000000000000000000000000000000000000..1d451c02672de61503dc9a6c821d1fdcce186f8c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2991.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:85382472a7976a0876cb125b1fb3a390dab2d25a6bc80804a10992bde25bb0b2
+size 1969778
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2992.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2992.png
new file mode 100644
index 0000000000000000000000000000000000000000..f10852a12a7897344abee550229d5f5d1a9c85ff
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2992.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5b5bc8af8faae3013ab77cf6fa5f55e0abdbfeabc1e7fdde3a7c4f45932ff81f
+size 1670634
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2993.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2993.png
new file mode 100644
index 0000000000000000000000000000000000000000..7fbdf7be9da375002cd14994720ef98e096e8356
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2993.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6e534193290c9150c0b57f3c717437a4aa77d13adf995f90cb35380d7b4e86b3
+size 1151864
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2994.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2994.png
new file mode 100644
index 0000000000000000000000000000000000000000..b5a77a241820a808a20075583b6b6c89220fc213
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2994.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d3d03f417ade2a708198423d1911e0621920261e793ecf661cf04b079309addd
+size 1326831
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2995.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2995.png
new file mode 100644
index 0000000000000000000000000000000000000000..0915befb6964127c65bb81cf277224aeb4e810ad
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2995.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0c262de0639fd79f99efc1c0dc198fb51f268faca1b302dd6d05854b6ee2722b
+size 1369680
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2996.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2996.png
new file mode 100644
index 0000000000000000000000000000000000000000..e6347166f22a5c95591aa6b8b9337c4330ccd5f5
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2996.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d5560a1a4ba6104a38a70f28daceb157e301623ab3c1a99a18f785c88a2efc61
+size 1437298
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2997.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2997.png
new file mode 100644
index 0000000000000000000000000000000000000000..b52e4d6126e5c3fd5c38fe5567a46a91cbc3da73
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2997.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:946bc29da08009be097a0368c37dc984869d0a2f7a3d508b6f98beed34e05d32
+size 1229224
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2998.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2998.png
new file mode 100644
index 0000000000000000000000000000000000000000..204cbb56bf5d2b7fc8fabf3e41d9ba45f7fff693
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2998.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:72eee52ef2d8e063b9d582122dcdc2fba03f7e151952023c109814a2c075c81a
+size 1445770
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2999.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2999.png
new file mode 100644
index 0000000000000000000000000000000000000000..0c6f57a3ac6b98745dcee2ba026855c17cb35289
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/2999.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:197dfdc155e9042abb20b794b5430c1543ba28b1139e121d8ac7d0379a108142
+size 1563923
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3000.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3000.png
new file mode 100644
index 0000000000000000000000000000000000000000..cca10eb56308f0195abd51cb287f348c9581e4b9
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3000.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dfcd77c5bf10b84e9b6c1845f334113d6dd6435b9f629d897b5461f93ca957f0
+size 741648
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3001.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3001.png
new file mode 100644
index 0000000000000000000000000000000000000000..950586b0e649ddea6ba974bce459134de84a626e
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3001.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:812b13aac1c14722c07f336df2ade29d4d98b7e3fed9fc5cba829389618f44da
+size 823777
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3002.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3002.png
new file mode 100644
index 0000000000000000000000000000000000000000..13cb5093ed3d55a09fb6ca7c621b9118cec1eca5
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3002.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:34fe68d02c806534d25be33ba0a144436c2eb56b5585e87269fc1941ba55f19b
+size 1092828
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3003.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3003.png
new file mode 100644
index 0000000000000000000000000000000000000000..5402931dc15f85459d18cc56848936a0ce2b6e9f
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3003.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bb372a74ed3ee366f110e7c71dddae87d2c46ea131c2215abc986955eefaf2e7
+size 1505376
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3004.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3004.png
new file mode 100644
index 0000000000000000000000000000000000000000..2af5ab082f64a9d868effcb19ec2f0dcba928e75
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3004.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7945eef5de37f3f69670200d52d487d365012ae9ff92a53b9381f999f04c9539
+size 1801765
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3005.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3005.png
new file mode 100644
index 0000000000000000000000000000000000000000..99ebd0c013fc07f621efa865a368de3dc04d7c60
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3005.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b2df548e271ee7e36bdbad524fad9a1f053e4eaf4fa3ebd3618d5a0ea82a732b
+size 1639793
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3006.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3006.png
new file mode 100644
index 0000000000000000000000000000000000000000..df456cbbb7e590cae21067d62c8c9292c3965c94
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3006.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5e47a091d76ef5aedab85c2b2418fbfeacba2c9ff27ee30ebea9c024bf44f046
+size 901911
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3007.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3007.png
new file mode 100644
index 0000000000000000000000000000000000000000..2b4352048831f667dd28ab1f02ceedac04ebfb03
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3007.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4a701494e150aafd4dea5977c7c1675c732076f34c1a0f3693b184ec7af33751
+size 1224032
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3008.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3008.png
new file mode 100644
index 0000000000000000000000000000000000000000..f2b2da1f48a0323cc819a87cf3cc479fd7199298
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3008.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2276318e52c53dac941a2966142dece32149b1c6bb98a407981dc53dd64de300
+size 1382429
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3009.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3009.png
new file mode 100644
index 0000000000000000000000000000000000000000..55703503078a5f55301e25867c836e4327928981
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3009.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:00b2539be66875032ce7992f8fa0c3369a07065d5f2dd6dcd9984b41d45588d5
+size 1597212
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3010.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3010.png
new file mode 100644
index 0000000000000000000000000000000000000000..94509f5926eb03656aec070b4bd2fb2fb85d0512
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3010.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:362e97eae34195a99c58764d78492dfad657bc859cd8842f77e3cf923d0cebc4
+size 1604815
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3011.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3011.png
new file mode 100644
index 0000000000000000000000000000000000000000..bb2efa89db9604d3b4148374713af039baa5dbc4
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3011.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:73bc16f65763923274177991cf7345dc241f7fcc7991ee783f2b29b794c5a326
+size 1008268
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3012.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3012.png
new file mode 100644
index 0000000000000000000000000000000000000000..cfb3acb23c0afe9a03e801aadb4a2efa894adbc9
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3012.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9fe3486d677cf2b4755e084c67946850d1b0633a43f2b0016ae35e8a98d1060e
+size 1348050
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3013.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3013.png
new file mode 100644
index 0000000000000000000000000000000000000000..39b2bf17a84b0dfa0096bfe9b2899b414817de0e
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3013.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:16d48b83892a5210b06559d77b9073625855c3f5780cabb6062660dc2bbb757f
+size 1072358
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3014.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3014.png
new file mode 100644
index 0000000000000000000000000000000000000000..8d071d0d25a3ea2e6c374b77d751f363cf54d7ff
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3014.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d08cd3d3208f925558a7177b89cf4d0edac1896f639b97e8bc3d899ce9d60c92
+size 1773790
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3015.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3015.png
new file mode 100644
index 0000000000000000000000000000000000000000..9abfaf66598f199d82cb84505f86cecc034cfb92
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3015.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0a5e3cc35d38ecfaf6081aba194018a026f94832951bde2a4ac43a9029fb9f06
+size 1215496
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3016.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3016.png
new file mode 100644
index 0000000000000000000000000000000000000000..15de36e217150a20cc285f9934bb2c5622250441
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3016.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6e5bc213ac5e4bcf8ac179c9b29fe4eb2997250a06e71715787b52c6be9acbe1
+size 1059389
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3017.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3017.png
new file mode 100644
index 0000000000000000000000000000000000000000..e6dca195c570b3babb8aa60c85d40fdcfab14fc3
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3017.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:161968859cb3260dc946c7db7dbe0ac8d00790a2ba678eaed40aaef5474c7db6
+size 1390970
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3018.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3018.png
new file mode 100644
index 0000000000000000000000000000000000000000..255ec0621e99cabe6e213d4b672b84636e8c7741
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3018.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fb7dcc1d4e60d3c0af795c4887edf64298b7d96aed47947fad75c20f0c749002
+size 957444
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3019.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3019.png
new file mode 100644
index 0000000000000000000000000000000000000000..de038ac28f12a60dde533a622e1f2fe7f1598568
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3019.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:899a1e5bfb75f9969f5f9457f1535e2a7bfbf571ee379248783160c7e158a7ce
+size 1599222
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3020.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3020.png
new file mode 100644
index 0000000000000000000000000000000000000000..e83a969c915fce5bb099dd6d872c068ede4aaacd
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3020.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7baba730d6713700b2a5162db5098d7c0fc4bed4a2523fd186c2ae1583d9d953
+size 1193235
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3021.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3021.png
new file mode 100644
index 0000000000000000000000000000000000000000..92dfe16638fbda0965f275a2f979a5daa2482146
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3021.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:873c9c74c35fdc406035f994f6cfeb5da91d94b9071ffb3f17091e675808805c
+size 1111011
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3022.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3022.png
new file mode 100644
index 0000000000000000000000000000000000000000..ad525de640f2d7d6ff1d83138fcedbe1244ca462
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3022.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5f87453bc68e60d15cd1f0ceb47e98d724adbf090ffc16671ee98cb4b22e39d5
+size 1113801
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3023.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3023.png
new file mode 100644
index 0000000000000000000000000000000000000000..c4b69c9e2d8c9daf65c7b50f85b5fd52fd47bfa8
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3023.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8214fa9e3e4c0f0442bd15fe73473077f9bdd9a555010174e2fff8735d56a3eb
+size 1262505
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3024.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3024.png
new file mode 100644
index 0000000000000000000000000000000000000000..ee1de6574864152feee2cc29e031648c818f3b41
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3024.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e5240d2a06de7ec74dc8bb9f4527c82e5cd8300ca41c780e370da6f1bd5b7e83
+size 1415596
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3025.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3025.png
new file mode 100644
index 0000000000000000000000000000000000000000..891931a6ebc922b1fcb053e000f1b9c913891b9a
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3025.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c86c5849890828e824c6ab613e35b6318c1c5328d70af9155f928fc637d35432
+size 1219855
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3026.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3026.png
new file mode 100644
index 0000000000000000000000000000000000000000..732498f635aa2be39eaa46477c346334427e1da1
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3026.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f969cfa26aa7adc6ba74e16e7bf6e7b92aabb2990ca245e223df6c18e29556d0
+size 1278149
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3027.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3027.png
new file mode 100644
index 0000000000000000000000000000000000000000..bdd31e84703331e3bb37391d948d27d53b04a7c8
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3027.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fb9949a7af16275f53b7f5f87f109f37d0c01867d7928ed3890bc0fec28bec19
+size 1247655
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3028.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3028.png
new file mode 100644
index 0000000000000000000000000000000000000000..6dd48e1e5f9edef9b8e51ead6566ff35ab97fe9c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3028.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e4f265f2e2499d236e64994126c9100a969888b2c00317590dd50fe12e1d4a54
+size 1207337
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3029.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3029.png
new file mode 100644
index 0000000000000000000000000000000000000000..dfe05ae6f04c4b6b09979999ac16621424e353b5
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3029.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7c4163d848ec64acc07ad7a00c5b57e986f2776f6e3fd012ec4315b10d3b0e6d
+size 891459
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3030.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3030.png
new file mode 100644
index 0000000000000000000000000000000000000000..379b16e62d8890f0fb576504e1e00e272a6a42c9
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3030.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f4081ae58999fa18374f46fac0ededef2c2c527c9f1d27d70461eb923337e495
+size 1214691
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3031.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3031.png
new file mode 100644
index 0000000000000000000000000000000000000000..5bd26627041c10aee3b2922cfe2e38b90ad86f79
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3031.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a7f755d27f4655d7a1b2fca6dc8a34fd9e2a344ed6525eae0fe7f496c51cfb7e
+size 1107659
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3032.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3032.png
new file mode 100644
index 0000000000000000000000000000000000000000..85936b01255a34c8bee6839c8a8090ad94095b39
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3032.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:396d85a06ea3132f262e6997f104e3e2fa77580aaa34825d730190e3eac458b2
+size 1152606
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3033.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3033.png
new file mode 100644
index 0000000000000000000000000000000000000000..f9e8e96c64cfb4e0db1cfcd04b812820b2439580
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3033.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:21055e9a705b9a2df06e50ae9020c65c7be6cbf24c61883641227b61c9d69cbf
+size 807957
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3034.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3034.png
new file mode 100644
index 0000000000000000000000000000000000000000..860b2ca4931f6735231a63021e6411daaf861a2b
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3034.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b5a20bd7ec24849bea0adde5eb81cf6e9024daa0a089227e1e38339a2391948d
+size 897327
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3035.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3035.png
new file mode 100644
index 0000000000000000000000000000000000000000..7f0d058f864b746304ae1297405dfd961baf8dad
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3035.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:52b1db82fedd5577f0bdc9ebe94fef13d29732164cfab3367d9c14f1d8e6ae9a
+size 1025798
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3036.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3036.png
new file mode 100644
index 0000000000000000000000000000000000000000..c08875a68757fc9c6dc667d7dc49ad116efe8bf5
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3036.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cc3038d7c60ad4d5fc73b77a793b198ddea971ecb90e3e91d000b442482f39f8
+size 952708
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3037.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3037.png
new file mode 100644
index 0000000000000000000000000000000000000000..99cdcd7d73c77630d906e72f81cdfe3df8cf7868
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3037.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:696d998da20931cd7e4e3822dd3f3ca1e48d17f2ad7acdcc91146a6ddc48f2d4
+size 1536956
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3038.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3038.png
new file mode 100644
index 0000000000000000000000000000000000000000..1e1c37e597b94e7330ee256bae1c5f8b0b24899c
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3038.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5864f27f7d8f98cf9c87d9524346865819f211db652f6172ae053b571050d514
+size 1062942
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3039.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3039.png
new file mode 100644
index 0000000000000000000000000000000000000000..3530b1496c38fb2c5f3006d9ed8a83a7bdb73778
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3039.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:64818de41930e434d30594fdb331bb0fefaca15292479b31090fbef12517efd8
+size 1393370
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3040.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3040.png
new file mode 100644
index 0000000000000000000000000000000000000000..5ed8369701805d4ae7b3dfad2a4de5e1db0946ad
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3040.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:092e1a4712429f44a4de393407820b8e44534f80a1d56192c4095fa2d13afa7b
+size 1486749
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3041.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3041.png
new file mode 100644
index 0000000000000000000000000000000000000000..0bab443fbf6bb9ccbbb91695a948e74ccfa951c7
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3041.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4337bab7e303e0c4eb14644ac8395a8c517cdad68eddc9372ed7660f15b02b76
+size 1495462
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3042.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3042.png
new file mode 100644
index 0000000000000000000000000000000000000000..b335d3714e9a81a4c0cf96ca54b4358f7cd0ab0d
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3042.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a19af2adcc372c05837311a4ff15c16657c9146ab9e719dc10b85e241ca5aae5
+size 1390337
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3043.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3043.png
new file mode 100644
index 0000000000000000000000000000000000000000..31b80f99abe0c9e2d120dfa2f99b0b3817d32a16
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3043.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6d587b2c5b8ca23953650fb7e6e22e600dc10be952b41a2bfcce7021bc5a5adc
+size 1759145
diff --git a/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3044.png b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3044.png
new file mode 100644
index 0000000000000000000000000000000000000000..f44a0235b868038b719ec2fb53d13c5f633d4fd2
--- /dev/null
+++ b/Edit-Res/EMU3.5/EMU3.5/cn/Part5/Virtual_Try_On/3044.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bf7304b793746c4f66f7c0e8ee587bda06cbadeb2591343ec071703ea88ba9ea
+size 1733868
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Action/Action_rank2.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Action/Action_rank2.json
new file mode 100644
index 0000000000000000000000000000000000000000..1dd249bbab98cf3d224bdc7e27a0ab3ce5b77f82
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Action/Action_rank2.json
@@ -0,0 +1,78 @@
+[
+    {
+        "id": "25",
+        "source_image": "Part2/Action/25.png",
+        "edit_type": "Action",
+        "prompt_en": "Direct the dog to approach and pick up the tennis ball from the ground. ",
+        "GPT_translation_prompt_cn": "让狗去捡白色的小球。",
+        "GPT_refined_prompt_en": "Have the dog go pick up the white ball.",
+        "GPT_refined_prompt_cn": "让狗去捡白色的小球。",
+        "prompt_cn": "让狗过去叼起地上的网球。",
+        "save_id": 920,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Action/920.png",
+        "_merge_order": 20,
+        "status": "success"
+    },
+    {
+        "id": "31",
+        "source_image": "Part2/Action/31.png",
+        "edit_type": "Action",
+        "prompt_en": "Adjust the girl’s pose so that she is looking straight ahead.",
+        "GPT_translation_prompt_cn": "让这个女生向前看。",
+        "GPT_refined_prompt_en": "Adjust the girl’s pose so that she is looking straight ahead.",
+        "GPT_refined_prompt_cn": "让这个女生向前看.",
+        "prompt_cn": "让这个女生向前看.",
+        "save_id": 926,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Action/926.png",
+        "_merge_order": 26,
+        "status": "success"
+    },
+    {
+        "id": "32",
+        "source_image": "Part2/Action/32.png",
+        "edit_type": "Action",
+        "prompt_en": "Have the basketball player hold the basketball at chest level.",
+        "GPT_translation_prompt_cn": "让这名篮球运动员将篮球举到胸口。",
+        "GPT_refined_prompt_en": "Have the basketball player hold the basketball at chest level.",
+        "GPT_refined_prompt_cn": "让这名篮球运动员将篮球举到胸口。",
+        "prompt_cn": "让这名篮球运动员将篮球举到胸口。",
+        "save_id": 927,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Action/927.png",
+        "_merge_order": 27,
+        "status": "success"
+    },
+    {
+        "id": "72",
+        "source_image": "Part2/Action/72.png",
+        "edit_type": "Action",
+        "prompt_en": "Have this girl make a finger heart gesture.",
+        "GPT_translation_prompt_cn": "让这个女生做出比心的动作",
+        "GPT_refined_prompt_en": "Have this girl make a finger heart gesture.",
+        "GPT_refined_prompt_cn": "让这个女生做出比心的动作",
+        "prompt_cn": "让这个女生做出比心的动作",
+        "save_id": 111962,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Action/111962.png",
+        "_merge_order": 67,
+        "status": "success"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/Emotion_Change.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/Emotion_Change.json
new file mode 100644
index 0000000000000000000000000000000000000000..62cd78126be3096f4abc48cfced9a8360e7c6871
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/Emotion_Change.json
@@ -0,0 +1,776 @@
+[
+    {
+        "id": "2",
+        "source_image": "Part2/emotion_change/2.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Replace the smiling balloon with a frowning one.",
+        "GPT_translation_prompt_cn": "把微笑的气球换成一个皱眉的气球。",
+        "GPT_refined_prompt_en": "Replace the smiling balloon with a frowning balloon.",
+        "GPT_refined_prompt_cn": "将微笑的气球替换为一个皱眉的气球。",
+        "prompt_cn": "将微笑的气球替换为一个皱眉的气球。",
+        "save_id": 1179,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1179.png",
+        "status": "skipped"
+    },
+    {
+        "id": "3",
+        "source_image": "Part2/emotion_change/3.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the cat look very fierce.”",
+        "GPT_translation_prompt_cn": "让这只猫看起来非常凶猛。",
+        "GPT_refined_prompt_en": "Make the cat look very fierce.",
+        "GPT_refined_prompt_cn": "让这只猫看起来非常凶猛。",
+        "prompt_cn": "让这只猫看起来非常凶猛。",
+        "save_id": 1180,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1180.png",
+        "status": "skipped"
+    },
+    {
+        "id": "4",
+        "source_image": "Part2/emotion_change/4.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the boy sink into deep thought.",
+        "GPT_translation_prompt_cn": "让这个男孩陷入深思。",
+        "GPT_refined_prompt_en": "Make the boy appear to be deep in thought.",
+        "GPT_refined_prompt_cn": "让这个男孩看起来正在深思。",
+        "prompt_cn": "让这个男孩看起来正在深思。",
+        "save_id": 1181,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1181.png",
+        "status": "skipped"
+    },
+    {
+        "id": "5",
+        "source_image": "Part2/emotion_change/5.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him smiling broadly.",
+        "GPT_translation_prompt_cn": "让他露出灿烂的笑容。",
+        "GPT_refined_prompt_en": "Make him smile broadly.",
+        "GPT_refined_prompt_cn": "让他开怀大笑，露出灿烂的笑容。",
+        "prompt_cn": "让他开怀大笑，露出灿烂的笑容。",
+        "save_id": 1182,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1182.png",
+        "status": "skipped"
+    },
+    {
+        "id": "6",
+        "source_image": "Part2/emotion_change/6.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the baby laughing happily.",
+        "GPT_translation_prompt_cn": "让这个婴儿高兴地大笑。",
+        "GPT_refined_prompt_en": "Make the baby laugh happily.",
+        "GPT_refined_prompt_cn": "让婴儿开心地笑起来。",
+        "prompt_cn": "让婴儿开心地笑起来。",
+        "save_id": 1183,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1183.png",
+        "status": "skipped"
+    },
+    {
+        "id": "7",
+        "source_image": "Part2/emotion_change/7.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the cat look happy and smiling.",
+        "GPT_translation_prompt_cn": "让这只猫看起来开心并露出微笑。",
+        "GPT_refined_prompt_en": "Make the cat look happy and smiling.",
+        "GPT_refined_prompt_cn": "让这只猫看起来开心并带着微笑。",
+        "prompt_cn": "让这只猫看起来开心并带着微笑。",
+        "save_id": 1184,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1184.png",
+        "status": "skipped"
+    },
+    {
+        "id": "9",
+        "source_image": "Part2/emotion_change/9.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her laughing with her mouth open.",
+        "GPT_translation_prompt_cn": "让她张开嘴大笑。",
+        "GPT_refined_prompt_en": "Make her laugh with her mouth open.",
+        "GPT_refined_prompt_cn": "让她张开嘴笑出来。",
+        "prompt_cn": "让她张开嘴笑出来。",
+        "save_id": 1185,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1185.png",
+        "status": "skipped"
+    },
+    {
+        "id": "13",
+        "source_image": "Part2/emotion_change/13.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him look relieved and happy.",
+        "GPT_translation_prompt_cn": "让他看起来如释重负并且开心。",
+        "GPT_refined_prompt_en": "Make him look relieved and happy.",
+        "GPT_refined_prompt_cn": "让他看起来放松、如释重负并且开心。",
+        "prompt_cn": "让他看起来放松、如释重负并且开心。",
+        "save_id": 1187,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1187.png",
+        "status": "skipped"
+    },
+    {
+        "id": "16",
+        "source_image": "Part2/emotion_change/16.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her look disappointed and frowning.",
+        "GPT_translation_prompt_cn": "让她看起来很失望并皱着眉头。",
+        "GPT_refined_prompt_en": "Make her look disappointed and frowning.",
+        "GPT_refined_prompt_cn": "让她看起来很失望，并且皱着眉头。",
+        "prompt_cn": "让她看起来很失望，并且皱着眉头。",
+        "save_id": 1189,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1189.png",
+        "status": "skipped"
+    },
+    {
+        "id": "20",
+        "source_image": "Part2/emotion_change/20.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the baby about to cry.",
+        "GPT_translation_prompt_cn": "让这个婴儿看起来即将哭出来。",
+        "GPT_refined_prompt_en": "Make the baby look like they are about to cry.",
+        "GPT_refined_prompt_cn": "让这名婴儿看起来好像快要哭出来。",
+        "prompt_cn": "让这名婴儿看起来好像快要哭出来。",
+        "save_id": 1191,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1191.png",
+        "status": "skipped"
+    },
+    {
+        "id": "21",
+        "source_image": "Part2/emotion_change/21.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the superhero look defeated and sad.",
+        "GPT_translation_prompt_cn": "让这位超级英雄看起来被打败且很悲伤。",
+        "GPT_refined_prompt_en": "Make the superhero look defeated and sad.",
+        "GPT_refined_prompt_cn": "让这位超级英雄看起来被打败并且很悲伤。",
+        "prompt_cn": "让这位超级英雄看起来被打败并且很悲伤。",
+        "save_id": 1192,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1192.png",
+        "status": "skipped"
+    },
+    {
+        "id": "24",
+        "source_image": "Part2/emotion_change/24.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Change the expression to a sad face.",
+        "GPT_translation_prompt_cn": "把表情改成一张悲伤的脸。",
+        "GPT_refined_prompt_en": "Change the expression to a sad face.",
+        "GPT_refined_prompt_cn": "将表情更改为悲伤的脸。",
+        "prompt_cn": "将表情更改为悲伤的脸。",
+        "save_id": 1193,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1193.png",
+        "status": "skipped"
+    },
+    {
+        "id": "25",
+        "source_image": "Part2/emotion_change/25.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the teacher look furious and shouting.",
+        "GPT_translation_prompt_cn": "让这位老师看起来非常愤怒并在大喊。",
+        "GPT_refined_prompt_en": "Make the teacher look extremely furious and shouting.",
+        "GPT_refined_prompt_cn": "让这位老师看起来极度愤怒并在大喊。",
+        "prompt_cn": "让这位老师看起来极度愤怒并在大喊。",
+        "save_id": 1194,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1194.png",
+        "status": "skipped"
+    },
+    {
+        "id": "26",
+        "source_image": "Part2/emotion_change/26.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her look angry and scolding.",
+        "GPT_translation_prompt_cn": "让她看起来很生气并在责骂人。",
+        "GPT_refined_prompt_en": "Make her look angry and as if she is scolding someone.",
+        "GPT_refined_prompt_cn": "让她看起来很生气，好像正在责骂某个人。",
+        "prompt_cn": "让她看起来很生气，好像正在责骂某个人。",
+        "save_id": 1195,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1195.png",
+        "status": "skipped"
+    },
+    {
+        "id": "28",
+        "source_image": "Part2/emotion_change/28.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the waiter look annoyed and frowning.",
+        "GPT_translation_prompt_cn": "让他看起来很恼火并皱着眉头。",
+        "GPT_refined_prompt_en": "Make him look annoyed with a frown.",
+        "GPT_refined_prompt_cn": "让他看起来很恼火，并露出皱眉的表情。",
+        "prompt_cn": "让服务员看起来很恼火，并露出皱眉的表情。",
+        "save_id": 1196,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1196.png",
+        "status": "success"
+    },
+    {
+        "id": "30",
+        "source_image": "Part2/emotion_change/30.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the person sitting in the car look like they are having road rage.",
+        "GPT_translation_prompt_cn": "让车里坐的人看起来像是路怒症发作了。",
+        "GPT_refined_prompt_en": "Make the person sitting in the car look like they are having road rage.",
+        "GPT_refined_prompt_cn": "让车里坐的人看起来像是路怒症发作了。",
+        "prompt_cn": "让车里坐的人看起来像是路怒症发作了。",
+        "save_id": 1198,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1198.png",
+        "status": "skipped"
+    },
+    {
+        "id": "32",
+        "source_image": "Part2/emotion_change/32.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him look shocked with his jaw dropped.",
+        "GPT_translation_prompt_cn": "让他看起来很震惊，下巴掉下来。",
+        "GPT_refined_prompt_en": "Make him look shocked with his jaw dropped.",
+        "GPT_refined_prompt_cn": "让他看起来很震惊，张大嘴巴下巴下垂。",
+        "prompt_cn": "让他看起来很震惊，张大嘴巴下巴下垂。",
+        "save_id": 1199,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1199.png",
+        "status": "success"
+    },
+    {
+        "id": "33",
+        "source_image": "Part2/emotion_change/33.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her look surprised by what she is reading.",
+        "GPT_translation_prompt_cn": "让她看起来对正在阅读的内容感到惊讶。",
+        "GPT_refined_prompt_en": "Make her look surprised by what she is reading.",
+        "GPT_refined_prompt_cn": "让她看起来对自己正在阅读的内容感到惊讶。",
+        "prompt_cn": "让她看起来对自己正在阅读的内容感到惊讶。",
+        "save_id": 1200,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1200.png",
+        "status": "skipped"
+    },
+    {
+        "id": "36",
+        "source_image": "Part2/emotion_change/36.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him look terrified.",
+        "GPT_translation_prompt_cn": "让他看起来很恐惧。",
+        "GPT_refined_prompt_en": "Make him look terrified.",
+        "GPT_refined_prompt_cn": "让他看起来非常害怕。",
+        "prompt_cn": "让他看起来非常害怕。",
+        "save_id": 1202,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1202.png",
+        "status": "skipped"
+    },
+    {
+        "id": "37",
+        "source_image": "Part2/emotion_change/37.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her look very scared.",
+        "GPT_translation_prompt_cn": "让她看起来很害怕。",
+        "GPT_refined_prompt_en": "Make her look very scared.",
+        "GPT_refined_prompt_cn": "让她看起来很害怕。",
+        "prompt_cn": "让她看起来很害怕。",
+        "save_id": 1203,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1203.png",
+        "status": "skipped"
+    },
+    {
+        "id": "38",
+        "source_image": "Part2/emotion_change/38.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her look nervous and sweating.",
+        "GPT_translation_prompt_cn": "让他看起来紧张并且满头大汗。",
+        "GPT_refined_prompt_en": "Make her look nervous and sweating.",
+        "GPT_refined_prompt_cn": "让他看起来紧张并且在流汗。",
+        "prompt_cn": "让她看起来紧张并且在流汗。",
+        "save_id": 1204,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1204.png",
+        "status": "success"
+    },
+    {
+        "id": "41",
+        "source_image": "Part2/emotion_change/41.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him show a fearful expression.",
+        "GPT_translation_prompt_cn": "让他展示出恐惧的表情。",
+        "GPT_refined_prompt_en": "Make him show a fearful expression.",
+        "GPT_refined_prompt_cn": "让他展示出恐惧的表情。",
+        "prompt_cn": "让他展示出恐惧的表情。",
+        "save_id": 1205,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1205.png",
+        "status": "skipped"
+    },
+    {
+        "id": "42",
+        "source_image": "Part2/emotion_change/42.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him show a disgusted expression.",
+        "GPT_translation_prompt_cn": "让他展示出厌恶的表情。",
+        "GPT_refined_prompt_en": "Make him show a disgusted expression.",
+        "GPT_refined_prompt_cn": "让他展示出厌恶的表情。",
+        "prompt_cn": "让他展示出厌恶的表情。",
+        "save_id": 1206,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1206.png",
+        "status": "skipped"
+    },
+    {
+        "id": "43",
+        "source_image": "Part2/emotion_change/43.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her sneer with contempt.",
+        "GPT_translation_prompt_cn": "让她露出轻蔑的冷笑。",
+        "GPT_refined_prompt_en": "Make her sneer with contempt.",
+        "GPT_refined_prompt_cn": "让她露出带有轻蔑意味的冷笑。",
+        "prompt_cn": "让她露出带有轻蔑意味的冷笑。",
+        "save_id": 1207,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1207.png",
+        "status": "skipped"
+    },
+    {
+        "id": "44",
+        "source_image": "Part2/emotion_change/44.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the cat look alert and focused.",
+        "GPT_translation_prompt_cn": "让这只猫做出一副厌恶的表情（作呕）。",
+        "GPT_refined_prompt_en": "Make the cat show a disgusted, gagging facial expression.",
+        "GPT_refined_prompt_cn": "让这只猫表现出厌恶、作呕的表情。",
+        "prompt_cn": "让猫看起来警觉且专注。",
+        "save_id": 1208,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1208.png",
+        "status": "skipped"
+    },
+    {
+        "id": "45",
+        "source_image": "Part2/emotion_change/45.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her look very focused.",
+        "GPT_translation_prompt_cn": "让她看起来很专注。",
+        "GPT_refined_prompt_en": "Make her look very focused.",
+        "GPT_refined_prompt_cn": "让她看起来很专注。",
+        "prompt_cn": "让她看起来很专注。",
+        "save_id": 1209,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1209.png",
+        "status": "skipped"
+    },
+    {
+        "id": "46",
+        "source_image": "Part2/emotion_change/46.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the girl riding the horse look arrogant and contemptuous.",
+        "GPT_translation_prompt_cn": "让骑着马的女生看起来傲慢而轻蔑。",
+        "GPT_refined_prompt_en": "Make the girl riding the horse look arrogant and contemptuous.",
+        "GPT_refined_prompt_cn": "让骑着马的女生看起来傲慢而轻蔑。",
+        "prompt_cn": "让骑着马的女生看起来傲慢而轻蔑。",
+        "save_id": 1210,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1210.png",
+        "status": "skipped"
+    },
+    {
+        "id": "49",
+        "source_image": "Part2/emotion_change/49.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her look wicked and sneering.",
+        "GPT_translation_prompt_cn": "让她看起来邪恶而冷笑。",
+        "GPT_refined_prompt_en": "Make her look wicked and sneering.",
+        "GPT_refined_prompt_cn": "让她看起来邪恶并带着冷笑。",
+        "prompt_cn": "让她看起来邪恶并带着冷笑。",
+        "save_id": 1211,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1211.png",
+        "status": "skipped"
+    },
+    {
+        "id": "50",
+        "source_image": "Part2/emotion_change/50.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her look exhausted and panting.",
+        "GPT_translation_prompt_cn": "让她看起来很疲惫并气喘吁吁。",
+        "GPT_refined_prompt_en": "Make her look exhausted and out of breath.",
+        "GPT_refined_prompt_cn": "让她看起来筋疲力尽、气喘吁吁。",
+        "prompt_cn": "让她看起来筋疲力尽、气喘吁吁。",
+        "save_id": 1212,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1212.png",
+        "status": "skipped"
+    },
+    {
+        "id": "51",
+        "source_image": "Part2/emotion_change/51.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the student yawning.",
+        "GPT_translation_prompt_cn": "让这位学生打哈欠。",
+        "GPT_refined_prompt_en": "Make the student yawn.",
+        "GPT_refined_prompt_cn": "让这位学生打哈欠。",
+        "prompt_cn": "让这位学生打哈欠。",
+        "save_id": 1213,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1213.png",
+        "status": "skipped"
+    },
+    {
+        "id": "52",
+        "source_image": "Part2/emotion_change/52.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the dog look sleepy and dozing off.",
+        "GPT_translation_prompt_cn": "让这只狗看起来昏昏欲睡、打瞌睡的样子。",
+        "GPT_refined_prompt_en": "Make the dog look sleepy and dozing off.",
+        "GPT_refined_prompt_cn": "让这只狗看起来很困倦，正在打瞌睡。",
+        "prompt_cn": "让这只狗看起来很困倦，正在打瞌睡。",
+        "save_id": 1214,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1214.png",
+        "status": "skipped"
+    },
+    {
+        "id": "53",
+        "source_image": "Part2/emotion_change/53.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him look like he has dark circles and is tired.",
+        "GPT_translation_prompt_cn": "让他看起来有黑眼圈而且很疲惫。",
+        "GPT_refined_prompt_en": "Make him look like he has dark circles under his eyes and appears tired.",
+        "GPT_refined_prompt_cn": "让他看起来眼睛下方有黑眼圈，并显得很疲惫。",
+        "prompt_cn": "让他看起来眼睛下方有黑眼圈，并显得很疲惫。",
+        "save_id": 1215,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1215.png",
+        "status": "skipped"
+    },
+    {
+        "id": "56",
+        "source_image": "Part2/emotion_change/56.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her sticking her tongue out playfully.",
+        "GPT_translation_prompt_cn": "让她调皮地吐舌头。",
+        "GPT_refined_prompt_en": "Make her stick her tongue out playfully.",
+        "GPT_refined_prompt_cn": "让她调皮地伸出舌头。",
+        "prompt_cn": "让她调皮地伸出舌头。",
+        "save_id": 1216,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1216.png",
+        "status": "skipped"
+    },
+    {
+        "id": "57",
+        "source_image": "Part2/emotion_change/57.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him look serious and thinking.",
+        "GPT_translation_prompt_cn": "让他看起来很严肃并在思考。",
+        "GPT_refined_prompt_en": "Make him look serious and deep in thought.",
+        "GPT_refined_prompt_cn": "让他看起来很严肃，并且陷入深思之中。",
+        "prompt_cn": "让他看起来很严肃，并且陷入深思之中。",
+        "save_id": 1217,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1217.png",
+        "status": "skipped"
+    },
+    {
+        "id": "60",
+        "source_image": "Part2/emotion_change/60.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him look meditated and calm.",
+        "GPT_translation_prompt_cn": "让他看起来在冥想且十分平静。",
+        "GPT_refined_prompt_en": "Make him look meditative and calm.",
+        "GPT_refined_prompt_cn": "让他看起来处于冥想状态并且很平静。",
+        "prompt_cn": "让他看起来处于冥想状态并且很平静。",
+        "save_id": 1218,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1218.png",
+        "status": "skipped"
+    },
+    {
+        "id": "61",
+        "source_image": "Part2/emotion_change/61.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make this baby look very gloomy.",
+        "GPT_translation_prompt_cn": "让这个宝宝看起来很郁闷。",
+        "GPT_refined_prompt_en": "Make this baby look very gloomy.",
+        "GPT_refined_prompt_cn": "让这个宝宝看起来很郁闷。",
+        "prompt_cn": "让这个宝宝看起来很郁闷。",
+        "save_id": 1219,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1219.png",
+        "status": "skipped"
+    },
+    {
+        "id": "62",
+        "source_image": "Part2/emotion_change/62.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him look utterly confused, scratching his head.",
+        "GPT_translation_prompt_cn": "让他看起来非常困惑，一边挠头。",
+        "GPT_refined_prompt_en": "Make him look extremely confused, scratching his head.",
+        "GPT_refined_prompt_cn": "让他看起来极度困惑，并且正在挠头。",
+        "prompt_cn": "让他看起来极度困惑，并且正在挠头。",
+        "save_id": 1220,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1220.png",
+        "status": "skipped"
+    },
+    {
+        "id": "63",
+        "source_image": "Part2/emotion_change/63.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the dog tilt its head to the side in confusion.",
+        "GPT_translation_prompt_cn": "让这只狗困惑地把头歪向一侧。",
+        "GPT_refined_prompt_en": "Make the dog tilt its head to the side as if it is confused.",
+        "GPT_refined_prompt_cn": "让这只狗把头歪向一侧，就好像它很困惑一样。",
+        "prompt_cn": "让这只狗把头歪向一侧，就好像它很困惑一样。",
+        "save_id": 1221,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1221.png",
+        "status": "skipped"
+    },
+    {
+        "id": "65",
+        "source_image": "Part2/emotion_change/65.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him wincing in sudden muscle pain.",
+        "GPT_translation_prompt_cn": "让他看起来因为突然的肌肉疼痛而龇牙咧嘴。",
+        "GPT_refined_prompt_en": "Make him appear to be wincing in sudden muscle pain.",
+        "GPT_refined_prompt_cn": "让他看起来正在因突然的肌肉疼痛而龇牙咧嘴。",
+        "prompt_cn": "让他看起来正在因突然的肌肉疼痛而龇牙咧嘴。",
+        "save_id": 1222,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1222.png",
+        "status": "skipped"
+    },
+    {
+        "id": "66",
+        "source_image": "Part2/emotion_change/66.png",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make this little boy look lost in thought.",
+        "GPT_translation_prompt_cn": "让这个小男孩正在发呆。",
+        "GPT_refined_prompt_en": "Make this little boy look lost in thought.",
+        "GPT_refined_prompt_cn": "让这个小男孩正在发呆。",
+        "prompt_cn": "让这个小男孩正在发呆。",
+        "save_id": 1223,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1223.png",
+        "status": "skipped"
+    },
+    {
+        "id": "69",
+        "source_image": "Part2/emotion_change/69.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her show a disappointed expression.",
+        "GPT_translation_prompt_cn": "让她展示出失望的表情。",
+        "GPT_refined_prompt_en": "Make her show a disappointed expression.",
+        "GPT_refined_prompt_cn": "让她展示出失望的表情。",
+        "prompt_cn": "让她展示出失望的表情。",
+        "save_id": 1224,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1224.png",
+        "status": "skipped"
+    },
+    {
+        "id": "72",
+        "source_image": "Part2/emotion_change/72.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him look very impatient.",
+        "GPT_translation_prompt_cn": "让他看起来很不耐烦。",
+        "GPT_refined_prompt_en": "Make him look very impatient.",
+        "GPT_refined_prompt_cn": "让他看起来很不耐烦。",
+        "prompt_cn": "让他看起来很不耐烦。",
+        "save_id": 1225,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1225.png",
+        "status": "skipped"
+    },
+    {
+        "id": "73",
+        "source_image": "Part2/emotion_change/73.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him look like he is desperately holding back laughter.",
+        "GPT_translation_prompt_cn": "让他看起来像在拼命憋笑。",
+        "GPT_refined_prompt_en": "Make him look like he is desperately holding back laughter.",
+        "GPT_refined_prompt_cn": "让他看起来像在极力忍住笑。",
+        "prompt_cn": "让他看起来像在极力憋笑。",
+        "save_id": 1226,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1226.png",
+        "status": "success"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/Emotion_Change_rank4.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/Emotion_Change_rank4.json
new file mode 100644
index 0000000000000000000000000000000000000000..6da4087df060bcf5882727ccb8cf9211fae3c00a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/Emotion_Change_rank4.json
@@ -0,0 +1,78 @@
+[
+    {
+        "id": "28",
+        "source_image": "Part2/emotion_change/28.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make the waiter look annoyed and frowning.",
+        "GPT_translation_prompt_cn": "让他看起来很恼火并皱着眉头。",
+        "GPT_refined_prompt_en": "Make him look annoyed with a frown.",
+        "GPT_refined_prompt_cn": "让他看起来很恼火，并露出皱眉的表情。",
+        "prompt_cn": "让服务员看起来很恼火，并露出皱眉的表情。",
+        "save_id": 1196,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1196.png",
+        "_merge_order": 14,
+        "status": "success"
+    },
+    {
+        "id": "32",
+        "source_image": "Part2/emotion_change/32.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him look shocked with his jaw dropped.",
+        "GPT_translation_prompt_cn": "让他看起来很震惊，下巴掉下来。",
+        "GPT_refined_prompt_en": "Make him look shocked with his jaw dropped.",
+        "GPT_refined_prompt_cn": "让他看起来很震惊，张大嘴巴下巴下垂。",
+        "prompt_cn": "让他看起来很震惊，张大嘴巴下巴下垂。",
+        "save_id": 1199,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1199.png",
+        "_merge_order": 16,
+        "status": "success"
+    },
+    {
+        "id": "38",
+        "source_image": "Part2/emotion_change/38.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make her look nervous and sweating.",
+        "GPT_translation_prompt_cn": "让他看起来紧张并且满头大汗。",
+        "GPT_refined_prompt_en": "Make her look nervous and sweating.",
+        "GPT_refined_prompt_cn": "让他看起来紧张并且在流汗。",
+        "prompt_cn": "让她看起来紧张并且在流汗。",
+        "save_id": 1204,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1204.png",
+        "_merge_order": 20,
+        "status": "success"
+    },
+    {
+        "id": "73",
+        "source_image": "Part2/emotion_change/73.jpg",
+        "edit_type": "Motion_change",
+        "prompt_en": "Make him look like he is desperately holding back laughter.",
+        "GPT_translation_prompt_cn": "让他看起来像在拼命憋笑。",
+        "GPT_refined_prompt_en": "Make him look like he is desperately holding back laughter.",
+        "GPT_refined_prompt_cn": "让他看起来像在极力忍住笑。",
+        "prompt_cn": "让他看起来像在极力憋笑。",
+        "save_id": 1226,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Emotion_Change/1226.png",
+        "_merge_order": 42,
+        "status": "success"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Move/Move.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Move/Move.json
new file mode 100644
index 0000000000000000000000000000000000000000..b7e37e83ba80858858513186cca3c5c4f598e5a7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Move/Move.json
@@ -0,0 +1,1169 @@
+[
+    {
+        "id": "1",
+        "source_image": "Part2/Move/1.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the letter V to the right of the letter E, move the letter O to the right of V, and move the letter L to the right of O.",
+        "GPT_translation_prompt_cn": "把字母 V 移动到字母 E 的右边，把字母 O 移动到 V 的右边，把字母 L 移动到 O 的右边。",
+        "GPT_refined_prompt_en": "Move the letter V to the right of the letter E, then move the letter O to the right of V, and move the letter L to the right of O.",
+        "GPT_refined_prompt_cn": "将字母 V 移动到字母 E 的右侧，然后将字母 O 移动到 V 的右侧，再将字母 L 移动到 O 的右侧。",
+        "prompt_cn": "将字母 V 移动到字母 E 的右侧，然后将字母 O 移动到 V 的右侧，再将字母 L 移动到 O 的右侧。",
+        "save_id": 967,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/967.png",
+        "status": "skipped"
+    },
+    {
+        "id": "2",
+        "source_image": "Part2/Move/2.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the single cherry tomato onto the spoon.”",
+        "GPT_translation_prompt_cn": "将那颗单独的樱桃番茄移动到勺子上。",
+        "GPT_refined_prompt_en": "Move the single cherry tomato onto the spoon.",
+        "GPT_refined_prompt_cn": "将那颗单独的樱桃番茄移到勺子上。",
+        "prompt_cn": "将那颗单独的樱桃番茄移到勺子上。",
+        "save_id": 968,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/968.png",
+        "status": "skipped"
+    },
+    {
+        "id": "3",
+        "source_image": "Part2/Move/3.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the candies outside the jar into the box.",
+        "GPT_translation_prompt_cn": "把罐子外面的糖果移到盒子里。",
+        "GPT_refined_prompt_en": "Move the candies that are outside the jar into the box.",
+        "GPT_refined_prompt_cn": "将罐子外面的糖果移入盒子中。",
+        "prompt_cn": "将罐子外面的糖果移入盒子中。",
+        "save_id": 969,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/969.png",
+        "status": "skipped"
+    },
+    {
+        "id": "4",
+        "source_image": "Part2/Move/4.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the chair to the right side of the sofa.",
+        "GPT_translation_prompt_cn": "把椅子移动到沙发的右侧。",
+        "GPT_refined_prompt_en": "Move the chair to the right side of the sofa.",
+        "GPT_refined_prompt_cn": "将椅子移动到沙发的右侧。",
+        "prompt_cn": "将椅子移动到沙发的右侧。",
+        "save_id": 970,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/970.png",
+        "status": "skipped"
+    },
+    {
+        "id": "5",
+        "source_image": "Part2/Move/5.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the robot to the left.",
+        "GPT_translation_prompt_cn": "把机器人移动到左边。",
+        "GPT_refined_prompt_en": "Move the robot to the left side.",
+        "GPT_refined_prompt_cn": "将机器人移动到左侧。",
+        "prompt_cn": "将机器人移动到左侧。",
+        "save_id": 971,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/971.png",
+        "status": "skipped"
+    },
+    {
+        "id": "6",
+        "source_image": "Part2/Move/6.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the SIM card into the slot.",
+        "GPT_translation_prompt_cn": "把这张 SIM 卡移动到卡槽里。",
+        "GPT_refined_prompt_en": "Move the SIM card into the slot.",
+        "GPT_refined_prompt_cn": "将这张 SIM 卡移动到插槽中。",
+        "prompt_cn": "将这张 SIM 卡移动到插槽中。",
+        "save_id": 972,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/972.png",
+        "status": "skipped"
+    },
+    {
+        "id": "7",
+        "source_image": "Part2/Move/7.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the coffee cup to the bottom-right corner of the image.",
+        "GPT_translation_prompt_cn": "将咖啡杯移动到右下角。",
+        "GPT_refined_prompt_en": "Move the coffee cup to the bottom-right corner of the image.",
+        "GPT_refined_prompt_cn": "将咖啡杯移动到右下角。",
+        "prompt_cn": "将咖啡杯移动到右下角。",
+        "save_id": 973,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/973.png",
+        "status": "skipped"
+    },
+    {
+        "id": "8",
+        "source_image": "Part2/Move/8.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the soccer ball to the other foot.",
+        "GPT_translation_prompt_cn": "把足球移到另一只脚上。",
+        "GPT_refined_prompt_en": "Move the soccer ball to the other foot.",
+        "GPT_refined_prompt_cn": "将足球移动到另一只脚上。",
+        "prompt_cn": "将足球移动到另一只脚上。",
+        "save_id": 974,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/974.png",
+        "status": "skipped"
+    },
+    {
+        "id": "9",
+        "source_image": "Part2/Move/9.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the paper clip to the right.",
+        "GPT_translation_prompt_cn": "将纸夹向右移动。",
+        "GPT_refined_prompt_en": "Move the paper clip to the right side.",
+        "GPT_refined_prompt_cn": "将纸夹移动到右侧。",
+        "prompt_cn": "将纸夹移动到右侧。",
+        "save_id": 975,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/975.png",
+        "status": "skipped"
+    },
+    {
+        "id": "10",
+        "source_image": "Part2/Move/10.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the cards to the correct positions to complete the puzzle.",
+        "GPT_translation_prompt_cn": "将这些卡片移动到正确的位置以完成拼图。",
+        "GPT_refined_prompt_en": "Move the pieces to their correct positions to complete the puzzle.",
+        "GPT_refined_prompt_cn": "将这些拼图块移动到正确的位置以完成拼图。",
+        "prompt_cn": "将这些拼图块移动到正确的位置以完成拼图。",
+        "save_id": 976,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/976.png",
+        "status": "skipped"
+    },
+    {
+        "id": "11",
+        "source_image": "Part2/Move/11.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the spoon into the bowl.",
+        "GPT_translation_prompt_cn": "把勺子移到碗里。",
+        "GPT_refined_prompt_en": "Move the spoon into the bowl.",
+        "GPT_refined_prompt_cn": "将勺子移入碗中。",
+        "prompt_cn": "将勺子移入碗中。",
+        "save_id": 977,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/977.png",
+        "status": "skipped"
+    },
+    {
+        "id": "15",
+        "source_image": "Part2/Move/15.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the painting to the right.",
+        "GPT_translation_prompt_cn": "将这幅画向右移动。",
+        "GPT_refined_prompt_en": "Move the painting to the right.",
+        "GPT_refined_prompt_cn": "将这幅画向右移动。",
+        "prompt_cn": "将这幅画向右移动。",
+        "save_id": 980,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/980.png",
+        "status": "skipped"
+    },
+    {
+        "id": "17",
+        "source_image": "Part2/Move/17.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the table lamp to the right bedside table.",
+        "GPT_translation_prompt_cn": "把台灯移到右边的床头柜上。",
+        "GPT_refined_prompt_en": "Move the table lamp onto the right bedside table.",
+        "GPT_refined_prompt_cn": "将台灯移到右侧的床头柜上。",
+        "prompt_cn": "将台灯移到右侧的床头柜上。",
+        "save_id": 981,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/981.png",
+        "status": "skipped"
+    },
+    {
+        "id": "19",
+        "source_image": "Part2/Move/19.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the book from the chair to the nearby bookshelf.",
+        "GPT_translation_prompt_cn": "把这叠书移到旁边的书架上。",
+        "GPT_refined_prompt_en": "Move the stack of books onto the nearby bookshelf.",
+        "GPT_refined_prompt_cn": "将那叠书移动到附近的书架上。",
+        "prompt_cn": "把椅子上的书移动到附近的书架上。",
+        "save_id": 982,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/982.png",
+        "status": "success"
+    },
+    {
+        "id": "20",
+        "source_image": "Part2/Move/20.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the wall clock to the left of the television.",
+        "GPT_translation_prompt_cn": "把墙上的时钟移动到电视的左侧。",
+        "GPT_refined_prompt_en": "Move the wall clock to the left side of the television.",
+        "GPT_refined_prompt_cn": "将墙上的时钟移动到电视的左侧。",
+        "prompt_cn": "将墙上的时钟移动到电视的左侧。",
+        "save_id": 983,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/983.png",
+        "status": "skipped"
+    },
+    {
+        "id": "21",
+        "source_image": "Part2/Move/21.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the throw pillow to the center of the couch.",
+        "GPT_translation_prompt_cn": "将抱枕移动到沙发的中央。",
+        "GPT_refined_prompt_en": "Move the throw pillow to the center of the couch.",
+        "GPT_refined_prompt_cn": "将抱枕移动到沙发的中央。",
+        "prompt_cn": "将抱枕移动到沙发的中央。",
+        "save_id": 984,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/984.png",
+        "status": "skipped"
+    },
+    {
+        "id": "22",
+        "source_image": "Part2/Move/22.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the cat onto the sofa.",
+        "GPT_translation_prompt_cn": "把猫移动到沙发上。",
+        "GPT_refined_prompt_en": "Move the cat onto the sofa.",
+        "GPT_refined_prompt_cn": "将猫移动到沙发上。",
+        "prompt_cn": "将猫移动到沙发上。",
+        "save_id": 985,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/985.png",
+        "status": "skipped"
+    },
+    {
+        "id": "23",
+        "source_image": "Part2/Move/23.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the apple onto the white tablecloth.",
+        "GPT_translation_prompt_cn": "请将苹果移动到白色的桌布上。",
+        "GPT_refined_prompt_en": "Move the apple onto the white tablecloth.",
+        "GPT_refined_prompt_cn": "请将苹果移动到白色的桌布上。",
+        "prompt_cn": "请将苹果移动到白色的桌布上。",
+        "save_id": 986,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/986.png",
+        "status": "skipped"
+    },
+    {
+        "id": "24",
+        "source_image": "Part2/Move/24.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Place the pen on the left onto the coffee cup on the right.",
+        "GPT_translation_prompt_cn": "把左边的笔放在右边的咖啡杯上。",
+        "GPT_refined_prompt_en": "Place the pen on the left onto the coffee cup on the right.",
+        "GPT_refined_prompt_cn": "把左边的笔放在右边的咖啡杯上。",
+        "prompt_cn": "把左边的笔放在右边的咖啡杯上。",
+        "save_id": 987,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/987.png",
+        "status": "skipped"
+    },
+    {
+        "id": "25",
+        "source_image": "Part2/Move/25.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the spoon to the napkin beside the bowl.",
+        "GPT_translation_prompt_cn": "将勺子移到碗旁边的餐巾纸上。",
+        "GPT_refined_prompt_en": "Move the spoon onto the napkin beside the bowl.",
+        "GPT_refined_prompt_cn": "将勺子移到碗旁边的餐巾纸上。",
+        "prompt_cn": "将勺子移到碗旁边的餐巾纸上。",
+        "save_id": 988,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/988.png",
+        "status": "skipped"
+    },
+    {
+        "id": "26",
+        "source_image": "Part2/Move/26.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the candle to the front-right corner of the table.",
+        "GPT_translation_prompt_cn": "将蜡烛移动到桌子右前方的角落。",
+        "GPT_refined_prompt_en": "Move the candle to the front-right corner of the table.",
+        "GPT_refined_prompt_cn": "将蜡烛移动到桌子右前方的角落。",
+        "prompt_cn": "将蜡烛移动到桌子右前方的角落。",
+        "save_id": 989,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/989.png",
+        "status": "skipped"
+    },
+    {
+        "id": "27",
+        "source_image": "Part2/Move/27.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the glass of water off the coaster directly onto the table.",
+        "GPT_translation_prompt_cn": "将这杯水从杯垫上移动到桌面上。",
+        "GPT_refined_prompt_en": "Move the glass of water from the coaster directly onto the table.",
+        "GPT_refined_prompt_cn": "将这杯水直接从杯垫上移到桌面上。",
+        "prompt_cn": "将这杯水直接从杯垫上移到桌面上。",
+        "save_id": 990,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/990.png",
+        "status": "skipped"
+    },
+    {
+        "id": "28",
+        "source_image": "Part2/Move/28.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the pen to the space above the notebook.",
+        "GPT_translation_prompt_cn": "将钢笔移动到笔记本上方的空白处。",
+        "GPT_refined_prompt_en": "Move the pen to the empty space above the notebook.",
+        "GPT_refined_prompt_cn": "将钢笔移动到笔记本上方的空白位置。",
+        "prompt_cn": "将钢笔移动到笔记本上方的空白位置。",
+        "save_id": 991,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/991.png",
+        "status": "skipped"
+    },
+    {
+        "id": "29",
+        "source_image": "Part2/Move/29.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the strawberry onto the fork next to the cake.",
+        "GPT_translation_prompt_cn": "把草莓移动到蛋糕旁边的叉子上。",
+        "GPT_refined_prompt_en": "Move the strawberry onto the fork next to the cake.",
+        "GPT_refined_prompt_cn": "将草莓移到蛋糕旁边的叉子上。",
+        "prompt_cn": "将草莓移到蛋糕旁边的叉子上。",
+        "save_id": 992,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/992.png",
+        "status": "skipped"
+    },
+    {
+        "id": "30",
+        "source_image": "Part2/Move/30.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the strawberry onto the plate next to the cake.",
+        "GPT_translation_prompt_cn": "将草莓移到蛋糕旁边的盘子里。",
+        "GPT_refined_prompt_en": "Move the strawberry onto the plate next to the cake.",
+        "GPT_refined_prompt_cn": "将草莓移到蛋糕旁边的盘子里。",
+        "prompt_cn": "将草莓移到蛋糕旁边的盘子里。",
+        "save_id": 993,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/993.png",
+        "status": "skipped"
+    },
+    {
+        "id": "31",
+        "source_image": "Part2/Move/31.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the flower vase to the edge of the table.",
+        "GPT_translation_prompt_cn": "把花瓶移动到桌子的边缘。",
+        "GPT_refined_prompt_en": "Move the flower vase to the edge of the table.",
+        "GPT_refined_prompt_cn": "将花瓶移到桌子边缘。",
+        "prompt_cn": "将花瓶移到桌子边缘。",
+        "save_id": 994,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/994.png",
+        "status": "success"
+    },
+    {
+        "id": "33",
+        "source_image": "Part2/Move/33.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the red car to the right side of the street.",
+        "GPT_translation_prompt_cn": "把这辆红色汽车移动到街道的右侧。",
+        "GPT_refined_prompt_en": "Move the red car to the right side of the street.",
+        "GPT_refined_prompt_cn": "将红色汽车移动到街道的右侧。",
+        "prompt_cn": "将红色汽车移动到街道的右侧。",
+        "save_id": 995,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/995.png",
+        "status": "skipped"
+    },
+    {
+        "id": "36",
+        "source_image": "Part2/Move/36.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the bicycle to lean against the lamp post.",
+        "GPT_translation_prompt_cn": "让自行车靠在路灯杆上。",
+        "GPT_refined_prompt_en": "Move the bicycle so that it is leaning against the lamp post.",
+        "GPT_refined_prompt_cn": "让自行车靠在路灯杆上。",
+        "prompt_cn": "让自行车靠在路灯杆上。",
+        "save_id": 996,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/996.png",
+        "status": "skipped"
+    },
+    {
+        "id": "37",
+        "source_image": "Part2/Move/37.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the pigeon onto the bench and have it sit on it.",
+        "GPT_translation_prompt_cn": "把那只鸽子移动到长椅的靠背上坐着。",
+        "GPT_refined_prompt_en": "Move the pigeon so that it is sitting on the backrest of the bench.",
+        "GPT_refined_prompt_cn": "将那只鸽子移动到长椅的靠背上，让它坐在上面。",
+        "prompt_cn": "将那只鸽子移动到长椅上，让它坐在上面。",
+        "save_id": 997,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/997.png",
+        "status": "success"
+    },
+    {
+        "id": "39",
+        "source_image": "Part2/Move/39.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the taxi to the far right lane.",
+        "GPT_translation_prompt_cn": "把这辆出租车移到最右侧车道。",
+        "GPT_refined_prompt_en": "Move the taxi to the far-right lane.",
+        "GPT_refined_prompt_cn": "将出租车移动到最右侧车道。",
+        "prompt_cn": "将出租车移动到最右侧车道。",
+        "save_id": 998,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/998.png",
+        "status": "skipped"
+    },
+    {
+        "id": "40",
+        "source_image": "Part2/Move/40.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the trash can to be under the street light.",
+        "GPT_translation_prompt_cn": "把垃圾桶移到路灯下面。",
+        "GPT_refined_prompt_en": "Move the trash can so that it is positioned directly under the streetlight.",
+        "GPT_refined_prompt_cn": "将垃圾桶移动到直接位于路灯下方的位置。",
+        "prompt_cn": "将垃圾桶移动到直接位于路灯下方的位置。",
+        "save_id": 999,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/999.png",
+        "status": "skipped"
+    },
+    {
+        "id": "41",
+        "source_image": "Part2/Move/41.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the motorcycle to the open sunny area.",
+        "GPT_translation_prompt_cn": "把摩托车移动到开阔、阳光照射的区域。",
+        "GPT_refined_prompt_en": "Move the motorcycle to the open, sunny area.",
+        "GPT_refined_prompt_cn": "将摩托车移动到开阔、阳光充足的区域。",
+        "prompt_cn": "将摩托车移动到开阔、阳光充足的区域。",
+        "save_id": 1000,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1000.png",
+        "status": "skipped"
+    },
+    {
+        "id": "45",
+        "source_image": "Part2/Move/45.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the tent to the right side.",
+        "GPT_translation_prompt_cn": "将帐篷移动到右侧。",
+        "GPT_refined_prompt_en": "Move the tent to the right side.",
+        "GPT_refined_prompt_cn": "将帐篷移动到右侧。",
+        "prompt_cn": "将帐篷移动到右侧。",
+        "save_id": 1002,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1002.png",
+        "status": "skipped"
+    },
+    {
+        "id": "50",
+        "source_image": "Part2/Move/50.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the boat to the center of the lake.",
+        "GPT_translation_prompt_cn": "将船移动到湖的中心。",
+        "GPT_refined_prompt_en": "Move the boat to the center of the lake.",
+        "GPT_refined_prompt_cn": "将船移动到湖中央。",
+        "prompt_cn": "将船移动到湖中央。",
+        "save_id": 1003,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1003.png",
+        "status": "skipped"
+    },
+    {
+        "id": "51",
+        "source_image": "Part2/Move/51.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the butterfly onto the red flower nearby.",
+        "GPT_translation_prompt_cn": "把蝴蝶移到旁边的红色花朵上。",
+        "GPT_refined_prompt_en": "Move the butterfly onto the nearby red flower.",
+        "GPT_refined_prompt_cn": "将蝴蝶移动到附近的红色花朵上。",
+        "prompt_cn": "将蝴蝶移动到附近的红色花朵上。",
+        "save_id": 1004,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1004.png",
+        "status": "skipped"
+    },
+    {
+        "id": "56",
+        "source_image": "Part2/Move/56.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the tennis racket to lie next to the net.",
+        "GPT_translation_prompt_cn": "把网球拍移动到网旁边躺着。",
+        "GPT_refined_prompt_en": "Move the tennis racket so that it is lying next to the net.",
+        "GPT_refined_prompt_cn": "将网球拍移动，使其躺在球网旁边。",
+        "prompt_cn": "将网球拍移动，使其躺在球网旁边。",
+        "save_id": 1007,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1007.png",
+        "status": "skipped"
+    },
+    {
+        "id": "57",
+        "source_image": "Part2/Move/57.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the yoga mat to the center of the room.",
+        "GPT_translation_prompt_cn": "将瑜伽垫移到房间中央并把它展开。",
+        "GPT_refined_prompt_en": "Move the yoga mat to the center of the room.",
+        "GPT_refined_prompt_cn": "把瑜伽垫移动到房间中心。",
+        "prompt_cn": "把瑜伽垫移动到房间中心。",
+        "save_id": 1008,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1008.png",
+        "status": "skipped"
+    },
+    {
+        "id": "59",
+        "source_image": "Part2/Move/59.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the golf ball onto the green grass.",
+        "GPT_translation_prompt_cn": "把高尔夫球移动到前方的绿色球道草地上。",
+        "GPT_refined_prompt_en": "Move the golf ball onto the green fairway grass in front.",
+        "GPT_refined_prompt_cn": "将高尔夫球移动到前方的绿色球道草地上。",
+        "prompt_cn": "将高尔夫球移动到前方的绿色球道草地上。",
+        "save_id": 1009,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1009.png",
+        "status": "skipped"
+    },
+    {
+        "id": "61",
+        "source_image": "Part2/Move/61.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the sneaker up two steps.",
+        "GPT_translation_prompt_cn": "把那只运动鞋向上移两级台阶。",
+        "GPT_refined_prompt_en": "Move the sneaker up two steps.",
+        "GPT_refined_prompt_cn": "把那只运动鞋向上移两级台阶。",
+        "prompt_cn": "把那只运动鞋向上移两级台阶。",
+        "save_id": 1011,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1011.png",
+        "status": "skipped"
+    },
+    {
+        "id": "62",
+        "source_image": "Part2/Move/62.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the backpack onto the grass beside the bench.",
+        "GPT_translation_prompt_cn": "把背包移动到长椅旁边的草地上。",
+        "GPT_refined_prompt_en": "Move the backpack onto the grass beside the bench.",
+        "GPT_refined_prompt_cn": "将背包移动到长椅旁边的草地上。",
+        "prompt_cn": "将背包移动到长椅旁边的草地上。",
+        "save_id": 1012,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1012.png",
+        "status": "skipped"
+    },
+    {
+        "id": "63",
+        "source_image": "Part2/Move/63.png",
+        "edit_type": "Move",
+        "prompt_en": "Move the monitor to the left corner of the desk.",
+        "GPT_translation_prompt_cn": "将显示器移动到桌子的左侧角落。",
+        "GPT_refined_prompt_en": "Move the monitor to the left corner of the desk.",
+        "GPT_refined_prompt_cn": "将显示器移动到桌面左侧的角落。",
+        "prompt_cn": "将显示器移动到桌面左侧的角落。",
+        "save_id": 1013,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1013.png",
+        "status": "skipped"
+    },
+    {
+        "id": "64",
+        "source_image": "Part2/Move/64.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the mouse to the left of the smartphone.",
+        "GPT_translation_prompt_cn": "将鼠标移动到智能手机的左边。",
+        "GPT_refined_prompt_en": "Move the mouse to the left of the smartphone.",
+        "GPT_refined_prompt_cn": "将鼠标移动到智能手机的左边。",
+        "prompt_cn": "将鼠标移动到智能手机的左边。",
+        "save_id": 1014,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1014.png",
+        "status": "skipped"
+    },
+    {
+        "id": "65",
+        "source_image": "Part2/Move/65.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the sticky note to the bottom bezel of the monitor.",
+        "GPT_translation_prompt_cn": "将便利贴移动到显示器底部的边框上。",
+        "GPT_refined_prompt_en": "Move the sticky note to the bottom bezel of the monitor.",
+        "GPT_refined_prompt_cn": "将便利贴移动到显示器底部边框处。",
+        "prompt_cn": "将便利贴移动到显示器底部边框处。",
+        "save_id": 1015,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1015.png",
+        "status": "skipped"
+    },
+    {
+        "id": "66",
+        "source_image": "Part2/Move/66.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the trash bin to the side of the desk.",
+        "GPT_translation_prompt_cn": "把垃圾桶移到桌子的侧面。",
+        "GPT_refined_prompt_en": "Move the trash bin to the side of the desk.",
+        "GPT_refined_prompt_cn": "将垃圾桶移动到桌子旁边。",
+        "prompt_cn": "把垃圾桶移到桌子的侧面。",
+        "save_id": 1016,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1016.png",
+        "status": "success"
+    },
+    {
+        "id": "68",
+        "source_image": "Part2/Move/68.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the headphones to lay flat on the desk surface.",
+        "GPT_translation_prompt_cn": "将耳机移动到桌面上平放。",
+        "GPT_refined_prompt_en": "Move the headphones so that they lie flat on the surface of the desk.",
+        "GPT_refined_prompt_cn": "将耳机移动到桌面表面上，使其平放。",
+        "prompt_cn": "将耳机移动到桌面表面上，使其平放。",
+        "save_id": 1017,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1017.png",
+        "status": "skipped"
+    },
+    {
+        "id": "70",
+        "source_image": "Part2/Move/70.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the charger to lie on the floor next to the outlet.",
+        "GPT_translation_prompt_cn": "将充电器移动到插座旁边的地板上平放。",
+        "GPT_refined_prompt_en": "Move the charger so that it lies on the floor next to the outlet.",
+        "GPT_refined_prompt_cn": "将充电器移动到插座旁边的地板上，使其平放在那里。",
+        "prompt_cn": "将充电器移动到插座旁边的地板上，使其平放在那里。",
+        "save_id": 1018,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1018.png",
+        "status": "skipped"
+    },
+    {
+        "id": "71",
+        "source_image": "Part2/Move/71.png",
+        "edit_type": "Move",
+        "prompt_en": "Move the printer onto the adjacent desk.",
+        "GPT_translation_prompt_cn": "把打印机移动到旁边的桌子上。",
+        "GPT_refined_prompt_en": "Move the printer onto the desk next to it.",
+        "GPT_refined_prompt_cn": "将打印机移动到旁边的桌子上。",
+        "prompt_cn": "将打印机移动到旁边的桌子上。",
+        "save_id": 1019,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1019.png",
+        "status": "skipped"
+    },
+    {
+        "id": "73",
+        "source_image": "Part2/Move/73.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the hat from her head to her hand.",
+        "GPT_translation_prompt_cn": "把帽子从她的头上移到她的手上。",
+        "GPT_refined_prompt_en": "Move the hat from her head to her hand.",
+        "GPT_refined_prompt_cn": "将帽子从她的头上移到她的手中。",
+        "prompt_cn": "将帽子从她的头上移到她的手中。",
+        "save_id": 1020,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1020.png",
+        "status": "skipped"
+    },
+    {
+        "id": "74",
+        "source_image": "Part2/Move/74.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the sunglasses down to cover her eyes.",
+        "GPT_translation_prompt_cn": "把太阳镜往下移动，让它遮住她的眼睛。",
+        "GPT_refined_prompt_en": "Move the sunglasses down so that they cover her eyes.",
+        "GPT_refined_prompt_cn": "将太阳镜向下移动，使其遮住她的眼睛。",
+        "prompt_cn": "将太阳镜向下移动，使其遮住她的眼睛。",
+        "save_id": 1021,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1021.png",
+        "status": "skipped"
+    },
+    {
+        "id": "75",
+        "source_image": "Part2/Move/75.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the brooch down to the pocket area.",
+        "GPT_translation_prompt_cn": "把胸针向下移动到口袋区域。",
+        "GPT_refined_prompt_en": "Move the brooch down to the pocket area of the jacket.",
+        "GPT_refined_prompt_cn": "将胸针向下移动到夹克的口袋区域。",
+        "prompt_cn": "将胸针向下移动到夹克的口袋区域。",
+        "save_id": 1022,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1022.png",
+        "status": "skipped"
+    },
+    {
+        "id": "78",
+        "source_image": "Part2/Move/78.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the watch to the wrist of the other hand.",
+        "GPT_translation_prompt_cn": "把手表移到右手腕上。",
+        "GPT_refined_prompt_en": "Move the wristwatch to the right-hand wrist.",
+        "GPT_refined_prompt_cn": "将腕表移动到右手手腕上。",
+        "prompt_cn": "把手表移到另一只手的手腕上。",
+        "save_id": 1023,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1023.png",
+        "status": "skipped"
+    },
+    {
+        "id": "80",
+        "source_image": "Part2/Move/80.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the logo to the left chest area.",
+        "GPT_translation_prompt_cn": "将Logo移动到人的右胸。",
+        "GPT_refined_prompt_en": "Move the logo to the person’s right chest.",
+        "GPT_refined_prompt_cn": "将Logo移动到人的右胸。",
+        "prompt_cn": "将Logo移动到左胸。",
+        "save_id": 1024,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1024.png",
+        "status": "skipped"
+    },
+    {
+        "id": "81",
+        "source_image": "Part2/Move/81.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the ring to the ring finger.",
+        "GPT_translation_prompt_cn": "把戒指移到无名指上。",
+        "GPT_refined_prompt_en": "Move the ring to the ring finger.",
+        "GPT_refined_prompt_cn": "将戒指移到无名指上。",
+        "prompt_cn": "将戒指移到无名指上。",
+        "save_id": 1025,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1025.png",
+        "status": "skipped"
+    },
+    {
+        "id": "85",
+        "source_image": "Part2/Move/85.png",
+        "edit_type": "Move",
+        "prompt_en": "Move the potion bottle onto the table next to the open book.",
+        "GPT_translation_prompt_cn": "将药水瓶移动到桌子上，放在打开的书旁边。",
+        "GPT_refined_prompt_en": "Move the potion bottle onto the table next to the open book.",
+        "GPT_refined_prompt_cn": "将药水瓶移到桌子上，放在打开的书旁边。",
+        "prompt_cn": "将药水瓶移到桌子上，放在打开的书旁边。",
+        "save_id": 1026,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1026.png",
+        "status": "skipped"
+    },
+    {
+        "id": "92",
+        "source_image": "Part2/Move/92.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the fairy to fly in the air.",
+        "GPT_translation_prompt_cn": "把小仙子移动到空中飞行。",
+        "GPT_refined_prompt_en": "Move the fairy so that she is flying in the air.",
+        "GPT_refined_prompt_cn": "将小仙子移动到空中，使她在空中飞行。",
+        "prompt_cn": "将小仙子移动到空中，使她在空中飞行。",
+        "save_id": 1027,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1027.png",
+        "status": "skipped"
+    },
+    {
+        "id": "93",
+        "source_image": "Part2/Move/93.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the red cube to the bottom left corner.",
+        "GPT_translation_prompt_cn": "将红色立方体移动到左下角。",
+        "GPT_refined_prompt_en": "Move the red cube to the bottom-left corner.",
+        "GPT_refined_prompt_cn": "将红色立方体移动到左下角。",
+        "prompt_cn": "将红色立方体移动到左下角。",
+        "save_id": 1028,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1028.png",
+        "status": "skipped"
+    },
+    {
+        "id": "94",
+        "source_image": "Part2/Move/94.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the blue sphere to the right of the yellow cylinder.",
+        "GPT_translation_prompt_cn": "将蓝色球体移动到黄色圆柱的右边。",
+        "GPT_refined_prompt_en": "Move the blue sphere to the right of the yellow cylinder.",
+        "GPT_refined_prompt_cn": "将蓝色球体移动到黄色圆柱的右边。",
+        "prompt_cn": "将蓝色球体移动到黄色圆柱的右边。",
+        "save_id": 1029,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1029.png",
+        "status": "skipped"
+    },
+    {
+        "id": "95",
+        "source_image": "Part2/Move/95.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the black line to the bottom of the canvas.",
+        "GPT_translation_prompt_cn": "将黑色线条移动到画布的底部。",
+        "GPT_refined_prompt_en": "Move the black line to the bottom of the canvas.",
+        "GPT_refined_prompt_cn": "将黑色线条移动到画布底部。",
+        "prompt_cn": "将黑色线条移动到画布底部。",
+        "save_id": 1030,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1030.png",
+        "status": "skipped"
+    },
+    {
+        "id": "96",
+        "source_image": "Part2/Move/96.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the golden pyramid out of the glass box and place it on the ground outside.",
+        "GPT_translation_prompt_cn": "把金色金字塔从玻璃盒子里移到外面的地上。",
+        "GPT_refined_prompt_en": "Move the golden pyramid out of the glass box and place it on the ground outside.",
+        "GPT_refined_prompt_cn": "把金色金字塔从玻璃盒子里移到外面的地上。",
+        "prompt_cn": "把金色金字塔从玻璃盒子里移到外面的地上。",
+        "save_id": 1031,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1031.png",
+        "status": "skipped"
+    },
+    {
+        "id": "100",
+        "source_image": "Part2/Move/100.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the pattern of dots to the right half.",
+        "GPT_translation_prompt_cn": "将这些点状图案移动到画面的右半部分。",
+        "GPT_refined_prompt_en": "Move the pattern of dots to the right half of the image.",
+        "GPT_refined_prompt_cn": "将点状图案移动到图像的右半部分。",
+        "prompt_cn": "将点状图案移动到图像的右半部分。",
+        "save_id": 1032,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1032.png",
+        "status": "skipped"
+    },
+    {
+        "id": "107",
+        "source_image": "Part2/Move/107.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the garden bench to be under the large tree on the lawn.",
+        "GPT_translation_prompt_cn": "将花园长椅移动到草坪上那棵大树的下面。",
+        "GPT_refined_prompt_en": "Move the garden bench so that it is positioned under the large tree on the lawn.",
+        "GPT_refined_prompt_cn": "将花园长椅移动，使其摆放在草坪上那棵大树的下面。",
+        "prompt_cn": "将花园长椅移动，使其摆放在草坪上那棵大树的下面。",
+        "save_id": 1033,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1033.png",
+        "status": "skipped"
+    },
+    {
+        "id": "108",
+        "source_image": "Part2/Move/108.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the street number '10' to the center of the door.",
+        "GPT_translation_prompt_cn": "把门牌号码“10”移动到门的中央位置。",
+        "GPT_refined_prompt_en": "Move the street number \"10\" to the center of the door.",
+        "GPT_refined_prompt_cn": "将门牌号码“10”移动到门的正中央。",
+        "prompt_cn": "将门牌号码“10”移动到门的正中央。",
+        "save_id": 1034,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1034.png",
+        "status": "skipped"
+    },
+    {
+        "id": "109",
+        "source_image": "Part2/Move/109.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the flower pot to sit on the porch steps.",
+        "GPT_translation_prompt_cn": "将花盆移到门廊的台阶上。",
+        "GPT_refined_prompt_en": "Move the flower pot so that it is sitting on the porch steps.",
+        "GPT_refined_prompt_cn": "将花盆移动到门廊台阶上摆放。",
+        "prompt_cn": "将花盆移动到门廊台阶上摆放。",
+        "save_id": 1035,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1035.png",
+        "status": "skipped"
+    },
+    {
+        "id": "110",
+        "source_image": "Part2/Move/110.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the air conditioner unit onto the ground.",
+        "GPT_translation_prompt_cn": "将空调机移动在地上。",
+        "GPT_refined_prompt_en": "Move the air conditioner unit onto the ground.",
+        "GPT_refined_prompt_cn": "将空调机移动在地上。",
+        "prompt_cn": "将空调机移动在地上。",
+        "save_id": 1036,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1036.png",
+        "status": "skipped"
+    },
+    {
+        "id": "111",
+        "source_image": "Part2/Move/111.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Place the teapot lid inside the teacup.",
+        "prompt_cn": "将茶壶的壶盖移动到茶碗里面。",
+        "save_id": 3391,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/3391.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Move/Move_rank2.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Move/Move_rank2.json
new file mode 100644
index 0000000000000000000000000000000000000000..0af29e6a353a03c1ffe2a75fb36efbacca23136d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Move/Move_rank2.json
@@ -0,0 +1,59 @@
+[
+    {
+        "id": "19",
+        "source_image": "Part2/Move/19.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the book from the chair to the nearby bookshelf.",
+        "GPT_translation_prompt_cn": "把这叠书移到旁边的书架上。",
+        "GPT_refined_prompt_en": "Move the stack of books onto the nearby bookshelf.",
+        "GPT_refined_prompt_cn": "将那叠书移动到附近的书架上。",
+        "prompt_cn": "把椅子上的书移动到附近的书架上。",
+        "save_id": 982,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/982.png",
+        "_merge_order": 13,
+        "status": "success"
+    },
+    {
+        "id": "31",
+        "source_image": "Part2/Move/31.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the flower vase to the edge of the table.",
+        "GPT_translation_prompt_cn": "把花瓶移动到桌子的边缘。",
+        "GPT_refined_prompt_en": "Move the flower vase to the edge of the table.",
+        "GPT_refined_prompt_cn": "将花瓶移到桌子边缘。",
+        "prompt_cn": "将花瓶移到桌子边缘。",
+        "save_id": 994,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/994.png",
+        "_merge_order": 25,
+        "status": "success"
+    },
+    {
+        "id": "37",
+        "source_image": "Part2/Move/37.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the pigeon onto the bench and have it sit on it.",
+        "GPT_translation_prompt_cn": "把那只鸽子移动到长椅的靠背上坐着。",
+        "GPT_refined_prompt_en": "Move the pigeon so that it is sitting on the backrest of the bench.",
+        "GPT_refined_prompt_cn": "将那只鸽子移动到长椅的靠背上，让它坐在上面。",
+        "prompt_cn": "将那只鸽子移动到长椅上，让它坐在上面。",
+        "save_id": 997,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/997.png",
+        "_merge_order": 28,
+        "status": "success"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Move/Move_rank3.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Move/Move_rank3.json
new file mode 100644
index 0000000000000000000000000000000000000000..87b33b9dc8c72688b45bce2e63e7aa96046a8770
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Move/Move_rank3.json
@@ -0,0 +1,21 @@
+[
+    {
+        "id": "66",
+        "source_image": "Part2/Move/66.jpg",
+        "edit_type": "Move",
+        "prompt_en": "Move the trash bin to the side of the desk.",
+        "GPT_translation_prompt_cn": "把垃圾桶移到桌子的侧面。",
+        "GPT_refined_prompt_en": "Move the trash bin to the side of the desk.",
+        "GPT_refined_prompt_cn": "将垃圾桶移动到桌子旁边。",
+        "prompt_cn": "把垃圾桶移到桌子的侧面。",
+        "save_id": 1016,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Move/1016.png",
+        "_merge_order": 43,
+        "status": "success"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/Object_Interaction.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/Object_Interaction.json
new file mode 100644
index 0000000000000000000000000000000000000000..c6643088a98a14800061fedc4badcf9a7dd92466
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/Object_Interaction.json
@@ -0,0 +1,1244 @@
+[
+    {
+        "id": "1",
+        "source_image": "Part2/Obj_interaction/1.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the boy perform a bicep curl with the dumbbells next to him.",
+        "GPT_translation_prompt_cn": "让男孩用旁边的哑铃做一个二头肌弯举动作。",
+        "GPT_refined_prompt_en": "Make the boy perform a bicep curl with the dumbbells next to him.",
+        "GPT_refined_prompt_cn": "让男孩用他旁边的哑铃做一个二头肌弯举动作。",
+        "prompt_cn": "让男孩用他旁边的哑铃做一个二头肌弯举动作。",
+        "save_id": 1106,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1106.png",
+        "status": "skipped"
+    },
+    {
+        "id": "2",
+        "source_image": "Part2/Obj_interaction/2.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the girl pick up the two dumbbells at her feet and perform a chest press.",
+        "GPT_translation_prompt_cn": "让女孩捡起脚边的两个哑铃并做卧推动作。",
+        "GPT_refined_prompt_en": "Have the girl pick up the two dumbbells at her feet and perform a chest press.",
+        "GPT_refined_prompt_cn": "让女孩捡起脚边的两个哑铃并进行卧推动作。",
+        "prompt_cn": "让女孩捡起脚边的两个哑铃并进行卧推动作。",
+        "save_id": 1107,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1107.png",
+        "status": "skipped"
+    },
+    {
+        "id": "3",
+        "source_image": "Part2/Obj_interaction/3.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the girl practice lat pulldowns.",
+        "GPT_translation_prompt_cn": "让这个女孩在做高位下拉训练。",
+        "GPT_refined_prompt_en": "Make the girl perform a lat pulldown exercise.",
+        "GPT_refined_prompt_cn": "让这个女孩做高位下拉动作。",
+        "prompt_cn": "让这个女孩做高位下拉动作。",
+        "save_id": 1108,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1108.png",
+        "status": "skipped"
+    },
+    {
+        "id": "4",
+        "source_image": "Part2/Obj_interaction/4.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have this girl practice seated hip abduction.",
+        "GPT_translation_prompt_cn": "让这个女孩练习坐姿髋外展。",
+        "GPT_refined_prompt_en": "Have this girl perform a seated hip abduction exercise.",
+        "GPT_refined_prompt_cn": "让这个女孩做坐姿髋外展训练。",
+        "prompt_cn": "让这个女孩做坐姿髋外展训练。",
+        "save_id": 1109,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1109.png",
+        "status": "skipped"
+    },
+    {
+        "id": "5",
+        "source_image": "Part2/Obj_interaction/5.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the man and woman hug each other tightly.",
+        "GPT_translation_prompt_cn": "让这名男子和女子紧紧拥抱在一起。",
+        "GPT_refined_prompt_en": "Make the man and woman hug each other tightly.",
+        "GPT_refined_prompt_cn": "让这名男子和女子紧紧拥抱在一起。",
+        "prompt_cn": "让这名男子和女子紧紧拥抱在一起。",
+        "save_id": 1110,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1110.png",
+        "status": "skipped"
+    },
+    {
+        "id": "6",
+        "source_image": "Part2/Obj_interaction/6.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the bride and groom kiss.",
+        "GPT_translation_prompt_cn": "让新娘和新郎亲吻。",
+        "GPT_refined_prompt_en": "Make the bride and groom kiss.",
+        "GPT_refined_prompt_cn": "让新娘和新郎亲吻。",
+        "prompt_cn": "让新娘和新郎亲吻。",
+        "save_id": 1111,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1111.png",
+        "status": "skipped"
+    },
+    {
+        "id": "7",
+        "source_image": "Part2/Obj_interaction/7.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the boy and girl hold hands.",
+        "GPT_translation_prompt_cn": "让男孩和女孩牵手。",
+        "GPT_refined_prompt_en": "Make the boy and the girl hold hands.",
+        "GPT_refined_prompt_cn": "让这个男孩和这个女孩牵着手。",
+        "prompt_cn": "让这个男孩和这个女孩牵着手。",
+        "save_id": 1112,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1112.png",
+        "status": "skipped"
+    },
+    {
+        "id": "9",
+        "source_image": "Part2/Obj_interaction/9.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the boy hold the nearby bottle of Coke in his right hand and make him appear to be drinking it.",
+        "GPT_translation_prompt_cn": "让这个男孩用右手拿着这瓶可乐并正在喝。",
+        "GPT_refined_prompt_en": "Have the boy hold the bottle of Coke in his right hand and drink from it.",
+        "GPT_refined_prompt_cn": "让这个男孩用右手拿着这瓶可乐并正在喝。",
+        "prompt_cn": "让这个男孩右手拿着旁边的可乐，并做出正在喝的动作。",
+        "save_id": 1113,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1113.png",
+        "status": "success"
+    },
+    {
+        "id": "10",
+        "source_image": "Part2/Obj_interaction/10.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the two boys bump fists.",
+        "GPT_translation_prompt_cn": "让两个男生正在进行碰拳的动作。",
+        "GPT_refined_prompt_en": "Make the two boys bump fists.",
+        "GPT_refined_prompt_cn": "让两个男生正在进行碰拳的动作。",
+        "prompt_cn": "让两个男生正在进行碰拳的动作。",
+        "save_id": 1114,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1114.png",
+        "status": "skipped"
+    },
+    {
+        "id": "11",
+        "source_image": "Part2/Obj_interaction/11.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the two players high five.",
+        "GPT_translation_prompt_cn": "让这两名球员互相击掌。",
+        "GPT_refined_prompt_en": "Make the two players give each other a high five.",
+        "GPT_refined_prompt_cn": "让这两名球员互相击掌。",
+        "prompt_cn": "让这两名球员互相击掌。",
+        "save_id": 1115,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1115.png",
+        "status": "skipped"
+    },
+    {
+        "id": "12",
+        "source_image": "Part2/Obj_interaction/12.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make them shake hands.",
+        "GPT_translation_prompt_cn": "让他们握手。",
+        "GPT_refined_prompt_en": "Make them shake hands.",
+        "GPT_refined_prompt_cn": "让他们握手。",
+        "prompt_cn": "让他们握手。",
+        "save_id": 1116,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1116.png",
+        "status": "skipped"
+    },
+    {
+        "id": "13",
+        "source_image": "Part2/Obj_interaction/13.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the older brother lift up his younger sister.",
+        "GPT_translation_prompt_cn": "让哥哥把妹妹抱起来。",
+        "GPT_refined_prompt_en": "MHave the older brother lift up his younger sister.",
+        "GPT_refined_prompt_cn": "让哥哥把妹妹抱起来。",
+        "prompt_cn": "让哥哥把妹妹抱起来。",
+        "save_id": 1117,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1117.png",
+        "status": "skipped"
+    },
+    {
+        "id": "14",
+        "source_image": "Part2/Obj_interaction/14.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the two girls compare the sizes of their left hands.",
+        "GPT_translation_prompt_cn": "让这两个女孩在比左手手掌的大小。",
+        "GPT_refined_prompt_en": "Have the two girls compare the sizes of their left hands.",
+        "GPT_refined_prompt_cn": "让这两个女孩在比左手手掌的大小。",
+        "prompt_cn": "让这两个女孩在比左手手掌的大小。",
+        "save_id": 1118,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1118.png",
+        "status": "skipped"
+    },
+    {
+        "id": "15",
+        "source_image": "Part2/Obj_interaction/15.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the woman perform a barbell squat.",
+        "GPT_translation_prompt_cn": "让这个女人做杠铃深蹲。",
+        "GPT_refined_prompt_en": "Make the woman perform a barbell squat.",
+        "GPT_refined_prompt_cn": "让这名女子进行杠铃深蹲动作。",
+        "prompt_cn": "让这名女子进行杠铃深蹲动作。",
+        "save_id": 1119,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1119.png",
+        "status": "skipped"
+    },
+    {
+        "id": "16",
+        "source_image": "Part2/Obj_interaction/16.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the woman wave the battle ropes vigorously.",
+        "GPT_translation_prompt_cn": "让这名女子用力挥动战绳。",
+        "GPT_refined_prompt_en": "Make the woman wave the battle ropes vigorously.",
+        "GPT_refined_prompt_cn": "让这名女子剧烈地挥动战绳。",
+        "prompt_cn": "让这名女子剧烈地挥动战绳。",
+        "save_id": 1120,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1120.png",
+        "status": "skipped"
+    },
+    {
+        "id": "17",
+        "source_image": "Part2/Obj_interaction/17.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the man perform a bench press, lifting the barbell.",
+        "GPT_translation_prompt_cn": "让这个男人正在做卧推，举起杠铃。",
+        "GPT_refined_prompt_en": "Have the man perform a bench press, lifting the barbell.",
+        "GPT_refined_prompt_cn": "让这个男人正在做卧推，举起杠铃。",
+        "prompt_cn": "让这个男人正在做卧推，举起杠铃。",
+        "save_id": 1121,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1121.png",
+        "status": "skipped"
+    },
+    {
+        "id": "18",
+        "source_image": "Part2/Obj_interaction/18.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the athlete perform a kettlebell swing.",
+        "GPT_translation_prompt_cn": "让这位运动员做一个壶铃摆动动作。",
+        "GPT_refined_prompt_en": "Make the athlete perform a kettlebell swing.",
+        "GPT_refined_prompt_cn": "让这位运动员进行壶铃摆动动作。",
+        "prompt_cn": "让这位运动员进行壶铃摆动动作。",
+        "save_id": 1122,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1122.png",
+        "status": "skipped"
+    },
+    {
+        "id": "19",
+        "source_image": "Part2/Obj_interaction/19.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the boy kick the soccer ball.",
+        "GPT_translation_prompt_cn": "让这个男孩踢足球。",
+        "GPT_refined_prompt_en": "Make the boy appear to be kicking the soccer ball.",
+        "GPT_refined_prompt_cn": "让这个男孩看起来正在踢足球。",
+        "prompt_cn": "让这个男孩看起来正在踢足球。",
+        "save_id": 1123,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1123.png",
+        "status": "skipped"
+    },
+    {
+        "id": "20",
+        "source_image": "Part2/Obj_interaction/20.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the girl in the image pick up the tennis racket.",
+        "GPT_translation_prompt_cn": "让图中的女生捡起来网球拍。",
+        "GPT_refined_prompt_en": "Have the girl in the image pick up the tennis racket.",
+        "GPT_refined_prompt_cn": "让图中的女生捡起来网球拍。",
+        "prompt_cn": "让图中的女生捡起来网球拍。",
+        "save_id": 1124,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1124.png",
+        "status": "skipped"
+    },
+    {
+        "id": "21",
+        "source_image": "Part2/Obj_interaction/21.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the player holding the volleyball appear to be serving the ball.",
+        "GPT_translation_prompt_cn": "让这名球员发排球。",
+        "GPT_refined_prompt_en": "Make the player appear to be serving the volleyball.",
+        "GPT_refined_prompt_cn": "让这名球员看起来正在发排球。",
+        "prompt_cn": "让拿着排球的这名球员看起来正在发排球。",
+        "save_id": 1125,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1125.png",
+        "status": "success"
+    },
+    {
+        "id": "24",
+        "source_image": "Part2/Obj_interaction/24.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the painter paint the wall with the roller.",
+        "GPT_translation_prompt_cn": "让油漆工用滚筒给墙上漆。",
+        "GPT_refined_prompt_en": "Make the painter paint the wall using the roller.",
+        "GPT_refined_prompt_cn": "让油漆工使用滚筒给墙面刷漆。",
+        "prompt_cn": "让油漆工使用滚筒给墙面刷漆。",
+        "save_id": 1127,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1127.png",
+        "status": "skipped"
+    },
+    {
+        "id": "25",
+        "source_image": "Part2/Obj_interaction/25.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the chef chop the carrot.",
+        "GPT_translation_prompt_cn": "让这位厨师正在切胡萝卜。",
+        "GPT_refined_prompt_en": "Make the chef appear to be chopping the carrot.",
+        "GPT_refined_prompt_cn": "让这位厨师看起来正在切胡萝卜。",
+        "prompt_cn": "让这位厨师看起来正在切胡萝卜。",
+        "save_id": 1128,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1128.png",
+        "status": "skipped"
+    },
+    {
+        "id": "27",
+        "source_image": "Part2/Obj_interaction/27.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the boy brush his teeth.",
+        "GPT_translation_prompt_cn": "让这个男孩在刷牙。",
+        "GPT_refined_prompt_en": "Make the boy brush his teeth.",
+        "GPT_refined_prompt_cn": "让这个男孩刷牙。",
+        "prompt_cn": "让这个男孩刷牙。",
+        "save_id": 1130,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1130.png",
+        "status": "skipped"
+    },
+    {
+        "id": "29",
+        "source_image": "Part2/Obj_interaction/29.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the runner tie his shoelaces.",
+        "GPT_translation_prompt_cn": "让这名跑者系好他的鞋带。",
+        "GPT_refined_prompt_en": "Make the runner tie his shoelaces.",
+        "GPT_refined_prompt_cn": "让这名跑者系好他的鞋带。",
+        "prompt_cn": "让这名跑者系好他的鞋带。",
+        "save_id": 1131,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1131.png",
+        "status": "skipped"
+    },
+    {
+        "id": "30",
+        "source_image": "Part2/Obj_interaction/30.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the runner drink from the water bottle.",
+        "GPT_translation_prompt_cn": "让这位跑步者看起来正在从水瓶中喝水。",
+        "GPT_refined_prompt_en": "Make the runner appear to be drinking from the water bottle.",
+        "GPT_refined_prompt_cn": "让这位跑步者看起来正在从水瓶中喝水。",
+        "prompt_cn": "让这位跑步者看起来正在从水瓶中喝水。",
+        "save_id": 1132,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1132.png",
+        "status": "skipped"
+    },
+    {
+        "id": "31",
+        "source_image": "Part2/Obj_interaction/31.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the teacher take a bite of the apple.",
+        "GPT_translation_prompt_cn": "让这位老师咬一口苹果。",
+        "GPT_refined_prompt_en": "Make the teacher take a bite of the apple.",
+        "GPT_refined_prompt_cn": "让这位老师咬一口苹果。",
+        "prompt_cn": "让这位老师咬一口苹果。",
+        "save_id": 1133,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1133.png",
+        "status": "success"
+    },
+    {
+        "id": "32",
+        "source_image": "Part2/Obj_interaction/32.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the man pick up and eat the burger.",
+        "GPT_translation_prompt_cn": "让这个男人拿起并吃汉堡。",
+        "GPT_refined_prompt_en": "Make the man pick up the burger and eat it.",
+        "GPT_refined_prompt_cn": "让这个男人拿起汉堡并吃下去。",
+        "prompt_cn": "让这个男人拿起汉堡并吃下去。",
+        "save_id": 1134,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1134.png",
+        "status": "success"
+    },
+    {
+        "id": "33",
+        "source_image": "Part2/Obj_interaction/33.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the girl blow out the candles.",
+        "GPT_translation_prompt_cn": "让这个女孩吹灭蜡烛。",
+        "GPT_refined_prompt_en": "Make the girl appear to be blowing out the candles.",
+        "GPT_refined_prompt_cn": "让这个女孩看起来正在吹灭蜡烛。",
+        "prompt_cn": "让这个女孩看起来正在吹灭蜡烛。",
+        "save_id": 1135,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1135.png",
+        "status": "skipped"
+    },
+    {
+        "id": "35",
+        "source_image": "Part2/Obj_interaction/35.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the boy eat the noodles held by the chopsticks.",
+        "GPT_translation_prompt_cn": "让男孩吃筷子上的面条。",
+        "GPT_refined_prompt_en": "Make the boy eat the noodles held by the chopsticks.",
+        "GPT_refined_prompt_cn": "让男孩吃筷子上的面条。",
+        "prompt_cn": "让男孩吃筷子上的面条。",
+        "save_id": 1136,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1136.png",
+        "status": "skipped"
+    },
+    {
+        "id": "36",
+        "source_image": "Part2/Obj_interaction/36.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the child lick the ice cream.",
+        "GPT_translation_prompt_cn": "让这个孩子在舔冰淇淋。",
+        "GPT_refined_prompt_en": "Make the child appear to be licking the ice cream.",
+        "GPT_refined_prompt_cn": "让这个孩子看起来正在舔冰淇淋。",
+        "prompt_cn": "让这个孩子看起来正在舔冰淇淋。",
+        "save_id": 1137,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1137.png",
+        "status": "skipped"
+    },
+    {
+        "id": "37",
+        "source_image": "Part2/Obj_interaction/37.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the man and woman holding wine glasses clink their glasses together.",
+        "GPT_translation_prompt_cn": "让他们把酒杯碰在一起。",
+        "GPT_refined_prompt_en": "Make them clink their glasses together.",
+        "GPT_refined_prompt_cn": "让他们把酒杯碰在一起。",
+        "prompt_cn": "让拿着酒杯的男生和女生进行碰杯。",
+        "save_id": 1138,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1138.png",
+        "status": "success"
+    },
+    {
+        "id": "39",
+        "source_image": "Part2/Obj_interaction/39.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the tourist ride the camel.",
+        "GPT_translation_prompt_cn": "让这位游客骑在骆驼上。",
+        "GPT_refined_prompt_en": "Make the tourist ride the camel.",
+        "GPT_refined_prompt_cn": "让游客骑在骆驼上。",
+        "prompt_cn": "让游客骑在骆驼上。",
+        "save_id": 1140,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1140.png",
+        "status": "skipped"
+    },
+    {
+        "id": "40",
+        "source_image": "Part2/Obj_interaction/40.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the dog jump to catch the frisbee thrown by the man.",
+        "GPT_translation_prompt_cn": "让狗跳起来去接住男人扔出的飞盘。",
+        "GPT_refined_prompt_en": "Make the dog jump to catch the frisbee thrown by the man.",
+        "GPT_refined_prompt_cn": "让狗跳起来去接住男人扔出的飞盘。",
+        "prompt_cn": "让狗跳起来去接住男人扔出的飞盘。",
+        "save_id": 1141,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1141.png",
+        "status": "skipped"
+    },
+    {
+        "id": "41",
+        "source_image": "Part2/Obj_interaction/41.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make one man push the other.",
+        "GPT_translation_prompt_cn": "让一个男人推另一个男人。",
+        "GPT_refined_prompt_en": "Make one man push the other.",
+        "GPT_refined_prompt_cn": "让一个男人推另一个男人。",
+        "prompt_cn": "让一个男人推另一个男人。",
+        "save_id": 1142,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1142.png",
+        "status": "skipped"
+    },
+    {
+        "id": "42",
+        "source_image": "Part2/Obj_interaction/42.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make them arm wrestle.",
+        "GPT_translation_prompt_cn": "让他们进行掰腕子比赛。",
+        "GPT_refined_prompt_en": "Make them arm wrestle.",
+        "GPT_refined_prompt_cn": "让他们掰腕子。",
+        "prompt_cn": "让他们掰腕子。",
+        "save_id": 1143,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1143.png",
+        "status": "skipped"
+    },
+    {
+        "id": "44",
+        "source_image": "Part2/Obj_interaction/44.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the student kick the sandbag.",
+        "GPT_translation_prompt_cn": "让这名学员踢沙袋。",
+        "GPT_refined_prompt_en": "Make the student kick the sandbag.",
+        "GPT_refined_prompt_cn": "让这名学员踢沙袋。",
+        "prompt_cn": "让这名学员踢沙袋。",
+        "save_id": 1144,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1144.png",
+        "status": "skipped"
+    },
+    {
+        "id": "45",
+        "source_image": "Part2/Obj_interaction/45.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the student pick up the drink beside them.",
+        "GPT_translation_prompt_cn": "让这个学生拿起旁边的饮料。",
+        "GPT_refined_prompt_en": "Make the student pick up the drink beside them.",
+        "GPT_refined_prompt_cn": "让这个学生拿起旁边的饮料。",
+        "prompt_cn": "让这个学生拿起旁边的饮料。",
+        "save_id": 1145,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1145.png",
+        "status": "skipped"
+    },
+    {
+        "id": "46",
+        "source_image": "Part2/Obj_interaction/46.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the writer write in the notebook.",
+        "GPT_translation_prompt_cn": "让这位写作者在笔记本上写字。",
+        "GPT_refined_prompt_en": "Make the writer write in the notebook.",
+        "GPT_refined_prompt_cn": "让写作者在笔记本上写字。",
+        "prompt_cn": "让写作者在笔记本上写字。",
+        "save_id": 1146,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1146.png",
+        "status": "skipped"
+    },
+    {
+        "id": "49",
+        "source_image": "Part2/Obj_interaction/49.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the teacher write on the blackboard.",
+        "GPT_translation_prompt_cn": "让这位老师在黑板上写字。",
+        "GPT_refined_prompt_en": "Make the teacher write on the blackboard.",
+        "GPT_refined_prompt_cn": "让老师在黑板上写字。",
+        "prompt_cn": "让老师在黑板上写字。",
+        "save_id": 1147,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1147.png",
+        "status": "skipped"
+    },
+    {
+        "id": "50",
+        "source_image": "Part2/Obj_interaction/50.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the programmer type on the laptop keyboard.",
+        "GPT_translation_prompt_cn": "让这位程序员在笔记本电脑键盘上打字。",
+        "GPT_refined_prompt_en": "Make the programmer appear to be typing on the laptop keyboard.",
+        "GPT_refined_prompt_cn": "让这位程序员看起来正在笔记本电脑键盘上打字。",
+        "prompt_cn": "让这位程序员看起来正在笔记本电脑键盘上打字。",
+        "save_id": 1148,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1148.png",
+        "status": "skipped"
+    },
+    {
+        "id": "51",
+        "source_image": "Part2/Obj_interaction/51.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the tourist look down at the map in their hands.",
+        "GPT_translation_prompt_cn": "让这名游客用手指着打开地图上的某个位置。",
+        "GPT_refined_prompt_en": "Make the tourist point to a specific location on the open map.",
+        "GPT_refined_prompt_cn": "让这名游客指向打开地图上的一个具体位置。",
+        "prompt_cn": "让这名游客低头看着手中的地图。",
+        "save_id": 1149,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1149.png",
+        "status": "success"
+    },
+    {
+        "id": "53",
+        "source_image": "Part2/Obj_interaction/53.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the child turn the page of the book.",
+        "GPT_translation_prompt_cn": "让这个孩子翻动书页。",
+        "GPT_refined_prompt_en": "Make the child turn a page of the book.",
+        "GPT_refined_prompt_cn": "让孩子翻动书中的一页。",
+        "prompt_cn": "让孩子翻动书中的一页。",
+        "save_id": 1150,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1150.png",
+        "status": "skipped"
+    },
+    {
+        "id": "54",
+        "source_image": "Part2/Obj_interaction/54.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the man put on the glasses.",
+        "GPT_translation_prompt_cn": "让这个男人戴上眼镜。",
+        "GPT_refined_prompt_en": "Make the man put on the glasses.",
+        "GPT_refined_prompt_cn": "让这个男人戴上眼镜。",
+        "prompt_cn": "让这个男人戴上眼镜。",
+        "save_id": 1151,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1151.png",
+        "status": "skipped"
+    },
+    {
+        "id": "55",
+        "source_image": "Part2/Obj_interaction/55.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the woman wear the hat.",
+        "GPT_translation_prompt_cn": "让这位女性把帽子戴在头上。",
+        "GPT_refined_prompt_en": "Make the woman wear the hat on her head.",
+        "GPT_refined_prompt_cn": "让这位女性把帽子戴在头上。",
+        "prompt_cn": "让这位女性把帽子戴在头上。",
+        "save_id": 1152,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1152.png",
+        "status": "skipped"
+    },
+    {
+        "id": "58",
+        "source_image": "Part2/Obj_interaction/58.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the student pick up the backpack.",
+        "GPT_translation_prompt_cn": "让这个学生拿起书包。",
+        "GPT_refined_prompt_en": "Make the student pick up the backpack.",
+        "GPT_refined_prompt_cn": "让这个学生拿起书包。",
+        "prompt_cn": "让这个学生拿起书包。",
+        "save_id": 1154,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1154.png",
+        "status": "skipped"
+    },
+    {
+        "id": "64",
+        "source_image": "Part2/Obj_interaction/64.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the woman appear to be pushing the wheelchair.",
+        "GPT_translation_prompt_cn": "让这个女人正在推轮椅。",
+        "GPT_refined_prompt_en": "Make the woman appear to be pushing the wheelchair.",
+        "GPT_refined_prompt_cn": "让这个女人正在推轮椅。",
+        "prompt_cn": "让这个女人正在推轮椅。",
+        "save_id": 1155,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1155.png",
+        "status": "skipped"
+    },
+    {
+        "id": "69",
+        "source_image": "Part2/Obj_interaction/69.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the woman lift the suitcase by its handle.",
+        "GPT_translation_prompt_cn": "让这位女子提起手柄，把手提箱举起来。",
+        "GPT_refined_prompt_en": "Make the woman lift the suitcase by its handle.",
+        "GPT_refined_prompt_cn": "让这位女子抓住手提箱的手柄把它提起来。",
+        "prompt_cn": "让这位女子抓住手提箱的手柄把它提起来。",
+        "save_id": 1156,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1156.png",
+        "status": "skipped"
+    },
+    {
+        "id": "70",
+        "source_image": "Part2/Obj_interaction/70.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the dog pick up the stick at its feet and hold it in its mouth.",
+        "GPT_translation_prompt_cn": "让这只狗把木棍叼在嘴里。",
+        "GPT_refined_prompt_en": "Make the dog hold the stick in its mouth.",
+        "GPT_refined_prompt_cn": "让这只狗把木棍叼在嘴里。",
+        "prompt_cn": "让这只狗把脚下的木棍叼在嘴里。",
+        "save_id": 1157,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1157.png",
+        "status": "success"
+    },
+    {
+        "id": "72",
+        "source_image": "Part2/Obj_interaction/72.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the girl hold the teddy bear on the bed tightly in her arms.",
+        "GPT_translation_prompt_cn": "让女孩紧紧地抱着泰迪熊。",
+        "GPT_refined_prompt_en": "Make the girl hug the teddy bear tightly.",
+        "GPT_refined_prompt_cn": "让女孩紧紧地抱着泰迪熊。",
+        "prompt_cn": "让女孩紧紧地抱着床上的泰迪熊。",
+        "save_id": 1158,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1158.png",
+        "status": "success"
+    },
+    {
+        "id": "73",
+        "source_image": "Part2/Obj_interaction/73.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the astronaut walk over and grab the flag stuck in the ground.",
+        "GPT_translation_prompt_cn": "让宇航员握住插在地上的旗子。",
+        "GPT_refined_prompt_en": "Make the astronaut hold the flag that is planted in the ground.",
+        "GPT_refined_prompt_cn": "让宇航员握住插在地上的那面旗子。",
+        "prompt_cn": "让宇航员走过去握住插在地上的那面旗子。",
+        "save_id": 1159,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1159.png",
+        "status": "skipped"
+    },
+    {
+        "id": "74",
+        "source_image": "Part2/Obj_interaction/74.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the monkey hold the banana with its two front hands.",
+        "GPT_translation_prompt_cn": "让猴子前面两只手抓住香蕉。",
+        "GPT_refined_prompt_en": "Make the monkey hold the banana with its two front hands.",
+        "GPT_refined_prompt_cn": "让猴子前面两只手抓住香蕉。",
+        "prompt_cn": "让猴子前面两只手抓住香蕉。",
+        "save_id": 1160,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1160.png",
+        "status": "skipped"
+    },
+    {
+        "id": "75",
+        "source_image": "Part2/Obj_interaction/75.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the knight pull the sword out of the stone.",
+        "GPT_translation_prompt_cn": "让骑士把剑从石头中拔出来。",
+        "GPT_refined_prompt_en": "Make the knight pull the sword out of the stone.",
+        "GPT_refined_prompt_cn": "让骑士把剑从石头中拔出来。",
+        "prompt_cn": "让骑士把剑从石头中拔出来。",
+        "save_id": 1161,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1161.png",
+        "status": "skipped"
+    },
+    {
+        "id": "76",
+        "source_image": "Part2/Obj_interaction/76.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the chef hold the frying pan up by its handle.",
+        "GPT_translation_prompt_cn": "让这位厨师用手握住煎锅的把手，把煎锅举起来。",
+        "GPT_refined_prompt_en": "Make the chef hold the frying pan up by its handle.",
+        "GPT_refined_prompt_cn": "让厨师用手握住煎锅的把手，把煎锅举起来。",
+        "prompt_cn": "让厨师用手握住煎锅的把手，把煎锅举起来。",
+        "save_id": 1162,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1162.png",
+        "status": "skipped"
+    },
+    {
+        "id": "77",
+        "source_image": "Part2/Obj_interaction/77.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the robot wrap its mechanical arms around the box beside it.",
+        "GPT_translation_prompt_cn": "让机器人用它的机械手臂抱住箱子。",
+        "GPT_refined_prompt_en": "Make the robot hold the box tightly using its mechanical arm.",
+        "GPT_refined_prompt_cn": "让机器人用它的机械手臂抱住箱子。",
+        "prompt_cn": "让机器人用它的机械手臂抱住旁边的箱子。",
+        "save_id": 1163,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1163.png",
+        "status": "success"
+    },
+    {
+        "id": "78",
+        "source_image": "Part2/Obj_interaction/78.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the crow pick up the coin beside it in its beak.",
+        "GPT_translation_prompt_cn": "让乌鸦用喙叼起硬币。",
+        "GPT_refined_prompt_en": "Make the crow pick up the coin with its beak.",
+        "GPT_refined_prompt_cn": "让乌鸦用喙叼起那枚硬币。",
+        "prompt_cn": "让乌鸦叼起旁边的硬币。",
+        "save_id": 1164,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1164.png",
+        "status": "success"
+    },
+    {
+        "id": "79",
+        "source_image": "Part2/Obj_interaction/79.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the weightlifter lift the barbell overhead.",
+        "GPT_translation_prompt_cn": "让这名举重运动员把杠铃举过头顶。",
+        "GPT_refined_prompt_en": "Make the weightlifter raise the barbell overhead.",
+        "GPT_refined_prompt_cn": "让举重运动员把杠铃举到头顶上方。",
+        "prompt_cn": "让举重运动员把杠铃举到头顶上方。",
+        "save_id": 1165,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1165.png",
+        "status": "skipped"
+    },
+    {
+        "id": "80",
+        "source_image": "Part2/Obj_interaction/80.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the person bend down and pick up the hat.",
+        "GPT_translation_prompt_cn": "让这个人弯下腰捡起帽子。",
+        "GPT_refined_prompt_en": "Make the person bend down and pick up the hat.",
+        "GPT_refined_prompt_cn": "让这个人弯下腰并捡起帽子。",
+        "prompt_cn": "让这个人弯下腰并捡起帽子。",
+        "save_id": 1166,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1166.png",
+        "status": "skipped"
+    },
+    {
+        "id": "81",
+        "source_image": "Part2/Obj_interaction/81.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the cat push the ball of yarn with its paw.",
+        "GPT_translation_prompt_cn": "让这只猫用爪子推毛线球。",
+        "GPT_refined_prompt_en": "Make the cat push the ball of yarn with its paw.",
+        "GPT_refined_prompt_cn": "让猫用爪子推毛线球。",
+        "prompt_cn": "让猫用爪子推毛线球。",
+        "save_id": 1167,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1167.png",
+        "status": "skipped"
+    },
+    {
+        "id": "84",
+        "source_image": "Part2/Obj_interaction/84.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the penguin move forward to push the ice block.",
+        "GPT_translation_prompt_cn": "让这只企鹅去推冰块。",
+        "GPT_refined_prompt_en": "Make the penguin move forward to push the ice block.",
+        "GPT_refined_prompt_cn": "让这只企鹅去推冰块",
+        "prompt_cn": "让这只企鹅去推冰块",
+        "save_id": 1168,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1168.png",
+        "status": "skipped"
+    },
+    {
+        "id": "86",
+        "source_image": "Part2/Obj_interaction/86.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the teenager ride the skateboard.",
+        "GPT_translation_prompt_cn": "让这个青少年正在滑滑板。",
+        "GPT_refined_prompt_en": "Make the teenager ride the skateboard.",
+        "GPT_refined_prompt_cn": "让这个青少年正在踩着滑板滑行。",
+        "prompt_cn": "让这个青少年正在踩着滑板滑行。",
+        "save_id": 1170,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1170.png",
+        "status": "skipped"
+    },
+    {
+        "id": "91",
+        "source_image": "Part2/Obj_interaction/91.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the barber reach out and touch the customer’s hair.",
+        "GPT_translation_prompt_cn": "让理发师去摸顾客的头发。",
+        "GPT_refined_prompt_en": "Make the barber reach out and touch the customer’s hair.",
+        "GPT_refined_prompt_cn": "让理发师去摸顾客的头发。",
+        "prompt_cn": "让理发师去摸顾客的头发。",
+        "save_id": 1171,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1171.png",
+        "status": "skipped"
+    },
+    {
+        "id": "92",
+        "source_image": "Part2/Obj_interaction/92.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the red and blue bumper cars collide with each other.",
+        "GPT_translation_prompt_cn": "让红色和蓝色的碰碰车彼此相撞。",
+        "GPT_refined_prompt_en": "Make the red and blue bumper cars collide with each other.",
+        "GPT_refined_prompt_cn": "让红色和蓝色的碰碰车彼此相撞。",
+        "prompt_cn": "让红色和蓝色的碰碰车彼此相撞。",
+        "save_id": 1172,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1172.png",
+        "status": "skipped"
+    },
+    {
+        "id": "93",
+        "source_image": "Part2/Obj_interaction/93.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Write on the paper next to it using the pen shown in the picture.",
+        "GPT_translation_prompt_cn": "使用图片中的笔正在旁边的纸上写字",
+        "GPT_refined_prompt_en": "Write on the paper next to it using the pen shown in the picture.",
+        "GPT_refined_prompt_cn": "使用图片中的笔正在旁边的纸上写字。",
+        "prompt_cn": "使用图片中的笔正在旁边的纸上写字。",
+        "save_id": 1173,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1173.png",
+        "status": "skipped"
+    },
+    {
+        "id": "94",
+        "source_image": "Part2/Obj_interaction/94.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the boy pick up the drink next to him with his left hand.",
+        "GPT_translation_prompt_cn": "用男生的左手拿起旁边的饮料。",
+        "GPT_refined_prompt_en": "Have the boy pick up the drink next to him with his left hand.",
+        "GPT_refined_prompt_cn": "用男生的左手拿起旁边的饮料。",
+        "prompt_cn": "用男生的左手拿起旁边的饮料。",
+        "save_id": 1174,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1174.png",
+        "status": "skipped"
+    },
+    {
+        "id": "95",
+        "source_image": "Part2/Obj_interaction/95.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the man pick up the camera and start taking photos.",
+        "GPT_translation_prompt_cn": "让这位男士拿起相机开始拍照。",
+        "GPT_refined_prompt_en": "Have the man pick up the camera and start taking photos.",
+        "GPT_refined_prompt_cn": "让这位男士拿起相机开始拍照。",
+        "prompt_cn": "让这位男士拿起相机开始拍照。",
+        "save_id": 1175,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1175.png",
+        "status": "skipped"
+    },
+    {
+        "id": "96",
+        "source_image": "Part2/Obj_interaction/96.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the athlete appear to be kicking the ball.",
+        "GPT_translation_prompt_cn": "让这名运动员看起来正在踢球。",
+        "GPT_refined_prompt_en": "Make the athlete appear to be kicking the ball.",
+        "GPT_refined_prompt_cn": "让这名运动员看起来正在踢球。",
+        "prompt_cn": "让这名运动员看起来正在踢球。",
+        "save_id": 1176,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1176.png",
+        "status": "skipped"
+    },
+    {
+        "id": "97",
+        "source_image": "Part2/Obj_interaction/97.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the defensive player hit the offensive player’s arm.",
+        "GPT_translation_prompt_cn": "让这个防守球员去打进攻球员的手臂。",
+        "GPT_refined_prompt_en": "Have this person tear the paper in half.",
+        "GPT_refined_prompt_cn": "让这个防守球员去打进攻球员的手臂。",
+        "prompt_cn": "让这个防守球员去打进攻球员的手臂。",
+        "save_id": 1177,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1177.png",
+        "status": "success"
+    },
+    {
+        "id": "98",
+        "source_image": "Part2/Obj_interaction/98.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the girl sit on a suitcase.",
+        "GPT_translation_prompt_cn": "让女孩坐在旅行箱上。",
+        "GPT_refined_prompt_en": "Have the girl sit on a suitcase.",
+        "GPT_refined_prompt_cn": "让女孩坐在旅行箱上。",
+        "prompt_cn": "让女孩坐在旅行箱上。",
+        "save_id": 1178,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1178.png",
+        "status": "success"
+    },
+    {
+        "id": "99",
+        "source_image": "Part2/Obj_interaction/99.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the boy in the image pick up the teacup on the table and drink from it.",
+        "GPT_translation_prompt_cn": "让女孩坐在旅行箱上。",
+        "GPT_refined_prompt_en": "Have the girl sit on a suitcase.",
+        "GPT_refined_prompt_cn": "让女孩坐在旅行箱上。",
+        "prompt_cn": "让图中的男孩拿起桌子上的茶碗喝水。",
+        "save_id": 11178,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/11178.png",
+        "status": "success"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/Object_Interaction_rank3.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/Object_Interaction_rank3.json
new file mode 100644
index 0000000000000000000000000000000000000000..787962fa0979b808a811d2399195654663f7e60a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/Object_Interaction_rank3.json
@@ -0,0 +1,249 @@
+[
+    {
+        "id": "9",
+        "source_image": "Part2/Obj_interaction/9.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the boy hold the nearby bottle of Coke in his right hand and make him appear to be drinking it.",
+        "GPT_translation_prompt_cn": "让这个男孩用右手拿着这瓶可乐并正在喝。",
+        "GPT_refined_prompt_en": "Have the boy hold the bottle of Coke in his right hand and drink from it.",
+        "GPT_refined_prompt_cn": "让这个男孩用右手拿着这瓶可乐并正在喝。",
+        "prompt_cn": "让这个男孩右手拿着旁边的可乐，并做出正在喝的动作。",
+        "save_id": 1113,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1113.png",
+        "_merge_order": 7,
+        "status": "success"
+    },
+    {
+        "id": "21",
+        "source_image": "Part2/Obj_interaction/21.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the player holding the volleyball appear to be serving the ball.",
+        "GPT_translation_prompt_cn": "让这名球员发排球。",
+        "GPT_refined_prompt_en": "Make the player appear to be serving the volleyball.",
+        "GPT_refined_prompt_cn": "让这名球员看起来正在发排球。",
+        "prompt_cn": "让拿着排球的这名球员看起来正在发排球。",
+        "save_id": 1125,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1125.png",
+        "_merge_order": 19,
+        "status": "success"
+    },
+    {
+        "id": "31",
+        "source_image": "Part2/Obj_interaction/31.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the teacher take a bite of the apple.",
+        "GPT_translation_prompt_cn": "让这位老师咬一口苹果。",
+        "GPT_refined_prompt_en": "Make the teacher take a bite of the apple.",
+        "GPT_refined_prompt_cn": "让这位老师咬一口苹果。",
+        "prompt_cn": "让这位老师咬一口苹果。",
+        "save_id": 1133,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1133.png",
+        "_merge_order": 25,
+        "status": "success"
+    },
+    {
+        "id": "32",
+        "source_image": "Part2/Obj_interaction/32.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the man pick up and eat the burger.",
+        "GPT_translation_prompt_cn": "让这个男人拿起并吃汉堡。",
+        "GPT_refined_prompt_en": "Make the man pick up the burger and eat it.",
+        "GPT_refined_prompt_cn": "让这个男人拿起汉堡并吃下去。",
+        "prompt_cn": "让这个男人拿起汉堡并吃下去。",
+        "save_id": 1134,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1134.png",
+        "_merge_order": 26,
+        "status": "success"
+    },
+    {
+        "id": "37",
+        "source_image": "Part2/Obj_interaction/37.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the man and woman holding wine glasses clink their glasses together.",
+        "GPT_translation_prompt_cn": "让他们把酒杯碰在一起。",
+        "GPT_refined_prompt_en": "Make them clink their glasses together.",
+        "GPT_refined_prompt_cn": "让他们把酒杯碰在一起。",
+        "prompt_cn": "让拿着酒杯的男生和女生进行碰杯。",
+        "save_id": 1138,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1138.png",
+        "_merge_order": 30,
+        "status": "success"
+    },
+    {
+        "id": "51",
+        "source_image": "Part2/Obj_interaction/51.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the tourist look down at the map in their hands.",
+        "GPT_translation_prompt_cn": "让这名游客用手指着打开地图上的某个位置。",
+        "GPT_refined_prompt_en": "Make the tourist point to a specific location on the open map.",
+        "GPT_refined_prompt_cn": "让这名游客指向打开地图上的一个具体位置。",
+        "prompt_cn": "让这名游客低头看着手中的地图。",
+        "save_id": 1149,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1149.png",
+        "_merge_order": 40,
+        "status": "success"
+    },
+    {
+        "id": "70",
+        "source_image": "Part2/Obj_interaction/70.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the dog pick up the stick at its feet and hold it in its mouth.",
+        "GPT_translation_prompt_cn": "让这只狗把木棍叼在嘴里。",
+        "GPT_refined_prompt_en": "Make the dog hold the stick in its mouth.",
+        "GPT_refined_prompt_cn": "让这只狗把木棍叼在嘴里。",
+        "prompt_cn": "让这只狗把脚下的木棍叼在嘴里。",
+        "save_id": 1157,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1157.png",
+        "_merge_order": 47,
+        "status": "success"
+    },
+    {
+        "id": "72",
+        "source_image": "Part2/Obj_interaction/72.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the girl hold the teddy bear on the bed tightly in her arms.",
+        "GPT_translation_prompt_cn": "让女孩紧紧地抱着泰迪熊。",
+        "GPT_refined_prompt_en": "Make the girl hug the teddy bear tightly.",
+        "GPT_refined_prompt_cn": "让女孩紧紧地抱着泰迪熊。",
+        "prompt_cn": "让女孩紧紧地抱着床上的泰迪熊。",
+        "save_id": 1158,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1158.png",
+        "_merge_order": 48,
+        "status": "success"
+    },
+    {
+        "id": "77",
+        "source_image": "Part2/Obj_interaction/77.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the robot wrap its mechanical arms around the box beside it.",
+        "GPT_translation_prompt_cn": "让机器人用它的机械手臂抱住箱子。",
+        "GPT_refined_prompt_en": "Make the robot hold the box tightly using its mechanical arm.",
+        "GPT_refined_prompt_cn": "让机器人用它的机械手臂抱住箱子。",
+        "prompt_cn": "让机器人用它的机械手臂抱住旁边的箱子。",
+        "save_id": 1163,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1163.png",
+        "_merge_order": 53,
+        "status": "success"
+    },
+    {
+        "id": "78",
+        "source_image": "Part2/Obj_interaction/78.jpg",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the crow pick up the coin beside it in its beak.",
+        "GPT_translation_prompt_cn": "让乌鸦用喙叼起硬币。",
+        "GPT_refined_prompt_en": "Make the crow pick up the coin with its beak.",
+        "GPT_refined_prompt_cn": "让乌鸦用喙叼起那枚硬币。",
+        "prompt_cn": "让乌鸦叼起旁边的硬币。",
+        "save_id": 1164,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1164.png",
+        "_merge_order": 54,
+        "status": "success"
+    },
+    {
+        "id": "97",
+        "source_image": "Part2/Obj_interaction/97.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the defensive player hit the offensive player’s arm.",
+        "GPT_translation_prompt_cn": "让这个防守球员去打进攻球员的手臂。",
+        "GPT_refined_prompt_en": "Have this person tear the paper in half.",
+        "GPT_refined_prompt_cn": "让这个防守球员去打进攻球员的手臂。",
+        "prompt_cn": "让这个防守球员去打进攻球员的手臂。",
+        "save_id": 1177,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1177.png",
+        "_merge_order": 66,
+        "status": "success"
+    },
+    {
+        "id": "98",
+        "source_image": "Part2/Obj_interaction/98.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Have the girl sit on a suitcase.",
+        "GPT_translation_prompt_cn": "让女孩坐在旅行箱上。",
+        "GPT_refined_prompt_en": "Have the girl sit on a suitcase.",
+        "GPT_refined_prompt_cn": "让女孩坐在旅行箱上。",
+        "prompt_cn": "让女孩坐在旅行箱上。",
+        "save_id": 1178,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/1178.png",
+        "_merge_order": 67,
+        "status": "success"
+    },
+    {
+        "id": "99",
+        "source_image": "Part2/Obj_interaction/99.png",
+        "edit_type": "Object_Interaction",
+        "prompt_en": "Make the boy in the image pick up the teacup on the table and drink from it.",
+        "GPT_translation_prompt_cn": "让女孩坐在旅行箱上。",
+        "GPT_refined_prompt_en": "Have the girl sit on a suitcase.",
+        "GPT_refined_prompt_cn": "让女孩坐在旅行箱上。",
+        "prompt_cn": "让图中的男孩拿起桌子上的茶碗喝水。",
+        "save_id": 11178,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Object_Interaction/11178.png",
+        "_merge_order": 68,
+        "status": "success"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Swap/Swap.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Swap/Swap.json
new file mode 100644
index 0000000000000000000000000000000000000000..aa2f2112921a85e33a58a070f600dbdf2974ffb0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Swap/Swap.json
@@ -0,0 +1,1244 @@
+[
+    {
+        "id": "1",
+        "source_image": "Part2/Swap/1.jpg",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the positions of the cup and the spoon.",
+        "GPT_translation_prompt_cn": "交换杯子和勺子的的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the cup and the spoon.",
+        "GPT_refined_prompt_cn": "交换杯子和勺子的的位置。",
+        "prompt_cn": "交换杯子和勺子的的位置。",
+        "save_id": 1037,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1037.png",
+        "status": "skipped"
+    },
+    {
+        "id": "2",
+        "source_image": "Part2/Swap/2.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the positions of the J card and the Q card.",
+        "GPT_translation_prompt_cn": "交换 J 牌和 Q 牌的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the J card and the Q card.",
+        "GPT_refined_prompt_cn": "交换 J 牌和 Q 牌的位置。",
+        "prompt_cn": "交换 J 牌和 Q 牌的位置。",
+        "save_id": 1038,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1038.png",
+        "status": "skipped"
+    },
+    {
+        "id": "3",
+        "source_image": "Part2/Swap/3.jpg",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the positions of the pen and the headphones.",
+        "GPT_translation_prompt_cn": "交换笔和耳机的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the pen and the headphones.",
+        "GPT_refined_prompt_cn": "交换笔和耳机的位置。",
+        "prompt_cn": "交换笔和耳机的位置。",
+        "save_id": 1039,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1039.png",
+        "status": "skipped"
+    },
+    {
+        "id": "4",
+        "source_image": "Part2/Swap/4.jpg",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the positions of the coffee cup and the vase.",
+        "GPT_translation_prompt_cn": "交换咖啡杯和花瓶的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the coffee cup and the vase.",
+        "GPT_refined_prompt_cn": "将咖啡杯和花瓶的位置互相对调。",
+        "prompt_cn": "将咖啡杯和花瓶的位置互相对调。",
+        "save_id": 1040,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1040.png",
+        "status": "skipped"
+    },
+    {
+        "id": "5",
+        "source_image": "Part2/Swap/5.jpg",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the positions of the two people.",
+        "GPT_translation_prompt_cn": "交换这两个人的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the two people.",
+        "GPT_refined_prompt_cn": "交换这两个人的位置。",
+        "prompt_cn": "交换这两个人的位置。",
+        "save_id": 1041,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1041.png",
+        "status": "skipped"
+    },
+    {
+        "id": "6",
+        "source_image": "Part2/Swap/6.png",
+        "edit_type": "Swap",
+        "prompt_en": "Exchange the cup of coffee with the glass of water.",
+        "GPT_translation_prompt_cn": "将咖啡杯与玻璃水杯交换位置。",
+        "GPT_refined_prompt_en": "Swap the cup of coffee with the glass of water.",
+        "GPT_refined_prompt_cn": "将咖啡杯与玻璃水杯互相对调。",
+        "prompt_cn": "将咖啡杯与玻璃水杯互相对调。",
+        "save_id": 1042,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1042.png",
+        "status": "skipped"
+    },
+    {
+        "id": "7",
+        "source_image": "Part2/Swap/7.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the fork and the knife.",
+        "GPT_translation_prompt_cn": "交换叉子和刀子。",
+        "GPT_refined_prompt_en": "Swap the positions of the fork and the knife.",
+        "GPT_refined_prompt_cn": "交换叉子和刀子的摆放位置。",
+        "prompt_cn": "交换叉子和刀子的摆放位置。",
+        "save_id": 1043,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1043.png",
+        "status": "skipped"
+    },
+    {
+        "id": "8",
+        "source_image": "Part2/Swap/8.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the positions of the red apple and the green pear.",
+        "GPT_translation_prompt_cn": "交换红苹果和绿梨的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the red apple and the green pear.",
+        "GPT_refined_prompt_cn": "交换红色苹果和绿色梨的位置。",
+        "prompt_cn": "交换红色苹果和绿色梨的位置。",
+        "save_id": 1044,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1044.png",
+        "status": "skipped"
+    },
+    {
+        "id": "9",
+        "source_image": "Part2/Swap/9.png",
+        "edit_type": "Swap",
+        "prompt_en": "Switch the positions of the salt shaker and the pepper shaker.",
+        "GPT_translation_prompt_cn": "交换盐瓶和胡椒瓶的位置。",
+        "GPT_refined_prompt_en": "Switch the positions of the salt shaker and the pepper shaker.",
+        "GPT_refined_prompt_cn": "交换盐瓶和胡椒瓶的位置。",
+        "prompt_cn": "交换盐瓶和胡椒瓶的位置。",
+        "save_id": 1045,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1045.png",
+        "status": "skipped"
+    },
+    {
+        "id": "10",
+        "source_image": "Part2/Swap/10.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the chocolate cake and the donut.",
+        "GPT_translation_prompt_cn": "交换巧克力蛋糕和甜甜圈的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the chocolate cake and the donut.",
+        "GPT_refined_prompt_cn": "交换巧克力蛋糕和甜甜圈的位置。",
+        "prompt_cn": "交换巧克力蛋糕和甜甜圈的位置。",
+        "save_id": 1046,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1046.png",
+        "status": "skipped"
+    },
+    {
+        "id": "11",
+        "source_image": "Part2/Swap/11.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the strawberry and the blueberry.",
+        "GPT_translation_prompt_cn": "交换草莓和蓝莓。",
+        "GPT_refined_prompt_en": "Swap the positions of the strawberry and the blueberry.",
+        "GPT_refined_prompt_cn": "交换草莓和蓝莓的位置。",
+        "prompt_cn": "交换草莓和蓝莓的位置。",
+        "save_id": 1047,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1047.png",
+        "status": "skipped"
+    },
+    {
+        "id": "12",
+        "source_image": "Part2/Swap/12.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the cat and the dog.",
+        "GPT_translation_prompt_cn": "把猫和狗对调位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the cat and the dog.",
+        "GPT_refined_prompt_cn": "交换猫和狗的位置。",
+        "prompt_cn": "交换猫和狗的位置。",
+        "save_id": 1048,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1048.png",
+        "status": "skipped"
+    },
+    {
+        "id": "13",
+        "source_image": "Part2/Swap/13.png",
+        "edit_type": "Swap",
+        "prompt_en": "Exchange the orange and the lemon.",
+        "GPT_translation_prompt_cn": "交换橙子和柠檬。",
+        "GPT_refined_prompt_en": "Swap the positions of the orange and the lemon.",
+        "GPT_refined_prompt_cn": "交换橙子和柠檬的位置。",
+        "prompt_cn": "交换橙子和柠檬的位置。",
+        "save_id": 1049,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1049.png",
+        "status": "skipped"
+    },
+    {
+        "id": "14",
+        "source_image": "Part2/Swap/14.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the poster of LeBron James in the top-left corner with the poster of Kobe Bryant in the bottom-right corner.",
+        "GPT_translation_prompt_cn": "将左上角勒布朗·詹姆斯的海报与右下角科比·布莱恩特的海报互换位置。",
+        "GPT_refined_prompt_en": "Swap the LeBron James poster in the top-left corner with the Kobe Bryant poster in the bottom-right corner.",
+        "GPT_refined_prompt_cn": "将左上角的勒布朗·詹姆斯海报与右下角的科比·布莱恩特海报互换位置。",
+        "prompt_cn": "将左上角的勒布朗·詹姆斯海报与右下角的科比·布莱恩特海报互换位置。",
+        "save_id": 1050,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1050.png",
+        "status": "skipped"
+    },
+    {
+        "id": "15",
+        "source_image": "Part2/Swap/15.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the positions of the cookie and the candy jar.",
+        "GPT_translation_prompt_cn": "将饼干和糖果瓶的位置互换。",
+        "GPT_refined_prompt_en": "Swap the positions of the cookie and the candy jar.",
+        "GPT_refined_prompt_cn": "将饼干和糖果瓶的位置互换。",
+        "prompt_cn": "将饼干和糖果瓶的位置互换。",
+        "save_id": 1051,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1051.png",
+        "status": "skipped"
+    },
+    {
+        "id": "16",
+        "source_image": "Part2/Swap/16.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the positions of the wine bottle and the wine glass.",
+        "GPT_translation_prompt_cn": "交换酒瓶和酒杯的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the wine bottle and the wine glass.",
+        "GPT_refined_prompt_cn": "交换酒瓶和酒杯的位置。",
+        "prompt_cn": "交换酒瓶和酒杯的位置。",
+        "save_id": 1052,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1052.png",
+        "status": "skipped"
+    },
+    {
+        "id": "17",
+        "source_image": "Part2/Swap/17.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the toy car with the teddy bear.",
+        "GPT_translation_prompt_cn": "把玩具小汽车和泰迪熊对调位置。",
+        "GPT_refined_prompt_en": "Swap the toy car with the teddy bear.",
+        "GPT_refined_prompt_cn": "将玩具小汽车与泰迪熊互相交换位置。",
+        "prompt_cn": "将玩具小汽车与泰迪熊互相交换位置。",
+        "save_id": 1053,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1053.png",
+        "status": "skipped"
+    },
+    {
+        "id": "18",
+        "source_image": "Part2/Swap/18.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the positions of the girl wearing yellow and the driver in the car.",
+        "GPT_translation_prompt_cn": "将穿黄色衣服的女生和开车的司机互换位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the girl wearing yellow and the driver in the car.",
+        "GPT_refined_prompt_cn": "将穿黄色衣服的女生和开车的司机互换位置。",
+        "prompt_cn": "将穿黄色衣服的女生和开车的司机互换位置。",
+        "save_id": 1054,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1054.png",
+        "status": "skipped"
+    },
+    {
+        "id": "20",
+        "source_image": "Part2/Swap/20.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the trash bin and the recycling bin.",
+        "GPT_translation_prompt_cn": "交换垃圾桶和回收桶的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the trash bin and the recycling bin.",
+        "GPT_refined_prompt_cn": "交换垃圾桶和回收桶的摆放位置。",
+        "prompt_cn": "交换垃圾桶和回收桶的摆放位置。",
+        "save_id": 1055,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1055.png",
+        "status": "skipped"
+    },
+    {
+        "id": "22",
+        "source_image": "Part2/Swap/22.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the shoe and the sock.",
+        "GPT_translation_prompt_cn": "交换鞋子和袜子的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the shoe and the sock.",
+        "GPT_refined_prompt_cn": "交换鞋子和袜子的放置位置。",
+        "prompt_cn": "交换鞋子和袜子的放置位置。",
+        "save_id": 1056,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1056.png",
+        "status": "skipped"
+    },
+    {
+        "id": "23",
+        "source_image": "Part2/Swap/23.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the router and the plant beside it.",
+        "GPT_translation_prompt_cn": "把路由器和旁边的那盆植物互相交换位置。",
+        "GPT_refined_prompt_en": "Swap the router with the plant beside it.",
+        "GPT_refined_prompt_cn": "将路由器与旁边的那盆植物互换位置。",
+        "prompt_cn": "将路由器与旁边的那盆植物互换位置。",
+        "save_id": 1057,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1057.png",
+        "status": "skipped"
+    },
+    {
+        "id": "24",
+        "source_image": "Part2/Swap/24.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the striped tie and the polka dot tie.",
+        "GPT_translation_prompt_cn": "交换条纹领带和波点领带的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the striped tie and the polka dot tie.",
+        "GPT_refined_prompt_cn": "交换条纹领带和波点领带的位置。",
+        "prompt_cn": "交换条纹领带和波点领带的位置。",
+        "save_id": 1058,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1058.png",
+        "status": "skipped"
+    },
+    {
+        "id": "25",
+        "source_image": "Part2/Swap/25.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the silver earring and the gold earring.",
+        "GPT_translation_prompt_cn": "交换银色耳环和金色耳环。",
+        "GPT_refined_prompt_en": "Swap the positions of the silver earring and the gold earring.",
+        "GPT_refined_prompt_cn": "交换银色耳环和金色耳环的位置。",
+        "prompt_cn": "交换银色耳环和金色耳环的位置。",
+        "save_id": 1059,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1059.png",
+        "status": "skipped"
+    },
+    {
+        "id": "26",
+        "source_image": "Part2/Swap/26.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the squirrel and the rabbit.",
+        "GPT_translation_prompt_cn": "交换松鼠和兔子的的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the squirrel and the rabbit.",
+        "GPT_refined_prompt_cn": "交换松鼠和兔子的位置。",
+        "prompt_cn": "交换松鼠和兔子的位置。",
+        "save_id": 1060,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1060.png",
+        "status": "skipped"
+    },
+    {
+        "id": "27",
+        "source_image": "Part2/Swap/27.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the soccer ball and the basketball.",
+        "GPT_translation_prompt_cn": "交换足球和篮球的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the soccer ball and the basketball.",
+        "GPT_refined_prompt_cn": "交换足球和篮球的位置。",
+        "prompt_cn": "交换足球和篮球的位置。",
+        "save_id": 1061,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1061.png",
+        "status": "skipped"
+    },
+    {
+        "id": "29",
+        "source_image": "Part2/Swap/29.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the dumbbell and the water bottle.",
+        "GPT_translation_prompt_cn": "交换哑铃和水瓶的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the dumbbell and the water bottle.",
+        "GPT_refined_prompt_cn": "交换哑铃和水瓶的位置。",
+        "prompt_cn": "交换哑铃和水瓶的位置。",
+        "save_id": 1062,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1062.png",
+        "status": "skipped"
+    },
+    {
+        "id": "30",
+        "source_image": "Part2/Swap/30.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the green pyramid and the yellow cylinder.",
+        "GPT_translation_prompt_cn": "交换绿色金字塔和黄色圆柱体。",
+        "GPT_refined_prompt_en": "Swap the green pyramid with the yellow cylinder.",
+        "GPT_refined_prompt_cn": "将绿色金字塔与黄色圆柱体互换位置。",
+        "prompt_cn": "将绿色金字塔与黄色圆柱体互换位置。",
+        "save_id": 1063,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1063.png",
+        "status": "skipped"
+    },
+    {
+        "id": "33",
+        "source_image": "Part2/Swap/33.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the letter 'A' and the letter 'b'.",
+        "GPT_translation_prompt_cn": "交换字母“A”和字母“b”。",
+        "GPT_refined_prompt_en": "Swap the position of the letter “A” with the letter “b”.",
+        "GPT_refined_prompt_cn": "将字母“A”和字母“b”的位置互相交换。",
+        "prompt_cn": "将字母“A”和字母“b”的位置互相交换。",
+        "save_id": 1064,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1064.png",
+        "status": "skipped"
+    },
+    {
+        "id": "34",
+        "source_image": "Part2/Swap/34.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the materials of the chair and the table.",
+        "GPT_translation_prompt_cn": "交换椅子和桌子的材质。",
+        "GPT_refined_prompt_en": "Swap the materials of the chair and the table.",
+        "GPT_refined_prompt_cn": "将椅子和桌子的材质互相交换。",
+        "prompt_cn": "将椅子和桌子的材质互相交换。",
+        "save_id": 1065,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1065.png",
+        "status": "skipped"
+    },
+    {
+        "id": "35",
+        "source_image": "Part2/Swap/35.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the colors of the ring and the bracelet.",
+        "GPT_translation_prompt_cn": "交换戒指和手镯的颜色。",
+        "GPT_refined_prompt_en": "Swap the colors of the ring and the bracelet.",
+        "GPT_refined_prompt_cn": "交换戒指和手镯的颜色。",
+        "prompt_cn": "交换戒指和手镯的颜色。",
+        "save_id": 1066,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1066.png",
+        "status": "skipped"
+    },
+    {
+        "id": "36",
+        "source_image": "Part2/Swap/36.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the remote control and the game controller.",
+        "GPT_translation_prompt_cn": "交换遥控器和游戏手柄的位置。",
+        "GPT_refined_prompt_en": "Swap the positions of the remote control and the game controller.",
+        "GPT_refined_prompt_cn": "交换遥控器和游戏手柄的位置。",
+        "prompt_cn": "交换遥控器和游戏手柄的位置。",
+        "save_id": 1067,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1067.png",
+        "status": "skipped"
+    },
+    {
+        "id": "37",
+        "source_image": "Part2/Swap/37.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the blue pillow and the red pillow.",
+        "GPT_translation_prompt_cn": "交换蓝色枕头和红色枕头。",
+        "GPT_refined_prompt_en": "Swap the positions of the blue pillow and the red pillow.",
+        "GPT_refined_prompt_cn": "交换蓝色枕头和红色枕头的位置。",
+        "prompt_cn": "交换蓝色枕头和红色枕头的位置。",
+        "save_id": 1068,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1068.png",
+        "status": "skipped"
+    },
+    {
+        "id": "38",
+        "source_image": "Part2/Swap/38.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the colors of the cube and the sphere.",
+        "GPT_translation_prompt_cn": "交换立方体和球体的颜色。",
+        "GPT_refined_prompt_en": "Swap the colors of the cube and the sphere.",
+        "GPT_refined_prompt_cn": "交换立方体和球体的颜色。",
+        "prompt_cn": "交换立方体和球体的颜色。",
+        "save_id": 1069,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1069.png",
+        "status": "skipped"
+    },
+    {
+        "id": "40",
+        "source_image": "Part2/Swap/40.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the colors of the apple and the pepper.",
+        "GPT_translation_prompt_cn": "交换苹果和甜椒的颜色。",
+        "GPT_refined_prompt_en": "Swap the colors of the apple and the pepper.",
+        "GPT_refined_prompt_cn": "交换苹果和甜椒的颜色。",
+        "prompt_cn": "交换苹果和甜椒的颜色。",
+        "save_id": 1070,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1070.png",
+        "status": "skipped"
+    },
+    {
+        "id": "41",
+        "source_image": "Part2/Swap/41.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the upholstery material of the couch and the armchair.",
+        "GPT_translation_prompt_cn": "交换沙发和扶手椅的软包材质。",
+        "GPT_refined_prompt_en": "Swap the upholstery material between the couch and the armchair.",
+        "GPT_refined_prompt_cn": "在沙发和扶手椅之间交换软包材质。",
+        "prompt_cn": "在沙发和扶手椅之间交换软包材质。",
+        "save_id": 1071,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1071.png",
+        "status": "skipped"
+    },
+    {
+        "id": "42",
+        "source_image": "Part2/Swap/42.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the colors of the cat and the dog.",
+        "GPT_translation_prompt_cn": "交换猫和狗的颜色。",
+        "GPT_refined_prompt_en": "Swap the fur colors of the cat and the dog.",
+        "GPT_refined_prompt_cn": "交换猫和狗毛色的颜色。",
+        "prompt_cn": "交换猫和狗毛色的颜色。",
+        "save_id": 1072,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1072.png",
+        "status": "skipped"
+    },
+    {
+        "id": "43",
+        "source_image": "Part2/Swap/43.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the fabrics of the jacket and the pants.",
+        "GPT_translation_prompt_cn": "交换夹克和裤子的面料。",
+        "GPT_refined_prompt_en": "Swap the fabrics of the jacket and the pants.",
+        "GPT_refined_prompt_cn": "交换夹克和裤子的面料。",
+        "prompt_cn": "交换夹克和裤子的面料。",
+        "save_id": 1073,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1073.png",
+        "status": "skipped"
+    },
+    {
+        "id": "44",
+        "source_image": "Part2/Swap/44.jpg",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the characters 13 and 09 on the monitor.",
+        "GPT_translation_prompt_cn": "将显示器上的字符 13 和 09 互换位置。",
+        "GPT_refined_prompt_en": "Swap the “13” and “09” characters on the monitor.",
+        "GPT_refined_prompt_cn": "将显示器上的“13”和“09”字符互相交换。",
+        "prompt_cn": "将显示器上的“13”和“09”字符互相交换。",
+        "save_id": 1074,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1074.png",
+        "status": "skipped"
+    },
+    {
+        "id": "46",
+        "source_image": "Part2/Swap/46.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the text labels: write 'SALE' on the blue tag and 'NEW' on the red tag.",
+        "GPT_translation_prompt_cn": "交换文字标签：在蓝色标签上写上“SALE”，在红色标签上写上“NEW”。",
+        "GPT_refined_prompt_en": "Swap the text labels: write “SALE” on the blue tag and “NEW” on the red tag.",
+        "GPT_refined_prompt_cn": "交换文字标签：在蓝色吊牌上写上“SALE”，在红色吊牌上写上“NEW”。",
+        "prompt_cn": "交换文字标签：在蓝色吊牌上写上“SALE”，在红色吊牌上写上“NEW”。",
+        "save_id": 1075,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1075.png",
+        "status": "skipped"
+    },
+    {
+        "id": "47",
+        "source_image": "Part2/Swap/47.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the digital time displayed on the two clocks.",
+        "GPT_translation_prompt_cn": "交换两只时钟上显示的数字时间。",
+        "GPT_refined_prompt_en": "Swap the digital times displayed on the two clocks.",
+        "GPT_refined_prompt_cn": "交换两只时钟上显示的数字时间。",
+        "prompt_cn": "交换两只时钟上显示的数字时间。",
+        "save_id": 1076,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1076.png",
+        "status": "skipped"
+    },
+    {
+        "id": "48",
+        "source_image": "Part2/Swap/48.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the contents inside the picture frame.",
+        "GPT_translation_prompt_cn": "交换画框中的内容。",
+        "GPT_refined_prompt_en": "Swap the contents inside the picture frame.",
+        "GPT_refined_prompt_cn": "交换画框中的内容。",
+        "prompt_cn": "交换画框中的内容。",
+        "save_id": 1077,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1077.png",
+        "status": "skipped"
+    },
+    {
+        "id": "49",
+        "source_image": "Part2/Swap/49.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the content on the phone screen and the monitor.",
+        "GPT_translation_prompt_cn": "交换手机屏幕和显示器的内容 。",
+        "GPT_refined_prompt_en": "Swap the content on the phone screen and the monitor.",
+        "GPT_refined_prompt_cn": "交换手机屏幕和显示器的内容 。",
+        "prompt_cn": "交换手机屏幕和显示器的内容 。",
+        "save_id": 1078,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1078.png",
+        "status": "skipped"
+    },
+    {
+        "id": "50",
+        "source_image": "Part2/Swap/50.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the hair colors of the two children.",
+        "GPT_translation_prompt_cn": "交换两个孩子的头发颜色。",
+        "GPT_refined_prompt_en": "Swap the hair colors of the two children.",
+        "GPT_refined_prompt_cn": "交换两个孩子的头发颜色。",
+        "prompt_cn": "交换两个孩子的头发颜色。",
+        "save_id": 1079,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1079.png",
+        "status": "skipped"
+    },
+    {
+        "id": "51",
+        "source_image": "Part2/Swap/51.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the hairstyles of the blonde woman and the brunette woman.",
+        "GPT_translation_prompt_cn": "把金发女子和棕发女子的发型互相交换。",
+        "GPT_refined_prompt_en": "Swap the hairstyles of the blonde woman and the brunette woman.",
+        "GPT_refined_prompt_cn": "将金发女子和棕发女子的发型对调。",
+        "prompt_cn": "将金发女子和棕发女子的发型对调。",
+        "save_id": 1080,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1080.png",
+        "status": "skipped"
+    },
+    {
+        "id": "52",
+        "source_image": "Part2/Swap/52.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the colors of the tractor and the sports car.",
+        "GPT_translation_prompt_cn": "交换拖拉机和跑车的颜色。",
+        "GPT_refined_prompt_en": "Swap the colors of the tractor and the sports car.",
+        "GPT_refined_prompt_cn": "交换拖拉机和跑车的颜色。",
+        "prompt_cn": "交换拖拉机和跑车的颜色。",
+        "save_id": 1081,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1081.png",
+        "status": "skipped"
+    },
+    {
+        "id": "53",
+        "source_image": "Part2/Swap/53.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the liquids in the two cups.",
+        "GPT_translation_prompt_cn": "交换两个杯子里面液体的状态。",
+        "GPT_refined_prompt_en": "Swap the states of the liquids in the two cups.",
+        "GPT_refined_prompt_cn": "交换两个杯子里面液体的状态。",
+        "prompt_cn": "交换两个杯子里面的液体。",
+        "save_id": 1082,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1082.png",
+        "status": "success"
+    },
+    {
+        "id": "54",
+        "source_image": "Part2/Swap/54.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the outfits of the doctor and the police officer.",
+        "GPT_translation_prompt_cn": "交换医生和警察的衣服。",
+        "GPT_refined_prompt_en": "Swap the outfits of the doctor and the police officer.",
+        "GPT_refined_prompt_cn": "交换医生和警察的衣服。",
+        "prompt_cn": "交换医生和警察的衣服。",
+        "save_id": 1083,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1083.png",
+        "status": "skipped"
+    },
+    {
+        "id": "55",
+        "source_image": "Part2/Swap/55.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the lace colors of the two pairs of shoes.",
+        "GPT_translation_prompt_cn": "交换两双鞋鞋带的颜色",
+        "GPT_refined_prompt_en": "Swap the lace colors of the two pairs of shoes.",
+        "GPT_refined_prompt_cn": "交换两双鞋鞋带的颜色",
+        "prompt_cn": "交换两双鞋鞋带的颜色",
+        "save_id": 1084,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1084.png",
+        "status": "skipped"
+    },
+    {
+        "id": "56",
+        "source_image": "Part2/Swap/56.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the bracelets on the girl’s left and right wrists.",
+        "GPT_translation_prompt_cn": "交换女生左右手的镯子。",
+        "GPT_refined_prompt_en": "Swap the bracelets on the girl’s left and right wrists.",
+        "GPT_refined_prompt_cn": "交换女生左右手的镯子。",
+        "prompt_cn": "交换女生左右手的镯子。",
+        "save_id": 1085,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1085.png",
+        "status": "skipped"
+    },
+    {
+        "id": "57",
+        "source_image": "Part2/Swap/57.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the collar shapes of the T-shirt and the sweater.",
+        "GPT_translation_prompt_cn": "交换T恤和毛衣衣领的形状。",
+        "GPT_refined_prompt_en": "Swap the collar shapes of the T-shirt and the sweater.",
+        "GPT_refined_prompt_cn": "交换T恤和毛衣衣领的形状。",
+        "prompt_cn": "交换T恤和毛衣衣领的形状。",
+        "save_id": 1086,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1086.png",
+        "status": "skipped"
+    },
+    {
+        "id": "58",
+        "source_image": "Part2/Swap/58.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the states of the liquids in the two cups.",
+        "GPT_translation_prompt_cn": "交换两件衣服的颜色。",
+        "GPT_refined_prompt_en": "Swap the states of the liquids in the two cups.",
+        "GPT_refined_prompt_cn": "交换两件衣服的颜色。",
+        "prompt_cn": "交换两件衣服的颜色。",
+        "save_id": 1087,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1087.png",
+        "status": "skipped"
+    },
+    {
+        "id": "59",
+        "source_image": "Part2/Swap/59.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the shapes of the two picture frames.",
+        "GPT_translation_prompt_cn": "交换两个镜框的形状。",
+        "GPT_refined_prompt_en": "Swap the shapes of the two picture frames.",
+        "GPT_refined_prompt_cn": "交换两个镜框的形状。",
+        "prompt_cn": "交换两个镜框的形状。",
+        "save_id": 1088,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1088.png",
+        "status": "skipped"
+    },
+    {
+        "id": "61",
+        "source_image": "Part2/Swap/61.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the expressions of the baby and the woman.",
+        "GPT_translation_prompt_cn": "交换婴儿和女人的表情。",
+        "GPT_refined_prompt_en": "Swap the expressions of the baby and the woman.",
+        "GPT_refined_prompt_cn": "交换婴儿和女人的表情。",
+        "prompt_cn": "交换婴儿和女人的表情。",
+        "save_id": 1089,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1089.png",
+        "status": "skipped"
+    },
+    {
+        "id": "62",
+        "source_image": "Part2/Swap/62.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the positions and poses of the man and the woman.",
+        "GPT_translation_prompt_cn": "交换男人和女人的位置和姿势。",
+        "GPT_refined_prompt_en": "Swap the positions and poses of the man and the woman.",
+        "GPT_refined_prompt_cn": "交换男人和女人的位置和姿势。",
+        "prompt_cn": "交换男人和女人的位置和姿势。",
+        "save_id": 1090,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1090.png",
+        "status": "skipped"
+    },
+    {
+        "id": "63",
+        "source_image": "Part2/Swap/63.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the expressions of the two masks.",
+        "GPT_translation_prompt_cn": "交换两个面具的表情。",
+        "GPT_refined_prompt_en": "Swap the expressions of the two masks.",
+        "GPT_refined_prompt_cn": "交换两个面具的表情。",
+        "prompt_cn": "交换两个面具的表情。",
+        "save_id": 1091,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1091.png",
+        "status": "skipped"
+    },
+    {
+        "id": "64",
+        "source_image": "Part2/Swap/64.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the outfits of the boy and the girl.",
+        "GPT_translation_prompt_cn": "交换男孩和女孩的服装。",
+        "GPT_refined_prompt_en": "Swap the outfits of the boy and the girl.",
+        "GPT_refined_prompt_cn": "交换男孩和女孩的服装。",
+        "prompt_cn": "交换男孩和女孩的服装。",
+        "save_id": 1092,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1092.png",
+        "status": "skipped"
+    },
+    {
+        "id": "65",
+        "source_image": "Part2/Swap/65.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the positions and poses of the two dogs.",
+        "GPT_translation_prompt_cn": "交换两只犬的位置和姿势。",
+        "GPT_refined_prompt_en": "Swap the positions and poses of the two dogs.",
+        "GPT_refined_prompt_cn": "交换两只犬的位置和姿势。",
+        "prompt_cn": "交换两只犬的位置和姿势。",
+        "save_id": 1093,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1093.png",
+        "status": "skipped"
+    },
+    {
+        "id": "66",
+        "source_image": "Part2/Swap/66.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the actions of the two girls in the image.",
+        "GPT_translation_prompt_cn": "交换教练和学员的瑜伽姿势。",
+        "GPT_refined_prompt_en": "Swap the yoga poses between the instructor and the student.",
+        "GPT_refined_prompt_cn": "在教练和学员之间交换瑜伽姿势。",
+        "prompt_cn": "交换图中两位女生的动作。",
+        "save_id": 1094,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1094.png",
+        "status": "skipped"
+    },
+    {
+        "id": "67",
+        "source_image": "Part2/Swap/67.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the states and positions of the cat and the dog.",
+        "GPT_translation_prompt_cn": "交换猫和狗的状态和位置。",
+        "GPT_refined_prompt_en": "Swap the states and positions of the cat and the dog.",
+        "GPT_refined_prompt_cn": "交换猫和狗的状态和位置。",
+        "prompt_cn": "交换猫和狗的状态和位置。",
+        "save_id": 1095,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1095.png",
+        "status": "skipped"
+    },
+    {
+        "id": "68",
+        "source_image": "Part2/Swap/68.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the objects being eaten by the boy and the girl.",
+        "GPT_translation_prompt_cn": "交换男孩和女孩吃的物体。",
+        "GPT_refined_prompt_en": "Swap the objects being eaten by the boy and the girl.",
+        "GPT_refined_prompt_cn": "交换男孩和女孩吃的物体。",
+        "prompt_cn": "交换男孩和女孩吃的物体。",
+        "save_id": 1096,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1096.png",
+        "status": "skipped"
+    },
+    {
+        "id": "69",
+        "source_image": "Part2/Swap/69.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the states of the two laptops.",
+        "GPT_translation_prompt_cn": "交换两台笔记本的状态",
+        "GPT_refined_prompt_en": "Swap the states of the two laptops.",
+        "GPT_refined_prompt_cn": "交换两台笔记本的状态",
+        "prompt_cn": "交换两台笔记本的状态",
+        "save_id": 1097,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1097.png",
+        "status": "skipped"
+    },
+    {
+        "id": "70",
+        "source_image": "Part2/Swap/70.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the poses of the two models.",
+        "GPT_translation_prompt_cn": "交换两个模特的姿势。",
+        "GPT_refined_prompt_en": "Swap the poses of the two models.",
+        "GPT_refined_prompt_cn": "交换两个模特的姿势。",
+        "prompt_cn": "交换两个模特的姿势。",
+        "save_id": 1098,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1098.png",
+        "status": "skipped"
+    },
+    {
+        "id": "71",
+        "source_image": "Part2/Swap/71.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the eye states of the two people.",
+        "GPT_translation_prompt_cn": "交换两个人眼睛状态。",
+        "GPT_refined_prompt_en": "Swap the eye states of the two people.",
+        "GPT_refined_prompt_cn": "交换两个人眼睛状态。",
+        "prompt_cn": "交换两个人眼睛状态。",
+        "save_id": 1099,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1099.png",
+        "status": "skipped"
+    },
+    {
+        "id": "72",
+        "source_image": "Part2/Swap/72.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the colors of the two umbrellas.",
+        "GPT_translation_prompt_cn": "交换两把伞的颜色。",
+        "GPT_refined_prompt_en": "Swap the colors of the two umbrellas.",
+        "GPT_refined_prompt_cn": "交换两把伞的颜色。",
+        "prompt_cn": "交换两把伞的颜色。",
+        "save_id": 1100,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1100.png",
+        "status": "skipped"
+    },
+    {
+        "id": "73",
+        "source_image": "Part2/Swap/73.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the positions and actions of these two people.",
+        "GPT_translation_prompt_cn": "交换这两个人的位置和动作",
+        "GPT_refined_prompt_en": "Swap the positions and actions of these two people.”",
+        "GPT_refined_prompt_cn": "交换这两个人的位置和动作",
+        "prompt_cn": "交换这两个人的位置和动作",
+        "save_id": 1101,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1101.png",
+        "status": "skipped"
+    },
+    {
+        "id": "74",
+        "source_image": "Part2/Swap/74.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the colors of the two traffic lights.",
+        "GPT_translation_prompt_cn": "交换两个信号灯的颜色。",
+        "GPT_refined_prompt_en": "Swap the colors of the two traffic lights.",
+        "GPT_refined_prompt_cn": "交换两个信号灯的颜色。",
+        "prompt_cn": "交换两个信号灯的颜色。",
+        "save_id": 1102,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1102.png",
+        "status": "skipped"
+    },
+    {
+        "id": "75",
+        "source_image": "Part2/Swap/75.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the poses and states of the two cats.",
+        "GPT_translation_prompt_cn": "交换两个猫的动作和状态",
+        "GPT_refined_prompt_en": "Swap the poses and states of the two cats.",
+        "GPT_refined_prompt_cn": "交换两个猫的动作和状态。",
+        "prompt_cn": "交换两个猫的动作和状态。",
+        "save_id": 1103,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1103.png",
+        "status": "skipped"
+    },
+    {
+        "id": "76",
+        "source_image": "Part2/Swap/76.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the objects in the boy’s left and right hands.",
+        "GPT_translation_prompt_cn": "交换男孩左右手拿的物体。",
+        "GPT_refined_prompt_en": "Swap the objects in the boy’s left and right hands.",
+        "GPT_refined_prompt_cn": "交换男孩左右手拿的物体。",
+        "prompt_cn": "交换男孩左右手拿的物体。",
+        "save_id": 1104,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1104.png",
+        "status": "skipped"
+    },
+    {
+        "id": "77",
+        "source_image": "Part2/Swap/77.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the colors and textures of the two cats.",
+        "GPT_translation_prompt_cn": "交换两个猫的颜色和纹理。",
+        "GPT_refined_prompt_en": "Swap the colors and textures of the two cats.",
+        "GPT_refined_prompt_cn": "交换两个猫的颜色和纹理。",
+        "prompt_cn": "交换两个猫的颜色和纹理。",
+        "save_id": 1105,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1105.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Swap/Swap_rank3.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Swap/Swap_rank3.json
new file mode 100644
index 0000000000000000000000000000000000000000..ea28a8e883e74477c72c1ce2dd82d6ec69f261a0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part2/Swap/Swap_rank3.json
@@ -0,0 +1,21 @@
+[
+    {
+        "id": "53",
+        "source_image": "Part2/Swap/53.png",
+        "edit_type": "Swap",
+        "prompt_en": "Swap the liquids in the two cups.",
+        "GPT_translation_prompt_cn": "交换两个杯子里面液体的状态。",
+        "GPT_refined_prompt_en": "Swap the states of the liquids in the two cups.",
+        "GPT_refined_prompt_cn": "交换两个杯子里面液体的状态。",
+        "prompt_cn": "交换两个杯子里面的液体。",
+        "save_id": 1082,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part2/Swap/1082.png",
+        "_merge_order": 45,
+        "status": "success"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1864.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1864.png
new file mode 100644
index 0000000000000000000000000000000000000000..12d5fa03dfd8affd0dff7b78af5b021b689dd934
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1864.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:060b974b6eacef64c3ea98d8928d657dcd791969244d1b31592c6d218fe82c7e
+size 55371
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1866.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1866.png
new file mode 100644
index 0000000000000000000000000000000000000000..32cb0cc12eca76bc6064c60c78217935a0bc0329
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1866.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7e9cb42a995b53133328a6187e71d4927feb7702eb78d28a52d6d31eb56fd0f7
+size 48284
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1868.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1868.png
new file mode 100644
index 0000000000000000000000000000000000000000..e3d578e6680058b6ad69314d47ffea1ec66630db
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1868.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5cc4ffcfae6786ae64b92760a665f73d34cf4163b9ab2da8115a44a7f57a63c8
+size 61228
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1870.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1870.png
new file mode 100644
index 0000000000000000000000000000000000000000..c1043d5b218f4f7a68101a836b3929d1e6e60d25
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1870.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9725f0d7f99bcc6bf3899b20d32c4d1aedf21a61e30f30e2b516dfc508e0f2db
+size 49045
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1872.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1872.png
new file mode 100644
index 0000000000000000000000000000000000000000..2ebe329020385c4107b6dc9b514ecb5809cea341
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1872.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0c0da25346dab6d4e5134db1e1effe55e321b9f2289e781fbaa1c94b24bb4700
+size 53363
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1874.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1874.png
new file mode 100644
index 0000000000000000000000000000000000000000..7680314d5c618f21443fa9532d70af1718dff31c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1874.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:264ff4bf4e1d00d4aa923577e178c1a91b0857f620a562217757841d95879fb7
+size 46978
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1876.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1876.png
new file mode 100644
index 0000000000000000000000000000000000000000..4e47a884df69487ff6272d59a14edc996a0a4063
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1876.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f003858da9cfa20af8088fe43c29817cb32e4f04788dc638434033d567d61283
+size 60587
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1878.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1878.png
new file mode 100644
index 0000000000000000000000000000000000000000..d36b000cee6e468541257c7b521406c3bc832318
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1878.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0e0911e5c79118895747ee052880e824c44532acd6c8af206ad3cdc972f1f33d
+size 43745
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1880.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1880.png
new file mode 100644
index 0000000000000000000000000000000000000000..4f263840be030b1de6452a5afa3900165a2f0156
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1880.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0b3192ce6c4898c219833bb615ee397cff83890e00debb2f916c614d6212eea6
+size 53377
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1882.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1882.png
new file mode 100644
index 0000000000000000000000000000000000000000..59ab70009bdffc5db457ef89d5629894d27ef2a4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1882.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f5eb28a0ccf2b7818e374945276303cdffe105f0b53ba0efcb381507502b19b9
+size 52462
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1884.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1884.png
new file mode 100644
index 0000000000000000000000000000000000000000..14d40579cf6bf23a635029597733a45f27c43df2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1884.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2e9cc0d8ea08b8fe82284f49d95c31dd6a0f816b47132102a47fa4b9b3198b76
+size 51092
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1886.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1886.png
new file mode 100644
index 0000000000000000000000000000000000000000..5b10b80cc0107fd5ad22fa92fbb9bfa0bc12e073
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1886.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f1062f76d3a1d5fb927d5fc0c155266542f692a34e2d5863df024be7e39730aa
+size 51695
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1888.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1888.png
new file mode 100644
index 0000000000000000000000000000000000000000..821a466e25db554ec4194756332b97433fda8738
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1888.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0b05ea5e2b19963850c50dcc1360fc07733574f145504837ceecfe08fed35c51
+size 48647
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1890.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1890.png
new file mode 100644
index 0000000000000000000000000000000000000000..b23e9ef3dc4624138b927b6f319f853a3283709c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1890.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d44801f2b9a34785096eb9a8ef48dd39ed05eda7ca162496c89ad7780a3c8210
+size 54993
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1892.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1892.png
new file mode 100644
index 0000000000000000000000000000000000000000..7872086323b1e911c98c158b94641b867114bcd5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1892.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5b1845ca0d37e39fb71975b656bc6477596f6eb37fc2d85092ed323ca21034da
+size 59515
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1894.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1894.png
new file mode 100644
index 0000000000000000000000000000000000000000..81ef5386b6c4dbb32926c1cbc39b27e7a4a80d9b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1894.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:530207019a4e7b065f918c3b69786e61aac8b7b1a3f8b20867d3b5196a1dfe48
+size 60797
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1896.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1896.png
new file mode 100644
index 0000000000000000000000000000000000000000..4777dd0e3a0ce64c524ece5b6baad34d10f72403
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1896.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e8638fa3cf00043414f98077e673914781e0aa80ef9b5041dca07ee2d95ca997
+size 44488
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1898.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1898.png
new file mode 100644
index 0000000000000000000000000000000000000000..30e125d3085d8c9112c40c9ae5a96d039c7dab02
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1898.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:36936090bb143358ed51a79409b0e3f2ac5c2a5b682f927334ba6f3cf586d463
+size 55784
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1900.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1900.png
new file mode 100644
index 0000000000000000000000000000000000000000..f2394fd28d5fa9fb95bbab6f456d259948814718
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1900.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ed7d5c9e89e95764bc0947cc81b52fa1766f42ae301da71ec24d73a8cad191f9
+size 45907
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1902.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1902.png
new file mode 100644
index 0000000000000000000000000000000000000000..bf558acb35cc67e50d036f3134f632e64620b8f2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1902.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c87111224a03c0da44dc3e84d4fdffe6404e5e3f85fe67f83342d45f30d61c41
+size 60181
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1904.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1904.png
new file mode 100644
index 0000000000000000000000000000000000000000..6179ed2d64a4051aa2ce5b9aa9da97b833189065
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1904.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:47a9f7b2bec83b444b7d4c8cd1946c7e3139d20b4f05e525aea60047e5023661
+size 47315
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1905.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1905.png
new file mode 100644
index 0000000000000000000000000000000000000000..020b2998bf996e17d61929a7281ef957c736e4a9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1905.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e2abf4e388162bfad3feab0a428c39062a6593a0fe5090b5c861c7c48cf26c0c
+size 43889
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1906.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1906.png
new file mode 100644
index 0000000000000000000000000000000000000000..46c1f14112e0c116b74b1a3452cf4b4d75452df0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1906.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:023ff351f01d40a15e98170c4ac7560b46ea74f989630b788a56d25f6997fd08
+size 59238
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1907.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1907.png
new file mode 100644
index 0000000000000000000000000000000000000000..8a14d0efec16540168f0eadb04d0a6ee5f3ab831
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1907.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:102ff18e5264c6775a098de13d4fafaa9f6b9e73fa3f65e1ca91c2db07593d0b
+size 52483
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1908.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1908.png
new file mode 100644
index 0000000000000000000000000000000000000000..0c3bcddf675dfadd20c71a884555a7218151c827
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1908.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e2c40bdcbf50c2d9d3dcabd1993fdf8d1e7dcb920096e5b3615e54d2ad7f950a
+size 51830
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1909.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1909.png
new file mode 100644
index 0000000000000000000000000000000000000000..a6f62b66d436d809fc5a644f0ab764eb1c69cf24
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1909.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dbf57e332762d551d1f54f0fcd40e7b6cf5d50af570166614e0f941ced10b45c
+size 56615
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1910.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1910.png
new file mode 100644
index 0000000000000000000000000000000000000000..cfb10ac697fca72a373e3839950034bde2a86ef0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1910.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:39578ac8bbd816b4d8586c4126d3e26f212e169b765acd4494af219487065817
+size 45383
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1911.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1911.png
new file mode 100644
index 0000000000000000000000000000000000000000..1b17d21204c98e5bf6ec2024bfc2a40d7f1c3bb8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1911.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:23742b6f801957f8b58264a759fcd730f8b2234b9909d673fac31a955801439a
+size 47913
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1912.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1912.png
new file mode 100644
index 0000000000000000000000000000000000000000..014783ce424e2a8a08ed82e2647e36a7e2d7c5a9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1912.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:53fdb4d458fae852582053967cfa438beecc27a56738b033f060d13b7a6fd05e
+size 59760
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1913.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1913.png
new file mode 100644
index 0000000000000000000000000000000000000000..539b56cc6aaeab3aad254ac60749e867f32a0daa
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1913.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f93d7dabacd4c1da277855c8fff4468e803132816208552690c0f5f06b353eab
+size 53407
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1914.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1914.png
new file mode 100644
index 0000000000000000000000000000000000000000..829d712d6f551c8c0e2c9b9a4043d269ab2c0c8e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1914.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6145fd6da05a2285b09e82212b732d7b666f41006fc6dfa3a7208b2787be7a35
+size 51956
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1915.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1915.png
new file mode 100644
index 0000000000000000000000000000000000000000..67eef356d1ccf0998c2f6097f293de72af42f104
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1915.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:71e8ffb0910cabb5db681f016d93417aeaca588b95472ab46c812184cccff640
+size 53574
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1916.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1916.png
new file mode 100644
index 0000000000000000000000000000000000000000..f75617a7b869bda743e41c0b34e32bc9c799b559
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1916.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:53b82374d74028d8485c0ba380b84b93bcb99474580a149ef8e367ff4d2cdae7
+size 50091
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1917.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1917.png
new file mode 100644
index 0000000000000000000000000000000000000000..8dcf84fe0cd940c773946489ac0b1a852acf9e82
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1917.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bcb1921ae11591019acc0e17463dc0a417b3f72c555f18dd5ba0ffe5b24b0b5d
+size 51660
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1918.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1918.png
new file mode 100644
index 0000000000000000000000000000000000000000..f434082351af6ac57f8d2560e3da14e85b71c8ad
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1918.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a6f2a180a8d11584c2f8cc4849b21b57594431610955d6547ae99d76b7e56021
+size 49866
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1919.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1919.png
new file mode 100644
index 0000000000000000000000000000000000000000..2e5083d727dca332378adfb76fba876c4348a326
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1919.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:11b0278cf4f5012de44d90a43dd239cfc71747209daed264e14d77a273a70f18
+size 48173
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1920.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1920.png
new file mode 100644
index 0000000000000000000000000000000000000000..1d2c9cd178a5982ab8ade0e24983f7c566751e60
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1920.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6443237f701b913b71f5c9203de7417a28c0825d4322f870d14800ab20cfc8de
+size 45306
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1921.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1921.png
new file mode 100644
index 0000000000000000000000000000000000000000..7d8318a1b7b481c60ae83b17f7db14fbbbf237e9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1921.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ec31032d9b0ff0931dd713bb53a57c9259ebc4b159bbd3682fea38d2078173b9
+size 47849
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1922.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1922.png
new file mode 100644
index 0000000000000000000000000000000000000000..f81581a42788989dc756044803d084aa08d2e841
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1922.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c73b3c25a1d175e6189bd76a117b30c51bc30809226dd6bf99e76a0fd059e558
+size 51769
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1923.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1923.png
new file mode 100644
index 0000000000000000000000000000000000000000..ad1e967d6a81870d14db8617523936545f41656b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1923.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fb558c9e75edc202e1f07a28833c92d74168af48d1fae5eea951733de724f2c6
+size 52487
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1924.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1924.png
new file mode 100644
index 0000000000000000000000000000000000000000..cc8e4df36c5d50e90eb642ed25fad50e42cd2673
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1924.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:458ab014978df3a63df15db0a484c7fc2f596d0af8fc9a5a5ff23368be828516
+size 58184
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1926.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1926.png
new file mode 100644
index 0000000000000000000000000000000000000000..dabae3590b3f81ef23d30f453c15bb020bdc3b49
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1926.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:68ce1f29ce894897d58bd085af638a26fa15e954c9adacc83e9b0ce6fa042a1b
+size 56710
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1928.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1928.png
new file mode 100644
index 0000000000000000000000000000000000000000..c0781a8a404b319bbb38c2f41ce1932a82267e3a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1928.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6d80e56cb1e7063fc379bfa29af847985a1f187caf1e41f7d4fe09f6d0c7bda1
+size 52653
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1930.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1930.png
new file mode 100644
index 0000000000000000000000000000000000000000..4d2465d7b3722178ad635725f9a29ccca9fc50a3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1930.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:541e4d667e6a409f95cacc7580605f38034dd1f6cfadd32a279a785dd3a1b205
+size 50168
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1932.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1932.png
new file mode 100644
index 0000000000000000000000000000000000000000..243bd91feda78eb4ea0286c0f280f11bd9c4703d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1932.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dc31bf2c84f12a7b7a89d0190dbd2e8a476c7e92b9ef94f57b28422e46d35084
+size 50216
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1934.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1934.png
new file mode 100644
index 0000000000000000000000000000000000000000..3f4671dad0f63bee07dce55fadef5bb0b16ae298
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1934.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:60b97cded50f1b34cdd207dcc722f8bdb819b42425deb49db3ddd8fea15e4689
+size 46639
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1936.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1936.png
new file mode 100644
index 0000000000000000000000000000000000000000..bba6bea46b8100bdb6ea13e1183d7911e45fce49
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1936.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b5f4b8932508c1e7cf58216ff5fbe54e32451a02e780b60f53c04dbae22220ca
+size 57248
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1938.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1938.png
new file mode 100644
index 0000000000000000000000000000000000000000..dc453cdffcaa7e8c296b8339799a232244b96c05
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1938.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:812508e01a8908a981fa5a33b2b8c19ca31357ee94bb95c9dc4af76329c0a457
+size 59147
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1940.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1940.png
new file mode 100644
index 0000000000000000000000000000000000000000..acef8e567a307ade05a36302a9e1804d85a71c08
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1940.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bc845aba1fd4b74b8917c584790eecf452d95b1e4dae5e2bf286db6bf15ce6d4
+size 52994
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1942.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1942.png
new file mode 100644
index 0000000000000000000000000000000000000000..e0d86bf09a1efa475c082375d1b9ff3504179e55
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1942.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:56525ced89deac7bdc8c969dda50301e81afb6c47e7fc0b8e829f3170e2451f7
+size 46476
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1944.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1944.png
new file mode 100644
index 0000000000000000000000000000000000000000..494d9464303048ce1fa6380567f7583496d27beb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1944.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:57d4e49a85ca39a373e1f70021c265c6d9b3db68f1d09085eb7a3ba11c473138
+size 56070
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1946.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1946.png
new file mode 100644
index 0000000000000000000000000000000000000000..ccd51f0d7a9025e0da03a64d1e1f808a99669eb8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1946.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:77e1b4206e0e13a463ad10be9984d5f92ce33ba202dc7d46d1cc2ccd4017bd7c
+size 51378
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1948.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1948.png
new file mode 100644
index 0000000000000000000000000000000000000000..434afe259060da5168ce793691c640804edee662
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1948.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3769d069731559fd5dc57a46beabc02064d1892aa76276843b87826ed9a28e73
+size 49591
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1950.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1950.png
new file mode 100644
index 0000000000000000000000000000000000000000..a80a6ba98c536bf74b8941507dcc5869e382fd22
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1950.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8c6ff5229e7204a427f78e167c924dda9d9a68fb2eb8f36ef6f267a5227f789f
+size 58811
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1952.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1952.png
new file mode 100644
index 0000000000000000000000000000000000000000..495843f7d83ac6d47833221ad72d661881e5cbdb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1952.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5a7fc9c734f6031759e1845d791c8763e12d8079717c682c55a7c1379c9337cc
+size 59044
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1954.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1954.png
new file mode 100644
index 0000000000000000000000000000000000000000..a045ed54d45c2a2f61cb4d2e5ee721f7e9f32da0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1954.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8e087550bdfa6cefb869304c1c14145fa434cb1241ce6fafbf68d6affc143cb6
+size 45420
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1956.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1956.png
new file mode 100644
index 0000000000000000000000000000000000000000..22bea859014bcef86de85dc3488067aa17e79a98
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1956.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:00714673b6ae024a3493f317ecf3d71a1884e84386aa60d69c90fec9c3d8ff0a
+size 53319
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1958.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1958.png
new file mode 100644
index 0000000000000000000000000000000000000000..cdb75c5ea041373031b3231c14afe3cb6dc76dd6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1958.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b31471b4b6fa0a0353c93853aab3061f1b6ed354905bba310832f510b3ba15cc
+size 48633
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1960.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1960.png
new file mode 100644
index 0000000000000000000000000000000000000000..660ec135821f043556121f65bab2e805c0eb4b3d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1960.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c764922f208ee5093bd2690b21ff7f2180a3040454feb9b51dd36dbd6a8ebab8
+size 50662
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1962.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1962.png
new file mode 100644
index 0000000000000000000000000000000000000000..cf90d6bd3b619b0d5cfd25a4340251ceca22ebc1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/1962.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9bf364ead21375c800b227970d90ac9e183cb8d474270cb3f2e082f8913623a4
+size 53137
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/Bag.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/Bag.json
new file mode 100644
index 0000000000000000000000000000000000000000..e645f0b8df34bbfb1344111df124c97cd2a0bb62
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Bag/Bag.json
@@ -0,0 +1,3962 @@
+[
+    {
+        "id": "knap_000",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 10, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 10，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 10,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 4,
+                    "value": 46,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 3,
+                    "value": 11,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 8,
+                    "value": 16,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 4,
+                    "value": 21,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 2,
+                    "value": 41,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 3,
+                    "value": 26,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 8,
+                    "value": 37,
+                    "selected": false
+                },
+                {
+                    "item_id": 8,
+                    "weight": 8,
+                    "value": 16,
+                    "selected": false
+                }
+            ],
+            "total_weight": 9,
+            "total_value": 113
+        },
+        "input_image": "dataset_knapsack_fixed/knap_000_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_000_result.jpg",
+        "source_image": "Part4/Bag/knap_000_input.jpg",
+        "save_id": 1864,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1864.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_002",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 11, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 11，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 11,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 7,
+                    "value": 29,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 2,
+                    "value": 26,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 5,
+                    "value": 27,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 2,
+                    "value": 24,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 3,
+                    "value": 36,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 4,
+                    "value": 20,
+                    "selected": true
+                }
+            ],
+            "total_weight": 11,
+            "total_value": 106
+        },
+        "input_image": "dataset_knapsack_fixed/knap_002_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_002_result.jpg",
+        "source_image": "Part4/Bag/knap_002_input.jpg",
+        "save_id": 1866,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1866.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_004",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 17, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 17，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 17,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 4,
+                    "value": 12,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 5,
+                    "value": 50,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 6,
+                    "value": 41,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 2,
+                    "value": 22,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 3,
+                    "value": 16,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 2,
+                    "value": 25,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 6,
+                    "value": 19,
+                    "selected": false
+                },
+                {
+                    "item_id": 8,
+                    "weight": 7,
+                    "value": 27,
+                    "selected": false
+                }
+            ],
+            "total_weight": 15,
+            "total_value": 138
+        },
+        "input_image": "dataset_knapsack_fixed/knap_004_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_004_result.jpg",
+        "source_image": "Part4/Bag/knap_004_input.jpg",
+        "save_id": 1868,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1868.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_006",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 20, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 20，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 20,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 8,
+                    "value": 12,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 8,
+                    "value": 40,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 8,
+                    "value": 28,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 8,
+                    "value": 36,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 2,
+                    "value": 42,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 6,
+                    "value": 36,
+                    "selected": false
+                }
+            ],
+            "total_weight": 18,
+            "total_value": 118
+        },
+        "input_image": "dataset_knapsack_fixed/knap_006_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_006_result.jpg",
+        "source_image": "Part4/Bag/knap_006_input.jpg",
+        "save_id": 1870,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1870.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_008",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 12, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 12，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 12,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 7,
+                    "value": 16,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 7,
+                    "value": 45,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 6,
+                    "value": 45,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 2,
+                    "value": 32,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 7,
+                    "value": 30,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 3,
+                    "value": 21,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 3,
+                    "value": 36,
+                    "selected": true
+                }
+            ],
+            "total_weight": 12,
+            "total_value": 113
+        },
+        "input_image": "dataset_knapsack_fixed/knap_008_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_008_result.jpg",
+        "source_image": "Part4/Bag/knap_008_input.jpg",
+        "save_id": 1872,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1872.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_010",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 15, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 15，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 15,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 2,
+                    "value": 46,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 7,
+                    "value": 22,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 8,
+                    "value": 10,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 2,
+                    "value": 16,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 6,
+                    "value": 34,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 2,
+                    "value": 41,
+                    "selected": true
+                }
+            ],
+            "total_weight": 12,
+            "total_value": 137
+        },
+        "input_image": "dataset_knapsack_fixed/knap_010_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_010_result.jpg",
+        "source_image": "Part4/Bag/knap_010_input.jpg",
+        "save_id": 1874,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1874.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_012",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 16, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 16，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 16,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 6,
+                    "value": 29,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 2,
+                    "value": 30,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 3,
+                    "value": 35,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 2,
+                    "value": 46,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 3,
+                    "value": 26,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 4,
+                    "value": 20,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 2,
+                    "value": 10,
+                    "selected": true
+                },
+                {
+                    "item_id": 8,
+                    "weight": 3,
+                    "value": 32,
+                    "selected": true
+                }
+            ],
+            "total_weight": 15,
+            "total_value": 179
+        },
+        "input_image": "dataset_knapsack_fixed/knap_012_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_012_result.jpg",
+        "source_image": "Part4/Bag/knap_012_input.jpg",
+        "save_id": 1876,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1876.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_014",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 16, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 16，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 16,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 7,
+                    "value": 10,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 23,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 7,
+                    "value": 31,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 6,
+                    "value": 11,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 6,
+                    "value": 47,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 6,
+                    "value": 29,
+                    "selected": false
+                }
+            ],
+            "total_weight": 13,
+            "total_value": 78
+        },
+        "input_image": "dataset_knapsack_fixed/knap_014_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_014_result.jpg",
+        "source_image": "Part4/Bag/knap_014_input.jpg",
+        "save_id": 1878,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1878.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_016",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 15, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 15，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 15,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 4,
+                    "value": 31,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 27,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 5,
+                    "value": 20,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 5,
+                    "value": 32,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 7,
+                    "value": 15,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 2,
+                    "value": 40,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 8,
+                    "value": 34,
+                    "selected": true
+                }
+            ],
+            "total_weight": 15,
+            "total_value": 106
+        },
+        "input_image": "dataset_knapsack_fixed/knap_016_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_016_result.jpg",
+        "source_image": "Part4/Bag/knap_016_input.jpg",
+        "save_id": 1880,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1880.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_018",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 17, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 17，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 17,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 8,
+                    "value": 17,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 30,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 2,
+                    "value": 23,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 4,
+                    "value": 27,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 3,
+                    "value": 27,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 7,
+                    "value": 10,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 5,
+                    "value": 44,
+                    "selected": true
+                }
+            ],
+            "total_weight": 17,
+            "total_value": 124
+        },
+        "input_image": "dataset_knapsack_fixed/knap_018_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_018_result.jpg",
+        "source_image": "Part4/Bag/knap_018_input.jpg",
+        "save_id": 1882,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1882.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_020",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 17, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 17，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 17,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 7,
+                    "value": 44,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 7,
+                    "value": 38,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 4,
+                    "value": 15,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 2,
+                    "value": 21,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 8,
+                    "value": 41,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 5,
+                    "value": 46,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 7,
+                    "value": 23,
+                    "selected": false
+                }
+            ],
+            "total_weight": 14,
+            "total_value": 111
+        },
+        "input_image": "dataset_knapsack_fixed/knap_020_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_020_result.jpg",
+        "source_image": "Part4/Bag/knap_020_input.jpg",
+        "save_id": 1884,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1884.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_022",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 14, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 14，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 14,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 7,
+                    "value": 18,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 8,
+                    "value": 19,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 6,
+                    "value": 23,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 2,
+                    "value": 34,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 5,
+                    "value": 19,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 2,
+                    "value": 44,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 6,
+                    "value": 47,
+                    "selected": true
+                }
+            ],
+            "total_weight": 10,
+            "total_value": 125
+        },
+        "input_image": "dataset_knapsack_fixed/knap_022_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_022_result.jpg",
+        "source_image": "Part4/Bag/knap_022_input.jpg",
+        "save_id": 1886,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1886.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_024",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 18, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 18，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 18,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 7,
+                    "value": 38,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 4,
+                    "value": 13,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 6,
+                    "value": 26,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 5,
+                    "value": 15,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 7,
+                    "value": 47,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 8,
+                    "value": 14,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 6,
+                    "value": 41,
+                    "selected": true
+                }
+            ],
+            "total_weight": 18,
+            "total_value": 103
+        },
+        "input_image": "dataset_knapsack_fixed/knap_024_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_024_result.jpg",
+        "source_image": "Part4/Bag/knap_024_input.jpg",
+        "save_id": 1888,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1888.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_026",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 17, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 17，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 17,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 2,
+                    "value": 32,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 5,
+                    "value": 38,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 4,
+                    "value": 15,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 5,
+                    "value": 48,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 3,
+                    "value": 18,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 8,
+                    "value": 13,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 4,
+                    "value": 21,
+                    "selected": true
+                }
+            ],
+            "total_weight": 16,
+            "total_value": 139
+        },
+        "input_image": "dataset_knapsack_fixed/knap_026_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_026_result.jpg",
+        "source_image": "Part4/Bag/knap_026_input.jpg",
+        "save_id": 1890,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1890.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_028",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 16, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 16，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 16,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 8,
+                    "value": 44,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 48,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 4,
+                    "value": 15,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 4,
+                    "value": 50,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 4,
+                    "value": 10,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 5,
+                    "value": 37,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 2,
+                    "value": 46,
+                    "selected": true
+                },
+                {
+                    "item_id": 8,
+                    "weight": 3,
+                    "value": 17,
+                    "selected": true
+                }
+            ],
+            "total_weight": 15,
+            "total_value": 161
+        },
+        "input_image": "dataset_knapsack_fixed/knap_028_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_028_result.jpg",
+        "source_image": "Part4/Bag/knap_028_input.jpg",
+        "save_id": 1892,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1892.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_030",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 12, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 12，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 12,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 3,
+                    "value": 15,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 8,
+                    "value": 36,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 7,
+                    "value": 42,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 5,
+                    "value": 21,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 8,
+                    "value": 21,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 7,
+                    "value": 30,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 3,
+                    "value": 50,
+                    "selected": true
+                },
+                {
+                    "item_id": 8,
+                    "weight": 2,
+                    "value": 43,
+                    "selected": true
+                }
+            ],
+            "total_weight": 12,
+            "total_value": 135
+        },
+        "input_image": "dataset_knapsack_fixed/knap_030_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_030_result.jpg",
+        "source_image": "Part4/Bag/knap_030_input.jpg",
+        "save_id": 1894,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1894.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_032",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 11, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 11，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 11,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 4,
+                    "value": 16,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 8,
+                    "value": 23,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 2,
+                    "value": 16,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 3,
+                    "value": 32,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 7,
+                    "value": 38,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 5,
+                    "value": 49,
+                    "selected": true
+                }
+            ],
+            "total_weight": 10,
+            "total_value": 97
+        },
+        "input_image": "dataset_knapsack_fixed/knap_032_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_032_result.jpg",
+        "source_image": "Part4/Bag/knap_032_input.jpg",
+        "save_id": 1896,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1896.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_034",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 14, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 14，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 14,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 5,
+                    "value": 39,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 47,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 6,
+                    "value": 50,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 4,
+                    "value": 40,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 5,
+                    "value": 31,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 8,
+                    "value": 37,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 4,
+                    "value": 48,
+                    "selected": true
+                },
+                {
+                    "item_id": 8,
+                    "weight": 7,
+                    "value": 18,
+                    "selected": false
+                }
+            ],
+            "total_weight": 14,
+            "total_value": 138
+        },
+        "input_image": "dataset_knapsack_fixed/knap_034_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_034_result.jpg",
+        "source_image": "Part4/Bag/knap_034_input.jpg",
+        "save_id": 1898,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1898.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_036",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 11, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 11，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 11,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 2,
+                    "value": 22,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 7,
+                    "value": 13,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 7,
+                    "value": 40,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 3,
+                    "value": 35,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 7,
+                    "value": 41,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 8,
+                    "value": 38,
+                    "selected": false
+                }
+            ],
+            "total_weight": 10,
+            "total_value": 76
+        },
+        "input_image": "dataset_knapsack_fixed/knap_036_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_036_result.jpg",
+        "source_image": "Part4/Bag/knap_036_input.jpg",
+        "save_id": 1900,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1900.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_038",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 20, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 20，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 20,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 4,
+                    "value": 32,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 5,
+                    "value": 26,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 2,
+                    "value": 48,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 6,
+                    "value": 43,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 3,
+                    "value": 17,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 8,
+                    "value": 23,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 4,
+                    "value": 50,
+                    "selected": true
+                },
+                {
+                    "item_id": 8,
+                    "weight": 4,
+                    "value": 44,
+                    "selected": true
+                }
+            ],
+            "total_weight": 20,
+            "total_value": 217
+        },
+        "input_image": "dataset_knapsack_fixed/knap_038_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_038_result.jpg",
+        "source_image": "Part4/Bag/knap_038_input.jpg",
+        "save_id": 1902,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1902.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_040",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 15, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 15，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 15,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 7,
+                    "value": 43,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 7,
+                    "value": 30,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 7,
+                    "value": 18,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 3,
+                    "value": 21,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 8,
+                    "value": 24,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 6,
+                    "value": 33,
+                    "selected": true
+                }
+            ],
+            "total_weight": 13,
+            "total_value": 76
+        },
+        "input_image": "dataset_knapsack_fixed/knap_040_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_040_result.jpg",
+        "source_image": "Part4/Bag/knap_040_input.jpg",
+        "save_id": 1904,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1904.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_041",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 17, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 17，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 17,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 2,
+                    "value": 28,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 26,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 8,
+                    "value": 20,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 7,
+                    "value": 44,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 7,
+                    "value": 44,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 2,
+                    "value": 33,
+                    "selected": true
+                }
+            ],
+            "total_weight": 17,
+            "total_value": 131
+        },
+        "input_image": "dataset_knapsack_fixed/knap_041_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_041_result.jpg",
+        "source_image": "Part4/Bag/knap_041_input.jpg",
+        "save_id": 1905,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1905.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_042",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 19, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 19，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 19,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 7,
+                    "value": 16,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 47,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 5,
+                    "value": 45,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 8,
+                    "value": 48,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 4,
+                    "value": 48,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 5,
+                    "value": 27,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 7,
+                    "value": 11,
+                    "selected": false
+                },
+                {
+                    "item_id": 8,
+                    "weight": 3,
+                    "value": 32,
+                    "selected": true
+                }
+            ],
+            "total_weight": 18,
+            "total_value": 172
+        },
+        "input_image": "dataset_knapsack_fixed/knap_042_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_042_result.jpg",
+        "source_image": "Part4/Bag/knap_042_input.jpg",
+        "save_id": 1906,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1906.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_043",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 12, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 12，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 12,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 4,
+                    "value": 34,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 5,
+                    "value": 22,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 5,
+                    "value": 17,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 6,
+                    "value": 36,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 3,
+                    "value": 24,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 6,
+                    "value": 36,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 4,
+                    "value": 17,
+                    "selected": false
+                }
+            ],
+            "total_weight": 12,
+            "total_value": 80
+        },
+        "input_image": "dataset_knapsack_fixed/knap_043_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_043_result.jpg",
+        "source_image": "Part4/Bag/knap_043_input.jpg",
+        "save_id": 1907,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1907.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_044",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 10, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 10，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 10,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 5,
+                    "value": 11,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 5,
+                    "value": 21,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 7,
+                    "value": 17,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 7,
+                    "value": 43,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 8,
+                    "value": 46,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 7,
+                    "value": 11,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 8,
+                    "value": 39,
+                    "selected": false
+                }
+            ],
+            "total_weight": 8,
+            "total_value": 46
+        },
+        "input_image": "dataset_knapsack_fixed/knap_044_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_044_result.jpg",
+        "source_image": "Part4/Bag/knap_044_input.jpg",
+        "save_id": 1908,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1908.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_045",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 10, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 10，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 10,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 3,
+                    "value": 18,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 2,
+                    "value": 26,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 6,
+                    "value": 42,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 3,
+                    "value": 42,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 5,
+                    "value": 49,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 8,
+                    "value": 36,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 8,
+                    "value": 16,
+                    "selected": false
+                },
+                {
+                    "item_id": 8,
+                    "weight": 8,
+                    "value": 18,
+                    "selected": false
+                }
+            ],
+            "total_weight": 10,
+            "total_value": 117
+        },
+        "input_image": "dataset_knapsack_fixed/knap_045_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_045_result.jpg",
+        "source_image": "Part4/Bag/knap_045_input.jpg",
+        "save_id": 1909,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1909.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_046",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 17, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 17，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 17,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 5,
+                    "value": 23,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 3,
+                    "value": 48,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 6,
+                    "value": 35,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 7,
+                    "value": 25,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 3,
+                    "value": 10,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 7,
+                    "value": 43,
+                    "selected": true
+                }
+            ],
+            "total_weight": 16,
+            "total_value": 126
+        },
+        "input_image": "dataset_knapsack_fixed/knap_046_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_046_result.jpg",
+        "source_image": "Part4/Bag/knap_046_input.jpg",
+        "save_id": 1910,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1910.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_047",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 20, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 20，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 20,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 5,
+                    "value": 14,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 13,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 6,
+                    "value": 11,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 3,
+                    "value": 27,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 2,
+                    "value": 38,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 8,
+                    "value": 47,
+                    "selected": true
+                }
+            ],
+            "total_weight": 18,
+            "total_value": 126
+        },
+        "input_image": "dataset_knapsack_fixed/knap_047_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_047_result.jpg",
+        "source_image": "Part4/Bag/knap_047_input.jpg",
+        "save_id": 1911,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1911.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_048",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 10, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 10，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 10,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 5,
+                    "value": 44,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 2,
+                    "value": 21,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 4,
+                    "value": 10,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 8,
+                    "value": 29,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 6,
+                    "value": 35,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 3,
+                    "value": 34,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 7,
+                    "value": 22,
+                    "selected": false
+                },
+                {
+                    "item_id": 8,
+                    "weight": 6,
+                    "value": 21,
+                    "selected": false
+                }
+            ],
+            "total_weight": 10,
+            "total_value": 99
+        },
+        "input_image": "dataset_knapsack_fixed/knap_048_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_048_result.jpg",
+        "source_image": "Part4/Bag/knap_048_input.jpg",
+        "save_id": 1912,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1912.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_049",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 19, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 19，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 19,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 3,
+                    "value": 50,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 7,
+                    "value": 13,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 3,
+                    "value": 19,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 6,
+                    "value": 32,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 8,
+                    "value": 25,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 4,
+                    "value": 49,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 2,
+                    "value": 32,
+                    "selected": true
+                }
+            ],
+            "total_weight": 18,
+            "total_value": 182
+        },
+        "input_image": "dataset_knapsack_fixed/knap_049_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_049_result.jpg",
+        "source_image": "Part4/Bag/knap_049_input.jpg",
+        "save_id": 1913,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1913.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_050",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 17, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 17，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 17,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 5,
+                    "value": 46,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 2,
+                    "value": 18,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 3,
+                    "value": 30,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 7,
+                    "value": 12,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 6,
+                    "value": 16,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 4,
+                    "value": 19,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 3,
+                    "value": 19,
+                    "selected": true
+                }
+            ],
+            "total_weight": 17,
+            "total_value": 132
+        },
+        "input_image": "dataset_knapsack_fixed/knap_050_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_050_result.jpg",
+        "source_image": "Part4/Bag/knap_050_input.jpg",
+        "save_id": 1914,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1914.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_051",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 15, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 15，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 15,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 3,
+                    "value": 31,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 8,
+                    "value": 13,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 8,
+                    "value": 24,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 6,
+                    "value": 27,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 6,
+                    "value": 45,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 4,
+                    "value": 24,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 2,
+                    "value": 29,
+                    "selected": true
+                }
+            ],
+            "total_weight": 15,
+            "total_value": 129
+        },
+        "input_image": "dataset_knapsack_fixed/knap_051_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_051_result.jpg",
+        "source_image": "Part4/Bag/knap_051_input.jpg",
+        "save_id": 1915,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1915.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_052",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 16, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 16，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 16,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 6,
+                    "value": 43,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 5,
+                    "value": 49,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 7,
+                    "value": 42,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 6,
+                    "value": 33,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 7,
+                    "value": 31,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 2,
+                    "value": 21,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 5,
+                    "value": 15,
+                    "selected": false
+                }
+            ],
+            "total_weight": 13,
+            "total_value": 113
+        },
+        "input_image": "dataset_knapsack_fixed/knap_052_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_052_result.jpg",
+        "source_image": "Part4/Bag/knap_052_input.jpg",
+        "save_id": 1916,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1916.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_053",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 14, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 14，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 14,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 2,
+                    "value": 17,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 4,
+                    "value": 36,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 6,
+                    "value": 32,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 4,
+                    "value": 36,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 5,
+                    "value": 23,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 4,
+                    "value": 43,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 7,
+                    "value": 17,
+                    "selected": false
+                }
+            ],
+            "total_weight": 14,
+            "total_value": 132
+        },
+        "input_image": "dataset_knapsack_fixed/knap_053_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_053_result.jpg",
+        "source_image": "Part4/Bag/knap_053_input.jpg",
+        "save_id": 1917,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1917.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_054",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 19, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 19，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 19,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 3,
+                    "value": 30,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 4,
+                    "value": 33,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 3,
+                    "value": 12,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 7,
+                    "value": 12,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 4,
+                    "value": 12,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 3,
+                    "value": 22,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 8,
+                    "value": 45,
+                    "selected": true
+                }
+            ],
+            "total_weight": 18,
+            "total_value": 130
+        },
+        "input_image": "dataset_knapsack_fixed/knap_054_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_054_result.jpg",
+        "source_image": "Part4/Bag/knap_054_input.jpg",
+        "save_id": 1918,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1918.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_055",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 12, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 12，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 12,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 3,
+                    "value": 47,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 4,
+                    "value": 12,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 7,
+                    "value": 26,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 3,
+                    "value": 34,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 8,
+                    "value": 29,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 8,
+                    "value": 15,
+                    "selected": false
+                }
+            ],
+            "total_weight": 10,
+            "total_value": 93
+        },
+        "input_image": "dataset_knapsack_fixed/knap_055_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_055_result.jpg",
+        "source_image": "Part4/Bag/knap_055_input.jpg",
+        "save_id": 1919,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1919.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_056",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 16, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 16，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 16,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 6,
+                    "value": 21,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 3,
+                    "value": 40,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 2,
+                    "value": 45,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 6,
+                    "value": 13,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 5,
+                    "value": 14,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 7,
+                    "value": 50,
+                    "selected": true
+                }
+            ],
+            "total_weight": 12,
+            "total_value": 135
+        },
+        "input_image": "dataset_knapsack_fixed/knap_056_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_056_result.jpg",
+        "source_image": "Part4/Bag/knap_056_input.jpg",
+        "save_id": 1920,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1920.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_057",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 10, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 10，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 10,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 4,
+                    "value": 49,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 5,
+                    "value": 27,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 8,
+                    "value": 25,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 3,
+                    "value": 22,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 7,
+                    "value": 22,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 4,
+                    "value": 14,
+                    "selected": false
+                }
+            ],
+            "total_weight": 9,
+            "total_value": 76
+        },
+        "input_image": "dataset_knapsack_fixed/knap_057_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_057_result.jpg",
+        "source_image": "Part4/Bag/knap_057_input.jpg",
+        "save_id": 1921,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1921.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_058",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 13, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 13，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 13,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 4,
+                    "value": 18,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 23,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 7,
+                    "value": 21,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 2,
+                    "value": 28,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 3,
+                    "value": 13,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 5,
+                    "value": 31,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 6,
+                    "value": 26,
+                    "selected": true
+                }
+            ],
+            "total_weight": 13,
+            "total_value": 85
+        },
+        "input_image": "dataset_knapsack_fixed/knap_058_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_058_result.jpg",
+        "source_image": "Part4/Bag/knap_058_input.jpg",
+        "save_id": 1922,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1922.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_059",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 15, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 15，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 15,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 2,
+                    "value": 46,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 8,
+                    "value": 49,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 7,
+                    "value": 34,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 3,
+                    "value": 28,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 2,
+                    "value": 39,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 6,
+                    "value": 44,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 8,
+                    "value": 23,
+                    "selected": false
+                }
+            ],
+            "total_weight": 15,
+            "total_value": 162
+        },
+        "input_image": "dataset_knapsack_fixed/knap_059_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_059_result.jpg",
+        "source_image": "Part4/Bag/knap_059_input.jpg",
+        "save_id": 1923,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1923.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_060",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 19, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 19，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 19,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 7,
+                    "value": 17,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 8,
+                    "value": 45,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 4,
+                    "value": 33,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 5,
+                    "value": 20,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 8,
+                    "value": 22,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 7,
+                    "value": 49,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 4,
+                    "value": 49,
+                    "selected": true
+                },
+                {
+                    "item_id": 8,
+                    "weight": 2,
+                    "value": 47,
+                    "selected": true
+                }
+            ],
+            "total_weight": 17,
+            "total_value": 178
+        },
+        "input_image": "dataset_knapsack_fixed/knap_060_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_060_result.jpg",
+        "source_image": "Part4/Bag/knap_060_input.jpg",
+        "save_id": 1924,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1924.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_062",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 20, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 20，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 20,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 6,
+                    "value": 25,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 4,
+                    "value": 33,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 3,
+                    "value": 37,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 2,
+                    "value": 32,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 2,
+                    "value": 28,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 3,
+                    "value": 31,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 5,
+                    "value": 49,
+                    "selected": true
+                },
+                {
+                    "item_id": 8,
+                    "weight": 4,
+                    "value": 23,
+                    "selected": false
+                }
+            ],
+            "total_weight": 19,
+            "total_value": 210
+        },
+        "input_image": "dataset_knapsack_fixed/knap_062_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_062_result.jpg",
+        "source_image": "Part4/Bag/knap_062_input.jpg",
+        "save_id": 1926,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1926.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_064",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 16, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 16，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 16,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 5,
+                    "value": 28,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 4,
+                    "value": 22,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 2,
+                    "value": 10,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 3,
+                    "value": 41,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 5,
+                    "value": 48,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 2,
+                    "value": 50,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 6,
+                    "value": 27,
+                    "selected": false
+                }
+            ],
+            "total_weight": 16,
+            "total_value": 171
+        },
+        "input_image": "dataset_knapsack_fixed/knap_064_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_064_result.jpg",
+        "source_image": "Part4/Bag/knap_064_input.jpg",
+        "save_id": 1928,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1928.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_066",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 14, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 14，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 14,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 3,
+                    "value": 47,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 8,
+                    "value": 32,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 3,
+                    "value": 25,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 7,
+                    "value": 13,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 7,
+                    "value": 25,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 6,
+                    "value": 15,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 4,
+                    "value": 28,
+                    "selected": false
+                }
+            ],
+            "total_weight": 14,
+            "total_value": 104
+        },
+        "input_image": "dataset_knapsack_fixed/knap_066_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_066_result.jpg",
+        "source_image": "Part4/Bag/knap_066_input.jpg",
+        "save_id": 1930,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1930.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_068",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 13, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 13，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 13,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 5,
+                    "value": 29,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 4,
+                    "value": 36,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 8,
+                    "value": 49,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 8,
+                    "value": 45,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 3,
+                    "value": 41,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 8,
+                    "value": 17,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 2,
+                    "value": 49,
+                    "selected": true
+                }
+            ],
+            "total_weight": 13,
+            "total_value": 139
+        },
+        "input_image": "dataset_knapsack_fixed/knap_068_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_068_result.jpg",
+        "source_image": "Part4/Bag/knap_068_input.jpg",
+        "save_id": 1932,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1932.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_070",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 15, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 15，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 15,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 7,
+                    "value": 25,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 7,
+                    "value": 17,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 3,
+                    "value": 31,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 8,
+                    "value": 37,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 8,
+                    "value": 26,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 5,
+                    "value": 26,
+                    "selected": true
+                }
+            ],
+            "total_weight": 15,
+            "total_value": 82
+        },
+        "input_image": "dataset_knapsack_fixed/knap_070_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_070_result.jpg",
+        "source_image": "Part4/Bag/knap_070_input.jpg",
+        "save_id": 1934,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1934.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_072",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 12, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 12，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 12,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 6,
+                    "value": 48,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 4,
+                    "value": 42,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 3,
+                    "value": 49,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 2,
+                    "value": 32,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 6,
+                    "value": 16,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 3,
+                    "value": 10,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 5,
+                    "value": 30,
+                    "selected": false
+                },
+                {
+                    "item_id": 8,
+                    "weight": 6,
+                    "value": 33,
+                    "selected": false
+                }
+            ],
+            "total_weight": 12,
+            "total_value": 133
+        },
+        "input_image": "dataset_knapsack_fixed/knap_072_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_072_result.jpg",
+        "source_image": "Part4/Bag/knap_072_input.jpg",
+        "save_id": 1936,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1936.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_074",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 20, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 20，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 20,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 6,
+                    "value": 18,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 20,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 3,
+                    "value": 13,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 8,
+                    "value": 45,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 6,
+                    "value": 45,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 3,
+                    "value": 47,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 5,
+                    "value": 26,
+                    "selected": true
+                },
+                {
+                    "item_id": 8,
+                    "weight": 5,
+                    "value": 42,
+                    "selected": true
+                }
+            ],
+            "total_weight": 19,
+            "total_value": 160
+        },
+        "input_image": "dataset_knapsack_fixed/knap_074_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_074_result.jpg",
+        "source_image": "Part4/Bag/knap_074_input.jpg",
+        "save_id": 1938,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1938.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_076",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 19, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 19，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 19,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 5,
+                    "value": 31,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 7,
+                    "value": 17,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 2,
+                    "value": 11,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 6,
+                    "value": 47,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 7,
+                    "value": 44,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 7,
+                    "value": 50,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 3,
+                    "value": 24,
+                    "selected": true
+                }
+            ],
+            "total_weight": 18,
+            "total_value": 132
+        },
+        "input_image": "dataset_knapsack_fixed/knap_076_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_076_result.jpg",
+        "source_image": "Part4/Bag/knap_076_input.jpg",
+        "save_id": 1940,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1940.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_078",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 20, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 20，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 20,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 7,
+                    "value": 14,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 5,
+                    "value": 20,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 7,
+                    "value": 12,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 5,
+                    "value": 30,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 8,
+                    "value": 28,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 8,
+                    "value": 39,
+                    "selected": true
+                }
+            ],
+            "total_weight": 18,
+            "total_value": 89
+        },
+        "input_image": "dataset_knapsack_fixed/knap_078_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_078_result.jpg",
+        "source_image": "Part4/Bag/knap_078_input.jpg",
+        "save_id": 1942,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1942.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_080",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 14, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 14，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 14,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 7,
+                    "value": 14,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 27,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 7,
+                    "value": 36,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 8,
+                    "value": 11,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 3,
+                    "value": 10,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 2,
+                    "value": 12,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 8,
+                    "value": 44,
+                    "selected": true
+                },
+                {
+                    "item_id": 8,
+                    "weight": 5,
+                    "value": 20,
+                    "selected": false
+                }
+            ],
+            "total_weight": 14,
+            "total_value": 71
+        },
+        "input_image": "dataset_knapsack_fixed/knap_080_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_080_result.jpg",
+        "source_image": "Part4/Bag/knap_080_input.jpg",
+        "save_id": 1944,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1944.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_082",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 20, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 20，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 20,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 6,
+                    "value": 39,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 3,
+                    "value": 15,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 4,
+                    "value": 15,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 2,
+                    "value": 22,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 3,
+                    "value": 48,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 8,
+                    "value": 50,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 3,
+                    "value": 16,
+                    "selected": false
+                }
+            ],
+            "total_weight": 19,
+            "total_value": 159
+        },
+        "input_image": "dataset_knapsack_fixed/knap_082_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_082_result.jpg",
+        "source_image": "Part4/Bag/knap_082_input.jpg",
+        "save_id": 1946,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1946.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_084",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 18, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 18，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 18,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 4,
+                    "value": 27,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 7,
+                    "value": 14,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 3,
+                    "value": 41,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 8,
+                    "value": 10,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 2,
+                    "value": 27,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 7,
+                    "value": 38,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 3,
+                    "value": 38,
+                    "selected": true
+                }
+            ],
+            "total_weight": 17,
+            "total_value": 144
+        },
+        "input_image": "dataset_knapsack_fixed/knap_084_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_084_result.jpg",
+        "source_image": "Part4/Bag/knap_084_input.jpg",
+        "save_id": 1948,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1948.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_086",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 19, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 19，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 19,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 6,
+                    "value": 46,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 3,
+                    "value": 43,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 2,
+                    "value": 41,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 4,
+                    "value": 15,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 8,
+                    "value": 29,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 4,
+                    "value": 11,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 4,
+                    "value": 29,
+                    "selected": false
+                },
+                {
+                    "item_id": 8,
+                    "weight": 8,
+                    "value": 46,
+                    "selected": true
+                }
+            ],
+            "total_weight": 19,
+            "total_value": 176
+        },
+        "input_image": "dataset_knapsack_fixed/knap_086_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_086_result.jpg",
+        "source_image": "Part4/Bag/knap_086_input.jpg",
+        "save_id": 1950,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1950.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_088",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 12, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 12，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 12,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 8,
+                    "value": 14,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 2,
+                    "value": 10,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 5,
+                    "value": 27,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 5,
+                    "value": 23,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 2,
+                    "value": 24,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 5,
+                    "value": 34,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 7,
+                    "value": 13,
+                    "selected": false
+                },
+                {
+                    "item_id": 8,
+                    "weight": 5,
+                    "value": 35,
+                    "selected": true
+                }
+            ],
+            "total_weight": 12,
+            "total_value": 93
+        },
+        "input_image": "dataset_knapsack_fixed/knap_088_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_088_result.jpg",
+        "source_image": "Part4/Bag/knap_088_input.jpg",
+        "save_id": 1952,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1952.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_090",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 19, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 19，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 19,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 6,
+                    "value": 12,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 8,
+                    "value": 21,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 5,
+                    "value": 13,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 7,
+                    "value": 16,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 2,
+                    "value": 24,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 5,
+                    "value": 25,
+                    "selected": true
+                }
+            ],
+            "total_weight": 19,
+            "total_value": 78
+        },
+        "input_image": "dataset_knapsack_fixed/knap_090_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_090_result.jpg",
+        "source_image": "Part4/Bag/knap_090_input.jpg",
+        "save_id": 1954,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1954.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_092",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 12, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 12，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 12,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 4,
+                    "value": 45,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 43,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 2,
+                    "value": 44,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 7,
+                    "value": 22,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 2,
+                    "value": 15,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 8,
+                    "value": 43,
+                    "selected": false
+                },
+                {
+                    "item_id": 7,
+                    "weight": 5,
+                    "value": 42,
+                    "selected": false
+                }
+            ],
+            "total_weight": 12,
+            "total_value": 132
+        },
+        "input_image": "dataset_knapsack_fixed/knap_092_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_092_result.jpg",
+        "source_image": "Part4/Bag/knap_092_input.jpg",
+        "save_id": 1956,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1956.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_094",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 12, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 12，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 12,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 5,
+                    "value": 38,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 4,
+                    "value": 18,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 4,
+                    "value": 45,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 6,
+                    "value": 40,
+                    "selected": true
+                },
+                {
+                    "item_id": 5,
+                    "weight": 2,
+                    "value": 12,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 5,
+                    "value": 18,
+                    "selected": false
+                }
+            ],
+            "total_weight": 12,
+            "total_value": 97
+        },
+        "input_image": "dataset_knapsack_fixed/knap_094_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_094_result.jpg",
+        "source_image": "Part4/Bag/knap_094_input.jpg",
+        "save_id": 1958,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1958.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_096",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 20, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 20，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 20,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 5,
+                    "value": 26,
+                    "selected": false
+                },
+                {
+                    "item_id": 2,
+                    "weight": 6,
+                    "value": 43,
+                    "selected": true
+                },
+                {
+                    "item_id": 3,
+                    "weight": 7,
+                    "value": 23,
+                    "selected": false
+                },
+                {
+                    "item_id": 4,
+                    "weight": 8,
+                    "value": 31,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 6,
+                    "value": 50,
+                    "selected": true
+                },
+                {
+                    "item_id": 6,
+                    "weight": 2,
+                    "value": 23,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 4,
+                    "value": 47,
+                    "selected": true
+                }
+            ],
+            "total_weight": 18,
+            "total_value": 163
+        },
+        "input_image": "dataset_knapsack_fixed/knap_096_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_096_result.jpg",
+        "source_image": "Part4/Bag/knap_096_input.jpg",
+        "save_id": 1960,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1960.png",
+        "status": "skipped"
+    },
+    {
+        "id": "knap_098",
+        "task": "knapsack_optimization",
+        "prompt_en": "Given a capacity of 16, highlight the items in green that maximize total value without exceeding the weight limit.",
+        "prompt_cn": "给定背包容量为 16，请将总价值最大且不超过重量限制的物品高亮为绿色。",
+        "knapsack_params": {
+            "capacity": 16,
+            "items": [
+                {
+                    "item_id": 1,
+                    "weight": 6,
+                    "value": 49,
+                    "selected": true
+                },
+                {
+                    "item_id": 2,
+                    "weight": 8,
+                    "value": 24,
+                    "selected": false
+                },
+                {
+                    "item_id": 3,
+                    "weight": 3,
+                    "value": 41,
+                    "selected": true
+                },
+                {
+                    "item_id": 4,
+                    "weight": 7,
+                    "value": 34,
+                    "selected": false
+                },
+                {
+                    "item_id": 5,
+                    "weight": 8,
+                    "value": 13,
+                    "selected": false
+                },
+                {
+                    "item_id": 6,
+                    "weight": 3,
+                    "value": 41,
+                    "selected": true
+                },
+                {
+                    "item_id": 7,
+                    "weight": 2,
+                    "value": 44,
+                    "selected": true
+                }
+            ],
+            "total_weight": 14,
+            "total_value": 175
+        },
+        "input_image": "dataset_knapsack_fixed/knap_098_input.jpg",
+        "result_image": "dataset_knapsack_fixed/knap_098_result.jpg",
+        "source_image": "Part4/Bag/knap_098_input.jpg",
+        "save_id": 1962,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Bag/1962.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1964.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1964.png
new file mode 100644
index 0000000000000000000000000000000000000000..f19f246f32c867ec5575699dbe96f7268f9cef16
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1964.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0f7ce319231cf40f0030543a33464b1bd3f2cb6ed3f6759dc970d5b4773fac3f
+size 15244
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1966.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1966.png
new file mode 100644
index 0000000000000000000000000000000000000000..9026e1d3cd0e653e0d40b26d4d16f1d901bfad92
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1966.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dfb31b5f741e2472d0cb7380aaaef297923cba38761e5e1facb122a7f9c82557
+size 16805
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1968.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1968.png
new file mode 100644
index 0000000000000000000000000000000000000000..916656b0192ae9e53bb1f318712e1c701afd10fa
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1968.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:96b10e7491b2c84163bff07aab0926c9a89992ef1c31a8f4ecbc82630144da25
+size 18258
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1970.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1970.png
new file mode 100644
index 0000000000000000000000000000000000000000..59f28a76948ff1f15a6393dafa3271ecd5c087a3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1970.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b3a8968b5381b2dc64f368b8551e3f0c2c8ba93243034aeea2db80d7bc639bbf
+size 14457
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1972.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1972.png
new file mode 100644
index 0000000000000000000000000000000000000000..ca3ef41bbcdf4f4c9f20f3277ffafbef57164da6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1972.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9fa4421850e047bb665715a7805b6de8b15405f4fb6b1084e6c7e27012978e5a
+size 19181
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1974.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1974.png
new file mode 100644
index 0000000000000000000000000000000000000000..146d4518357acc3adea27be4a4a006f58e2614fb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1974.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2b01f1d5f47cc09d0eaafc12a25fc89ee49a325815bd71aa2bd24d138ab4b2fc
+size 19878
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1976.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1976.png
new file mode 100644
index 0000000000000000000000000000000000000000..5c7b735548f7bebf07738f29e02cacf974a2ab81
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1976.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5560e1150fa9c8758ab03b8e213374d14aa3eabd4cf0b44783a4d5fc0ecf503d
+size 13003
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1978.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1978.png
new file mode 100644
index 0000000000000000000000000000000000000000..3fe03652367d0689abcc2e9f6c7cf90751d0c5d9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1978.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c68cc91da5b9ee6f8725ecd5416b9af099d20279fae5e5b67baaf6f12ddae408
+size 15530
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1980.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1980.png
new file mode 100644
index 0000000000000000000000000000000000000000..694405b01d2784470a7d4e9682ae3ce82f420b61
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1980.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:df101e30ffee29acf24b3e5bd105e7eced7a4b2e7d56486ae9c18e7c9c74b74b
+size 17566
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1982.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1982.png
new file mode 100644
index 0000000000000000000000000000000000000000..2e3f87e3f31df6216175f4440db2d6f9a448ebc6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1982.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:df5e08014447d372ad0c1c40f2bd53fec64ef6a5e52eb53202f0af708b22cbe6
+size 18474
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1984.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1984.png
new file mode 100644
index 0000000000000000000000000000000000000000..a8b103d41372e0507fc0692f647b53b3374804d6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1984.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:50d147f6372c4d90ee4e891952d555e55b2f10d7e10c9d9b7e595d8d03e59a3b
+size 16270
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1986.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1986.png
new file mode 100644
index 0000000000000000000000000000000000000000..bb5cc2e571aa32817a522d3ed3e275dc4f07cca8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1986.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ab8993047892be427da6e12f1e404f5d0edd4138b181e7158738fbeb4c9d9b35
+size 16161
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1988.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1988.png
new file mode 100644
index 0000000000000000000000000000000000000000..cc496e89b89fc6136a39ef3139553a6ec9d0b3b0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1988.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:318ab337796de0c5324f24405ff2ae2400560882de3d0feea34c48ef419d22de
+size 20195
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1990.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1990.png
new file mode 100644
index 0000000000000000000000000000000000000000..3047de8ef9d3428c1bccc4875b8fe5ce84f200c1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1990.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5260e6d02e8dda31357c2289367c5031ad5c8661dcfc7d204897d20d99cd1814
+size 15326
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1992.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1992.png
new file mode 100644
index 0000000000000000000000000000000000000000..3809355fcf7b4e808b3489ff724fb9b6fc798a8b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1992.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d75caeff62290f72c5ca0214f9a0d93e29209c23257f15343058af47eb320fa6
+size 13497
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1994.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1994.png
new file mode 100644
index 0000000000000000000000000000000000000000..c3cf3e07944cb1309f9e8ffb5ce51ada91b500b5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1994.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8ab104b86415e84fe79ddc7035ae62ca112bbe8b2460798eda85205e31de25c1
+size 18497
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1996.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1996.png
new file mode 100644
index 0000000000000000000000000000000000000000..03a7a0f186b711118b9391b429d69eedb087a20d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1996.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6681812dc9789ce158285ba7cd94b2d6bdcedc44dcb7d4fbda67701d43b1211e
+size 19806
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1998.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1998.png
new file mode 100644
index 0000000000000000000000000000000000000000..8c801fc401fde4f53efbebaea1592ee33a689e54
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1998.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d8569793602a627a58c16a5a936100b7ebfa0bdf2fe38859515c472531ac40bb
+size 14262
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2000.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2000.png
new file mode 100644
index 0000000000000000000000000000000000000000..52f31fd23da4a824c3ec071fcc184dbc9762d1a9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2000.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:338accb7aede91d3511480cfe130e3ad726541b4caf1af94cb0eb6a8223ea3be
+size 16326
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2002.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2002.png
new file mode 100644
index 0000000000000000000000000000000000000000..5b3fd0587a904e71a9db08fcc2554cc47c643dc1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2002.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:67feeb25b94e835aab0794d1523867555e60f498096c4e84cfff913be76a75c1
+size 18595
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2004.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2004.png
new file mode 100644
index 0000000000000000000000000000000000000000..4f1557113b952b50d5e8821cca8ad8899d5af9bf
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2004.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:858805f9b266491f4b0ccbf25dfd0a939fa1fa835b3eb7e505b1a87b581d9b38
+size 19473
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2005.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2005.png
new file mode 100644
index 0000000000000000000000000000000000000000..af178a983007ad06b40a2637dfc096890c361663
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2005.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6efc034fd55673aa553a2d42d21fcf4985f1bf1449346342026716ccbfde15bb
+size 14839
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2006.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2006.png
new file mode 100644
index 0000000000000000000000000000000000000000..ebcbe500ec3070a7208588e966a1cba134910501
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2006.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ac0d522a3990af376e63ff8e8b1ac56b0fd62b6357dc65884436a560eb0900e8
+size 17304
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2007.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2007.png
new file mode 100644
index 0000000000000000000000000000000000000000..477322af84721e888b7d86df65cf6950e0d7bd05
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2007.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bc5c375ac98fb619e48200113c449564ff147d8294b4b3f9cd917d7889b72cbe
+size 12534
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2008.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2008.png
new file mode 100644
index 0000000000000000000000000000000000000000..f5b60efc25aa1573de4f8ac64b27910cbe493908
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2008.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9134ca267c05a749f9d291469e50c59ad617d89e24771b78e58c84eae548a9fa
+size 16247
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2009.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2009.png
new file mode 100644
index 0000000000000000000000000000000000000000..0d66ffaecaa19302bb502d4e3c5acc5e6ff84bda
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2009.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:85b005a0ecb80aab1e14e13d5e73bfbd689e832211bff00f29817e36911675c6
+size 12913
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2010.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2010.png
new file mode 100644
index 0000000000000000000000000000000000000000..e9d3dcd99b6e42931d538612c89e83aeec4099e9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2010.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6cda5791d7b99a34cf7f1ff28b5630fe97030eb24fffacc303edbbeb71722a90
+size 15834
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2011.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2011.png
new file mode 100644
index 0000000000000000000000000000000000000000..f7d2528f7bb0f691c5ca02237804a4198f52d14c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2011.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:126f3ed5144ff540136e4a3813b245a10ab806ed86c07c2065ec013abe536df2
+size 22083
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2012.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2012.png
new file mode 100644
index 0000000000000000000000000000000000000000..bf683029ed64bafa68ceddf883c45e3e0613cad5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2012.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e2d437511310e6b42d13829b05cd513e7780f5364352a316b07cf3d4328c01d1
+size 19703
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2013.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2013.png
new file mode 100644
index 0000000000000000000000000000000000000000..8a92987093ff1d4585c2100843f3fcbb25e425ab
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2013.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c59c3057380be1d65fdb8f8eeecde75dad18feed3a63c3504cb4f0332050ff01
+size 12027
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2014.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2014.png
new file mode 100644
index 0000000000000000000000000000000000000000..233651f3318d66031b50b2523d3dc803deb2ac56
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2014.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:408635b80276177d3ede18d3c287ca8e65e2f1b09d0e6383ed290e759855eaf0
+size 18847
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2015.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2015.png
new file mode 100644
index 0000000000000000000000000000000000000000..e66f91932b8276be2dc19a97bff33badff483150
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2015.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1f267816dd67447fb70c8b55e872c62cf40dc8db7571a9da6c80a83a81a619c0
+size 15844
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2016.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2016.png
new file mode 100644
index 0000000000000000000000000000000000000000..c180ef03ed2ac5ffc248f65c4638f3be3ff935e6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2016.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:91f67549d840eedc3075479508a5ba753ba66a681e76e6946aed78b45cdbf20a
+size 13414
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2017.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2017.png
new file mode 100644
index 0000000000000000000000000000000000000000..0928d36789d5544a8f1ecf67a366dd617f994b99
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2017.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1e359f85389fe2950397b53b193efe754ac802c6fae59ccc0fafce833826891f
+size 17351
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2018.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2018.png
new file mode 100644
index 0000000000000000000000000000000000000000..c6468b8c638e6aff126d517afca173de18461b64
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2018.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:df9b176617d3e26f9db34db9906e79fe32d3dce51867836a7f141be843174bcd
+size 10659
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2019.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2019.png
new file mode 100644
index 0000000000000000000000000000000000000000..ed7239704f9e9b225d6b4de849eaf55aea10d976
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2019.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d101f7813b01e90710fbc4524e41d23d7c3f278da09ee5620c4451f610ee3db9
+size 20053
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2020.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2020.png
new file mode 100644
index 0000000000000000000000000000000000000000..60e2be89f579006acbc636f1b974909422d8e454
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2020.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d3594323a75a4b7f4c81d6e81a48323970d9b1e3f7053c3f3d0daa3e84557cf8
+size 12380
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2021.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2021.png
new file mode 100644
index 0000000000000000000000000000000000000000..1a5625b66e5d906c8d39c17a993c7db617aebf16
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2021.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bf0dd05466fdca63c6e2c586af7e5a717e888e07683ffddadf3f6fbe4f29513c
+size 20127
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2022.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2022.png
new file mode 100644
index 0000000000000000000000000000000000000000..65f3e31acde1288785aee356e983fd80cdd0e897
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2022.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:abc86da676f227b1222cd43b922004db5f2c1b6db690e857f07476a014a20dd6
+size 13784
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2023.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2023.png
new file mode 100644
index 0000000000000000000000000000000000000000..9951fd2b6e88579a57f33b76da2445dd7fffb8be
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2023.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6eb133fef5bf8dd5b309cf8dd0991c9af0a9fdc200184ec57e8f54aa65a657ac
+size 18264
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2024.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2024.png
new file mode 100644
index 0000000000000000000000000000000000000000..f307bcc78ea4493ec980b1440e5af0decf9d5c92
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2024.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b71229c2109195d927e26ad52089e5f46b50ff4402f0f67194ef40a1b199eb6e
+size 17422
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2026.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2026.png
new file mode 100644
index 0000000000000000000000000000000000000000..c918bb07e1183cb9d85bc8a162ca5b14aaff646a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2026.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:66c5c187fd3d0477d923c77ec82acb71edc63e6b8e4cfaab949c64efe27157cf
+size 16947
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2028.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2028.png
new file mode 100644
index 0000000000000000000000000000000000000000..78bf93b836ba48851c9fbd8867f5ad4ac8851e3c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2028.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3093c0781236530055d23d3ea1e601412e296b11a289d4ea5b1aae6bda17b7a6
+size 22707
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2030.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2030.png
new file mode 100644
index 0000000000000000000000000000000000000000..c357e14aeacc79c6d1b07cbb0c80a1d0c0961aea
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2030.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:faf1e4c76ee51c95256c3fb44c51db5c8bd809b933693763332dedd2f2cd57a9
+size 15695
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2032.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2032.png
new file mode 100644
index 0000000000000000000000000000000000000000..6dd969bff3ebc4e8591ff5a259e1c3cc03e083c9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2032.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b1ba7e0d558f21f1e9439929aae815e0d53cec24887c5ac5f54ecd6d7f9621f6
+size 17002
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2034.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2034.png
new file mode 100644
index 0000000000000000000000000000000000000000..a85863b545629f06dffce035399538b1dd4067ef
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2034.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:03cb34c3901158cc0e722d53db1890ab161119b3026ab49b1ff6755ebcfd21ce
+size 21922
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2036.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2036.png
new file mode 100644
index 0000000000000000000000000000000000000000..f9a0b0b05c2483189aa89fb734c69123eadfb54a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2036.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:572c01caf1916c1423b76b57aaa24bfe56b5f745f59f0ff7519c4df185d8240d
+size 17633
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2038.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2038.png
new file mode 100644
index 0000000000000000000000000000000000000000..406cc68de76fa8520088087c6d2a3ce798eb1e8f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2038.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9fc961eac795a3fcc901f770ff060e66b0493e3cfec05dd4db30c013a9631f4a
+size 17802
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2040.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2040.png
new file mode 100644
index 0000000000000000000000000000000000000000..d5d7283e0b51d7b9ffff7fc726ff444bf3557840
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2040.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:31f308585536d047c7b37c199958bde9822b81c10cf94ac980edb528838ab9ab
+size 13513
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2042.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2042.png
new file mode 100644
index 0000000000000000000000000000000000000000..c196a68786f51bce8a0153dc203e63538dca7051
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2042.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a85df3ffd13cd58d70244dc328e199eefec457d240000fc45087e8b3ee7bcac7
+size 21754
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2044.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2044.png
new file mode 100644
index 0000000000000000000000000000000000000000..8dd210a748c8276736a3d6d23b0b67ced48b8fc8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2044.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2b23d0093fd2896730cc7783b5365b265cfdbf7d5526538554c343508208efaa
+size 15315
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2046.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2046.png
new file mode 100644
index 0000000000000000000000000000000000000000..d6d65c7b87e1e0b727907a7e8247137c91f2bf07
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2046.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:62b2f799e22068b11c1ee85fd3855959f6b1a2ff6b752c32593f68075b8c1b97
+size 21879
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2048.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2048.png
new file mode 100644
index 0000000000000000000000000000000000000000..f31ec46621c28a1ee24e08d69b6eb7754e0e3cf9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2048.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4f6ca5ba47c72a5c69db6ff615a4e0f5a485e06821024ca7bced0ea6b3a971ca
+size 15361
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2050.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2050.png
new file mode 100644
index 0000000000000000000000000000000000000000..033e4ef3552c503e275990f658782b294e629f34
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2050.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:abad100dd1ee80508a22a3afb1f8182ad2513991b0b584ffb0eba5d545265301
+size 13677
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2052.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2052.png
new file mode 100644
index 0000000000000000000000000000000000000000..0e2b16f84eb0d4f03a6d4d21900dfcba8340a5e3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2052.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:62049fc70ec79b3e30339308a962bfcc8c1f877a3a7c7391b9d9a28914c08de6
+size 19261
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2054.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2054.png
new file mode 100644
index 0000000000000000000000000000000000000000..c6a282e766f328b3f565107c794a3a77e75e5c72
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2054.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:be635b70e7ef3d62f2254e726882a60dff91011e4e90ab3561ba7b12245ad817
+size 20342
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2056.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2056.png
new file mode 100644
index 0000000000000000000000000000000000000000..bc4089b69d4265786ec72f3c0ced7d55ae5db4f2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2056.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6a844221bb5aebfd7c1a3a156b49332d479df25d16a418e4b5cd38232fa72024
+size 15767
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2058.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2058.png
new file mode 100644
index 0000000000000000000000000000000000000000..21def824da2767866d85031ddacd68173bee2ca0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2058.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bc808ec914ce53a65353eeceef5422c21368344876757a8afc2259e450687d77
+size 15901
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2060.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2060.png
new file mode 100644
index 0000000000000000000000000000000000000000..0eab903ecb293daa370519430dce7606c9bab12b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2060.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bd67a40ec82f661aff24055096eb25d409e5d52f03f378391511deab0aeb4d78
+size 16934
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2062.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2062.png
new file mode 100644
index 0000000000000000000000000000000000000000..0439f166f1aa1ef0621820aa461f465bcc15bacc
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2062.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8bd7eb37016584600a77fc4fdef4ff0d25538dd0bfae9880f152964672b0ca62
+size 21630
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/Convex_Hull.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/Convex_Hull.json
new file mode 100644
index 0000000000000000000000000000000000000000..dd88ace87bdec0dc90efa8fe246468f3f1b2c462
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/Convex_Hull.json
@@ -0,0 +1,5706 @@
+[
+    {
+        "id": "hull_000",
+        "task": "convex_hull",
+        "num_total_points": 8,
+        "num_hull_vertices": 4,
+        "points": [
+            [
+                2.5673568862065768,
+                2.937828775638394
+            ],
+            [
+                8.786654681426946,
+                4.366821850192897
+            ],
+            [
+                4.643108040880278,
+                1.7570159950527522
+            ],
+            [
+                6.0697092974629605,
+                8.407268843001592
+            ],
+            [
+                4.413466648998902,
+                2.419448536877261
+            ],
+            [
+                1.8519632841584173,
+                3.340585469639273
+            ],
+            [
+                1.005914324603319,
+                2.4909574662606406
+            ],
+            [
+                5.9172622438361255,
+                3.849292045717352
+            ]
+        ],
+        "hull_polygon": [
+            [
+                6.0697092974629605,
+                8.407268843001592
+            ],
+            [
+                1.005914324603319,
+                2.4909574662606406
+            ],
+            [
+                4.643108040880278,
+                1.7570159950527522
+            ],
+            [
+                8.786654681426946,
+                4.366821850192897
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_000_input.jpg",
+        "result_image": "dataset_convex_hull/hull_000_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_000_input.jpg",
+        "save_id": 1964,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1964.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_002",
+        "task": "convex_hull",
+        "num_total_points": 12,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                6.992275584339183,
+                1.9184514325050044
+            ],
+            [
+                7.48735946596577,
+                4.442505619440346
+            ],
+            [
+                4.295814545476352,
+                8.105427786124052
+            ],
+            [
+                6.797487266220882,
+                7.46150623276454
+            ],
+            [
+                5.4298936852007795,
+                4.521955250743499
+            ],
+            [
+                4.374220854786012,
+                2.5575604379878456
+            ],
+            [
+                6.382469864852293,
+                7.233892411671107
+            ],
+            [
+                8.13577738820849,
+                5.6154223953244635
+            ],
+            [
+                8.42812642803477,
+                8.414354932688818
+            ],
+            [
+                1.6203681255414182,
+                7.036755947162843
+            ],
+            [
+                5.08176876426345,
+                8.07739469273208
+            ],
+            [
+                1.579765392599728,
+                2.0152152456415307
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.579765392599728,
+                2.0152152456415307
+            ],
+            [
+                6.992275584339183,
+                1.9184514325050044
+            ],
+            [
+                8.13577738820849,
+                5.6154223953244635
+            ],
+            [
+                8.42812642803477,
+                8.414354932688818
+            ],
+            [
+                4.295814545476352,
+                8.105427786124052
+            ],
+            [
+                1.6203681255414182,
+                7.036755947162843
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_002_input.jpg",
+        "result_image": "dataset_convex_hull/hull_002_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_002_input.jpg",
+        "save_id": 1966,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1966.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_004",
+        "task": "convex_hull",
+        "num_total_points": 12,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                1.0344412553698064,
+                5.861648693462662
+            ],
+            [
+                2.1398352491924317,
+                2.795230703870158
+            ],
+            [
+                6.91621468576398,
+                2.5702072096646944
+            ],
+            [
+                1.1504815259723227,
+                1.773886017716511
+            ],
+            [
+                2.825519476249636,
+                2.234264411726497
+            ],
+            [
+                1.724949418619369,
+                6.98952748516979
+            ],
+            [
+                3.118207929497384,
+                5.838232063364343
+            ],
+            [
+                5.905900246479003,
+                4.741189248580387
+            ],
+            [
+                4.944696567470102,
+                2.800717096247145
+            ],
+            [
+                4.2369904790715065,
+                4.466923737913588
+            ],
+            [
+                5.214265194315339,
+                3.681483083000848
+            ],
+            [
+                6.883481506475223,
+                3.1154595113014354
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.0344412553698064,
+                5.861648693462662
+            ],
+            [
+                1.1504815259723227,
+                1.773886017716511
+            ],
+            [
+                6.91621468576398,
+                2.5702072096646944
+            ],
+            [
+                6.883481506475223,
+                3.1154595113014354
+            ],
+            [
+                5.905900246479003,
+                4.741189248580387
+            ],
+            [
+                1.724949418619369,
+                6.98952748516979
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_004_input.jpg",
+        "result_image": "dataset_convex_hull/hull_004_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_004_input.jpg",
+        "save_id": 1968,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1968.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_006",
+        "task": "convex_hull",
+        "num_total_points": 10,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                6.382908106027731,
+                1.6576914597334005
+            ],
+            [
+                3.0223177037320905,
+                3.434491954016819
+            ],
+            [
+                3.8243233553576594,
+                1.6308403876408173
+            ],
+            [
+                8.06637404100876,
+                1.338900590417765
+            ],
+            [
+                1.5248661827023176,
+                5.6749169089127545
+            ],
+            [
+                4.526751438222992,
+                8.831856490523004
+            ],
+            [
+                2.3706115018742038,
+                8.727298859612954
+            ],
+            [
+                7.021689470221371,
+                7.468821130396678
+            ],
+            [
+                7.804844834665489,
+                6.912586119512696
+            ],
+            [
+                2.4515145793298876,
+                6.950940408561538
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.06637404100876,
+                1.338900590417765
+            ],
+            [
+                7.804844834665489,
+                6.912586119512696
+            ],
+            [
+                7.021689470221371,
+                7.468821130396678
+            ],
+            [
+                4.526751438222992,
+                8.831856490523004
+            ],
+            [
+                2.3706115018742038,
+                8.727298859612954
+            ],
+            [
+                1.5248661827023176,
+                5.6749169089127545
+            ],
+            [
+                3.8243233553576594,
+                1.6308403876408173
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_006_input.jpg",
+        "result_image": "dataset_convex_hull/hull_006_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_006_input.jpg",
+        "save_id": 1970,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1970.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_008",
+        "task": "convex_hull",
+        "num_total_points": 14,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                3.1342554983821307,
+                5.532475285885235
+            ],
+            [
+                3.671699558008031,
+                4.368880951103497
+            ],
+            [
+                1.518750779755833,
+                8.41223328869118
+            ],
+            [
+                4.421900749531257,
+                8.65067753157853
+            ],
+            [
+                6.020051908462345,
+                7.739657667834716
+            ],
+            [
+                2.360692720153466,
+                8.073843494225986
+            ],
+            [
+                3.475840809438954,
+                8.828519650688644
+            ],
+            [
+                2.941366718535259,
+                5.1422027593985105
+            ],
+            [
+                6.553169245836974,
+                1.7351426790749258
+            ],
+            [
+                2.5939992261858205,
+                1.4564990059472223
+            ],
+            [
+                2.819193011847119,
+                5.727486062336365
+            ],
+            [
+                8.918074635729086,
+                2.602898387754774
+            ],
+            [
+                6.730413277204007,
+                7.089272843329354
+            ],
+            [
+                8.327948150904245,
+                8.432783436652358
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.518750779755833,
+                8.41223328869118
+            ],
+            [
+                2.5939992261858205,
+                1.4564990059472223
+            ],
+            [
+                6.553169245836974,
+                1.7351426790749258
+            ],
+            [
+                8.918074635729086,
+                2.602898387754774
+            ],
+            [
+                8.327948150904245,
+                8.432783436652358
+            ],
+            [
+                3.475840809438954,
+                8.828519650688644
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_008_input.jpg",
+        "result_image": "dataset_convex_hull/hull_008_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_008_input.jpg",
+        "save_id": 1972,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1972.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_010",
+        "task": "convex_hull",
+        "num_total_points": 14,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                5.204519356372838,
+                5.606868557709577
+            ],
+            [
+                3.496678627610902,
+                1.0693812739408424
+            ],
+            [
+                5.208568765351403,
+                4.981161769517697
+            ],
+            [
+                2.3518112401988542,
+                3.901605229144982
+            ],
+            [
+                6.579563630848086,
+                3.2931404213321356
+            ],
+            [
+                5.715619714082577,
+                6.208589624306953
+            ],
+            [
+                6.356538371759003,
+                6.007139449629682
+            ],
+            [
+                3.9227907881604116,
+                1.8985984138725271
+            ],
+            [
+                3.9786590047646913,
+                8.154405620085214
+            ],
+            [
+                8.312454336895044,
+                4.104279664072457
+            ],
+            [
+                6.218118074063129,
+                7.727605348191594
+            ],
+            [
+                8.85952246384371,
+                5.780408572827426
+            ],
+            [
+                7.775012924609492,
+                7.446898113261702
+            ],
+            [
+                1.140697654743505,
+                3.124244613613393
+            ]
+        ],
+        "hull_polygon": [
+            [
+                3.9786590047646913,
+                8.154405620085214
+            ],
+            [
+                1.140697654743505,
+                3.124244613613393
+            ],
+            [
+                3.496678627610902,
+                1.0693812739408424
+            ],
+            [
+                8.312454336895044,
+                4.104279664072457
+            ],
+            [
+                8.85952246384371,
+                5.780408572827426
+            ],
+            [
+                7.775012924609492,
+                7.446898113261702
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_010_input.jpg",
+        "result_image": "dataset_convex_hull/hull_010_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_010_input.jpg",
+        "save_id": 1974,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1974.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_012",
+        "task": "convex_hull",
+        "num_total_points": 9,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                5.366487409908495,
+                1.0410549373155273
+            ],
+            [
+                3.817450293961297,
+                1.8741332732440066
+            ],
+            [
+                7.167944387535974,
+                1.2663294614478264
+            ],
+            [
+                3.815153327835457,
+                7.807171580601358
+            ],
+            [
+                1.8759527808592704,
+                1.315875560757915
+            ],
+            [
+                5.707021748732038,
+                7.430896565455211
+            ],
+            [
+                6.845710679467212,
+                3.34276279278121
+            ],
+            [
+                6.669272738974459,
+                3.743196925321354
+            ],
+            [
+                2.7372388926984756,
+                3.13608746382688
+            ]
+        ],
+        "hull_polygon": [
+            [
+                3.815153327835457,
+                7.807171580601358
+            ],
+            [
+                1.8759527808592704,
+                1.315875560757915
+            ],
+            [
+                5.366487409908495,
+                1.0410549373155273
+            ],
+            [
+                7.167944387535974,
+                1.2663294614478264
+            ],
+            [
+                6.845710679467212,
+                3.34276279278121
+            ],
+            [
+                5.707021748732038,
+                7.430896565455211
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_012_input.jpg",
+        "result_image": "dataset_convex_hull/hull_012_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_012_input.jpg",
+        "save_id": 1976,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1976.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_014",
+        "task": "convex_hull",
+        "num_total_points": 10,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                8.899761183019962,
+                5.305745446991229
+            ],
+            [
+                7.669685631319391,
+                5.416964570487496
+            ],
+            [
+                1.465087969523875,
+                1.6615902018105535
+            ],
+            [
+                3.8662056718263553,
+                4.3464880915609125
+            ],
+            [
+                8.559916371803116,
+                8.968104477611135
+            ],
+            [
+                6.482548339908734,
+                1.0124929881358922
+            ],
+            [
+                5.729586401792552,
+                1.3282407113576395
+            ],
+            [
+                7.687904909096648,
+                7.648572494875283
+            ],
+            [
+                6.819956167679308,
+                1.422223037659057
+            ],
+            [
+                1.6600552457006703,
+                3.0659197647693004
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.899761183019962,
+                5.305745446991229
+            ],
+            [
+                8.559916371803116,
+                8.968104477611135
+            ],
+            [
+                1.6600552457006703,
+                3.0659197647693004
+            ],
+            [
+                1.465087969523875,
+                1.6615902018105535
+            ],
+            [
+                6.482548339908734,
+                1.0124929881358922
+            ],
+            [
+                6.819956167679308,
+                1.422223037659057
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_014_input.jpg",
+        "result_image": "dataset_convex_hull/hull_014_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_014_input.jpg",
+        "save_id": 1978,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1978.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_016",
+        "task": "convex_hull",
+        "num_total_points": 14,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                1.5554237010270215,
+                7.025422893640624
+            ],
+            [
+                4.704508960000559,
+                3.734924964937414
+            ],
+            [
+                4.832472083378676,
+                1.0587272932648402
+            ],
+            [
+                4.116820999602244,
+                2.7030932052056915
+            ],
+            [
+                4.5569859445902585,
+                1.1847915152682056
+            ],
+            [
+                4.71830146679365,
+                4.38512145292838
+            ],
+            [
+                8.832454652787309,
+                5.3281255713746365
+            ],
+            [
+                4.2887674683631225,
+                8.776885523794036
+            ],
+            [
+                1.0483511674185015,
+                4.635119081112228
+            ],
+            [
+                5.116834363019507,
+                5.9792648159018675
+            ],
+            [
+                4.149752183453044,
+                6.212021520885429
+            ],
+            [
+                7.107903967987631,
+                8.322377005070603
+            ],
+            [
+                4.18676989586932,
+                5.528330526501358
+            ],
+            [
+                6.561486143944079,
+                3.6357202164099496
+            ]
+        ],
+        "hull_polygon": [
+            [
+                4.832472083378676,
+                1.0587272932648402
+            ],
+            [
+                8.832454652787309,
+                5.3281255713746365
+            ],
+            [
+                7.107903967987631,
+                8.322377005070603
+            ],
+            [
+                4.2887674683631225,
+                8.776885523794036
+            ],
+            [
+                1.5554237010270215,
+                7.025422893640624
+            ],
+            [
+                1.0483511674185015,
+                4.635119081112228
+            ],
+            [
+                4.5569859445902585,
+                1.1847915152682056
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_016_input.jpg",
+        "result_image": "dataset_convex_hull/hull_016_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_016_input.jpg",
+        "save_id": 1980,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1980.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_018",
+        "task": "convex_hull",
+        "num_total_points": 14,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                4.383912982798166,
+                2.0371779707432296
+            ],
+            [
+                5.4178195922827905,
+                8.736517443779423
+            ],
+            [
+                8.266691592381477,
+                5.6208857410275535
+            ],
+            [
+                7.091421416309504,
+                6.719894941546082
+            ],
+            [
+                5.740213803735344,
+                3.445499870091263
+            ],
+            [
+                3.6399801659131326,
+                2.2010315051151883
+            ],
+            [
+                8.555218223123216,
+                7.97771691728696
+            ],
+            [
+                5.492046689760161,
+                8.375251815814615
+            ],
+            [
+                5.133005862215589,
+                5.479485938496536
+            ],
+            [
+                6.417219653489658,
+                3.8697309159182725
+            ],
+            [
+                7.323977741254731,
+                1.7970022083108956
+            ],
+            [
+                6.785924986064355,
+                7.100582152338762
+            ],
+            [
+                4.97784440724009,
+                7.3706077700213015
+            ],
+            [
+                8.296683508605287,
+                7.18694787154628
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.555218223123216,
+                7.97771691728696
+            ],
+            [
+                5.4178195922827905,
+                8.736517443779423
+            ],
+            [
+                4.97784440724009,
+                7.3706077700213015
+            ],
+            [
+                3.6399801659131326,
+                2.2010315051151883
+            ],
+            [
+                4.383912982798166,
+                2.0371779707432296
+            ],
+            [
+                7.323977741254731,
+                1.7970022083108956
+            ],
+            [
+                8.266691592381477,
+                5.6208857410275535
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_018_input.jpg",
+        "result_image": "dataset_convex_hull/hull_018_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_018_input.jpg",
+        "save_id": 1982,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1982.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_020",
+        "task": "convex_hull",
+        "num_total_points": 9,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                2.843420665803012,
+                8.328683857526837
+            ],
+            [
+                6.921070829227929,
+                7.084033604398969
+            ],
+            [
+                6.8101735100426035,
+                7.552620085048862
+            ],
+            [
+                5.6175170276492015,
+                1.606164046238237
+            ],
+            [
+                4.3977251566056905,
+                6.534701028368077
+            ],
+            [
+                6.194621785198602,
+                7.766848918249674
+            ],
+            [
+                6.670705298146078,
+                5.3851913387393395
+            ],
+            [
+                1.7323016771203807,
+                5.807972824503647
+            ],
+            [
+                5.0034617107011625,
+                8.754798842577022
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.7323016771203807,
+                5.807972824503647
+            ],
+            [
+                5.6175170276492015,
+                1.606164046238237
+            ],
+            [
+                6.670705298146078,
+                5.3851913387393395
+            ],
+            [
+                6.921070829227929,
+                7.084033604398969
+            ],
+            [
+                6.8101735100426035,
+                7.552620085048862
+            ],
+            [
+                5.0034617107011625,
+                8.754798842577022
+            ],
+            [
+                2.843420665803012,
+                8.328683857526837
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_020_input.jpg",
+        "result_image": "dataset_convex_hull/hull_020_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_020_input.jpg",
+        "save_id": 1984,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1984.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_022",
+        "task": "convex_hull",
+        "num_total_points": 10,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                4.244868129318167,
+                2.161866606843499
+            ],
+            [
+                2.142280548081666,
+                8.178636952391868
+            ],
+            [
+                1.9573005910279022,
+                1.750421381196535
+            ],
+            [
+                3.7511386679232785,
+                3.4439987786648096
+            ],
+            [
+                7.462117758378463,
+                5.391801718175144
+            ],
+            [
+                6.86459211081081,
+                8.519895338100849
+            ],
+            [
+                1.9681907912177161,
+                2.643280240301687
+            ],
+            [
+                4.467490727773562,
+                1.4493779229449464
+            ],
+            [
+                1.84956645299585,
+                6.017250014231002
+            ],
+            [
+                1.725674206064828,
+                5.662495174251935
+            ]
+        ],
+        "hull_polygon": [
+            [
+                4.467490727773562,
+                1.4493779229449464
+            ],
+            [
+                7.462117758378463,
+                5.391801718175144
+            ],
+            [
+                6.86459211081081,
+                8.519895338100849
+            ],
+            [
+                2.142280548081666,
+                8.178636952391868
+            ],
+            [
+                1.725674206064828,
+                5.662495174251935
+            ],
+            [
+                1.9573005910279022,
+                1.750421381196535
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_022_input.jpg",
+        "result_image": "dataset_convex_hull/hull_022_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_022_input.jpg",
+        "save_id": 1986,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1986.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_024",
+        "task": "convex_hull",
+        "num_total_points": 14,
+        "num_hull_vertices": 5,
+        "points": [
+            [
+                8.251394668922451,
+                2.4370330351043483
+            ],
+            [
+                7.0100210684411035,
+                5.860165003765647
+            ],
+            [
+                7.195417951690067,
+                5.545734068783223
+            ],
+            [
+                5.940886099919067,
+                7.5137840472719315
+            ],
+            [
+                3.2134476685179116,
+                4.989087755767763
+            ],
+            [
+                2.7441410699825797,
+                2.902295193158805
+            ],
+            [
+                3.4146484636925747,
+                3.518855669867368
+            ],
+            [
+                1.7730524774807392,
+                7.799671769378772
+            ],
+            [
+                6.020201310457895,
+                4.884160803416138
+            ],
+            [
+                1.8444081418861211,
+                5.5660863191775
+            ],
+            [
+                7.486455486042157,
+                7.665540005110047
+            ],
+            [
+                3.2137313461684878,
+                1.2427670820728212
+            ],
+            [
+                3.7647389462199623,
+                5.509414211374928
+            ],
+            [
+                6.714251331630113,
+                3.548696541616218
+            ]
+        ],
+        "hull_polygon": [
+            [
+                3.2137313461684878,
+                1.2427670820728212
+            ],
+            [
+                8.251394668922451,
+                2.4370330351043483
+            ],
+            [
+                7.486455486042157,
+                7.665540005110047
+            ],
+            [
+                1.7730524774807392,
+                7.799671769378772
+            ],
+            [
+                1.8444081418861211,
+                5.5660863191775
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_024_input.jpg",
+        "result_image": "dataset_convex_hull/hull_024_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_024_input.jpg",
+        "save_id": 1988,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1988.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_026",
+        "task": "convex_hull",
+        "num_total_points": 9,
+        "num_hull_vertices": 8,
+        "points": [
+            [
+                2.8870256584159906,
+                8.94902705197925
+            ],
+            [
+                2.8941186613614915,
+                3.3335569442280137
+            ],
+            [
+                3.391415009249828,
+                8.975852118525868
+            ],
+            [
+                5.063687780105878,
+                1.3872026981286947
+            ],
+            [
+                2.116820085075328,
+                4.293822947956399
+            ],
+            [
+                4.43183446601477,
+                7.059161951382701
+            ],
+            [
+                7.748998524577154,
+                1.1751112219057482
+            ],
+            [
+                1.261364808802841,
+                7.047547974355913
+            ],
+            [
+                7.680709930747081,
+                2.8292258020036005
+            ]
+        ],
+        "hull_polygon": [
+            [
+                2.8870256584159906,
+                8.94902705197925
+            ],
+            [
+                1.261364808802841,
+                7.047547974355913
+            ],
+            [
+                2.116820085075328,
+                4.293822947956399
+            ],
+            [
+                2.8941186613614915,
+                3.3335569442280137
+            ],
+            [
+                5.063687780105878,
+                1.3872026981286947
+            ],
+            [
+                7.748998524577154,
+                1.1751112219057482
+            ],
+            [
+                7.680709930747081,
+                2.8292258020036005
+            ],
+            [
+                3.391415009249828,
+                8.975852118525868
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_026_input.jpg",
+        "result_image": "dataset_convex_hull/hull_026_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_026_input.jpg",
+        "save_id": 1990,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1990.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_028",
+        "task": "convex_hull",
+        "num_total_points": 9,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                1.158793468938562,
+                5.4022664487091445
+            ],
+            [
+                6.429101038711727,
+                6.7987874130611585
+            ],
+            [
+                5.706817449721824,
+                4.265305505221376
+            ],
+            [
+                1.9832662145523745,
+                3.075451016442802
+            ],
+            [
+                3.9094304587642865,
+                7.134358045848022
+            ],
+            [
+                8.404520523303376,
+                7.992304919729873
+            ],
+            [
+                3.6923599703667396,
+                8.399902495681005
+            ],
+            [
+                4.999322541919238,
+                2.613679761933695
+            ],
+            [
+                8.369205054287988,
+                2.7044777961034603
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.369205054287988,
+                2.7044777961034603
+            ],
+            [
+                8.404520523303376,
+                7.992304919729873
+            ],
+            [
+                3.6923599703667396,
+                8.399902495681005
+            ],
+            [
+                1.158793468938562,
+                5.4022664487091445
+            ],
+            [
+                1.9832662145523745,
+                3.075451016442802
+            ],
+            [
+                4.999322541919238,
+                2.613679761933695
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_028_input.jpg",
+        "result_image": "dataset_convex_hull/hull_028_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_028_input.jpg",
+        "save_id": 1992,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1992.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_030",
+        "task": "convex_hull",
+        "num_total_points": 11,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                4.8556287670725675,
+                2.020913247833814
+            ],
+            [
+                7.5152678361271095,
+                6.638381284787431
+            ],
+            [
+                8.633184122311134,
+                8.795634051262589
+            ],
+            [
+                8.710483912864365,
+                6.3494899826681035
+            ],
+            [
+                4.464523300813779,
+                3.2825844409720606
+            ],
+            [
+                1.935182043744657,
+                6.0431504058932015
+            ],
+            [
+                6.999271008956811,
+                3.925433638320972
+            ],
+            [
+                2.9230441544047663,
+                3.295099275011066
+            ],
+            [
+                1.483359334814092,
+                3.141914926740199
+            ],
+            [
+                4.81086775410674,
+                1.4543281911129018
+            ],
+            [
+                4.474846047670335,
+                4.002222767193216
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.483359334814092,
+                3.141914926740199
+            ],
+            [
+                4.81086775410674,
+                1.4543281911129018
+            ],
+            [
+                6.999271008956811,
+                3.925433638320972
+            ],
+            [
+                8.710483912864365,
+                6.3494899826681035
+            ],
+            [
+                8.633184122311134,
+                8.795634051262589
+            ],
+            [
+                1.935182043744657,
+                6.0431504058932015
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_030_input.jpg",
+        "result_image": "dataset_convex_hull/hull_030_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_030_input.jpg",
+        "save_id": 1994,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1994.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_032",
+        "task": "convex_hull",
+        "num_total_points": 14,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                7.078625352369328,
+                6.421175447593002
+            ],
+            [
+                7.850918781500176,
+                7.830349956366118
+            ],
+            [
+                6.727398206274782,
+                7.169276834346246
+            ],
+            [
+                7.1323449803011005,
+                8.983468971490657
+            ],
+            [
+                1.0199087343286246,
+                3.120870374585669
+            ],
+            [
+                2.100777004136477,
+                3.1909916779006533
+            ],
+            [
+                1.9470883709333675,
+                4.862688196096028
+            ],
+            [
+                8.85515475086995,
+                1.8032281882726666
+            ],
+            [
+                3.4148333488646143,
+                5.640969339501268
+            ],
+            [
+                4.836450708196757,
+                1.2506258671504993
+            ],
+            [
+                3.5215036049634634,
+                5.577147774675102
+            ],
+            [
+                6.444651588847146,
+                6.326229876957846
+            ],
+            [
+                7.475905215792532,
+                7.188154214332073
+            ],
+            [
+                5.867686536858029,
+                2.0463509437886964
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.0199087343286246,
+                3.120870374585669
+            ],
+            [
+                4.836450708196757,
+                1.2506258671504993
+            ],
+            [
+                8.85515475086995,
+                1.8032281882726666
+            ],
+            [
+                7.850918781500176,
+                7.830349956366118
+            ],
+            [
+                7.1323449803011005,
+                8.983468971490657
+            ],
+            [
+                1.9470883709333675,
+                4.862688196096028
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_032_input.jpg",
+        "result_image": "dataset_convex_hull/hull_032_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_032_input.jpg",
+        "save_id": 1996,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1996.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_034",
+        "task": "convex_hull",
+        "num_total_points": 8,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                8.15300468154389,
+                2.7545137429062327
+            ],
+            [
+                2.55747253108978,
+                7.454683866926622
+            ],
+            [
+                4.280242063318104,
+                1.666756108756335
+            ],
+            [
+                8.31147029037592,
+                6.6223617180644165
+            ],
+            [
+                2.3245284558846837,
+                3.9126610764814176
+            ],
+            [
+                6.417988652340145,
+                2.2340992451566235
+            ],
+            [
+                7.894805521292758,
+                4.977873270577988
+            ],
+            [
+                5.54537953576767,
+                2.5845006779563384
+            ]
+        ],
+        "hull_polygon": [
+            [
+                2.55747253108978,
+                7.454683866926622
+            ],
+            [
+                2.3245284558846837,
+                3.9126610764814176
+            ],
+            [
+                4.280242063318104,
+                1.666756108756335
+            ],
+            [
+                6.417988652340145,
+                2.2340992451566235
+            ],
+            [
+                8.15300468154389,
+                2.7545137429062327
+            ],
+            [
+                8.31147029037592,
+                6.6223617180644165
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_034_input.jpg",
+        "result_image": "dataset_convex_hull/hull_034_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_034_input.jpg",
+        "save_id": 1998,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/1998.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_036",
+        "task": "convex_hull",
+        "num_total_points": 11,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                2.8170513676507776,
+                6.724731736952209
+            ],
+            [
+                2.4231990006467647,
+                3.830389148160851
+            ],
+            [
+                4.323650992677166,
+                7.325066421586743
+            ],
+            [
+                1.257876037403844,
+                4.567976778330187
+            ],
+            [
+                1.9377762516266372,
+                3.045983576066762
+            ],
+            [
+                8.977510087978157,
+                8.94435386902378
+            ],
+            [
+                7.321553947779497,
+                5.332763976068144
+            ],
+            [
+                8.933788139812759,
+                1.4295992721257003
+            ],
+            [
+                2.3682003974039043,
+                1.1721259537897897
+            ],
+            [
+                2.1413698622169326,
+                4.152984098378294
+            ],
+            [
+                8.318780622566106,
+                6.954431264184044
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.257876037403844,
+                4.567976778330187
+            ],
+            [
+                2.3682003974039043,
+                1.1721259537897897
+            ],
+            [
+                8.933788139812759,
+                1.4295992721257003
+            ],
+            [
+                8.977510087978157,
+                8.94435386902378
+            ],
+            [
+                4.323650992677166,
+                7.325066421586743
+            ],
+            [
+                2.8170513676507776,
+                6.724731736952209
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_036_input.jpg",
+        "result_image": "dataset_convex_hull/hull_036_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_036_input.jpg",
+        "save_id": 2000,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2000.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_038",
+        "task": "convex_hull",
+        "num_total_points": 15,
+        "num_hull_vertices": 8,
+        "points": [
+            [
+                2.479272721451496,
+                8.182968017060377
+            ],
+            [
+                5.075140248647448,
+                5.43818662434104
+            ],
+            [
+                1.671640470046424,
+                5.768876199329586
+            ],
+            [
+                8.980744541828605,
+                3.516322462844152
+            ],
+            [
+                5.655458198783705,
+                1.0717149734406437
+            ],
+            [
+                5.80981095619796,
+                1.8170822067437946
+            ],
+            [
+                1.4937856333187414,
+                8.481742933750965
+            ],
+            [
+                1.2417955367778495,
+                7.639449071515054
+            ],
+            [
+                3.8429787546877785,
+                2.9393173476540913
+            ],
+            [
+                3.2830582874149394,
+                4.367094201289793
+            ],
+            [
+                5.336598040852392,
+                8.468682018645584
+            ],
+            [
+                2.928458780456748,
+                7.767425413202347
+            ],
+            [
+                3.67643093925819,
+                8.431069401513593
+            ],
+            [
+                8.252964341057256,
+                7.14525667848814
+            ],
+            [
+                3.6665874351960195,
+                3.894759497007904
+            ]
+        ],
+        "hull_polygon": [
+            [
+                5.655458198783705,
+                1.0717149734406437
+            ],
+            [
+                8.980744541828605,
+                3.516322462844152
+            ],
+            [
+                8.252964341057256,
+                7.14525667848814
+            ],
+            [
+                5.336598040852392,
+                8.468682018645584
+            ],
+            [
+                1.4937856333187414,
+                8.481742933750965
+            ],
+            [
+                1.2417955367778495,
+                7.639449071515054
+            ],
+            [
+                1.671640470046424,
+                5.768876199329586
+            ],
+            [
+                3.8429787546877785,
+                2.9393173476540913
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_038_input.jpg",
+        "result_image": "dataset_convex_hull/hull_038_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_038_input.jpg",
+        "save_id": 2002,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2002.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_040",
+        "task": "convex_hull",
+        "num_total_points": 15,
+        "num_hull_vertices": 5,
+        "points": [
+            [
+                8.84186453796233,
+                4.592837725587237
+            ],
+            [
+                3.15110791199354,
+                4.245477819015693
+            ],
+            [
+                2.3074815836951936,
+                8.363490926075546
+            ],
+            [
+                6.881256053688133,
+                7.710678085234446
+            ],
+            [
+                4.31574669612963,
+                5.133012709961515
+            ],
+            [
+                6.73340889126091,
+                8.426773456450741
+            ],
+            [
+                4.2507449254857725,
+                3.688849770251487
+            ],
+            [
+                3.6735082097930363,
+                2.834728944019809
+            ],
+            [
+                3.202230633129835,
+                3.138662335359877
+            ],
+            [
+                2.269861582500563,
+                7.099969505371028
+            ],
+            [
+                8.067040478609416,
+                2.2989333787442936
+            ],
+            [
+                1.19745481590021,
+                1.122311966879538
+            ],
+            [
+                3.631571054995894,
+                1.823676017782554
+            ],
+            [
+                8.954757408173451,
+                1.1937169695919438
+            ],
+            [
+                7.148616802249008,
+                4.2733070727082545
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.19745481590021,
+                1.122311966879538
+            ],
+            [
+                8.954757408173451,
+                1.1937169695919438
+            ],
+            [
+                8.84186453796233,
+                4.592837725587237
+            ],
+            [
+                6.73340889126091,
+                8.426773456450741
+            ],
+            [
+                2.3074815836951936,
+                8.363490926075546
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_040_input.jpg",
+        "result_image": "dataset_convex_hull/hull_040_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_040_input.jpg",
+        "save_id": 2004,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2004.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_041",
+        "task": "convex_hull",
+        "num_total_points": 8,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                1.2930477794244402,
+                6.06301173423602
+            ],
+            [
+                5.1792519212554184,
+                5.122313409087439
+            ],
+            [
+                7.92187972410954,
+                3.8674750855361424
+            ],
+            [
+                3.771840852609208,
+                8.44136715781177
+            ],
+            [
+                7.166463048178132,
+                6.7336940817726605
+            ],
+            [
+                1.5951963015472161,
+                4.281000652586265
+            ],
+            [
+                7.906093574457525,
+                1.1144259513551766
+            ],
+            [
+                1.1842146078175562,
+                4.777274128167244
+            ]
+        ],
+        "hull_polygon": [
+            [
+                7.906093574457525,
+                1.1144259513551766
+            ],
+            [
+                7.92187972410954,
+                3.8674750855361424
+            ],
+            [
+                7.166463048178132,
+                6.7336940817726605
+            ],
+            [
+                3.771840852609208,
+                8.44136715781177
+            ],
+            [
+                1.2930477794244402,
+                6.06301173423602
+            ],
+            [
+                1.1842146078175562,
+                4.777274128167244
+            ],
+            [
+                1.5951963015472161,
+                4.281000652586265
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_041_input.jpg",
+        "result_image": "dataset_convex_hull/hull_041_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_041_input.jpg",
+        "save_id": 2005,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2005.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_042",
+        "task": "convex_hull",
+        "num_total_points": 12,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                7.1171119733435475,
+                6.313808535878187
+            ],
+            [
+                4.9500461383644,
+                5.74099457404607
+            ],
+            [
+                6.324056188200584,
+                3.257022719586163
+            ],
+            [
+                7.914032834358068,
+                5.0857757216182105
+            ],
+            [
+                8.598309242686579,
+                2.6002933774871213
+            ],
+            [
+                4.4301211445675515,
+                6.485957851470163
+            ],
+            [
+                8.957902980970479,
+                3.0726524834377704
+            ],
+            [
+                6.804764670815207,
+                4.366729597549445
+            ],
+            [
+                6.365625700290939,
+                7.970860785952232
+            ],
+            [
+                8.857243279190197,
+                6.213220377081679
+            ],
+            [
+                5.3255084097660745,
+                4.842593697429996
+            ],
+            [
+                3.665340121764732,
+                5.503066788344721
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.957902980970479,
+                3.0726524834377704
+            ],
+            [
+                8.857243279190197,
+                6.213220377081679
+            ],
+            [
+                6.365625700290939,
+                7.970860785952232
+            ],
+            [
+                4.4301211445675515,
+                6.485957851470163
+            ],
+            [
+                3.665340121764732,
+                5.503066788344721
+            ],
+            [
+                6.324056188200584,
+                3.257022719586163
+            ],
+            [
+                8.598309242686579,
+                2.6002933774871213
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_042_input.jpg",
+        "result_image": "dataset_convex_hull/hull_042_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_042_input.jpg",
+        "save_id": 2006,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2006.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_043",
+        "task": "convex_hull",
+        "num_total_points": 9,
+        "num_hull_vertices": 4,
+        "points": [
+            [
+                6.477735260307358,
+                6.963458497288365
+            ],
+            [
+                5.830859347152894,
+                2.39644695775712
+            ],
+            [
+                3.08697152992497,
+                8.648341086369658
+            ],
+            [
+                8.537553408631767,
+                1.8571628140618328
+            ],
+            [
+                7.622169368046248,
+                8.22793815394727
+            ],
+            [
+                8.589331661541117,
+                8.795180526293745
+            ],
+            [
+                2.8090533853477346,
+                5.274658473379988
+            ],
+            [
+                1.5035370882141716,
+                3.568579982242567
+            ],
+            [
+                1.0214434975974411,
+                2.6474553188031855
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.0214434975974411,
+                2.6474553188031855
+            ],
+            [
+                8.537553408631767,
+                1.8571628140618328
+            ],
+            [
+                8.589331661541117,
+                8.795180526293745
+            ],
+            [
+                3.08697152992497,
+                8.648341086369658
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_043_input.jpg",
+        "result_image": "dataset_convex_hull/hull_043_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_043_input.jpg",
+        "save_id": 2007,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2007.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_044",
+        "task": "convex_hull",
+        "num_total_points": 12,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                2.6206636851907694,
+                4.104194089564978
+            ],
+            [
+                1.8154483773474857,
+                3.885941638710997
+            ],
+            [
+                1.272708999040428,
+                1.5244814529562865
+            ],
+            [
+                2.0551323690482697,
+                4.453810445046956
+            ],
+            [
+                3.727630462628479,
+                8.24215314526505
+            ],
+            [
+                1.5127353042707403,
+                2.422453086377697
+            ],
+            [
+                6.337881900764073,
+                5.116641236492544
+            ],
+            [
+                4.404318941978535,
+                6.085356815918512
+            ],
+            [
+                1.5637642388009816,
+                7.877110318660835
+            ],
+            [
+                5.32954525692656,
+                3.2247937382371905
+            ],
+            [
+                1.1285899776405408,
+                8.19058555991575
+            ],
+            [
+                3.407221258182078,
+                8.25316726384565
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.1285899776405408,
+                8.19058555991575
+            ],
+            [
+                1.272708999040428,
+                1.5244814529562865
+            ],
+            [
+                5.32954525692656,
+                3.2247937382371905
+            ],
+            [
+                6.337881900764073,
+                5.116641236492544
+            ],
+            [
+                3.727630462628479,
+                8.24215314526505
+            ],
+            [
+                3.407221258182078,
+                8.25316726384565
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_044_input.jpg",
+        "result_image": "dataset_convex_hull/hull_044_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_044_input.jpg",
+        "save_id": 2008,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2008.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_045",
+        "task": "convex_hull",
+        "num_total_points": 8,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                5.651376598118987,
+                1.9334709326704198
+            ],
+            [
+                1.9339096184642255,
+                3.2637052232085857
+            ],
+            [
+                6.111225178397737,
+                5.948108590147777
+            ],
+            [
+                5.0908664437573155,
+                1.3956362117313414
+            ],
+            [
+                6.110571011854264,
+                2.835564166314289
+            ],
+            [
+                6.753104009502279,
+                3.9380993160761735
+            ],
+            [
+                2.5424812743360468,
+                6.084175145352575
+            ],
+            [
+                1.3921499607987835,
+                1.4294300076855304
+            ]
+        ],
+        "hull_polygon": [
+            [
+                2.5424812743360468,
+                6.084175145352575
+            ],
+            [
+                1.3921499607987835,
+                1.4294300076855304
+            ],
+            [
+                5.0908664437573155,
+                1.3956362117313414
+            ],
+            [
+                5.651376598118987,
+                1.9334709326704198
+            ],
+            [
+                6.753104009502279,
+                3.9380993160761735
+            ],
+            [
+                6.111225178397737,
+                5.948108590147777
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_045_input.jpg",
+        "result_image": "dataset_convex_hull/hull_045_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_045_input.jpg",
+        "save_id": 2009,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2009.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_046",
+        "task": "convex_hull",
+        "num_total_points": 10,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                2.632450373230234,
+                6.1216195724385845
+            ],
+            [
+                1.2672428050805635,
+                8.440571932318367
+            ],
+            [
+                8.421579902284325,
+                4.034815709781138
+            ],
+            [
+                1.0297915438714096,
+                3.7507220651855597
+            ],
+            [
+                5.4981228985457316,
+                1.1815150591092243
+            ],
+            [
+                4.904650286079422,
+                1.864663469718466
+            ],
+            [
+                8.416429142835522,
+                2.4822818265832387
+            ],
+            [
+                1.7047662978909912,
+                5.646790449044837
+            ],
+            [
+                2.9503736186273075,
+                8.610301595808165
+            ],
+            [
+                2.4694719580054256,
+                7.933979408072882
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.421579902284325,
+                4.034815709781138
+            ],
+            [
+                2.9503736186273075,
+                8.610301595808165
+            ],
+            [
+                1.2672428050805635,
+                8.440571932318367
+            ],
+            [
+                1.0297915438714096,
+                3.7507220651855597
+            ],
+            [
+                5.4981228985457316,
+                1.1815150591092243
+            ],
+            [
+                8.416429142835522,
+                2.4822818265832387
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_046_input.jpg",
+        "result_image": "dataset_convex_hull/hull_046_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_046_input.jpg",
+        "save_id": 2010,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2010.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_047",
+        "task": "convex_hull",
+        "num_total_points": 14,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                7.026328702211296,
+                4.9623571102138415
+            ],
+            [
+                8.67947039309713,
+                6.13119326941748
+            ],
+            [
+                5.241672053633603,
+                6.004269183305706
+            ],
+            [
+                7.532988450850752,
+                4.632836715633881
+            ],
+            [
+                1.6393616968726334,
+                8.827576452766134
+            ],
+            [
+                4.741965062310863,
+                2.600282104334542
+            ],
+            [
+                8.846949205936342,
+                2.2630449472516867
+            ],
+            [
+                3.3238699818179844,
+                6.360312884494926
+            ],
+            [
+                5.671068382313351,
+                7.07932510619479
+            ],
+            [
+                7.083444105344334,
+                3.8482300746263176
+            ],
+            [
+                7.998112359989324,
+                1.6395247029686564
+            ],
+            [
+                8.017905555768788,
+                7.891115497214203
+            ],
+            [
+                2.51738439458388,
+                8.09096168150137
+            ],
+            [
+                5.6922465673544425,
+                1.6711675284092609
+            ]
+        ],
+        "hull_polygon": [
+            [
+                7.998112359989324,
+                1.6395247029686564
+            ],
+            [
+                8.846949205936342,
+                2.2630449472516867
+            ],
+            [
+                8.67947039309713,
+                6.13119326941748
+            ],
+            [
+                8.017905555768788,
+                7.891115497214203
+            ],
+            [
+                1.6393616968726334,
+                8.827576452766134
+            ],
+            [
+                4.741965062310863,
+                2.600282104334542
+            ],
+            [
+                5.6922465673544425,
+                1.6711675284092609
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_047_input.jpg",
+        "result_image": "dataset_convex_hull/hull_047_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_047_input.jpg",
+        "save_id": 2011,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2011.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_048",
+        "task": "convex_hull",
+        "num_total_points": 15,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                7.485078529161037,
+                2.371042939594081
+            ],
+            [
+                7.864469926689374,
+                3.3394404374041384
+            ],
+            [
+                6.347122445850849,
+                6.602693325903487
+            ],
+            [
+                2.36824577874323,
+                8.115699547165175
+            ],
+            [
+                2.1525125132238543,
+                8.085304516809241
+            ],
+            [
+                5.839693164284731,
+                3.8045691118424063
+            ],
+            [
+                1.9201049148430043,
+                7.536576977167313
+            ],
+            [
+                5.631720247202305,
+                5.466263569453889
+            ],
+            [
+                3.9578145300147938,
+                2.240312392787109
+            ],
+            [
+                1.8661599829897586,
+                1.4204752382745909
+            ],
+            [
+                8.679591227098141,
+                2.17124985149709
+            ],
+            [
+                5.620175715284112,
+                8.647967492774978
+            ],
+            [
+                6.89606108315921,
+                6.8739975251256205
+            ],
+            [
+                3.4709086408081093,
+                4.470019581908774
+            ],
+            [
+                4.9726032593013,
+                3.7101046291584865
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.8661599829897586,
+                1.4204752382745909
+            ],
+            [
+                8.679591227098141,
+                2.17124985149709
+            ],
+            [
+                6.89606108315921,
+                6.8739975251256205
+            ],
+            [
+                5.620175715284112,
+                8.647967492774978
+            ],
+            [
+                2.1525125132238543,
+                8.085304516809241
+            ],
+            [
+                1.9201049148430043,
+                7.536576977167313
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_048_input.jpg",
+        "result_image": "dataset_convex_hull/hull_048_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_048_input.jpg",
+        "save_id": 2012,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2012.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_049",
+        "task": "convex_hull",
+        "num_total_points": 8,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                1.7871024815308365,
+                3.945241323041196
+            ],
+            [
+                2.9631970963979404,
+                3.0132082440415715
+            ],
+            [
+                3.7040848466811713,
+                2.6440018538891827
+            ],
+            [
+                3.60606679253328,
+                3.374793423221927
+            ],
+            [
+                8.504578210695858,
+                2.679670840239301
+            ],
+            [
+                5.745501428055189,
+                2.110895832676766
+            ],
+            [
+                3.11895084767586,
+                5.977730966371506
+            ],
+            [
+                1.7209875852083165,
+                4.745475887743027
+            ]
+        ],
+        "hull_polygon": [
+            [
+                3.11895084767586,
+                5.977730966371506
+            ],
+            [
+                1.7209875852083165,
+                4.745475887743027
+            ],
+            [
+                1.7871024815308365,
+                3.945241323041196
+            ],
+            [
+                2.9631970963979404,
+                3.0132082440415715
+            ],
+            [
+                3.7040848466811713,
+                2.6440018538891827
+            ],
+            [
+                5.745501428055189,
+                2.110895832676766
+            ],
+            [
+                8.504578210695858,
+                2.679670840239301
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_049_input.jpg",
+        "result_image": "dataset_convex_hull/hull_049_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_049_input.jpg",
+        "save_id": 2013,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2013.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_050",
+        "task": "convex_hull",
+        "num_total_points": 12,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                2.4809078338073327,
+                1.957686063861642
+            ],
+            [
+                4.88703968318775,
+                4.112553365959776
+            ],
+            [
+                7.1905206660866545,
+                6.342543105069652
+            ],
+            [
+                2.7371848357920507,
+                6.411980488915215
+            ],
+            [
+                4.388159976450311,
+                1.1742062916332054
+            ],
+            [
+                5.452192308418333,
+                6.263902155551207
+            ],
+            [
+                6.308282536486125,
+                3.5929413157606644
+            ],
+            [
+                6.484098212078581,
+                1.562204615986956
+            ],
+            [
+                8.272630511637635,
+                3.6091781113663925
+            ],
+            [
+                6.448087699702247,
+                5.9696448045508275
+            ],
+            [
+                5.828938223185823,
+                4.147739155210609
+            ],
+            [
+                6.769132915618009,
+                1.4149737528953406
+            ]
+        ],
+        "hull_polygon": [
+            [
+                2.7371848357920507,
+                6.411980488915215
+            ],
+            [
+                2.4809078338073327,
+                1.957686063861642
+            ],
+            [
+                4.388159976450311,
+                1.1742062916332054
+            ],
+            [
+                6.769132915618009,
+                1.4149737528953406
+            ],
+            [
+                8.272630511637635,
+                3.6091781113663925
+            ],
+            [
+                7.1905206660866545,
+                6.342543105069652
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_050_input.jpg",
+        "result_image": "dataset_convex_hull/hull_050_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_050_input.jpg",
+        "save_id": 2014,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2014.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_051",
+        "task": "convex_hull",
+        "num_total_points": 12,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                5.952494529201949,
+                4.323457263429511
+            ],
+            [
+                3.0069831921881045,
+                1.0696979427592188
+            ],
+            [
+                2.506681346557203,
+                4.427115249382148
+            ],
+            [
+                7.207395984197084,
+                2.5689119712376227
+            ],
+            [
+                3.0098362102878164,
+                3.694904408397634
+            ],
+            [
+                2.11495292281214,
+                8.865884953555732
+            ],
+            [
+                6.465836118342477,
+                8.10543812418556
+            ],
+            [
+                5.558650104692118,
+                1.0893633286500348
+            ],
+            [
+                5.465252385289764,
+                1.8146113451435824
+            ],
+            [
+                2.5238603272200946,
+                5.205853850975188
+            ],
+            [
+                6.16974799787221,
+                3.632241861962913
+            ],
+            [
+                6.190180080912606,
+                2.4646294714933568
+            ]
+        ],
+        "hull_polygon": [
+            [
+                6.465836118342477,
+                8.10543812418556
+            ],
+            [
+                2.11495292281214,
+                8.865884953555732
+            ],
+            [
+                2.506681346557203,
+                4.427115249382148
+            ],
+            [
+                3.0069831921881045,
+                1.0696979427592188
+            ],
+            [
+                5.558650104692118,
+                1.0893633286500348
+            ],
+            [
+                7.207395984197084,
+                2.5689119712376227
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_051_input.jpg",
+        "result_image": "dataset_convex_hull/hull_051_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_051_input.jpg",
+        "save_id": 2015,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2015.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_052",
+        "task": "convex_hull",
+        "num_total_points": 9,
+        "num_hull_vertices": 4,
+        "points": [
+            [
+                8.559999843850209,
+                1.428708265605156
+            ],
+            [
+                6.242612614171754,
+                7.6524040793613075
+            ],
+            [
+                3.315678839257977,
+                1.4667425449651716
+            ],
+            [
+                6.2543215324514145,
+                7.784689298017737
+            ],
+            [
+                4.428023238070292,
+                1.471410229503209
+            ],
+            [
+                5.111939641915137,
+                3.0674153067172005
+            ],
+            [
+                1.5500567236742366,
+                6.845760731045116
+            ],
+            [
+                6.023268131118307,
+                7.2028889325890475
+            ],
+            [
+                2.9549835100890105,
+                6.820919120894904
+            ]
+        ],
+        "hull_polygon": [
+            [
+                6.2543215324514145,
+                7.784689298017737
+            ],
+            [
+                1.5500567236742366,
+                6.845760731045116
+            ],
+            [
+                3.315678839257977,
+                1.4667425449651716
+            ],
+            [
+                8.559999843850209,
+                1.428708265605156
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_052_input.jpg",
+        "result_image": "dataset_convex_hull/hull_052_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_052_input.jpg",
+        "save_id": 2016,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2016.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_053",
+        "task": "convex_hull",
+        "num_total_points": 13,
+        "num_hull_vertices": 5,
+        "points": [
+            [
+                3.868169820959875,
+                4.079738867181178
+            ],
+            [
+                3.2072901654006465,
+                4.631265686718925
+            ],
+            [
+                3.332607991358276,
+                6.877690817176881
+            ],
+            [
+                7.886251187833646,
+                4.365678470293343
+            ],
+            [
+                1.8226410260960497,
+                7.721307156827823
+            ],
+            [
+                6.108476324341504,
+                5.859337416776198
+            ],
+            [
+                6.886440917768375,
+                2.2845062864460006
+            ],
+            [
+                2.4066816711310297,
+                3.306528198746407
+            ],
+            [
+                3.5124235061035307,
+                4.730229883612129
+            ],
+            [
+                6.73280267545379,
+                4.196996893345324
+            ],
+            [
+                8.483765367180057,
+                7.236754076555154
+            ],
+            [
+                5.689062537698608,
+                2.8479018144714514
+            ],
+            [
+                1.4615070334118254,
+                1.7443581080050556
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.8226410260960497,
+                7.721307156827823
+            ],
+            [
+                1.4615070334118254,
+                1.7443581080050556
+            ],
+            [
+                6.886440917768375,
+                2.2845062864460006
+            ],
+            [
+                7.886251187833646,
+                4.365678470293343
+            ],
+            [
+                8.483765367180057,
+                7.236754076555154
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_053_input.jpg",
+        "result_image": "dataset_convex_hull/hull_053_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_053_input.jpg",
+        "save_id": 2017,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2017.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_054",
+        "task": "convex_hull",
+        "num_total_points": 8,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                5.882314655710669,
+                2.0197495327171113
+            ],
+            [
+                7.201947045953385,
+                8.169586047563708
+            ],
+            [
+                6.757471140428401,
+                4.121583201121708
+            ],
+            [
+                3.5001112863570114,
+                4.75720174544547
+            ],
+            [
+                8.515835449284594,
+                6.466000444386023
+            ],
+            [
+                7.710293501971649,
+                2.677077953752476
+            ],
+            [
+                6.5633162902113,
+                1.5039167137814813
+            ],
+            [
+                6.180330724068033,
+                1.740624169545062
+            ]
+        ],
+        "hull_polygon": [
+            [
+                7.201947045953385,
+                8.169586047563708
+            ],
+            [
+                3.5001112863570114,
+                4.75720174544547
+            ],
+            [
+                5.882314655710669,
+                2.0197495327171113
+            ],
+            [
+                6.180330724068033,
+                1.740624169545062
+            ],
+            [
+                6.5633162902113,
+                1.5039167137814813
+            ],
+            [
+                7.710293501971649,
+                2.677077953752476
+            ],
+            [
+                8.515835449284594,
+                6.466000444386023
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_054_input.jpg",
+        "result_image": "dataset_convex_hull/hull_054_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_054_input.jpg",
+        "save_id": 2018,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2018.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_055",
+        "task": "convex_hull",
+        "num_total_points": 15,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                7.639617120682105,
+                6.016302490115648
+            ],
+            [
+                7.327222525686027,
+                4.749994480997763
+            ],
+            [
+                7.908830954243126,
+                2.5511304652163185
+            ],
+            [
+                5.6520097356249215,
+                6.383995594064892
+            ],
+            [
+                1.6090752599123537,
+                8.395448862313675
+            ],
+            [
+                1.7405693105795716,
+                2.2263075073587313
+            ],
+            [
+                8.579458074672104,
+                4.447022347958753
+            ],
+            [
+                4.4651960203366805,
+                8.23043620575799
+            ],
+            [
+                1.0043338237252666,
+                6.3067874406254
+            ],
+            [
+                4.449522119008299,
+                2.4343042966130612
+            ],
+            [
+                7.4356080315576,
+                8.578066212642739
+            ],
+            [
+                6.39175586186328,
+                5.032564070358658
+            ],
+            [
+                1.3532235741160115,
+                7.074089385088578
+            ],
+            [
+                3.470697190423869,
+                3.1514217193683844
+            ],
+            [
+                6.847350146858721,
+                5.353853958673841
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.0043338237252666,
+                6.3067874406254
+            ],
+            [
+                1.7405693105795716,
+                2.2263075073587313
+            ],
+            [
+                7.908830954243126,
+                2.5511304652163185
+            ],
+            [
+                8.579458074672104,
+                4.447022347958753
+            ],
+            [
+                7.4356080315576,
+                8.578066212642739
+            ],
+            [
+                1.6090752599123537,
+                8.395448862313675
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_055_input.jpg",
+        "result_image": "dataset_convex_hull/hull_055_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_055_input.jpg",
+        "save_id": 2019,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2019.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_056",
+        "task": "convex_hull",
+        "num_total_points": 8,
+        "num_hull_vertices": 5,
+        "points": [
+            [
+                5.294152300043057,
+                8.323548701768336
+            ],
+            [
+                1.8221176668636687,
+                4.302795881804299
+            ],
+            [
+                3.4190877719705846,
+                1.5530994778417702
+            ],
+            [
+                3.6875992851923014,
+                5.953433415979391
+            ],
+            [
+                2.987214819525345,
+                3.8773730798361425
+            ],
+            [
+                5.130287586062512,
+                2.5688454257425555
+            ],
+            [
+                3.729742246518195,
+                7.0589031093814665
+            ],
+            [
+                3.6347692376220397,
+                7.208541266692469
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.8221176668636687,
+                4.302795881804299
+            ],
+            [
+                3.4190877719705846,
+                1.5530994778417702
+            ],
+            [
+                5.130287586062512,
+                2.5688454257425555
+            ],
+            [
+                5.294152300043057,
+                8.323548701768336
+            ],
+            [
+                3.6347692376220397,
+                7.208541266692469
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_056_input.jpg",
+        "result_image": "dataset_convex_hull/hull_056_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_056_input.jpg",
+        "save_id": 2020,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2020.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_057",
+        "task": "convex_hull",
+        "num_total_points": 14,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                4.548073328532318,
+                1.4248135630689118
+            ],
+            [
+                2.7178715384027763,
+                3.9548090407647996
+            ],
+            [
+                5.1523154618422735,
+                8.764701931418315
+            ],
+            [
+                7.2539078120806755,
+                1.0454734288781191
+            ],
+            [
+                3.1998073148987762,
+                5.509080510923665
+            ],
+            [
+                4.698739138211675,
+                7.279816246697512
+            ],
+            [
+                8.638083561958954,
+                4.06143664391734
+            ],
+            [
+                1.7457335601538295,
+                6.90079871154622
+            ],
+            [
+                3.754544283083243,
+                6.128183748274402
+            ],
+            [
+                1.6452174014918368,
+                2.5795892313746718
+            ],
+            [
+                5.620099261083328,
+                7.266194007499273
+            ],
+            [
+                5.868119427890366,
+                1.266497882962435
+            ],
+            [
+                4.057961264011185,
+                7.047483930809268
+            ],
+            [
+                4.90888667050759,
+                4.157979487834289
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.638083561958954,
+                4.06143664391734
+            ],
+            [
+                5.1523154618422735,
+                8.764701931418315
+            ],
+            [
+                1.7457335601538295,
+                6.90079871154622
+            ],
+            [
+                1.6452174014918368,
+                2.5795892313746718
+            ],
+            [
+                4.548073328532318,
+                1.4248135630689118
+            ],
+            [
+                7.2539078120806755,
+                1.0454734288781191
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_057_input.jpg",
+        "result_image": "dataset_convex_hull/hull_057_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_057_input.jpg",
+        "save_id": 2021,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2021.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_058",
+        "task": "convex_hull",
+        "num_total_points": 10,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                8.39151392829676,
+                2.827704260654654
+            ],
+            [
+                1.5076554770028663,
+                6.667710012313049
+            ],
+            [
+                3.211070320761155,
+                6.592510323108744
+            ],
+            [
+                1.4827849169278693,
+                4.782011325519087
+            ],
+            [
+                3.774077220795901,
+                2.8094568419538364
+            ],
+            [
+                4.995820934395936,
+                8.991655084512779
+            ],
+            [
+                1.873626406287868,
+                6.746294307268907
+            ],
+            [
+                1.9616075450754575,
+                6.6696467037727665
+            ],
+            [
+                1.731037297062568,
+                3.182727806369022
+            ],
+            [
+                4.010168635981787,
+                7.146157767352852
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.39151392829676,
+                2.827704260654654
+            ],
+            [
+                4.995820934395936,
+                8.991655084512779
+            ],
+            [
+                1.5076554770028663,
+                6.667710012313049
+            ],
+            [
+                1.4827849169278693,
+                4.782011325519087
+            ],
+            [
+                1.731037297062568,
+                3.182727806369022
+            ],
+            [
+                3.774077220795901,
+                2.8094568419538364
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_058_input.jpg",
+        "result_image": "dataset_convex_hull/hull_058_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_058_input.jpg",
+        "save_id": 2022,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2022.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_059",
+        "task": "convex_hull",
+        "num_total_points": 13,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                3.0496953669880797,
+                3.2448929810203424
+            ],
+            [
+                8.244384499388362,
+                5.804900933141087
+            ],
+            [
+                4.558820985812906,
+                5.261048077319754
+            ],
+            [
+                7.850901703148858,
+                2.381451343974894
+            ],
+            [
+                6.893681277511163,
+                2.958965267807823
+            ],
+            [
+                8.15306862387664,
+                7.639042095049998
+            ],
+            [
+                5.326700917008912,
+                4.064885001564051
+            ],
+            [
+                6.39482961488219,
+                4.892896241384987
+            ],
+            [
+                1.132583393559714,
+                6.134555240914964
+            ],
+            [
+                8.301862977696164,
+                8.502090480858303
+            ],
+            [
+                3.8213081753824456,
+                3.4597514681571164
+            ],
+            [
+                4.7449582693689685,
+                8.591438566956118
+            ],
+            [
+                3.025730162651665,
+                7.526211402045167
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.132583393559714,
+                6.134555240914964
+            ],
+            [
+                3.0496953669880797,
+                3.2448929810203424
+            ],
+            [
+                7.850901703148858,
+                2.381451343974894
+            ],
+            [
+                8.244384499388362,
+                5.804900933141087
+            ],
+            [
+                8.301862977696164,
+                8.502090480858303
+            ],
+            [
+                4.7449582693689685,
+                8.591438566956118
+            ],
+            [
+                3.025730162651665,
+                7.526211402045167
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_059_input.jpg",
+        "result_image": "dataset_convex_hull/hull_059_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_059_input.jpg",
+        "save_id": 2023,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2023.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_060",
+        "task": "convex_hull",
+        "num_total_points": 13,
+        "num_hull_vertices": 8,
+        "points": [
+            [
+                3.0561435208738725,
+                4.330072482009068
+            ],
+            [
+                6.809254202261002,
+                7.916567298827085
+            ],
+            [
+                6.925015850143201,
+                8.352706353803429
+            ],
+            [
+                5.386587909794335,
+                2.0244523956110747
+            ],
+            [
+                1.5885972777036121,
+                8.386668392719852
+            ],
+            [
+                2.234947330841127,
+                8.781906326435845
+            ],
+            [
+                5.809326909268565,
+                7.4126233878073435
+            ],
+            [
+                1.445545176358137,
+                2.55462428670588
+            ],
+            [
+                1.1097277790572537,
+                4.543325875108113
+            ],
+            [
+                1.650772748586478,
+                6.056755688762664
+            ],
+            [
+                6.052378989919239,
+                2.125003857630899
+            ],
+            [
+                4.527446957073329,
+                8.079166632457625
+            ],
+            [
+                2.7118522359999737,
+                2.137123304470962
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.5885972777036121,
+                8.386668392719852
+            ],
+            [
+                1.1097277790572537,
+                4.543325875108113
+            ],
+            [
+                1.445545176358137,
+                2.55462428670588
+            ],
+            [
+                2.7118522359999737,
+                2.137123304470962
+            ],
+            [
+                5.386587909794335,
+                2.0244523956110747
+            ],
+            [
+                6.052378989919239,
+                2.125003857630899
+            ],
+            [
+                6.925015850143201,
+                8.352706353803429
+            ],
+            [
+                2.234947330841127,
+                8.781906326435845
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_060_input.jpg",
+        "result_image": "dataset_convex_hull/hull_060_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_060_input.jpg",
+        "save_id": 2024,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2024.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_062",
+        "task": "convex_hull",
+        "num_total_points": 14,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                7.36025215183791,
+                5.4975421035090335
+            ],
+            [
+                5.630465139531227,
+                8.269481674747539
+            ],
+            [
+                5.336401695009057,
+                5.593224708089792
+            ],
+            [
+                2.3049541788742234,
+                1.0812126923635441
+            ],
+            [
+                1.8116690395676356,
+                6.4841056564259425
+            ],
+            [
+                3.628666474488883,
+                5.4108460768909605
+            ],
+            [
+                3.2870831704071906,
+                4.068207322450756
+            ],
+            [
+                4.161600728376186,
+                8.364900739044405
+            ],
+            [
+                7.88379555779424,
+                7.64130492931555
+            ],
+            [
+                1.8649402098345291,
+                6.181565823331129
+            ],
+            [
+                6.413026354368493,
+                6.224467721340674
+            ],
+            [
+                4.789842547680649,
+                5.590021228748482
+            ],
+            [
+                6.84312130675864,
+                6.08385647343287
+            ],
+            [
+                6.687569748339914,
+                7.5848036164169
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.8116690395676356,
+                6.4841056564259425
+            ],
+            [
+                2.3049541788742234,
+                1.0812126923635441
+            ],
+            [
+                7.36025215183791,
+                5.4975421035090335
+            ],
+            [
+                7.88379555779424,
+                7.64130492931555
+            ],
+            [
+                5.630465139531227,
+                8.269481674747539
+            ],
+            [
+                4.161600728376186,
+                8.364900739044405
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_062_input.jpg",
+        "result_image": "dataset_convex_hull/hull_062_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_062_input.jpg",
+        "save_id": 2026,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2026.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_064",
+        "task": "convex_hull",
+        "num_total_points": 15,
+        "num_hull_vertices": 8,
+        "points": [
+            [
+                7.230504773422624,
+                3.10837141157209
+            ],
+            [
+                8.943265804750702,
+                4.069188066932013
+            ],
+            [
+                3.253913329544356,
+                7.528533477089875
+            ],
+            [
+                8.146003423220735,
+                4.009589554095458
+            ],
+            [
+                2.415152004917026,
+                7.4245795975493
+            ],
+            [
+                2.941932120032858,
+                8.468421827051465
+            ],
+            [
+                1.2087932610891023,
+                5.235273391749122
+            ],
+            [
+                3.986692217993891,
+                7.450851343735361
+            ],
+            [
+                1.4268964675687164,
+                7.891364142837623
+            ],
+            [
+                5.687424941858921,
+                8.797567001108895
+            ],
+            [
+                1.4872033226005463,
+                4.729816102628251
+            ],
+            [
+                3.0193118835837724,
+                7.492706714373147
+            ],
+            [
+                3.527398525278242,
+                3.936702508530276
+            ],
+            [
+                2.7923207441828586,
+                2.647484516025747
+            ],
+            [
+                2.0840474916773335,
+                6.80206824242057
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.943265804750702,
+                4.069188066932013
+            ],
+            [
+                5.687424941858921,
+                8.797567001108895
+            ],
+            [
+                2.941932120032858,
+                8.468421827051465
+            ],
+            [
+                1.4268964675687164,
+                7.891364142837623
+            ],
+            [
+                1.2087932610891023,
+                5.235273391749122
+            ],
+            [
+                1.4872033226005463,
+                4.729816102628251
+            ],
+            [
+                2.7923207441828586,
+                2.647484516025747
+            ],
+            [
+                7.230504773422624,
+                3.10837141157209
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_064_input.jpg",
+        "result_image": "dataset_convex_hull/hull_064_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_064_input.jpg",
+        "save_id": 2028,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2028.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_066",
+        "task": "convex_hull",
+        "num_total_points": 12,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                2.6730457125160942,
+                1.123402882163778
+            ],
+            [
+                5.1029473279392,
+                7.271598232304176
+            ],
+            [
+                3.941369842781561,
+                1.4464683313646702
+            ],
+            [
+                2.2154600874043338,
+                2.799406914505421
+            ],
+            [
+                8.325633305621398,
+                1.0882330049476305
+            ],
+            [
+                4.378390918832504,
+                4.157139197350416
+            ],
+            [
+                5.508339767474094,
+                3.2726711605058956
+            ],
+            [
+                7.886311305100921,
+                1.7785762592475933
+            ],
+            [
+                8.605327366781454,
+                1.370879998620251
+            ],
+            [
+                4.207726087389594,
+                4.4783053288362975
+            ],
+            [
+                8.236487090430291,
+                4.236652325238004
+            ],
+            [
+                4.1376870066462645,
+                1.4535501861161313
+            ]
+        ],
+        "hull_polygon": [
+            [
+                5.1029473279392,
+                7.271598232304176
+            ],
+            [
+                2.2154600874043338,
+                2.799406914505421
+            ],
+            [
+                2.6730457125160942,
+                1.123402882163778
+            ],
+            [
+                8.325633305621398,
+                1.0882330049476305
+            ],
+            [
+                8.605327366781454,
+                1.370879998620251
+            ],
+            [
+                8.236487090430291,
+                4.236652325238004
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_066_input.jpg",
+        "result_image": "dataset_convex_hull/hull_066_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_066_input.jpg",
+        "save_id": 2030,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2030.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_068",
+        "task": "convex_hull",
+        "num_total_points": 12,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                5.374247652076181,
+                6.925033789397703
+            ],
+            [
+                8.189427685480076,
+                5.887027468368762
+            ],
+            [
+                4.2654570611160745,
+                4.725743845234177
+            ],
+            [
+                4.793113423143909,
+                4.1434310821174
+            ],
+            [
+                4.247769656345638,
+                3.6835957221072455
+            ],
+            [
+                6.861968293284951,
+                4.819711511077586
+            ],
+            [
+                6.449002364410798,
+                6.375101301636331
+            ],
+            [
+                3.58906662275247,
+                8.1871366497944
+            ],
+            [
+                8.757105379843413,
+                6.649079554460135
+            ],
+            [
+                5.86506672989295,
+                7.678490382011515
+            ],
+            [
+                3.2972376974878754,
+                2.3847284635747394
+            ],
+            [
+                5.809683635133165,
+                6.4824499542562055
+            ]
+        ],
+        "hull_polygon": [
+            [
+                3.58906662275247,
+                8.1871366497944
+            ],
+            [
+                3.2972376974878754,
+                2.3847284635747394
+            ],
+            [
+                6.861968293284951,
+                4.819711511077586
+            ],
+            [
+                8.189427685480076,
+                5.887027468368762
+            ],
+            [
+                8.757105379843413,
+                6.649079554460135
+            ],
+            [
+                5.86506672989295,
+                7.678490382011515
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_068_input.jpg",
+        "result_image": "dataset_convex_hull/hull_068_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_068_input.jpg",
+        "save_id": 2032,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2032.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_070",
+        "task": "convex_hull",
+        "num_total_points": 15,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                5.38633759167539,
+                1.6218092782503657
+            ],
+            [
+                3.2266288707474144,
+                2.215205316784294
+            ],
+            [
+                6.5610960322860015,
+                4.536559521612063
+            ],
+            [
+                6.504615110803998,
+                5.758168930676775
+            ],
+            [
+                1.1389860317329763,
+                8.411815177342703
+            ],
+            [
+                8.562221123417704,
+                2.0666203038958892
+            ],
+            [
+                1.9676076579923656,
+                2.4095945919863704
+            ],
+            [
+                8.12449236743036,
+                2.748228986030357
+            ],
+            [
+                4.9020166415043285,
+                5.654783231278941
+            ],
+            [
+                2.1451613024917613,
+                2.4435197941823086
+            ],
+            [
+                7.155045120267736,
+                2.0892511607928324
+            ],
+            [
+                2.4458588934120993,
+                5.4069468238018406
+            ],
+            [
+                8.226335917865244,
+                6.418562143767496
+            ],
+            [
+                2.382270145002325,
+                1.7296482873390966
+            ],
+            [
+                6.840504635115882,
+                1.2911342419326157
+            ]
+        ],
+        "hull_polygon": [
+            [
+                6.840504635115882,
+                1.2911342419326157
+            ],
+            [
+                8.562221123417704,
+                2.0666203038958892
+            ],
+            [
+                8.226335917865244,
+                6.418562143767496
+            ],
+            [
+                1.1389860317329763,
+                8.411815177342703
+            ],
+            [
+                1.9676076579923656,
+                2.4095945919863704
+            ],
+            [
+                2.382270145002325,
+                1.7296482873390966
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_070_input.jpg",
+        "result_image": "dataset_convex_hull/hull_070_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_070_input.jpg",
+        "save_id": 2034,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2034.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_072",
+        "task": "convex_hull",
+        "num_total_points": 11,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                4.130025495494357,
+                5.948295342907873
+            ],
+            [
+                5.9333881057373326,
+                1.0780380610241531
+            ],
+            [
+                8.406638995177733,
+                8.457376200241725
+            ],
+            [
+                8.777323588292958,
+                4.9092704198597525
+            ],
+            [
+                8.688693578610962,
+                4.522238721308668
+            ],
+            [
+                3.256780091239931,
+                6.633682573819209
+            ],
+            [
+                6.336374163473191,
+                6.8932331926600945
+            ],
+            [
+                3.7485024440423915,
+                1.5621942962115183
+            ],
+            [
+                8.875002970380457,
+                5.116103284873816
+            ],
+            [
+                2.716020136010833,
+                2.298194817206567
+            ],
+            [
+                4.023936031406958,
+                5.583841765745174
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.875002970380457,
+                5.116103284873816
+            ],
+            [
+                8.406638995177733,
+                8.457376200241725
+            ],
+            [
+                3.256780091239931,
+                6.633682573819209
+            ],
+            [
+                2.716020136010833,
+                2.298194817206567
+            ],
+            [
+                3.7485024440423915,
+                1.5621942962115183
+            ],
+            [
+                5.9333881057373326,
+                1.0780380610241531
+            ],
+            [
+                8.688693578610962,
+                4.522238721308668
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_072_input.jpg",
+        "result_image": "dataset_convex_hull/hull_072_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_072_input.jpg",
+        "save_id": 2036,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2036.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_074",
+        "task": "convex_hull",
+        "num_total_points": 12,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                7.209652017639639,
+                3.093217740674813
+            ],
+            [
+                6.661976213241932,
+                3.485121579692188
+            ],
+            [
+                7.454150890618197,
+                4.525185002682431
+            ],
+            [
+                2.9398567245149367,
+                1.4303456933745577
+            ],
+            [
+                7.587558337200311,
+                8.732550213262261
+            ],
+            [
+                4.15004545595078,
+                4.508591258541191
+            ],
+            [
+                4.4089140074481215,
+                2.334713955816703
+            ],
+            [
+                7.428441118898582,
+                1.6942978196799237
+            ],
+            [
+                8.745771615469106,
+                6.603051055938763
+            ],
+            [
+                7.614778758518462,
+                5.572366210262925
+            ],
+            [
+                1.568707658782201,
+                5.816293244166679
+            ],
+            [
+                1.8114437596855382,
+                2.523431685325865
+            ]
+        ],
+        "hull_polygon": [
+            [
+                7.428441118898582,
+                1.6942978196799237
+            ],
+            [
+                8.745771615469106,
+                6.603051055938763
+            ],
+            [
+                7.587558337200311,
+                8.732550213262261
+            ],
+            [
+                1.568707658782201,
+                5.816293244166679
+            ],
+            [
+                1.8114437596855382,
+                2.523431685325865
+            ],
+            [
+                2.9398567245149367,
+                1.4303456933745577
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_074_input.jpg",
+        "result_image": "dataset_convex_hull/hull_074_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_074_input.jpg",
+        "save_id": 2038,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2038.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_076",
+        "task": "convex_hull",
+        "num_total_points": 9,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                8.43299982209764,
+                8.422099713161533
+            ],
+            [
+                5.941620166732643,
+                3.0610185125940887
+            ],
+            [
+                2.8573567105912305,
+                8.380770188877964
+            ],
+            [
+                4.116361584089879,
+                3.0834960205295605
+            ],
+            [
+                5.189493363699631,
+                1.1128133005580683
+            ],
+            [
+                3.97167185737115,
+                2.736337160397846
+            ],
+            [
+                1.4146320271282065,
+                2.3860524024733465
+            ],
+            [
+                4.091424865061354,
+                8.471550223580042
+            ],
+            [
+                7.858575402876817,
+                3.6158096434364912
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.4146320271282065,
+                2.3860524024733465
+            ],
+            [
+                5.189493363699631,
+                1.1128133005580683
+            ],
+            [
+                7.858575402876817,
+                3.6158096434364912
+            ],
+            [
+                8.43299982209764,
+                8.422099713161533
+            ],
+            [
+                4.091424865061354,
+                8.471550223580042
+            ],
+            [
+                2.8573567105912305,
+                8.380770188877964
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_076_input.jpg",
+        "result_image": "dataset_convex_hull/hull_076_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_076_input.jpg",
+        "save_id": 2040,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2040.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_078",
+        "task": "convex_hull",
+        "num_total_points": 15,
+        "num_hull_vertices": 8,
+        "points": [
+            [
+                1.310549029993357,
+                4.828518362299351
+            ],
+            [
+                4.515463015644091,
+                3.4876255112174643
+            ],
+            [
+                8.73269415557604,
+                3.269969161317899
+            ],
+            [
+                3.246067963918791,
+                8.093759968892346
+            ],
+            [
+                1.984700390425778,
+                7.390234968496599
+            ],
+            [
+                5.130944892884591,
+                1.5720632192548925
+            ],
+            [
+                7.536434456491125,
+                8.29065276135253
+            ],
+            [
+                3.811332510080258,
+                8.12172871035694
+            ],
+            [
+                6.858518442924605,
+                8.21945025582812
+            ],
+            [
+                6.380514058314574,
+                7.340174534353035
+            ],
+            [
+                5.601876581621953,
+                2.3674076638013
+            ],
+            [
+                7.019473621278231,
+                1.0418236584371723
+            ],
+            [
+                3.0451369963562653,
+                4.595352431143125
+            ],
+            [
+                6.038559639697226,
+                2.0828197823990804
+            ],
+            [
+                6.190433213987818,
+                5.492063316315176
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.73269415557604,
+                3.269969161317899
+            ],
+            [
+                7.536434456491125,
+                8.29065276135253
+            ],
+            [
+                3.811332510080258,
+                8.12172871035694
+            ],
+            [
+                3.246067963918791,
+                8.093759968892346
+            ],
+            [
+                1.984700390425778,
+                7.390234968496599
+            ],
+            [
+                1.310549029993357,
+                4.828518362299351
+            ],
+            [
+                5.130944892884591,
+                1.5720632192548925
+            ],
+            [
+                7.019473621278231,
+                1.0418236584371723
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_078_input.jpg",
+        "result_image": "dataset_convex_hull/hull_078_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_078_input.jpg",
+        "save_id": 2042,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2042.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_080",
+        "task": "convex_hull",
+        "num_total_points": 11,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                7.106415516595614,
+                6.439369410113476
+            ],
+            [
+                4.183203058016156,
+                2.0358587695422123
+            ],
+            [
+                3.6550267693353895,
+                8.067011534120086
+            ],
+            [
+                1.317176300577609,
+                8.503537826696606
+            ],
+            [
+                4.096585926014773,
+                5.4295569406151065
+            ],
+            [
+                6.375306030313405,
+                6.988586484015011
+            ],
+            [
+                3.890841362600649,
+                2.13654077552334
+            ],
+            [
+                6.6726109174977895,
+                5.6609473470247575
+            ],
+            [
+                7.731434177244503,
+                5.277407871319624
+            ],
+            [
+                5.230801164135478,
+                4.6045592048459465
+            ],
+            [
+                3.0268489081737124,
+                5.710693836637149
+            ]
+        ],
+        "hull_polygon": [
+            [
+                4.183203058016156,
+                2.0358587695422123
+            ],
+            [
+                7.731434177244503,
+                5.277407871319624
+            ],
+            [
+                7.106415516595614,
+                6.439369410113476
+            ],
+            [
+                6.375306030313405,
+                6.988586484015011
+            ],
+            [
+                3.6550267693353895,
+                8.067011534120086
+            ],
+            [
+                1.317176300577609,
+                8.503537826696606
+            ],
+            [
+                3.890841362600649,
+                2.13654077552334
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_080_input.jpg",
+        "result_image": "dataset_convex_hull/hull_080_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_080_input.jpg",
+        "save_id": 2044,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2044.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_082",
+        "task": "convex_hull",
+        "num_total_points": 15,
+        "num_hull_vertices": 8,
+        "points": [
+            [
+                5.587349145124732,
+                1.524773408905416
+            ],
+            [
+                3.4003327211335783,
+                7.237110082565699
+            ],
+            [
+                7.216966375168633,
+                7.847216843172568
+            ],
+            [
+                4.702562758499617,
+                6.965306641866939
+            ],
+            [
+                6.19805923588753,
+                8.504987754205267
+            ],
+            [
+                3.163697667270851,
+                5.896502205884153
+            ],
+            [
+                8.13697616870974,
+                7.0088105826047284
+            ],
+            [
+                3.4056215416845923,
+                8.788471455560094
+            ],
+            [
+                1.8366451873506913,
+                7.204385925300066
+            ],
+            [
+                5.674456617737146,
+                7.60054107913182
+            ],
+            [
+                1.0668810453266317,
+                6.708470896641137
+            ],
+            [
+                3.9348198371553487,
+                1.983434896062569
+            ],
+            [
+                6.793129410340209,
+                3.9409232634617286
+            ],
+            [
+                8.98918577421439,
+                5.646466539921384
+            ],
+            [
+                4.808042200445269,
+                3.2488379211444123
+            ]
+        ],
+        "hull_polygon": [
+            [
+                5.587349145124732,
+                1.524773408905416
+            ],
+            [
+                8.98918577421439,
+                5.646466539921384
+            ],
+            [
+                8.13697616870974,
+                7.0088105826047284
+            ],
+            [
+                7.216966375168633,
+                7.847216843172568
+            ],
+            [
+                6.19805923588753,
+                8.504987754205267
+            ],
+            [
+                3.4056215416845923,
+                8.788471455560094
+            ],
+            [
+                1.0668810453266317,
+                6.708470896641137
+            ],
+            [
+                3.9348198371553487,
+                1.983434896062569
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_082_input.jpg",
+        "result_image": "dataset_convex_hull/hull_082_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_082_input.jpg",
+        "save_id": 2046,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2046.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_084",
+        "task": "convex_hull",
+        "num_total_points": 11,
+        "num_hull_vertices": 9,
+        "points": [
+            [
+                4.009115673063688,
+                1.4007482472024275
+            ],
+            [
+                4.204455294852465,
+                6.7393580157618365
+            ],
+            [
+                5.951606401827788,
+                3.5448992824187915
+            ],
+            [
+                1.5210653104417116,
+                3.650486674509729
+            ],
+            [
+                6.719689599298901,
+                3.0050733535275054
+            ],
+            [
+                2.124823929010483,
+                1.5317934393765107
+            ],
+            [
+                3.896613418361013,
+                1.3647017445958651
+            ],
+            [
+                2.4259563938725366,
+                7.188153815241096
+            ],
+            [
+                1.5190379861140109,
+                2.3519289249869626
+            ],
+            [
+                7.83258010412781,
+                2.8784618931863974
+            ],
+            [
+                1.5804390016485481,
+                7.167014779934761
+            ]
+        ],
+        "hull_polygon": [
+            [
+                2.4259563938725366,
+                7.188153815241096
+            ],
+            [
+                1.5804390016485481,
+                7.167014779934761
+            ],
+            [
+                1.5210653104417116,
+                3.650486674509729
+            ],
+            [
+                1.5190379861140109,
+                2.3519289249869626
+            ],
+            [
+                2.124823929010483,
+                1.5317934393765107
+            ],
+            [
+                3.896613418361013,
+                1.3647017445958651
+            ],
+            [
+                4.009115673063688,
+                1.4007482472024275
+            ],
+            [
+                7.83258010412781,
+                2.8784618931863974
+            ],
+            [
+                4.204455294852465,
+                6.7393580157618365
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_084_input.jpg",
+        "result_image": "dataset_convex_hull/hull_084_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_084_input.jpg",
+        "save_id": 2048,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2048.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_086",
+        "task": "convex_hull",
+        "num_total_points": 9,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                2.4953487895436286,
+                5.424112805352825
+            ],
+            [
+                1.7795253692073238,
+                8.921845907915355
+            ],
+            [
+                3.539947068678991,
+                2.47855399061857
+            ],
+            [
+                1.7374524423273012,
+                1.2450422043471248
+            ],
+            [
+                1.354218515815722,
+                8.474602350077136
+            ],
+            [
+                7.161560140453202,
+                8.975078404247943
+            ],
+            [
+                2.311511209654955,
+                1.5646804649070454
+            ],
+            [
+                6.647081391394574,
+                7.944085366442131
+            ],
+            [
+                2.328607516086845,
+                2.3480150080871454
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.354218515815722,
+                8.474602350077136
+            ],
+            [
+                1.7374524423273012,
+                1.2450422043471248
+            ],
+            [
+                2.311511209654955,
+                1.5646804649070454
+            ],
+            [
+                3.539947068678991,
+                2.47855399061857
+            ],
+            [
+                6.647081391394574,
+                7.944085366442131
+            ],
+            [
+                7.161560140453202,
+                8.975078404247943
+            ],
+            [
+                1.7795253692073238,
+                8.921845907915355
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_086_input.jpg",
+        "result_image": "dataset_convex_hull/hull_086_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_086_input.jpg",
+        "save_id": 2050,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2050.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_088",
+        "task": "convex_hull",
+        "num_total_points": 15,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                1.0655584202424855,
+                1.0711668903378673
+            ],
+            [
+                1.2589103773839474,
+                3.2278483788915473
+            ],
+            [
+                6.678960343236694,
+                3.964122650267355
+            ],
+            [
+                2.2725259221907965,
+                3.2493862707609082
+            ],
+            [
+                8.700695991986057,
+                3.1460668163577443
+            ],
+            [
+                3.9188167068603788,
+                2.1778723242902407
+            ],
+            [
+                8.136794348432012,
+                6.45917263636662
+            ],
+            [
+                6.716578681998187,
+                1.9885389924462196
+            ],
+            [
+                8.121991469981655,
+                6.708230511087595
+            ],
+            [
+                4.883161647966481,
+                7.994502739530637
+            ],
+            [
+                8.204196304584233,
+                3.9158864450712167
+            ],
+            [
+                2.391878939971086,
+                3.245686852003293
+            ],
+            [
+                4.473305252230167,
+                1.9427816882915456
+            ],
+            [
+                2.8781075948636268,
+                1.5142866163886612
+            ],
+            [
+                5.195349353936317,
+                6.824371761518945
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.700695991986057,
+                3.1460668163577443
+            ],
+            [
+                8.121991469981655,
+                6.708230511087595
+            ],
+            [
+                4.883161647966481,
+                7.994502739530637
+            ],
+            [
+                1.2589103773839474,
+                3.2278483788915473
+            ],
+            [
+                1.0655584202424855,
+                1.0711668903378673
+            ],
+            [
+                6.716578681998187,
+                1.9885389924462196
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_088_input.jpg",
+        "result_image": "dataset_convex_hull/hull_088_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_088_input.jpg",
+        "save_id": 2052,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2052.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_090",
+        "task": "convex_hull",
+        "num_total_points": 14,
+        "num_hull_vertices": 5,
+        "points": [
+            [
+                4.326336703619751,
+                6.652059262118098
+            ],
+            [
+                7.510598376244043,
+                7.761748501167647
+            ],
+            [
+                5.396984463269939,
+                1.0307686429187504
+            ],
+            [
+                7.592713823090476,
+                4.010189107957025
+            ],
+            [
+                4.204896875621389,
+                2.0012439094202055
+            ],
+            [
+                4.034268780488959,
+                3.319428321863991
+            ],
+            [
+                4.879752960833006,
+                2.9730715332349282
+            ],
+            [
+                5.644561121841834,
+                2.4285133361165103
+            ],
+            [
+                3.4172513220788527,
+                1.9293937780092865
+            ],
+            [
+                2.622649101412999,
+                2.046475922745535
+            ],
+            [
+                7.92642608249843,
+                8.101183396923297
+            ],
+            [
+                8.361693917065537,
+                3.675271267211806
+            ],
+            [
+                1.6633818386099462,
+                8.630515951543437
+            ],
+            [
+                5.424533119970621,
+                4.372110223927562
+            ]
+        ],
+        "hull_polygon": [
+            [
+                5.396984463269939,
+                1.0307686429187504
+            ],
+            [
+                8.361693917065537,
+                3.675271267211806
+            ],
+            [
+                7.92642608249843,
+                8.101183396923297
+            ],
+            [
+                1.6633818386099462,
+                8.630515951543437
+            ],
+            [
+                2.622649101412999,
+                2.046475922745535
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_090_input.jpg",
+        "result_image": "dataset_convex_hull/hull_090_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_090_input.jpg",
+        "save_id": 2054,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2054.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_092",
+        "task": "convex_hull",
+        "num_total_points": 12,
+        "num_hull_vertices": 7,
+        "points": [
+            [
+                8.137362642001596,
+                3.2491959466939866
+            ],
+            [
+                2.378977296192997,
+                5.209911471583907
+            ],
+            [
+                5.854823579788671,
+                7.416211208184847
+            ],
+            [
+                6.836449164396795,
+                6.979751870565424
+            ],
+            [
+                3.849071392174694,
+                7.510041635833242
+            ],
+            [
+                3.005016461105577,
+                3.69184175010892
+            ],
+            [
+                1.6429978500348987,
+                2.6050875345264854
+            ],
+            [
+                3.116251951627401,
+                1.8279811675868096
+            ],
+            [
+                3.2576690838078433,
+                8.761692936955914
+            ],
+            [
+                1.2231241075015324,
+                3.496283662939998
+            ],
+            [
+                6.969786120073892,
+                4.562554206585342
+            ],
+            [
+                7.840535197538859,
+                4.2703665127901855
+            ]
+        ],
+        "hull_polygon": [
+            [
+                3.2576690838078433,
+                8.761692936955914
+            ],
+            [
+                1.2231241075015324,
+                3.496283662939998
+            ],
+            [
+                1.6429978500348987,
+                2.6050875345264854
+            ],
+            [
+                3.116251951627401,
+                1.8279811675868096
+            ],
+            [
+                8.137362642001596,
+                3.2491959466939866
+            ],
+            [
+                7.840535197538859,
+                4.2703665127901855
+            ],
+            [
+                6.836449164396795,
+                6.979751870565424
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_092_input.jpg",
+        "result_image": "dataset_convex_hull/hull_092_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_092_input.jpg",
+        "save_id": 2056,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2056.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_094",
+        "task": "convex_hull",
+        "num_total_points": 9,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                4.796389424807341,
+                2.958953927501951
+            ],
+            [
+                3.9834658737700703,
+                1.2196783349580231
+            ],
+            [
+                2.5338837086188333,
+                3.3357326916416854
+            ],
+            [
+                8.703354938649037,
+                5.819904809508685
+            ],
+            [
+                4.340034414771147,
+                3.905802415785166
+            ],
+            [
+                4.343125854798016,
+                5.6803954962812595
+            ],
+            [
+                5.290685227325285,
+                5.375427161618726
+            ],
+            [
+                2.249060004633659,
+                1.463242825571224
+            ],
+            [
+                7.658650087289008,
+                3.0492733141025736
+            ]
+        ],
+        "hull_polygon": [
+            [
+                2.249060004633659,
+                1.463242825571224
+            ],
+            [
+                3.9834658737700703,
+                1.2196783349580231
+            ],
+            [
+                7.658650087289008,
+                3.0492733141025736
+            ],
+            [
+                8.703354938649037,
+                5.819904809508685
+            ],
+            [
+                4.343125854798016,
+                5.6803954962812595
+            ],
+            [
+                2.5338837086188333,
+                3.3357326916416854
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_094_input.jpg",
+        "result_image": "dataset_convex_hull/hull_094_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_094_input.jpg",
+        "save_id": 2058,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2058.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_096",
+        "task": "convex_hull",
+        "num_total_points": 13,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                8.973325611243013,
+                7.222088540826382
+            ],
+            [
+                1.5753655369674107,
+                6.435805050740146
+            ],
+            [
+                8.8706298366007,
+                6.355584385961099
+            ],
+            [
+                6.691374278909562,
+                1.3205435912120898
+            ],
+            [
+                4.794759299015334,
+                3.1043949543996243
+            ],
+            [
+                7.989653787333961,
+                2.8778835321155825
+            ],
+            [
+                8.51090696351149,
+                5.987679572182448
+            ],
+            [
+                6.903826500842268,
+                1.0545446166338621
+            ],
+            [
+                2.6085120996357842,
+                4.033444960752339
+            ],
+            [
+                2.718081729225128,
+                2.521663124548297
+            ],
+            [
+                3.000392027081906,
+                7.357536299616827
+            ],
+            [
+                8.7310574324122,
+                5.961667426261275
+            ],
+            [
+                8.72296599582867,
+                3.699431266078724
+            ]
+        ],
+        "hull_polygon": [
+            [
+                1.5753655369674107,
+                6.435805050740146
+            ],
+            [
+                2.718081729225128,
+                2.521663124548297
+            ],
+            [
+                6.903826500842268,
+                1.0545446166338621
+            ],
+            [
+                8.72296599582867,
+                3.699431266078724
+            ],
+            [
+                8.973325611243013,
+                7.222088540826382
+            ],
+            [
+                3.000392027081906,
+                7.357536299616827
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_096_input.jpg",
+        "result_image": "dataset_convex_hull/hull_096_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_096_input.jpg",
+        "save_id": 2060,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2060.png",
+        "status": "skipped"
+    },
+    {
+        "id": "hull_098",
+        "task": "convex_hull",
+        "num_total_points": 14,
+        "num_hull_vertices": 6,
+        "points": [
+            [
+                7.513978614263561,
+                1.9083000192850186
+            ],
+            [
+                8.085847293601784,
+                1.9200979556212117
+            ],
+            [
+                7.70752844289013,
+                3.6128820809511817
+            ],
+            [
+                5.454379481576285,
+                2.4711508203506716
+            ],
+            [
+                4.23854697085519,
+                3.206601237015354
+            ],
+            [
+                8.287845563257864,
+                7.53810342875139
+            ],
+            [
+                2.7538211978214093,
+                7.417099182115209
+            ],
+            [
+                8.103773431736712,
+                3.7896495741632146
+            ],
+            [
+                6.251015374201634,
+                4.9115693426099964
+            ],
+            [
+                5.209593186546535,
+                8.473595063363993
+            ],
+            [
+                4.2945889417412975,
+                5.437795797654517
+            ],
+            [
+                2.5608821882627772,
+                1.109522117350151
+            ],
+            [
+                6.293580001707211,
+                1.3959116014841975
+            ],
+            [
+                4.048782842043525,
+                4.777605955649142
+            ]
+        ],
+        "hull_polygon": [
+            [
+                8.287845563257864,
+                7.53810342875139
+            ],
+            [
+                5.209593186546535,
+                8.473595063363993
+            ],
+            [
+                2.7538211978214093,
+                7.417099182115209
+            ],
+            [
+                2.5608821882627772,
+                1.109522117350151
+            ],
+            [
+                6.293580001707211,
+                1.3959116014841975
+            ],
+            [
+                8.085847293601784,
+                1.9200979556212117
+            ]
+        ],
+        "input_image": "dataset_convex_hull/hull_098_input.jpg",
+        "result_image": "dataset_convex_hull/hull_098_result.jpg",
+        "prompt_en": "Connect the outermost points to form the minimum convex polygon that encloses all points in the image.",
+        "prompt_cn": "连接图中最外侧的点，形成一个包围所有点的最小凸多边形",
+        "source_image": "Part4/dataset_convex_hull/hull_098_input.jpg",
+        "save_id": 2062,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Convex_Hull/2062.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2685.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2685.png
new file mode 100644
index 0000000000000000000000000000000000000000..e1640a494f21b404d4a232e62ac872b54f5a7fb8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2685.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:86c07a298383835d5fc2f451e3a1309dda30b056d49133920aefab72f0d5fa3f
+size 104640
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2687.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2687.png
new file mode 100644
index 0000000000000000000000000000000000000000..d3d61df154742994b93a28d2fed28a178580781d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2687.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:488d6a32398c820d794a7db522a8764412e9860fb3bf928eaffebaa0def085ed
+size 73690
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2689.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2689.png
new file mode 100644
index 0000000000000000000000000000000000000000..868d441e075c8d87dccb65b4671bb7cc0372d1aa
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2689.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c0801636b957fc9abe84dd73c5730375cb096d13fd3f63ee1748cd2300ae1c98
+size 94545
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2691.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2691.png
new file mode 100644
index 0000000000000000000000000000000000000000..27dab4ef2b0b45f126671d7d4fc7e59d05bab79a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2691.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:36ca53b13476941f6e68b5ebceb56be48e59ea265926c1f4d880f39d949126ec
+size 73336
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2693.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2693.png
new file mode 100644
index 0000000000000000000000000000000000000000..121f350b1e8057f27461ea2f6161feb4202a9bda
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2693.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:88c45985b14bd86dac307b9c7b87bc4c9ad40b70262eba7c7c4b0c0350f822bb
+size 112937
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2695.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2695.png
new file mode 100644
index 0000000000000000000000000000000000000000..e8b28126c586dd9e94542c15f1478cbed713a36c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2695.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9ee1f598fff3fe2a697654852fb0cb81971077e9ee733ff0b45e69fc8abfd27e
+size 154375
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2697.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2697.png
new file mode 100644
index 0000000000000000000000000000000000000000..c453f65599eac7a8c3bfb4f19fb6d3cb5c4db244
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2697.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:03d02dd0d43223e64fb6084f92dd6c06278837bb81bbe2fb2fde7711e56d676d
+size 116370
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2699.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2699.png
new file mode 100644
index 0000000000000000000000000000000000000000..cf1c91f4b47823dab83491689ea5f34a513e371f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2699.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4f7c58182db1b0129d5828b3149fcdb87b34ade96a0375b92dd02f48502d1776
+size 94825
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2701.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2701.png
new file mode 100644
index 0000000000000000000000000000000000000000..70477cc9bf105b0b475b0f7c2c54cc9d630e5378
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2701.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0420cea025f13654e94fae4da157b51116326dd07d3104f20979b753af6d4f4a
+size 95431
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2703.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2703.png
new file mode 100644
index 0000000000000000000000000000000000000000..1b007cbd84bf955d985d68cdc7a8f149779a569d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2703.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d636f7c8a195f2c6818296cfa1a52513de84289e084d9400fca471d1a3f395d2
+size 107465
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2705.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2705.png
new file mode 100644
index 0000000000000000000000000000000000000000..23212244db25c4ee198b9c6e499a6ca4e7e8b50b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2705.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:41ef157185f1454d7477f2c8b0ff923bb61c7b4dcec9e65088b93b564de7899d
+size 138724
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2707.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2707.png
new file mode 100644
index 0000000000000000000000000000000000000000..ed5769c57d158244bc2291db0659d39481b4ffee
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2707.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6280ae3bcfdfdaac7cf9549c4f3d2d6f9d153b1c40d277fdf9cff452e9c7874c
+size 147229
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2709.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2709.png
new file mode 100644
index 0000000000000000000000000000000000000000..e14de58b675ebe654f20cf8965f655f5415a746f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2709.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fdad5d28cfd6399582820d1f8aa7f31d8ee55311600664dd603d89aa216eb1c4
+size 112736
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2711.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2711.png
new file mode 100644
index 0000000000000000000000000000000000000000..a8811902ea421d94249cdd6163d627f75a3d972e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2711.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fa3dc7e02da3723d22bec4b3c096e467fe38915c85479ce3edbd8761358bda5d
+size 151184
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2713.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2713.png
new file mode 100644
index 0000000000000000000000000000000000000000..84ee17a49a0d81da0e189195ff5b7c0126c6b404
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2713.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dfd645adddd0d7639edca46e6b7f823caebfe4397ce5d23f4c2751f7bf38e394
+size 141926
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2715.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2715.png
new file mode 100644
index 0000000000000000000000000000000000000000..98093c2d59ecfbbfdd4a2fc638e8bc6343a0602b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2715.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1413e06b6864223911374fb641768f8205e0da229ae0c60f399dab3b2d3213dc
+size 119025
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2717.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2717.png
new file mode 100644
index 0000000000000000000000000000000000000000..5a906c9a7f3cfb74e6426a4237894fc954602e4a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2717.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:de389b2c51356bf63c9565b462e3c93d5c51327203311b8505b4ca339a247173
+size 178997
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2719.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2719.png
new file mode 100644
index 0000000000000000000000000000000000000000..8d92430dc4e9ed99f49cc3c751b2ca8097bfd1b9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2719.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0111144335a0fcfbe6396f291b45f142a586e97fedf6e9934d7ecc33de88249c
+size 149687
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2721.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2721.png
new file mode 100644
index 0000000000000000000000000000000000000000..b22bf0254efc0dd7eff8312707543e38b3ebfdc9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2721.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4ebd3e3d5a5a035b520d675fca448341e87c4d8bcb3d9e33088fda8e5851972a
+size 110233
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2723.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2723.png
new file mode 100644
index 0000000000000000000000000000000000000000..6732922779307c4171fc094ff4045ddb841f76ad
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2723.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f3128462686a4cb85b611e70da6a06b80cda59887577fbc8084a9e586e5332d6
+size 183375
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2725.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2725.png
new file mode 100644
index 0000000000000000000000000000000000000000..bc802146977320eac92c36b95c4fd067b204345d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2725.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e96cb30b0d73b6052345fb8da883cf6bebbe8efedfd78e9deb27deff336ca3da
+size 183341
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2727.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2727.png
new file mode 100644
index 0000000000000000000000000000000000000000..b04ba278025c484174562674fb3d9929639a0fad
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2727.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5eb9161b8dd928cee00d85fe06591114f601994110d4f5f056149f3e9042569b
+size 148883
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2729.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2729.png
new file mode 100644
index 0000000000000000000000000000000000000000..3193291a1a66c461cd81dc4fcc226b714bc74ecc
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2729.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:988ea2a597b45392f373593bcfda5360a6b2222472df32d2a7c6c7fb897d579c
+size 244005
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2731.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2731.png
new file mode 100644
index 0000000000000000000000000000000000000000..a873fd5a3f86c9e92beeef5b66fc3178ff7cbb60
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2731.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b8842ae3452221ba1925a69d552a231f299fbfba61f766a562d40d9345ac49a1
+size 116230
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2733.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2733.png
new file mode 100644
index 0000000000000000000000000000000000000000..6d8ddcf49576be13232cad2987c7481dbd1ed361
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2733.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6f0d50eb7c80efec03f88f1e4db5cabd47f956994df18fd91c6e331618c3198a
+size 112789
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2735.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2735.png
new file mode 100644
index 0000000000000000000000000000000000000000..dba0770ca53c8eeee5907cecb78edc0a8e3c255e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2735.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:021f88d81488a2c8f7b494a4dbf8e0d7fc659fc2feb849dc32e3c66645f7d86f
+size 151607
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2737.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2737.png
new file mode 100644
index 0000000000000000000000000000000000000000..6a36ac0bfe4477aa0d6be71cb5f43693711d2591
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2737.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:59f5e63feb2c9d992c542b5188a7d5d2fc2448a8764ad41fb769edeb181faae6
+size 150686
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2739.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2739.png
new file mode 100644
index 0000000000000000000000000000000000000000..21e1fab763fd0e42186335d5e2a92f81fbd9d69c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2739.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f5005a6e3db4975cdd6f570b4da10c17cb144be62a1642df152055b44d673054
+size 169069
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2741.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2741.png
new file mode 100644
index 0000000000000000000000000000000000000000..3944cd3fb6cc2b97e670812e556af773adbcfb54
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2741.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:23feed93e9dd70ae7719b5490915c023b4aaa1a020db11e132ecd56099872acf
+size 114316
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2743.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2743.png
new file mode 100644
index 0000000000000000000000000000000000000000..6da779128195a83d4c497d15f31676f21903f9de
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2743.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ea5664431dbf39723ac964665825ed4c36da4b18e9da95d0a777a10af272745a
+size 138144
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2745.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2745.png
new file mode 100644
index 0000000000000000000000000000000000000000..548886739b18f36709fd03e415ab8f98a1237693
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2745.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:aee74555ab2f09b2a73f050abf1bc05131851c057ceb504cf01bcfcd77a79961
+size 110641
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2747.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2747.png
new file mode 100644
index 0000000000000000000000000000000000000000..f8828f3d3057d064b22660c205bb44d2d48b359d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2747.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9e02f9a2eac14e5d6a170436a64c93432e375b62752081991f4117361fef0346
+size 173576
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2749.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2749.png
new file mode 100644
index 0000000000000000000000000000000000000000..320e693a5768ac7496d363d0eec555a88f8ddf08
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2749.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c180b38371cc2f23c64ba49de06fa40906927f71a391ac7d1527273d236f133b
+size 175056
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2751.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2751.png
new file mode 100644
index 0000000000000000000000000000000000000000..211a70eee3e922de7e3eb8308958e668e27a3e60
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2751.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:672fde8441de91468378294fd87dd356e5b564275880537a4af6dba216c2ec97
+size 165286
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2753.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2753.png
new file mode 100644
index 0000000000000000000000000000000000000000..02ae917b558c989b218261db4c7b3f236bdbb997
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2753.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9bfe41b912044f347028fa9674d86b85c5bf931e441d16c0635bd4b9d4f0b5d3
+size 248618
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2755.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2755.png
new file mode 100644
index 0000000000000000000000000000000000000000..a69a7740b92f1e4e7e98dc94bc8f8ff6055e1a03
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2755.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2744dc05218d0b339fe61d3d17e4e69eb7b45a839dde86138dc00f9ee8ba0ee9
+size 272541
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2757.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2757.png
new file mode 100644
index 0000000000000000000000000000000000000000..a695928a9caa4dfb6fdd82c2a4ca7b75936c0488
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2757.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a97d4310450845bc45bb164a95eecdb6e2fe9a07d1a594c967d32ca40d543bcb
+size 174146
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2759.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2759.png
new file mode 100644
index 0000000000000000000000000000000000000000..28db948d647fbe58fb415797c3299ef14225c586
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2759.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:74ec1bbaf9d843a9039a5a96ba192223a36e797e4488bc8d270a1416ebdc8b4a
+size 207285
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2761.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2761.png
new file mode 100644
index 0000000000000000000000000000000000000000..43826c71c95c1583860556b8179f9cbc402ff886
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2761.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:00d27b642dd7637b2c856a7a590d77f20102b57c790dd48ca75de056410a9b94
+size 232750
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2763.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2763.png
new file mode 100644
index 0000000000000000000000000000000000000000..3156f74a5d5352a41b42f328bb192d1af259a02f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2763.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:408f64840ad19fbcd052582a6b507303c7e974b8c2f8ed77e71c8630238d8261
+size 230633
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2765.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2765.png
new file mode 100644
index 0000000000000000000000000000000000000000..1f5983c7e60f1a52a5e2dd6d03eaa2b4ed41488a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2765.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:01d5fac9d85ca103e8420bbe0b70a2294819965afbb5601cae72c44c978e3471
+size 261265
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2767.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2767.png
new file mode 100644
index 0000000000000000000000000000000000000000..150b41d4245325574a421183a47f878f8b2115d8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2767.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5dd005580e88a53825ac3f676d84a87864dcd0a77b746034d19c56f5fa234639
+size 258885
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2769.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2769.png
new file mode 100644
index 0000000000000000000000000000000000000000..90521b6bb9afb1c487e3033ab65ca2e04aa08ed1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2769.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:87229205486e0f0cd2039458d71ddd9802b805d91289b876eb23d3686d9cb0cb
+size 172839
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2771.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2771.png
new file mode 100644
index 0000000000000000000000000000000000000000..d03a9a4dc1c4ddec8e932ca496efca6aa8cc6260
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2771.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:82dba8653a12eab220bb6b41b19e70fa236ba482e0ac7db210d25696050b97de
+size 245818
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2773.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2773.png
new file mode 100644
index 0000000000000000000000000000000000000000..6936665fadcd7b465ece3ec3c1fcff93749237da
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2773.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ea5561aabd42ca24d9a0a51d319ee76e7800b85ae1199a810e3b659c1124e711
+size 222599
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2775.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2775.png
new file mode 100644
index 0000000000000000000000000000000000000000..b2b49dc25cb83a688e4a5dd9e8a05cd663149f40
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2775.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0e925d325ee1c3d1be45eb79c47d659643c7522d1f193fe99223552e54f8fba4
+size 253758
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2777.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2777.png
new file mode 100644
index 0000000000000000000000000000000000000000..ddcb28a1558daa75a80e43663ff826685ca05ae2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2777.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:72b35826a01fde4469c8e92dd73e9d287e200599c8cdc0708ef6d9f560a109f2
+size 241372
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2779.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2779.png
new file mode 100644
index 0000000000000000000000000000000000000000..8e47bb8c7a3db7cc7763996cc152594e4ec9fb16
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2779.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6036dd0d747f96b58a3e70c59a6ad8c86771d76591c56bcb840c08c9b1d629c0
+size 211154
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2781.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2781.png
new file mode 100644
index 0000000000000000000000000000000000000000..9f049c1e777d8fcc0c29348abaa66e5b8e9fb810
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2781.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:53b35d43c4b2b8ff29ddedac1a877717237ddde3c5de799e426a3b189b19481b
+size 173391
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2783.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2783.png
new file mode 100644
index 0000000000000000000000000000000000000000..e246657322b76a03146407c86a38401d0468225a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2783.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:37d9128a2a872f3710b829a5dff493ce0c5bdb88deb51a4e3f8869adc4ede99e
+size 243819
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/Find_Word_No_Start.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/Find_Word_No_Start.json
new file mode 100644
index 0000000000000000000000000000000000000000..100707e43243880554ead813fedbcb88bd33a49f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/Find_Word_No_Start.json
@@ -0,0 +1,7146 @@
+[
+    {
+        "id": "task_001",
+        "mode": "global_search",
+        "target_word": "DOG",
+        "prompt_en": "Find the word 'DOG'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'DOG' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "G",
+                "X",
+                "E",
+                "D",
+                "T",
+                "B"
+            ],
+            [
+                "Q",
+                "O",
+                "F",
+                "H",
+                "A",
+                "S"
+            ],
+            [
+                "V",
+                "B",
+                "I",
+                "B",
+                "O",
+                "D"
+            ],
+            [
+                "S",
+                "S",
+                "W",
+                "O",
+                "X",
+                "C"
+            ],
+            [
+                "D",
+                "O",
+                "H",
+                "L",
+                "F",
+                "G"
+            ],
+            [
+                "O",
+                "G",
+                "X",
+                "J",
+                "A",
+                "T"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                5,
+                1
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_001_DOG_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_001_DOG_result.jpg",
+        "source_image": "Part4/word_no_start/task_001_DOG_input.jpg",
+        "save_id": 2685,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2685.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_003",
+        "mode": "global_search",
+        "target_word": "MAP",
+        "prompt_en": "Find the word 'MAP'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'MAP' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "J",
+                "U",
+                "T",
+                "V",
+                "V"
+            ],
+            [
+                "L",
+                "J",
+                "H",
+                "K",
+                "M"
+            ],
+            [
+                "L",
+                "D",
+                "H",
+                "B",
+                "A"
+            ],
+            [
+                "H",
+                "J",
+                "B",
+                "R",
+                "P"
+            ],
+            [
+                "K",
+                "A",
+                "U",
+                "W",
+                "Z"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_003_MAP_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_003_MAP_result.jpg",
+        "source_image": "Part4/word_no_start/task_003_MAP_input.jpg",
+        "save_id": 2687,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2687.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_005",
+        "mode": "global_search",
+        "target_word": "BOX",
+        "prompt_en": "Find the word 'BOX'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'BOX' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "N",
+                "R",
+                "X",
+                "C",
+                "I",
+                "K"
+            ],
+            [
+                "W",
+                "A",
+                "I",
+                "F",
+                "T",
+                "T"
+            ],
+            [
+                "S",
+                "P",
+                "R",
+                "J",
+                "B",
+                "J"
+            ],
+            [
+                "A",
+                "C",
+                "C",
+                "U",
+                "O",
+                "X"
+            ],
+            [
+                "W",
+                "T",
+                "I",
+                "Y",
+                "B",
+                "J"
+            ],
+            [
+                "S",
+                "J",
+                "D",
+                "Z",
+                "S",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_005_BOX_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_005_BOX_result.jpg",
+        "source_image": "Part4/word_no_start/task_005_BOX_input.jpg",
+        "save_id": 2689,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2689.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_007",
+        "mode": "global_search",
+        "target_word": "EYE",
+        "prompt_en": "Find the word 'EYE'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'EYE' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "J",
+                "S",
+                "H",
+                "V",
+                "T"
+            ],
+            [
+                "B",
+                "H",
+                "R",
+                "X",
+                "Q"
+            ],
+            [
+                "J",
+                "T",
+                "M",
+                "E",
+                "Z"
+            ],
+            [
+                "N",
+                "G",
+                "A",
+                "Y",
+                "V"
+            ],
+            [
+                "V",
+                "U",
+                "X",
+                "E",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_007_EYE_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_007_EYE_result.jpg",
+        "source_image": "Part4/word_no_start/task_007_EYE_input.jpg",
+        "save_id": 2691,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2691.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_009",
+        "mode": "global_search",
+        "target_word": "TEA",
+        "prompt_en": "Find the word 'TEA'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'TEA' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "W",
+                "X",
+                "F",
+                "T",
+                "C",
+                "K",
+                "N"
+            ],
+            [
+                "Z",
+                "S",
+                "Y",
+                "G",
+                "M",
+                "J",
+                "K"
+            ],
+            [
+                "L",
+                "L",
+                "F",
+                "U",
+                "O",
+                "M",
+                "M"
+            ],
+            [
+                "H",
+                "B",
+                "X",
+                "V",
+                "O",
+                "Z",
+                "W"
+            ],
+            [
+                "W",
+                "N",
+                "X",
+                "L",
+                "M",
+                "N",
+                "T"
+            ],
+            [
+                "X",
+                "Y",
+                "F",
+                "J",
+                "F",
+                "L",
+                "E"
+            ],
+            [
+                "L",
+                "W",
+                "H",
+                "Z",
+                "G",
+                "U",
+                "A"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_009_TEA_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_009_TEA_result.jpg",
+        "source_image": "Part4/word_no_start/task_009_TEA_input.jpg",
+        "save_id": 2693,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2693.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_011",
+        "mode": "global_search",
+        "target_word": "FISH",
+        "prompt_en": "Find the word 'FISH'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'FISH' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "Q",
+                "T",
+                "M",
+                "K",
+                "K",
+                "R",
+                "E",
+                "J"
+            ],
+            [
+                "H",
+                "C",
+                "A",
+                "B",
+                "K",
+                "I",
+                "H",
+                "O"
+            ],
+            [
+                "L",
+                "Y",
+                "O",
+                "A",
+                "Z",
+                "B",
+                "Y",
+                "N"
+            ],
+            [
+                "D",
+                "S",
+                "P",
+                "D",
+                "R",
+                "G",
+                "X",
+                "T"
+            ],
+            [
+                "P",
+                "N",
+                "Y",
+                "Y",
+                "I",
+                "C",
+                "O",
+                "N"
+            ],
+            [
+                "R",
+                "N",
+                "O",
+                "N",
+                "E",
+                "F",
+                "I",
+                "S"
+            ],
+            [
+                "D",
+                "Q",
+                "U",
+                "B",
+                "W",
+                "Y",
+                "H",
+                "H"
+            ],
+            [
+                "B",
+                "G",
+                "M",
+                "P",
+                "M",
+                "V",
+                "C",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_011_FISH_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_011_FISH_result.jpg",
+        "source_image": "Part4/word_no_start/task_011_FISH_input.jpg",
+        "save_id": 2695,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2695.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_013",
+        "mode": "global_search",
+        "target_word": "MILK",
+        "prompt_en": "Find the word 'MILK'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'MILK' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "C",
+                "P",
+                "I",
+                "B",
+                "Q",
+                "J",
+                "C"
+            ],
+            [
+                "S",
+                "Y",
+                "C",
+                "C",
+                "Y",
+                "Z",
+                "R"
+            ],
+            [
+                "P",
+                "C",
+                "Z",
+                "N",
+                "Q",
+                "N",
+                "K"
+            ],
+            [
+                "T",
+                "E",
+                "H",
+                "M",
+                "I",
+                "V",
+                "J"
+            ],
+            [
+                "D",
+                "Q",
+                "X",
+                "K",
+                "L",
+                "C",
+                "P"
+            ],
+            [
+                "R",
+                "R",
+                "B",
+                "V",
+                "K",
+                "J",
+                "T"
+            ],
+            [
+                "X",
+                "B",
+                "F",
+                "R",
+                "Z",
+                "U",
+                "Z"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_013_MILK_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_013_MILK_result.jpg",
+        "source_image": "Part4/word_no_start/task_013_MILK_input.jpg",
+        "save_id": 2697,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2697.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_015",
+        "mode": "global_search",
+        "target_word": "DUCK",
+        "prompt_en": "Find the word 'DUCK'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'DUCK' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "Z",
+                "N",
+                "S",
+                "I",
+                "G",
+                "T"
+            ],
+            [
+                "T",
+                "L",
+                "A",
+                "N",
+                "W",
+                "F"
+            ],
+            [
+                "D",
+                "P",
+                "S",
+                "P",
+                "V",
+                "C"
+            ],
+            [
+                "U",
+                "C",
+                "S",
+                "P",
+                "U",
+                "E"
+            ],
+            [
+                "E",
+                "K",
+                "Q",
+                "Q",
+                "C",
+                "T"
+            ],
+            [
+                "P",
+                "Q",
+                "Y",
+                "J",
+                "H",
+                "H"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                0
+            ],
+            [
+                3,
+                0
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                4,
+                1
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_015_DUCK_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_015_DUCK_result.jpg",
+        "source_image": "Part4/word_no_start/task_015_DUCK_input.jpg",
+        "save_id": 2699,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2699.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_017",
+        "mode": "global_search",
+        "target_word": "GOAT",
+        "prompt_en": "Find the word 'GOAT'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'GOAT' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "L",
+                "N",
+                "O",
+                "T",
+                "G",
+                "O"
+            ],
+            [
+                "F",
+                "Y",
+                "A",
+                "R",
+                "V",
+                "A"
+            ],
+            [
+                "D",
+                "O",
+                "Y",
+                "T",
+                "H",
+                "T"
+            ],
+            [
+                "N",
+                "M",
+                "U",
+                "C",
+                "A",
+                "Q"
+            ],
+            [
+                "W",
+                "K",
+                "L",
+                "F",
+                "R",
+                "X"
+            ],
+            [
+                "X",
+                "S",
+                "P",
+                "N",
+                "H",
+                "O"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_017_GOAT_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_017_GOAT_result.jpg",
+        "source_image": "Part4/word_no_start/task_017_GOAT_input.jpg",
+        "save_id": 2701,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2701.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_019",
+        "mode": "global_search",
+        "target_word": "CODE",
+        "prompt_en": "Find the word 'CODE'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'CODE' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "P",
+                "S",
+                "G",
+                "J",
+                "D",
+                "I",
+                "M"
+            ],
+            [
+                "L",
+                "H",
+                "T",
+                "F",
+                "L",
+                "L",
+                "U"
+            ],
+            [
+                "I",
+                "E",
+                "P",
+                "R",
+                "T",
+                "D",
+                "G"
+            ],
+            [
+                "W",
+                "O",
+                "Y",
+                "N",
+                "N",
+                "I",
+                "R"
+            ],
+            [
+                "V",
+                "Y",
+                "A",
+                "D",
+                "U",
+                "L",
+                "J"
+            ],
+            [
+                "R",
+                "I",
+                "K",
+                "R",
+                "R",
+                "U",
+                "R"
+            ],
+            [
+                "C",
+                "O",
+                "D",
+                "E",
+                "J",
+                "R",
+                "K"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                6,
+                0
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_019_CODE_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_019_CODE_result.jpg",
+        "source_image": "Part4/word_no_start/task_019_CODE_input.jpg",
+        "save_id": 2703,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2703.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_021",
+        "mode": "global_search",
+        "target_word": "LIME",
+        "prompt_en": "Find the word 'LIME'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'LIME' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "L",
+                "I",
+                "M",
+                "Z",
+                "M",
+                "E",
+                "W",
+                "J"
+            ],
+            [
+                "X",
+                "H",
+                "E",
+                "X",
+                "F",
+                "C",
+                "W",
+                "L"
+            ],
+            [
+                "Y",
+                "R",
+                "Z",
+                "P",
+                "W",
+                "I",
+                "L",
+                "N"
+            ],
+            [
+                "P",
+                "K",
+                "G",
+                "R",
+                "W",
+                "Y",
+                "H",
+                "B"
+            ],
+            [
+                "P",
+                "P",
+                "V",
+                "R",
+                "G",
+                "X",
+                "U",
+                "X"
+            ],
+            [
+                "R",
+                "D",
+                "R",
+                "A",
+                "M",
+                "W",
+                "P",
+                "B"
+            ],
+            [
+                "H",
+                "L",
+                "R",
+                "V",
+                "V",
+                "X",
+                "O",
+                "P"
+            ],
+            [
+                "T",
+                "S",
+                "L",
+                "I",
+                "K",
+                "M",
+                "D",
+                "L"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                0
+            ],
+            [
+                0,
+                1
+            ],
+            [
+                0,
+                2
+            ],
+            [
+                1,
+                2
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_021_LIME_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_021_LIME_result.jpg",
+        "source_image": "Part4/word_no_start/task_021_LIME_input.jpg",
+        "save_id": 2705,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2705.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_023",
+        "mode": "global_search",
+        "target_word": "BOAT",
+        "prompt_en": "Find the word 'BOAT'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'BOAT' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "R",
+                "M",
+                "G",
+                "J",
+                "C",
+                "K",
+                "H",
+                "K"
+            ],
+            [
+                "V",
+                "V",
+                "W",
+                "V",
+                "G",
+                "H",
+                "U",
+                "B"
+            ],
+            [
+                "B",
+                "M",
+                "W",
+                "U",
+                "M",
+                "P",
+                "B",
+                "F"
+            ],
+            [
+                "S",
+                "N",
+                "D",
+                "G",
+                "U",
+                "T",
+                "B",
+                "U"
+            ],
+            [
+                "J",
+                "F",
+                "H",
+                "M",
+                "C",
+                "U",
+                "Y",
+                "C"
+            ],
+            [
+                "I",
+                "T",
+                "Y",
+                "R",
+                "K",
+                "J",
+                "W",
+                "R"
+            ],
+            [
+                "E",
+                "B",
+                "B",
+                "G",
+                "B",
+                "O",
+                "A",
+                "W"
+            ],
+            [
+                "P",
+                "A",
+                "U",
+                "U",
+                "Q",
+                "A",
+                "T",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_023_BOAT_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_023_BOAT_result.jpg",
+        "source_image": "Part4/word_no_start/task_023_BOAT_input.jpg",
+        "save_id": 2707,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2707.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_025",
+        "mode": "global_search",
+        "target_word": "MOON",
+        "prompt_en": "Find the word 'MOON'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'MOON' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "W",
+                "K",
+                "S",
+                "F",
+                "Z",
+                "X",
+                "J"
+            ],
+            [
+                "I",
+                "V",
+                "O",
+                "A",
+                "W",
+                "I",
+                "I"
+            ],
+            [
+                "A",
+                "D",
+                "B",
+                "J",
+                "A",
+                "U",
+                "D"
+            ],
+            [
+                "X",
+                "W",
+                "S",
+                "F",
+                "V",
+                "K",
+                "G"
+            ],
+            [
+                "M",
+                "G",
+                "T",
+                "D",
+                "Q",
+                "U",
+                "R"
+            ],
+            [
+                "O",
+                "O",
+                "N",
+                "Z",
+                "N",
+                "H",
+                "C"
+            ],
+            [
+                "F",
+                "J",
+                "Z",
+                "J",
+                "U",
+                "V",
+                "V"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                5,
+                2
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_025_MOON_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_025_MOON_result.jpg",
+        "source_image": "Part4/word_no_start/task_025_MOON_input.jpg",
+        "save_id": 2709,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2709.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_027",
+        "mode": "global_search",
+        "target_word": "WIND",
+        "prompt_en": "Find the word 'WIND'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'WIND' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "M",
+                "C",
+                "Q",
+                "K",
+                "Y",
+                "V",
+                "O",
+                "P"
+            ],
+            [
+                "B",
+                "U",
+                "Y",
+                "H",
+                "M",
+                "A",
+                "O",
+                "Z"
+            ],
+            [
+                "K",
+                "G",
+                "Y",
+                "B",
+                "A",
+                "R",
+                "B",
+                "V"
+            ],
+            [
+                "S",
+                "P",
+                "Z",
+                "I",
+                "A",
+                "Y",
+                "Y",
+                "D"
+            ],
+            [
+                "K",
+                "D",
+                "O",
+                "A",
+                "K",
+                "Q",
+                "Q",
+                "Q"
+            ],
+            [
+                "K",
+                "W",
+                "I",
+                "N",
+                "D",
+                "X",
+                "O",
+                "Q"
+            ],
+            [
+                "X",
+                "N",
+                "H",
+                "O",
+                "J",
+                "R",
+                "B",
+                "S"
+            ],
+            [
+                "N",
+                "G",
+                "U",
+                "T",
+                "W",
+                "X",
+                "M",
+                "G"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                1
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_027_WIND_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_027_WIND_result.jpg",
+        "source_image": "Part4/word_no_start/task_027_WIND_input.jpg",
+        "save_id": 2711,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2711.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_029",
+        "mode": "global_search",
+        "target_word": "SNOW",
+        "prompt_en": "Find the word 'SNOW'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'SNOW' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "U",
+                "H",
+                "U",
+                "X",
+                "H",
+                "X",
+                "R",
+                "L"
+            ],
+            [
+                "Q",
+                "C",
+                "J",
+                "V",
+                "T",
+                "Q",
+                "N",
+                "S"
+            ],
+            [
+                "Q",
+                "A",
+                "R",
+                "W",
+                "G",
+                "X",
+                "O",
+                "K"
+            ],
+            [
+                "V",
+                "K",
+                "Q",
+                "B",
+                "A",
+                "X",
+                "H",
+                "V"
+            ],
+            [
+                "D",
+                "M",
+                "A",
+                "N",
+                "N",
+                "Y",
+                "E",
+                "X"
+            ],
+            [
+                "X",
+                "X",
+                "C",
+                "S",
+                "N",
+                "O",
+                "W",
+                "J"
+            ],
+            [
+                "Q",
+                "W",
+                "O",
+                "O",
+                "L",
+                "Z",
+                "Z",
+                "U"
+            ],
+            [
+                "J",
+                "O",
+                "K",
+                "H",
+                "O",
+                "Z",
+                "Z",
+                "G"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_029_SNOW_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_029_SNOW_result.jpg",
+        "source_image": "Part4/word_no_start/task_029_SNOW_input.jpg",
+        "save_id": 2713,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2713.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_031",
+        "mode": "global_search",
+        "target_word": "CORN",
+        "prompt_en": "Find the word 'CORN'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'CORN' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "R",
+                "K",
+                "G",
+                "H",
+                "T",
+                "Z",
+                "K"
+            ],
+            [
+                "R",
+                "F",
+                "V",
+                "P",
+                "J",
+                "N",
+                "C"
+            ],
+            [
+                "O",
+                "W",
+                "S",
+                "E",
+                "U",
+                "R",
+                "C"
+            ],
+            [
+                "L",
+                "I",
+                "P",
+                "V",
+                "F",
+                "T",
+                "O"
+            ],
+            [
+                "B",
+                "R",
+                "P",
+                "N",
+                "T",
+                "Z",
+                "R"
+            ],
+            [
+                "U",
+                "J",
+                "O",
+                "C",
+                "Y",
+                "M",
+                "N"
+            ],
+            [
+                "X",
+                "S",
+                "G",
+                "G",
+                "M",
+                "K",
+                "Z"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_031_CORN_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_031_CORN_result.jpg",
+        "source_image": "Part4/word_no_start/task_031_CORN_input.jpg",
+        "save_id": 2715,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2715.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_033",
+        "mode": "global_search",
+        "target_word": "SNAKE",
+        "prompt_en": "Find the word 'SNAKE'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'SNAKE' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "I",
+                "K",
+                "I",
+                "Y",
+                "S",
+                "R",
+                "L",
+                "M",
+                "M"
+            ],
+            [
+                "F",
+                "C",
+                "P",
+                "H",
+                "J",
+                "I",
+                "U",
+                "C",
+                "K"
+            ],
+            [
+                "I",
+                "T",
+                "P",
+                "Y",
+                "T",
+                "Z",
+                "D",
+                "H",
+                "N"
+            ],
+            [
+                "V",
+                "M",
+                "H",
+                "T",
+                "G",
+                "T",
+                "S",
+                "Z",
+                "Q"
+            ],
+            [
+                "O",
+                "A",
+                "T",
+                "G",
+                "F",
+                "S",
+                "Y",
+                "R",
+                "L"
+            ],
+            [
+                "O",
+                "E",
+                "K",
+                "F",
+                "U",
+                "P",
+                "C",
+                "S",
+                "N"
+            ],
+            [
+                "I",
+                "G",
+                "L",
+                "P",
+                "V",
+                "C",
+                "Y",
+                "L",
+                "A"
+            ],
+            [
+                "V",
+                "E",
+                "W",
+                "X",
+                "I",
+                "O",
+                "E",
+                "R",
+                "K"
+            ],
+            [
+                "N",
+                "G",
+                "C",
+                "A",
+                "F",
+                "G",
+                "K",
+                "W",
+                "E"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                7
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                8,
+                8
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_033_SNAKE_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_033_SNAKE_result.jpg",
+        "source_image": "Part4/word_no_start/task_033_SNAKE_input.jpg",
+        "save_id": 2717,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2717.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_035",
+        "mode": "global_search",
+        "target_word": "TIGER",
+        "prompt_en": "Find the word 'TIGER'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'TIGER' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "E",
+                "K",
+                "S",
+                "D",
+                "T",
+                "Z",
+                "M",
+                "P"
+            ],
+            [
+                "Y",
+                "J",
+                "Q",
+                "V",
+                "I",
+                "G",
+                "X",
+                "F"
+            ],
+            [
+                "M",
+                "A",
+                "Q",
+                "M",
+                "M",
+                "E",
+                "R",
+                "J"
+            ],
+            [
+                "Z",
+                "Z",
+                "B",
+                "Q",
+                "E",
+                "T",
+                "Z",
+                "B"
+            ],
+            [
+                "T",
+                "B",
+                "J",
+                "M",
+                "G",
+                "G",
+                "D",
+                "M"
+            ],
+            [
+                "M",
+                "A",
+                "W",
+                "C",
+                "I",
+                "G",
+                "J",
+                "B"
+            ],
+            [
+                "Z",
+                "T",
+                "E",
+                "P",
+                "H",
+                "P",
+                "A",
+                "Z"
+            ],
+            [
+                "D",
+                "I",
+                "Q",
+                "J",
+                "H",
+                "W",
+                "J",
+                "R"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_035_TIGER_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_035_TIGER_result.jpg",
+        "source_image": "Part4/word_no_start/task_035_TIGER_input.jpg",
+        "save_id": 2719,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2719.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_037",
+        "mode": "global_search",
+        "target_word": "PIZZA",
+        "prompt_en": "Find the word 'PIZZA'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'PIZZA' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "P",
+                "H",
+                "O",
+                "O",
+                "N",
+                "U",
+                "I"
+            ],
+            [
+                "I",
+                "B",
+                "V",
+                "C",
+                "S",
+                "K",
+                "Y"
+            ],
+            [
+                "Z",
+                "Q",
+                "L",
+                "U",
+                "B",
+                "J",
+                "U"
+            ],
+            [
+                "Z",
+                "A",
+                "X",
+                "Z",
+                "U",
+                "Y",
+                "L"
+            ],
+            [
+                "R",
+                "Z",
+                "G",
+                "R",
+                "X",
+                "S",
+                "D"
+            ],
+            [
+                "L",
+                "N",
+                "X",
+                "R",
+                "M",
+                "T",
+                "X"
+            ],
+            [
+                "K",
+                "X",
+                "B",
+                "J",
+                "C",
+                "P",
+                "C"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                0
+            ],
+            [
+                1,
+                0
+            ],
+            [
+                2,
+                0
+            ],
+            [
+                3,
+                0
+            ],
+            [
+                3,
+                1
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_037_PIZZA_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_037_PIZZA_result.jpg",
+        "source_image": "Part4/word_no_start/task_037_PIZZA_input.jpg",
+        "save_id": 2721,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2721.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_039",
+        "mode": "global_search",
+        "target_word": "MUSIC",
+        "prompt_en": "Find the word 'MUSIC'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'MUSIC' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "H",
+                "D",
+                "M",
+                "F",
+                "T",
+                "X",
+                "T",
+                "E",
+                "E"
+            ],
+            [
+                "U",
+                "S",
+                "W",
+                "R",
+                "G",
+                "R",
+                "R",
+                "F",
+                "B"
+            ],
+            [
+                "E",
+                "V",
+                "U",
+                "S",
+                "B",
+                "J",
+                "B",
+                "M",
+                "U"
+            ],
+            [
+                "Z",
+                "U",
+                "J",
+                "V",
+                "S",
+                "B",
+                "B",
+                "K",
+                "S"
+            ],
+            [
+                "M",
+                "A",
+                "N",
+                "P",
+                "T",
+                "F",
+                "P",
+                "H",
+                "I"
+            ],
+            [
+                "S",
+                "E",
+                "N",
+                "O",
+                "K",
+                "P",
+                "Z",
+                "W",
+                "C"
+            ],
+            [
+                "P",
+                "P",
+                "Z",
+                "M",
+                "P",
+                "P",
+                "X",
+                "K",
+                "X"
+            ],
+            [
+                "C",
+                "H",
+                "A",
+                "R",
+                "E",
+                "J",
+                "M",
+                "L",
+                "Y"
+            ],
+            [
+                "C",
+                "U",
+                "Y",
+                "Q",
+                "N",
+                "T",
+                "S",
+                "E",
+                "T"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                7
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                5,
+                8
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_039_MUSIC_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_039_MUSIC_result.jpg",
+        "source_image": "Part4/word_no_start/task_039_MUSIC_input.jpg",
+        "save_id": 2723,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2723.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_041",
+        "mode": "global_search",
+        "target_word": "MONKEY",
+        "prompt_en": "Find the word 'MONKEY'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'MONKEY' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "C",
+                "F",
+                "C",
+                "X",
+                "Z",
+                "P",
+                "D",
+                "X",
+                "Z"
+            ],
+            [
+                "G",
+                "O",
+                "D",
+                "N",
+                "T",
+                "G",
+                "S",
+                "J",
+                "I"
+            ],
+            [
+                "B",
+                "A",
+                "T",
+                "D",
+                "M",
+                "G",
+                "H",
+                "C",
+                "A"
+            ],
+            [
+                "C",
+                "W",
+                "X",
+                "K",
+                "O",
+                "N",
+                "G",
+                "F",
+                "I"
+            ],
+            [
+                "W",
+                "U",
+                "R",
+                "T",
+                "D",
+                "K",
+                "E",
+                "P",
+                "M"
+            ],
+            [
+                "Z",
+                "C",
+                "M",
+                "I",
+                "L",
+                "R",
+                "Y",
+                "Q",
+                "F"
+            ],
+            [
+                "U",
+                "R",
+                "S",
+                "Q",
+                "R",
+                "M",
+                "X",
+                "S",
+                "D"
+            ],
+            [
+                "H",
+                "C",
+                "S",
+                "U",
+                "V",
+                "B",
+                "N",
+                "Z",
+                "K"
+            ],
+            [
+                "C",
+                "V",
+                "U",
+                "I",
+                "I",
+                "Y",
+                "R",
+                "Q",
+                "B"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_041_MONKEY_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_041_MONKEY_result.jpg",
+        "source_image": "Part4/word_no_start/task_041_MONKEY_input.jpg",
+        "save_id": 2725,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2725.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_043",
+        "mode": "global_search",
+        "target_word": "ORANGE",
+        "prompt_en": "Find the word 'ORANGE'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'ORANGE' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "Y",
+                "K",
+                "S",
+                "W",
+                "J",
+                "O",
+                "J",
+                "S"
+            ],
+            [
+                "U",
+                "A",
+                "U",
+                "Q",
+                "X",
+                "B",
+                "E",
+                "O"
+            ],
+            [
+                "S",
+                "J",
+                "Z",
+                "L",
+                "G",
+                "M",
+                "T",
+                "R"
+            ],
+            [
+                "L",
+                "N",
+                "L",
+                "L",
+                "M",
+                "U",
+                "Q",
+                "A"
+            ],
+            [
+                "S",
+                "N",
+                "R",
+                "Y",
+                "B",
+                "N",
+                "Z",
+                "N"
+            ],
+            [
+                "T",
+                "Z",
+                "M",
+                "Z",
+                "P",
+                "U",
+                "K",
+                "G"
+            ],
+            [
+                "D",
+                "E",
+                "Z",
+                "L",
+                "M",
+                "S",
+                "V",
+                "E"
+            ],
+            [
+                "F",
+                "S",
+                "M",
+                "S",
+                "I",
+                "A",
+                "O",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                7
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_043_ORANGE_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_043_ORANGE_result.jpg",
+        "source_image": "Part4/word_no_start/task_043_ORANGE_input.jpg",
+        "save_id": 2727,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2727.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_045",
+        "mode": "global_search",
+        "target_word": "DOCTOR",
+        "prompt_en": "Find the word 'DOCTOR'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'DOCTOR' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "W",
+                "Z",
+                "Q",
+                "H",
+                "C",
+                "A",
+                "K",
+                "E",
+                "S",
+                "X"
+            ],
+            [
+                "Q",
+                "T",
+                "M",
+                "G",
+                "N",
+                "B",
+                "J",
+                "T",
+                "E",
+                "X"
+            ],
+            [
+                "A",
+                "H",
+                "L",
+                "P",
+                "I",
+                "F",
+                "B",
+                "I",
+                "V",
+                "Q"
+            ],
+            [
+                "X",
+                "E",
+                "W",
+                "I",
+                "F",
+                "V",
+                "Z",
+                "C",
+                "F",
+                "N"
+            ],
+            [
+                "K",
+                "R",
+                "U",
+                "H",
+                "D",
+                "Q",
+                "V",
+                "Q",
+                "M",
+                "E"
+            ],
+            [
+                "B",
+                "R",
+                "D",
+                "E",
+                "H",
+                "Z",
+                "C",
+                "Q",
+                "U",
+                "B"
+            ],
+            [
+                "F",
+                "G",
+                "X",
+                "V",
+                "L",
+                "E",
+                "D",
+                "I",
+                "F",
+                "D"
+            ],
+            [
+                "M",
+                "I",
+                "S",
+                "V",
+                "Z",
+                "S",
+                "O",
+                "C",
+                "T",
+                "O"
+            ],
+            [
+                "K",
+                "Q",
+                "J",
+                "N",
+                "Z",
+                "B",
+                "I",
+                "I",
+                "L",
+                "R"
+            ],
+            [
+                "R",
+                "G",
+                "O",
+                "M",
+                "U",
+                "K",
+                "T",
+                "X",
+                "T",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                6,
+                6
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                8,
+                9
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_045_DOCTOR_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_045_DOCTOR_result.jpg",
+        "source_image": "Part4/word_no_start/task_045_DOCTOR_input.jpg",
+        "save_id": 2729,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2729.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_047",
+        "mode": "global_search",
+        "target_word": "FRIEND",
+        "prompt_en": "Find the word 'FRIEND'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'FRIEND' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "C",
+                "R",
+                "G",
+                "S",
+                "S",
+                "U",
+                "W"
+            ],
+            [
+                "G",
+                "N",
+                "A",
+                "O",
+                "A",
+                "H",
+                "H"
+            ],
+            [
+                "M",
+                "Q",
+                "F",
+                "R",
+                "I",
+                "E",
+                "L"
+            ],
+            [
+                "G",
+                "H",
+                "M",
+                "V",
+                "R",
+                "N",
+                "D"
+            ],
+            [
+                "E",
+                "N",
+                "Z",
+                "I",
+                "M",
+                "Z",
+                "X"
+            ],
+            [
+                "P",
+                "P",
+                "R",
+                "G",
+                "W",
+                "N",
+                "W"
+            ],
+            [
+                "Q",
+                "F",
+                "Y",
+                "B",
+                "X",
+                "Q",
+                "V"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                3,
+                6
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_047_FRIEND_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_047_FRIEND_result.jpg",
+        "source_image": "Part4/word_no_start/task_047_FRIEND_input.jpg",
+        "save_id": 2731,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2731.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_049",
+        "mode": "global_search",
+        "target_word": "PYTHON",
+        "prompt_en": "Find the word 'PYTHON'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'PYTHON' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "D",
+                "Y",
+                "F",
+                "Q",
+                "G",
+                "J",
+                "M"
+            ],
+            [
+                "C",
+                "C",
+                "K",
+                "B",
+                "W",
+                "A",
+                "Z"
+            ],
+            [
+                "M",
+                "H",
+                "D",
+                "X",
+                "F",
+                "P",
+                "D"
+            ],
+            [
+                "G",
+                "O",
+                "S",
+                "N",
+                "I",
+                "H",
+                "W"
+            ],
+            [
+                "O",
+                "U",
+                "P",
+                "Y",
+                "T",
+                "H",
+                "Z"
+            ],
+            [
+                "X",
+                "C",
+                "B",
+                "S",
+                "L",
+                "O",
+                "J"
+            ],
+            [
+                "P",
+                "L",
+                "I",
+                "J",
+                "V",
+                "N",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_049_PYTHON_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_049_PYTHON_result.jpg",
+        "source_image": "Part4/word_no_start/task_049_PYTHON_input.jpg",
+        "save_id": 2733,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2733.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_051",
+        "mode": "global_search",
+        "target_word": "GARDEN",
+        "prompt_en": "Find the word 'GARDEN'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'GARDEN' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "N",
+                "F",
+                "P",
+                "Q",
+                "W",
+                "T",
+                "M",
+                "S"
+            ],
+            [
+                "G",
+                "A",
+                "R",
+                "D",
+                "R",
+                "N",
+                "G",
+                "B"
+            ],
+            [
+                "F",
+                "G",
+                "J",
+                "E",
+                "N",
+                "X",
+                "M",
+                "Y"
+            ],
+            [
+                "G",
+                "V",
+                "D",
+                "A",
+                "Z",
+                "Z",
+                "W",
+                "Q"
+            ],
+            [
+                "K",
+                "N",
+                "C",
+                "T",
+                "U",
+                "S",
+                "N",
+                "L"
+            ],
+            [
+                "L",
+                "B",
+                "P",
+                "X",
+                "J",
+                "Y",
+                "Z",
+                "F"
+            ],
+            [
+                "O",
+                "B",
+                "O",
+                "G",
+                "Z",
+                "G",
+                "Q",
+                "E"
+            ],
+            [
+                "Z",
+                "X",
+                "S",
+                "S",
+                "I",
+                "Y",
+                "O",
+                "S"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                0
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_051_GARDEN_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_051_GARDEN_result.jpg",
+        "source_image": "Part4/word_no_start/task_051_GARDEN_input.jpg",
+        "save_id": 2735,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2735.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_053",
+        "mode": "global_search",
+        "target_word": "APPLE",
+        "prompt_en": "Find the word 'APPLE'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'APPLE' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "U",
+                "M",
+                "U",
+                "S",
+                "G",
+                "I",
+                "S",
+                "A"
+            ],
+            [
+                "O",
+                "F",
+                "J",
+                "S",
+                "J",
+                "U",
+                "A",
+                "P"
+            ],
+            [
+                "G",
+                "N",
+                "T",
+                "R",
+                "K",
+                "M",
+                "J",
+                "P"
+            ],
+            [
+                "T",
+                "T",
+                "T",
+                "N",
+                "H",
+                "Y",
+                "V",
+                "L"
+            ],
+            [
+                "A",
+                "C",
+                "M",
+                "U",
+                "C",
+                "C",
+                "C",
+                "E"
+            ],
+            [
+                "D",
+                "V",
+                "S",
+                "H",
+                "U",
+                "H",
+                "F",
+                "J"
+            ],
+            [
+                "F",
+                "Z",
+                "S",
+                "D",
+                "J",
+                "M",
+                "A",
+                "G"
+            ],
+            [
+                "L",
+                "W",
+                "L",
+                "N",
+                "R",
+                "S",
+                "U",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_053_APPLE_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_053_APPLE_result.jpg",
+        "source_image": "Part4/word_no_start/task_053_APPLE_input.jpg",
+        "save_id": 2737,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2737.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_055",
+        "mode": "global_search",
+        "target_word": "LEMON",
+        "prompt_en": "Find the word 'LEMON'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'LEMON' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "C",
+                "Z",
+                "P",
+                "J",
+                "S",
+                "W",
+                "D",
+                "L",
+                "O"
+            ],
+            [
+                "Q",
+                "G",
+                "R",
+                "E",
+                "K",
+                "T",
+                "L",
+                "A",
+                "L"
+            ],
+            [
+                "P",
+                "A",
+                "P",
+                "Z",
+                "Q",
+                "S",
+                "E",
+                "M",
+                "O"
+            ],
+            [
+                "I",
+                "U",
+                "P",
+                "E",
+                "N",
+                "V",
+                "H",
+                "X",
+                "N"
+            ],
+            [
+                "D",
+                "W",
+                "U",
+                "D",
+                "G",
+                "J",
+                "E",
+                "B",
+                "Z"
+            ],
+            [
+                "X",
+                "X",
+                "A",
+                "P",
+                "F",
+                "B",
+                "F",
+                "L",
+                "D"
+            ],
+            [
+                "T",
+                "M",
+                "D",
+                "O",
+                "C",
+                "D",
+                "J",
+                "B",
+                "B"
+            ],
+            [
+                "S",
+                "D",
+                "Z",
+                "G",
+                "Y",
+                "X",
+                "V",
+                "J",
+                "I"
+            ],
+            [
+                "A",
+                "D",
+                "A",
+                "O",
+                "S",
+                "A",
+                "G",
+                "G",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                6
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_055_LEMON_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_055_LEMON_result.jpg",
+        "source_image": "Part4/word_no_start/task_055_LEMON_input.jpg",
+        "save_id": 2739,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2739.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_057",
+        "mode": "global_search",
+        "target_word": "RIVER",
+        "prompt_en": "Find the word 'RIVER'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'RIVER' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "X",
+                "A",
+                "Z",
+                "C",
+                "P",
+                "R",
+                "C"
+            ],
+            [
+                "L",
+                "M",
+                "T",
+                "U",
+                "S",
+                "A",
+                "D"
+            ],
+            [
+                "R",
+                "O",
+                "P",
+                "Z",
+                "G",
+                "O",
+                "S"
+            ],
+            [
+                "I",
+                "C",
+                "B",
+                "X",
+                "M",
+                "L",
+                "W"
+            ],
+            [
+                "V",
+                "E",
+                "R",
+                "J",
+                "L",
+                "H",
+                "D"
+            ],
+            [
+                "X",
+                "J",
+                "Z",
+                "J",
+                "G",
+                "E",
+                "M"
+            ],
+            [
+                "B",
+                "Y",
+                "A",
+                "O",
+                "O",
+                "T",
+                "R"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                0
+            ],
+            [
+                3,
+                0
+            ],
+            [
+                4,
+                0
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                2
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_057_RIVER_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_057_RIVER_result.jpg",
+        "source_image": "Part4/word_no_start/task_057_RIVER_input.jpg",
+        "save_id": 2741,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2741.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_059",
+        "mode": "global_search",
+        "target_word": "CLOUD",
+        "prompt_en": "Find the word 'CLOUD'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'CLOUD' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "T",
+                "H",
+                "U",
+                "U",
+                "L",
+                "A",
+                "E",
+                "X"
+            ],
+            [
+                "H",
+                "T",
+                "J",
+                "K",
+                "U",
+                "N",
+                "U",
+                "S"
+            ],
+            [
+                "U",
+                "M",
+                "V",
+                "U",
+                "L",
+                "H",
+                "W",
+                "E"
+            ],
+            [
+                "X",
+                "B",
+                "L",
+                "L",
+                "T",
+                "L",
+                "A",
+                "Q"
+            ],
+            [
+                "F",
+                "R",
+                "V",
+                "P",
+                "C",
+                "L",
+                "O",
+                "U"
+            ],
+            [
+                "E",
+                "Q",
+                "H",
+                "Y",
+                "O",
+                "O",
+                "P",
+                "D"
+            ],
+            [
+                "W",
+                "U",
+                "U",
+                "Q",
+                "J",
+                "H",
+                "I",
+                "Q"
+            ],
+            [
+                "Z",
+                "I",
+                "R",
+                "F",
+                "U",
+                "Z",
+                "H",
+                "F"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_059_CLOUD_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_059_CLOUD_result.jpg",
+        "source_image": "Part4/word_no_start/task_059_CLOUD_input.jpg",
+        "save_id": 2743,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2743.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_061",
+        "mode": "global_search",
+        "target_word": "CHAIR",
+        "prompt_en": "Find the word 'CHAIR'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'CHAIR' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "S",
+                "Y",
+                "Q",
+                "Y",
+                "R",
+                "O",
+                "C"
+            ],
+            [
+                "X",
+                "V",
+                "P",
+                "U",
+                "K",
+                "H",
+                "K"
+            ],
+            [
+                "C",
+                "H",
+                "A",
+                "I",
+                "R",
+                "J",
+                "O"
+            ],
+            [
+                "W",
+                "Q",
+                "Y",
+                "L",
+                "Q",
+                "I",
+                "H"
+            ],
+            [
+                "Y",
+                "G",
+                "Z",
+                "H",
+                "M",
+                "O",
+                "V"
+            ],
+            [
+                "W",
+                "Y",
+                "T",
+                "Z",
+                "S",
+                "Y",
+                "F"
+            ],
+            [
+                "F",
+                "M",
+                "K",
+                "F",
+                "C",
+                "Y",
+                "T"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                0
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_061_CHAIR_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_061_CHAIR_result.jpg",
+        "source_image": "Part4/word_no_start/task_061_CHAIR_input.jpg",
+        "save_id": 2745,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2745.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_063",
+        "mode": "global_search",
+        "target_word": "PLATE",
+        "prompt_en": "Find the word 'PLATE'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'PLATE' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "X",
+                "U",
+                "U",
+                "B",
+                "T",
+                "E",
+                "Z",
+                "D",
+                "C"
+            ],
+            [
+                "U",
+                "B",
+                "C",
+                "Y",
+                "F",
+                "C",
+                "Q",
+                "N",
+                "U"
+            ],
+            [
+                "S",
+                "L",
+                "X",
+                "E",
+                "N",
+                "D",
+                "A",
+                "V",
+                "X"
+            ],
+            [
+                "O",
+                "Q",
+                "Q",
+                "I",
+                "Q",
+                "U",
+                "A",
+                "W",
+                "I"
+            ],
+            [
+                "J",
+                "N",
+                "S",
+                "D",
+                "P",
+                "C",
+                "I",
+                "H",
+                "S"
+            ],
+            [
+                "U",
+                "P",
+                "B",
+                "M",
+                "M",
+                "B",
+                "C",
+                "O",
+                "P"
+            ],
+            [
+                "V",
+                "U",
+                "P",
+                "K",
+                "R",
+                "W",
+                "Q",
+                "X",
+                "B"
+            ],
+            [
+                "W",
+                "T",
+                "L",
+                "D",
+                "M",
+                "O",
+                "L",
+                "O",
+                "G"
+            ],
+            [
+                "J",
+                "A",
+                "A",
+                "T",
+                "E",
+                "X",
+                "R",
+                "G",
+                "D"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                6,
+                2
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_063_PLATE_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_063_PLATE_result.jpg",
+        "source_image": "Part4/word_no_start/task_063_PLATE_input.jpg",
+        "save_id": 2747,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2747.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_065",
+        "mode": "global_search",
+        "target_word": "KNIFE",
+        "prompt_en": "Find the word 'KNIFE'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'KNIFE' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "O",
+                "K",
+                "C",
+                "Q",
+                "B",
+                "A",
+                "F",
+                "W",
+                "A"
+            ],
+            [
+                "D",
+                "J",
+                "I",
+                "G",
+                "Q",
+                "Z",
+                "P",
+                "J",
+                "O"
+            ],
+            [
+                "U",
+                "V",
+                "Q",
+                "J",
+                "G",
+                "M",
+                "A",
+                "Y",
+                "S"
+            ],
+            [
+                "A",
+                "M",
+                "Q",
+                "B",
+                "S",
+                "I",
+                "D",
+                "R",
+                "D"
+            ],
+            [
+                "K",
+                "G",
+                "M",
+                "X",
+                "U",
+                "E",
+                "H",
+                "G",
+                "Z"
+            ],
+            [
+                "V",
+                "K",
+                "H",
+                "E",
+                "L",
+                "T",
+                "F",
+                "T",
+                "T"
+            ],
+            [
+                "K",
+                "X",
+                "T",
+                "G",
+                "Z",
+                "C",
+                "D",
+                "K",
+                "T"
+            ],
+            [
+                "N",
+                "O",
+                "G",
+                "L",
+                "V",
+                "M",
+                "V",
+                "B",
+                "X"
+            ],
+            [
+                "I",
+                "F",
+                "E",
+                "Z",
+                "H",
+                "C",
+                "H",
+                "L",
+                "T"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                6,
+                0
+            ],
+            [
+                7,
+                0
+            ],
+            [
+                8,
+                0
+            ],
+            [
+                8,
+                1
+            ],
+            [
+                8,
+                2
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_065_KNIFE_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_065_KNIFE_result.jpg",
+        "source_image": "Part4/word_no_start/task_065_KNIFE_input.jpg",
+        "save_id": 2749,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2749.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_067",
+        "mode": "global_search",
+        "target_word": "COMPUTER",
+        "prompt_en": "Find the word 'COMPUTER'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'COMPUTER' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "E",
+                "U",
+                "C",
+                "F",
+                "C",
+                "J",
+                "N",
+                "U",
+                "O"
+            ],
+            [
+                "E",
+                "F",
+                "X",
+                "I",
+                "S",
+                "V",
+                "T",
+                "X",
+                "W"
+            ],
+            [
+                "O",
+                "M",
+                "M",
+                "B",
+                "E",
+                "O",
+                "T",
+                "N",
+                "S"
+            ],
+            [
+                "X",
+                "B",
+                "Q",
+                "C",
+                "S",
+                "T",
+                "G",
+                "Z",
+                "P"
+            ],
+            [
+                "T",
+                "W",
+                "H",
+                "O",
+                "A",
+                "I",
+                "L",
+                "M",
+                "I"
+            ],
+            [
+                "S",
+                "H",
+                "S",
+                "E",
+                "O",
+                "G",
+                "V",
+                "A",
+                "G"
+            ],
+            [
+                "E",
+                "S",
+                "L",
+                "X",
+                "W",
+                "A",
+                "H",
+                "A",
+                "L"
+            ],
+            [
+                "E",
+                "E",
+                "C",
+                "O",
+                "R",
+                "Z",
+                "X",
+                "Q",
+                "G"
+            ],
+            [
+                "D",
+                "Q",
+                "F",
+                "M",
+                "P",
+                "U",
+                "T",
+                "E",
+                "R"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                7,
+                2
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_067_COMPUTER_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_067_COMPUTER_result.jpg",
+        "source_image": "Part4/word_no_start/task_067_COMPUTER_input.jpg",
+        "save_id": 2751,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2751.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_069",
+        "mode": "global_search",
+        "target_word": "UMBRELLA",
+        "prompt_en": "Find the word 'UMBRELLA'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'UMBRELLA' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "Y",
+                "H",
+                "I",
+                "J",
+                "O",
+                "Z",
+                "Q",
+                "Z",
+                "H",
+                "H",
+                "P",
+                "Y"
+            ],
+            [
+                "Q",
+                "U",
+                "U",
+                "O",
+                "H",
+                "J",
+                "H",
+                "S",
+                "V",
+                "W",
+                "H",
+                "C"
+            ],
+            [
+                "F",
+                "I",
+                "M",
+                "B",
+                "N",
+                "O",
+                "Y",
+                "T",
+                "J",
+                "Z",
+                "J",
+                "Y"
+            ],
+            [
+                "T",
+                "D",
+                "V",
+                "R",
+                "E",
+                "L",
+                "F",
+                "B",
+                "O",
+                "A",
+                "I",
+                "C"
+            ],
+            [
+                "Z",
+                "C",
+                "F",
+                "A",
+                "Y",
+                "L",
+                "Q",
+                "W",
+                "C",
+                "K",
+                "U",
+                "P"
+            ],
+            [
+                "Z",
+                "Z",
+                "I",
+                "U",
+                "R",
+                "A",
+                "Q",
+                "E",
+                "S",
+                "B",
+                "F",
+                "R"
+            ],
+            [
+                "I",
+                "C",
+                "F",
+                "S",
+                "D",
+                "Z",
+                "X",
+                "O",
+                "A",
+                "E",
+                "D",
+                "F"
+            ],
+            [
+                "S",
+                "Y",
+                "N",
+                "Q",
+                "G",
+                "V",
+                "E",
+                "N",
+                "Z",
+                "M",
+                "J",
+                "I"
+            ],
+            [
+                "B",
+                "U",
+                "N",
+                "W",
+                "C",
+                "A",
+                "J",
+                "A",
+                "E",
+                "A",
+                "W",
+                "O"
+            ],
+            [
+                "F",
+                "T",
+                "R",
+                "V",
+                "B",
+                "N",
+                "P",
+                "J",
+                "V",
+                "Z",
+                "R",
+                "B"
+            ],
+            [
+                "Q",
+                "H",
+                "D",
+                "A",
+                "Y",
+                "F",
+                "B",
+                "F",
+                "Q",
+                "W",
+                "M",
+                "I"
+            ],
+            [
+                "N",
+                "E",
+                "A",
+                "U",
+                "A",
+                "I",
+                "I",
+                "F",
+                "T",
+                "F",
+                "T",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_069_UMBRELLA_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_069_UMBRELLA_result.jpg",
+        "source_image": "Part4/word_no_start/task_069_UMBRELLA_input.jpg",
+        "save_id": 2753,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2753.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_071",
+        "mode": "global_search",
+        "target_word": "KANGAROO",
+        "prompt_en": "Find the word 'KANGAROO'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'KANGAROO' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "H",
+                "U",
+                "O",
+                "P",
+                "I",
+                "N",
+                "B",
+                "G",
+                "R",
+                "P",
+                "L",
+                "Q"
+            ],
+            [
+                "M",
+                "B",
+                "T",
+                "T",
+                "N",
+                "C",
+                "K",
+                "A",
+                "N",
+                "X",
+                "Z",
+                "M"
+            ],
+            [
+                "X",
+                "K",
+                "S",
+                "A",
+                "Y",
+                "U",
+                "G",
+                "H",
+                "G",
+                "S",
+                "J",
+                "P"
+            ],
+            [
+                "G",
+                "P",
+                "P",
+                "V",
+                "P",
+                "G",
+                "L",
+                "K",
+                "A",
+                "D",
+                "K",
+                "K"
+            ],
+            [
+                "P",
+                "Y",
+                "X",
+                "R",
+                "R",
+                "J",
+                "Z",
+                "M",
+                "R",
+                "O",
+                "P",
+                "O"
+            ],
+            [
+                "O",
+                "E",
+                "V",
+                "N",
+                "J",
+                "O",
+                "O",
+                "W",
+                "P",
+                "O",
+                "X",
+                "I"
+            ],
+            [
+                "B",
+                "A",
+                "L",
+                "G",
+                "F",
+                "Z",
+                "D",
+                "I",
+                "Z",
+                "Z",
+                "S",
+                "I"
+            ],
+            [
+                "R",
+                "O",
+                "V",
+                "W",
+                "X",
+                "T",
+                "V",
+                "M",
+                "U",
+                "E",
+                "N",
+                "A"
+            ],
+            [
+                "M",
+                "Z",
+                "W",
+                "N",
+                "U",
+                "Z",
+                "O",
+                "A",
+                "U",
+                "K",
+                "I",
+                "S"
+            ],
+            [
+                "K",
+                "K",
+                "F",
+                "E",
+                "M",
+                "U",
+                "A",
+                "O",
+                "M",
+                "H",
+                "O",
+                "R"
+            ],
+            [
+                "B",
+                "J",
+                "Y",
+                "H",
+                "U",
+                "M",
+                "J",
+                "M",
+                "E",
+                "R",
+                "C",
+                "B"
+            ],
+            [
+                "S",
+                "C",
+                "B",
+                "H",
+                "G",
+                "O",
+                "C",
+                "U",
+                "Z",
+                "W",
+                "C",
+                "R"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                1,
+                8
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                5,
+                9
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_071_KANGAROO_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_071_KANGAROO_result.jpg",
+        "source_image": "Part4/word_no_start/task_071_KANGAROO_input.jpg",
+        "save_id": 2755,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2755.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_073",
+        "mode": "global_search",
+        "target_word": "SANDWICH",
+        "prompt_en": "Find the word 'SANDWICH'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'SANDWICH' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "G",
+                "Y",
+                "L",
+                "Q",
+                "H",
+                "L",
+                "B",
+                "C",
+                "T"
+            ],
+            [
+                "Z",
+                "R",
+                "Y",
+                "M",
+                "B",
+                "N",
+                "V",
+                "M",
+                "D"
+            ],
+            [
+                "L",
+                "E",
+                "Q",
+                "S",
+                "A",
+                "M",
+                "U",
+                "C",
+                "M"
+            ],
+            [
+                "I",
+                "E",
+                "U",
+                "F",
+                "N",
+                "D",
+                "W",
+                "I",
+                "C"
+            ],
+            [
+                "T",
+                "G",
+                "E",
+                "V",
+                "A",
+                "Y",
+                "S",
+                "C",
+                "H"
+            ],
+            [
+                "B",
+                "T",
+                "P",
+                "M",
+                "C",
+                "D",
+                "D",
+                "W",
+                "J"
+            ],
+            [
+                "T",
+                "G",
+                "M",
+                "M",
+                "O",
+                "U",
+                "Z",
+                "P",
+                "J"
+            ],
+            [
+                "E",
+                "U",
+                "H",
+                "E",
+                "Z",
+                "E",
+                "H",
+                "U",
+                "G"
+            ],
+            [
+                "D",
+                "U",
+                "R",
+                "M",
+                "S",
+                "G",
+                "X",
+                "E",
+                "B"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                8
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_073_SANDWICH_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_073_SANDWICH_result.jpg",
+        "source_image": "Part4/word_no_start/task_073_SANDWICH_input.jpg",
+        "save_id": 2757,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2757.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_075",
+        "mode": "global_search",
+        "target_word": "ALGORITHM",
+        "prompt_en": "Find the word 'ALGORITHM'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'ALGORITHM' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "K",
+                "Z",
+                "R",
+                "G",
+                "R",
+                "B",
+                "E",
+                "X",
+                "L",
+                "N",
+                "C"
+            ],
+            [
+                "M",
+                "K",
+                "X",
+                "S",
+                "C",
+                "E",
+                "D",
+                "R",
+                "R",
+                "P",
+                "A"
+            ],
+            [
+                "A",
+                "Z",
+                "W",
+                "M",
+                "W",
+                "Z",
+                "G",
+                "S",
+                "Y",
+                "C",
+                "Y"
+            ],
+            [
+                "U",
+                "U",
+                "X",
+                "X",
+                "I",
+                "A",
+                "R",
+                "V",
+                "C",
+                "K",
+                "C"
+            ],
+            [
+                "O",
+                "U",
+                "O",
+                "C",
+                "U",
+                "W",
+                "Z",
+                "Y",
+                "C",
+                "J",
+                "D"
+            ],
+            [
+                "L",
+                "S",
+                "H",
+                "L",
+                "L",
+                "K",
+                "A",
+                "J",
+                "A",
+                "U",
+                "E"
+            ],
+            [
+                "A",
+                "J",
+                "G",
+                "B",
+                "S",
+                "J",
+                "R",
+                "I",
+                "F",
+                "R",
+                "E"
+            ],
+            [
+                "V",
+                "B",
+                "H",
+                "N",
+                "O",
+                "A",
+                "L",
+                "C",
+                "C",
+                "E",
+                "C"
+            ],
+            [
+                "K",
+                "J",
+                "T",
+                "H",
+                "Z",
+                "Z",
+                "G",
+                "C",
+                "H",
+                "M",
+                "E"
+            ],
+            [
+                "B",
+                "B",
+                "B",
+                "A",
+                "V",
+                "P",
+                "O",
+                "R",
+                "I",
+                "Y",
+                "Z"
+            ],
+            [
+                "M",
+                "Y",
+                "W",
+                "T",
+                "O",
+                "H",
+                "B",
+                "Z",
+                "T",
+                "H",
+                "M"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                9,
+                6
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                10,
+                8
+            ],
+            [
+                10,
+                9
+            ],
+            [
+                10,
+                10
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_075_ALGORITHM_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_075_ALGORITHM_result.jpg",
+        "source_image": "Part4/word_no_start/task_075_ALGORITHM_input.jpg",
+        "save_id": 2759,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2759.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_077",
+        "mode": "global_search",
+        "target_word": "STRAWBERRY",
+        "prompt_en": "Find the word 'STRAWBERRY'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'STRAWBERRY' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "E",
+                "F",
+                "B",
+                "Z",
+                "R",
+                "B",
+                "S",
+                "Y",
+                "O",
+                "V",
+                "Y"
+            ],
+            [
+                "A",
+                "B",
+                "H",
+                "G",
+                "C",
+                "N",
+                "M",
+                "W",
+                "V",
+                "T",
+                "H"
+            ],
+            [
+                "S",
+                "X",
+                "V",
+                "E",
+                "X",
+                "E",
+                "S",
+                "O",
+                "B",
+                "Y",
+                "Q"
+            ],
+            [
+                "X",
+                "A",
+                "O",
+                "N",
+                "Y",
+                "C",
+                "X",
+                "V",
+                "V",
+                "Z",
+                "N"
+            ],
+            [
+                "L",
+                "Q",
+                "T",
+                "R",
+                "V",
+                "V",
+                "T",
+                "A",
+                "Y",
+                "R",
+                "Q"
+            ],
+            [
+                "Q",
+                "E",
+                "I",
+                "F",
+                "G",
+                "S",
+                "T",
+                "P",
+                "Q",
+                "J",
+                "Q"
+            ],
+            [
+                "H",
+                "L",
+                "R",
+                "P",
+                "W",
+                "X",
+                "R",
+                "X",
+                "H",
+                "O",
+                "M"
+            ],
+            [
+                "A",
+                "Q",
+                "Y",
+                "U",
+                "Z",
+                "R",
+                "A",
+                "W",
+                "B",
+                "E",
+                "R"
+            ],
+            [
+                "M",
+                "E",
+                "Z",
+                "O",
+                "N",
+                "I",
+                "M",
+                "U",
+                "W",
+                "D",
+                "R"
+            ],
+            [
+                "G",
+                "V",
+                "P",
+                "D",
+                "X",
+                "V",
+                "W",
+                "T",
+                "U",
+                "Q",
+                "Y"
+            ],
+            [
+                "L",
+                "Y",
+                "V",
+                "B",
+                "K",
+                "D",
+                "M",
+                "P",
+                "B",
+                "T",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                7,
+                10
+            ],
+            [
+                8,
+                10
+            ],
+            [
+                9,
+                10
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_077_STRAWBERRY_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_077_STRAWBERRY_result.jpg",
+        "source_image": "Part4/word_no_start/task_077_STRAWBERRY_input.jpg",
+        "save_id": 2761,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2761.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_079",
+        "mode": "global_search",
+        "target_word": "INTELLIGENCE",
+        "prompt_en": "Find the word 'INTELLIGENCE'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'INTELLIGENCE' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "O",
+                "T",
+                "P",
+                "N",
+                "G",
+                "M",
+                "K",
+                "N",
+                "O",
+                "E",
+                "L",
+                "A"
+            ],
+            [
+                "P",
+                "Q",
+                "S",
+                "F",
+                "X",
+                "I",
+                "W",
+                "R",
+                "N",
+                "X",
+                "G",
+                "N"
+            ],
+            [
+                "R",
+                "D",
+                "C",
+                "Y",
+                "J",
+                "N",
+                "Z",
+                "P",
+                "E",
+                "N",
+                "A",
+                "B"
+            ],
+            [
+                "P",
+                "U",
+                "K",
+                "Y",
+                "I",
+                "T",
+                "J",
+                "C",
+                "N",
+                "T",
+                "J",
+                "C"
+            ],
+            [
+                "Q",
+                "X",
+                "R",
+                "G",
+                "N",
+                "T",
+                "R",
+                "I",
+                "A",
+                "H",
+                "X",
+                "G"
+            ],
+            [
+                "M",
+                "H",
+                "C",
+                "Z",
+                "H",
+                "E",
+                "L",
+                "K",
+                "S",
+                "W",
+                "M",
+                "F"
+            ],
+            [
+                "Z",
+                "D",
+                "V",
+                "G",
+                "M",
+                "F",
+                "L",
+                "I",
+                "F",
+                "H",
+                "F",
+                "T"
+            ],
+            [
+                "R",
+                "J",
+                "J",
+                "R",
+                "C",
+                "P",
+                "Q",
+                "G",
+                "E",
+                "N",
+                "C",
+                "N"
+            ],
+            [
+                "H",
+                "Y",
+                "Z",
+                "C",
+                "R",
+                "F",
+                "U",
+                "W",
+                "M",
+                "P",
+                "E",
+                "Z"
+            ],
+            [
+                "X",
+                "B",
+                "Z",
+                "O",
+                "U",
+                "D",
+                "O",
+                "X",
+                "L",
+                "A",
+                "J",
+                "U"
+            ],
+            [
+                "U",
+                "W",
+                "Z",
+                "S",
+                "X",
+                "O",
+                "V",
+                "P",
+                "Q",
+                "K",
+                "U",
+                "R"
+            ],
+            [
+                "V",
+                "Z",
+                "Q",
+                "Q",
+                "F",
+                "M",
+                "L",
+                "Y",
+                "R",
+                "R",
+                "M",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                7,
+                10
+            ],
+            [
+                8,
+                10
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_079_INTELLIGENCE_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_079_INTELLIGENCE_result.jpg",
+        "source_image": "Part4/word_no_start/task_079_INTELLIGENCE_input.jpg",
+        "save_id": 2763,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2763.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_081",
+        "mode": "global_search",
+        "target_word": "TELEPHONE",
+        "prompt_en": "Find the word 'TELEPHONE'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'TELEPHONE' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "L",
+                "J",
+                "I",
+                "H",
+                "V",
+                "D",
+                "S",
+                "D",
+                "R",
+                "R",
+                "J",
+                "K"
+            ],
+            [
+                "J",
+                "M",
+                "D",
+                "W",
+                "R",
+                "L",
+                "J",
+                "U",
+                "M",
+                "E",
+                "K",
+                "M"
+            ],
+            [
+                "S",
+                "R",
+                "P",
+                "K",
+                "W",
+                "X",
+                "F",
+                "H",
+                "D",
+                "J",
+                "Z",
+                "Q"
+            ],
+            [
+                "Y",
+                "A",
+                "I",
+                "L",
+                "W",
+                "I",
+                "H",
+                "S",
+                "C",
+                "Y",
+                "J",
+                "U"
+            ],
+            [
+                "T",
+                "D",
+                "Y",
+                "X",
+                "J",
+                "D",
+                "X",
+                "Y",
+                "S",
+                "L",
+                "E",
+                "I"
+            ],
+            [
+                "E",
+                "Q",
+                "D",
+                "Z",
+                "S",
+                "R",
+                "Q",
+                "B",
+                "Y",
+                "D",
+                "B",
+                "X"
+            ],
+            [
+                "L",
+                "E",
+                "P",
+                "E",
+                "N",
+                "E",
+                "K",
+                "M",
+                "X",
+                "N",
+                "S",
+                "E"
+            ],
+            [
+                "L",
+                "Q",
+                "H",
+                "O",
+                "A",
+                "F",
+                "H",
+                "R",
+                "S",
+                "G",
+                "Y",
+                "V"
+            ],
+            [
+                "D",
+                "C",
+                "I",
+                "N",
+                "E",
+                "X",
+                "X",
+                "Y",
+                "W",
+                "U",
+                "G",
+                "T"
+            ],
+            [
+                "M",
+                "Q",
+                "R",
+                "Y",
+                "X",
+                "F",
+                "X",
+                "L",
+                "O",
+                "T",
+                "G",
+                "C"
+            ],
+            [
+                "G",
+                "B",
+                "W",
+                "Z",
+                "Z",
+                "L",
+                "Z",
+                "V",
+                "P",
+                "Q",
+                "K",
+                "K"
+            ],
+            [
+                "N",
+                "E",
+                "Y",
+                "F",
+                "W",
+                "B",
+                "K",
+                "Z",
+                "Z",
+                "N",
+                "K",
+                "B"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                6,
+                0
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_081_TELEPHONE_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_081_TELEPHONE_result.jpg",
+        "source_image": "Part4/word_no_start/task_081_TELEPHONE_input.jpg",
+        "save_id": 2765,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2765.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_083",
+        "mode": "global_search",
+        "target_word": "ADVENTURE",
+        "prompt_en": "Find the word 'ADVENTURE'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'ADVENTURE' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "V",
+                "I",
+                "D",
+                "S",
+                "S",
+                "K",
+                "X",
+                "H",
+                "D",
+                "Q",
+                "H",
+                "L",
+                "O"
+            ],
+            [
+                "V",
+                "N",
+                "V",
+                "H",
+                "P",
+                "W",
+                "X",
+                "K",
+                "G",
+                "R",
+                "K",
+                "R",
+                "U"
+            ],
+            [
+                "J",
+                "I",
+                "E",
+                "W",
+                "M",
+                "I",
+                "U",
+                "Q",
+                "K",
+                "H",
+                "T",
+                "J",
+                "A"
+            ],
+            [
+                "O",
+                "A",
+                "R",
+                "S",
+                "A",
+                "A",
+                "D",
+                "Q",
+                "C",
+                "R",
+                "F",
+                "H",
+                "D"
+            ],
+            [
+                "D",
+                "G",
+                "N",
+                "Z",
+                "A",
+                "C",
+                "I",
+                "U",
+                "F",
+                "Y",
+                "H",
+                "Z",
+                "V"
+            ],
+            [
+                "Y",
+                "N",
+                "A",
+                "J",
+                "T",
+                "C",
+                "V",
+                "A",
+                "O",
+                "D",
+                "P",
+                "N",
+                "E"
+            ],
+            [
+                "A",
+                "H",
+                "M",
+                "Y",
+                "C",
+                "V",
+                "A",
+                "H",
+                "R",
+                "P",
+                "H",
+                "N",
+                "N"
+            ],
+            [
+                "Y",
+                "R",
+                "R",
+                "Z",
+                "Y",
+                "G",
+                "D",
+                "T",
+                "J",
+                "F",
+                "Q",
+                "E",
+                "T"
+            ],
+            [
+                "E",
+                "R",
+                "Q",
+                "P",
+                "F",
+                "U",
+                "W",
+                "G",
+                "P",
+                "R",
+                "M",
+                "W",
+                "U"
+            ],
+            [
+                "O",
+                "A",
+                "V",
+                "J",
+                "U",
+                "Z",
+                "D",
+                "U",
+                "P",
+                "E",
+                "O",
+                "Q",
+                "R"
+            ],
+            [
+                "Q",
+                "I",
+                "U",
+                "W",
+                "F",
+                "Y",
+                "D",
+                "U",
+                "H",
+                "O",
+                "L",
+                "C",
+                "E"
+            ],
+            [
+                "I",
+                "Z",
+                "A",
+                "G",
+                "Q",
+                "O",
+                "C",
+                "K",
+                "F",
+                "J",
+                "X",
+                "D",
+                "Q"
+            ],
+            [
+                "A",
+                "N",
+                "G",
+                "L",
+                "B",
+                "Y",
+                "T",
+                "V",
+                "K",
+                "X",
+                "M",
+                "T",
+                "Y"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                12
+            ],
+            [
+                3,
+                12
+            ],
+            [
+                4,
+                12
+            ],
+            [
+                5,
+                12
+            ],
+            [
+                6,
+                12
+            ],
+            [
+                7,
+                12
+            ],
+            [
+                8,
+                12
+            ],
+            [
+                9,
+                12
+            ],
+            [
+                10,
+                12
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_083_ADVENTURE_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_083_ADVENTURE_result.jpg",
+        "source_image": "Part4/word_no_start/task_083_ADVENTURE_input.jpg",
+        "save_id": 2767,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2767.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_085",
+        "mode": "global_search",
+        "target_word": "VACATION",
+        "prompt_en": "Find the word 'VACATION'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'VACATION' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "J",
+                "W",
+                "S",
+                "S",
+                "R",
+                "E",
+                "X",
+                "H",
+                "W"
+            ],
+            [
+                "Y",
+                "P",
+                "U",
+                "V",
+                "D",
+                "B",
+                "O",
+                "F",
+                "G"
+            ],
+            [
+                "F",
+                "V",
+                "H",
+                "R",
+                "R",
+                "U",
+                "O",
+                "C",
+                "I"
+            ],
+            [
+                "B",
+                "S",
+                "J",
+                "L",
+                "E",
+                "T",
+                "V",
+                "G",
+                "D"
+            ],
+            [
+                "G",
+                "F",
+                "E",
+                "A",
+                "P",
+                "L",
+                "A",
+                "R",
+                "F"
+            ],
+            [
+                "F",
+                "W",
+                "P",
+                "S",
+                "S",
+                "O",
+                "C",
+                "U",
+                "R"
+            ],
+            [
+                "I",
+                "J",
+                "I",
+                "A",
+                "A",
+                "E",
+                "A",
+                "J",
+                "P"
+            ],
+            [
+                "V",
+                "M",
+                "R",
+                "V",
+                "S",
+                "Q",
+                "T",
+                "I",
+                "O"
+            ],
+            [
+                "S",
+                "S",
+                "Z",
+                "H",
+                "B",
+                "I",
+                "T",
+                "W",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                8,
+                8
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_085_VACATION_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_085_VACATION_result.jpg",
+        "source_image": "Part4/word_no_start/task_085_VACATION_input.jpg",
+        "save_id": 2769,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2769.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_087",
+        "mode": "global_search",
+        "target_word": "ASTRONAUT",
+        "prompt_en": "Find the word 'ASTRONAUT'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'ASTRONAUT' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "L",
+                "N",
+                "O",
+                "F",
+                "A",
+                "J",
+                "B",
+                "Z",
+                "I",
+                "Y",
+                "U",
+                "B",
+                "G"
+            ],
+            [
+                "U",
+                "G",
+                "R",
+                "S",
+                "Z",
+                "R",
+                "J",
+                "W",
+                "M",
+                "A",
+                "S",
+                "T",
+                "R"
+            ],
+            [
+                "R",
+                "Y",
+                "L",
+                "B",
+                "K",
+                "J",
+                "Z",
+                "C",
+                "A",
+                "T",
+                "V",
+                "M",
+                "O"
+            ],
+            [
+                "N",
+                "R",
+                "Q",
+                "T",
+                "N",
+                "D",
+                "N",
+                "U",
+                "F",
+                "V",
+                "C",
+                "X",
+                "N"
+            ],
+            [
+                "B",
+                "S",
+                "S",
+                "N",
+                "F",
+                "Q",
+                "K",
+                "Q",
+                "E",
+                "Z",
+                "B",
+                "C",
+                "A"
+            ],
+            [
+                "A",
+                "G",
+                "Y",
+                "Z",
+                "A",
+                "T",
+                "C",
+                "M",
+                "R",
+                "N",
+                "S",
+                "B",
+                "U"
+            ],
+            [
+                "I",
+                "Y",
+                "T",
+                "G",
+                "U",
+                "B",
+                "A",
+                "P",
+                "E",
+                "K",
+                "Z",
+                "Y",
+                "T"
+            ],
+            [
+                "W",
+                "I",
+                "H",
+                "L",
+                "A",
+                "E",
+                "L",
+                "K",
+                "Y",
+                "L",
+                "Q",
+                "R",
+                "Q"
+            ],
+            [
+                "F",
+                "S",
+                "A",
+                "Z",
+                "Y",
+                "N",
+                "Z",
+                "L",
+                "Z",
+                "Y",
+                "L",
+                "B",
+                "E"
+            ],
+            [
+                "C",
+                "F",
+                "F",
+                "T",
+                "A",
+                "J",
+                "R",
+                "U",
+                "V",
+                "E",
+                "S",
+                "Y",
+                "B"
+            ],
+            [
+                "A",
+                "Z",
+                "A",
+                "Q",
+                "M",
+                "E",
+                "R",
+                "C",
+                "L",
+                "I",
+                "F",
+                "R",
+                "O"
+            ],
+            [
+                "S",
+                "F",
+                "K",
+                "B",
+                "E",
+                "K",
+                "J",
+                "J",
+                "H",
+                "T",
+                "W",
+                "Q",
+                "U"
+            ],
+            [
+                "W",
+                "I",
+                "N",
+                "A",
+                "H",
+                "M",
+                "P",
+                "K",
+                "V",
+                "Y",
+                "K",
+                "C",
+                "M"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                9
+            ],
+            [
+                1,
+                10
+            ],
+            [
+                1,
+                11
+            ],
+            [
+                1,
+                12
+            ],
+            [
+                2,
+                12
+            ],
+            [
+                3,
+                12
+            ],
+            [
+                4,
+                12
+            ],
+            [
+                5,
+                12
+            ],
+            [
+                6,
+                12
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_087_ASTRONAUT_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_087_ASTRONAUT_result.jpg",
+        "source_image": "Part4/word_no_start/task_087_ASTRONAUT_input.jpg",
+        "save_id": 2771,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2771.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_089",
+        "mode": "global_search",
+        "target_word": "PINEAPPLE",
+        "prompt_en": "Find the word 'PINEAPPLE'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'PINEAPPLE' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "T",
+                "S",
+                "T",
+                "S",
+                "I",
+                "V",
+                "K",
+                "T",
+                "R",
+                "T"
+            ],
+            [
+                "U",
+                "Y",
+                "H",
+                "F",
+                "L",
+                "J",
+                "Q",
+                "P",
+                "A",
+                "F"
+            ],
+            [
+                "T",
+                "V",
+                "V",
+                "M",
+                "Q",
+                "R",
+                "N",
+                "R",
+                "E",
+                "W"
+            ],
+            [
+                "C",
+                "K",
+                "Y",
+                "B",
+                "J",
+                "N",
+                "B",
+                "A",
+                "S",
+                "L"
+            ],
+            [
+                "V",
+                "B",
+                "H",
+                "W",
+                "Z",
+                "D",
+                "X",
+                "G",
+                "H",
+                "J"
+            ],
+            [
+                "N",
+                "U",
+                "P",
+                "D",
+                "Y",
+                "N",
+                "H",
+                "L",
+                "N",
+                "F"
+            ],
+            [
+                "E",
+                "E",
+                "U",
+                "J",
+                "P",
+                "I",
+                "N",
+                "E",
+                "A",
+                "P"
+            ],
+            [
+                "S",
+                "V",
+                "F",
+                "D",
+                "I",
+                "S",
+                "Z",
+                "V",
+                "B",
+                "P"
+            ],
+            [
+                "P",
+                "Y",
+                "T",
+                "E",
+                "C",
+                "G",
+                "E",
+                "C",
+                "R",
+                "L"
+            ],
+            [
+                "U",
+                "H",
+                "O",
+                "S",
+                "V",
+                "E",
+                "C",
+                "N",
+                "W",
+                "E"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_089_PINEAPPLE_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_089_PINEAPPLE_result.jpg",
+        "source_image": "Part4/word_no_start/task_089_PINEAPPLE_input.jpg",
+        "save_id": 2773,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2773.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_091",
+        "mode": "global_search",
+        "target_word": "CHEMISTRY",
+        "prompt_en": "Find the word 'CHEMISTRY'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'CHEMISTRY' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "Y",
+                "D",
+                "N",
+                "A",
+                "H",
+                "J",
+                "X",
+                "F",
+                "Z",
+                "V",
+                "O",
+                "S",
+                "Q"
+            ],
+            [
+                "F",
+                "G",
+                "X",
+                "J",
+                "G",
+                "Z",
+                "W",
+                "O",
+                "G",
+                "M",
+                "Q",
+                "Z",
+                "X"
+            ],
+            [
+                "W",
+                "S",
+                "J",
+                "U",
+                "Y",
+                "G",
+                "E",
+                "H",
+                "W",
+                "C",
+                "N",
+                "U",
+                "V"
+            ],
+            [
+                "C",
+                "K",
+                "B",
+                "N",
+                "V",
+                "Y",
+                "U",
+                "C",
+                "G",
+                "I",
+                "G",
+                "Y",
+                "C"
+            ],
+            [
+                "I",
+                "H",
+                "B",
+                "L",
+                "J",
+                "Y",
+                "M",
+                "I",
+                "A",
+                "O",
+                "M",
+                "S",
+                "H"
+            ],
+            [
+                "U",
+                "X",
+                "J",
+                "X",
+                "X",
+                "T",
+                "W",
+                "X",
+                "R",
+                "G",
+                "C",
+                "Y",
+                "H"
+            ],
+            [
+                "U",
+                "S",
+                "A",
+                "W",
+                "E",
+                "N",
+                "C",
+                "X",
+                "T",
+                "N",
+                "A",
+                "Y",
+                "I"
+            ],
+            [
+                "Y",
+                "S",
+                "H",
+                "N",
+                "Q",
+                "I",
+                "L",
+                "A",
+                "H",
+                "Z",
+                "D",
+                "F",
+                "C"
+            ],
+            [
+                "K",
+                "N",
+                "G",
+                "S",
+                "U",
+                "K",
+                "L",
+                "Q",
+                "Z",
+                "Y",
+                "U",
+                "T",
+                "N"
+            ],
+            [
+                "E",
+                "N",
+                "I",
+                "Q",
+                "W",
+                "V",
+                "H",
+                "C",
+                "I",
+                "B",
+                "L",
+                "W",
+                "G"
+            ],
+            [
+                "C",
+                "G",
+                "A",
+                "C",
+                "Q",
+                "V",
+                "K",
+                "G",
+                "S",
+                "B",
+                "H",
+                "F",
+                "U"
+            ],
+            [
+                "H",
+                "E",
+                "K",
+                "A",
+                "T",
+                "Z",
+                "X",
+                "K",
+                "D",
+                "E",
+                "R",
+                "O",
+                "Y"
+            ],
+            [
+                "G",
+                "M",
+                "I",
+                "S",
+                "T",
+                "R",
+                "Y",
+                "Q",
+                "O",
+                "J",
+                "Q",
+                "Z",
+                "L"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                10,
+                0
+            ],
+            [
+                11,
+                0
+            ],
+            [
+                11,
+                1
+            ],
+            [
+                12,
+                1
+            ],
+            [
+                12,
+                2
+            ],
+            [
+                12,
+                3
+            ],
+            [
+                12,
+                4
+            ],
+            [
+                12,
+                5
+            ],
+            [
+                12,
+                6
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_091_CHEMISTRY_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_091_CHEMISTRY_result.jpg",
+        "source_image": "Part4/word_no_start/task_091_CHEMISTRY_input.jpg",
+        "save_id": 2775,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2775.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_093",
+        "mode": "global_search",
+        "target_word": "LANGUAGE",
+        "prompt_en": "Find the word 'LANGUAGE'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'LANGUAGE' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "G",
+                "X",
+                "P",
+                "D",
+                "K",
+                "C",
+                "B",
+                "E",
+                "S",
+                "I",
+                "W"
+            ],
+            [
+                "U",
+                "P",
+                "C",
+                "Q",
+                "L",
+                "A",
+                "U",
+                "B",
+                "Z",
+                "S",
+                "A"
+            ],
+            [
+                "X",
+                "R",
+                "Q",
+                "R",
+                "H",
+                "N",
+                "G",
+                "U",
+                "A",
+                "G",
+                "M"
+            ],
+            [
+                "L",
+                "M",
+                "E",
+                "F",
+                "A",
+                "T",
+                "M",
+                "O",
+                "K",
+                "E",
+                "J"
+            ],
+            [
+                "Z",
+                "A",
+                "M",
+                "D",
+                "I",
+                "J",
+                "N",
+                "W",
+                "R",
+                "Z",
+                "Z"
+            ],
+            [
+                "P",
+                "Q",
+                "K",
+                "Q",
+                "C",
+                "N",
+                "H",
+                "K",
+                "H",
+                "U",
+                "B"
+            ],
+            [
+                "O",
+                "K",
+                "L",
+                "P",
+                "T",
+                "D",
+                "W",
+                "L",
+                "J",
+                "I",
+                "J"
+            ],
+            [
+                "J",
+                "A",
+                "A",
+                "U",
+                "Y",
+                "M",
+                "E",
+                "G",
+                "V",
+                "J",
+                "Y"
+            ],
+            [
+                "Z",
+                "I",
+                "J",
+                "G",
+                "H",
+                "M",
+                "P",
+                "Y",
+                "A",
+                "I",
+                "G"
+            ],
+            [
+                "A",
+                "M",
+                "J",
+                "K",
+                "A",
+                "G",
+                "O",
+                "U",
+                "S",
+                "T",
+                "W"
+            ],
+            [
+                "V",
+                "F",
+                "X",
+                "R",
+                "M",
+                "T",
+                "U",
+                "L",
+                "D",
+                "H",
+                "D"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                2,
+                9
+            ],
+            [
+                3,
+                9
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_093_LANGUAGE_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_093_LANGUAGE_result.jpg",
+        "source_image": "Part4/word_no_start/task_093_LANGUAGE_input.jpg",
+        "save_id": 2777,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2777.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_095",
+        "mode": "global_search",
+        "target_word": "GEOGRAPHY",
+        "prompt_en": "Find the word 'GEOGRAPHY'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'GEOGRAPHY' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "S",
+                "Y",
+                "T",
+                "E",
+                "C",
+                "P",
+                "J",
+                "I",
+                "G",
+                "E"
+            ],
+            [
+                "Q",
+                "S",
+                "R",
+                "I",
+                "Q",
+                "D",
+                "I",
+                "Y",
+                "J",
+                "O"
+            ],
+            [
+                "B",
+                "N",
+                "V",
+                "W",
+                "T",
+                "E",
+                "S",
+                "R",
+                "T",
+                "G"
+            ],
+            [
+                "E",
+                "O",
+                "I",
+                "S",
+                "A",
+                "O",
+                "K",
+                "S",
+                "B",
+                "R"
+            ],
+            [
+                "F",
+                "Q",
+                "Z",
+                "G",
+                "S",
+                "B",
+                "Q",
+                "N",
+                "G",
+                "A"
+            ],
+            [
+                "P",
+                "M",
+                "O",
+                "H",
+                "V",
+                "K",
+                "F",
+                "O",
+                "S",
+                "P"
+            ],
+            [
+                "N",
+                "U",
+                "I",
+                "Y",
+                "F",
+                "R",
+                "L",
+                "E",
+                "A",
+                "H"
+            ],
+            [
+                "U",
+                "A",
+                "G",
+                "E",
+                "P",
+                "A",
+                "Q",
+                "H",
+                "P",
+                "Y"
+            ],
+            [
+                "A",
+                "A",
+                "J",
+                "N",
+                "E",
+                "J",
+                "L",
+                "L",
+                "A",
+                "J"
+            ],
+            [
+                "S",
+                "J",
+                "H",
+                "R",
+                "W",
+                "Z",
+                "I",
+                "G",
+                "P",
+                "O"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                8
+            ],
+            [
+                0,
+                9
+            ],
+            [
+                1,
+                9
+            ],
+            [
+                2,
+                9
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_095_GEOGRAPHY_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_095_GEOGRAPHY_result.jpg",
+        "source_image": "Part4/word_no_start/task_095_GEOGRAPHY_input.jpg",
+        "save_id": 2779,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2779.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_097",
+        "mode": "global_search",
+        "target_word": "PHYSICS",
+        "prompt_en": "Find the word 'PHYSICS'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'PHYSICS' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "H",
+                "N",
+                "M",
+                "W",
+                "C",
+                "G",
+                "L",
+                "P",
+                "B"
+            ],
+            [
+                "B",
+                "A",
+                "X",
+                "C",
+                "W",
+                "E",
+                "A",
+                "H",
+                "N"
+            ],
+            [
+                "M",
+                "Z",
+                "G",
+                "P",
+                "J",
+                "T",
+                "I",
+                "Y",
+                "D"
+            ],
+            [
+                "Y",
+                "R",
+                "D",
+                "G",
+                "W",
+                "Z",
+                "A",
+                "S",
+                "D"
+            ],
+            [
+                "R",
+                "G",
+                "O",
+                "J",
+                "Q",
+                "D",
+                "M",
+                "I",
+                "C"
+            ],
+            [
+                "J",
+                "G",
+                "B",
+                "U",
+                "P",
+                "C",
+                "H",
+                "U",
+                "S"
+            ],
+            [
+                "R",
+                "U",
+                "M",
+                "L",
+                "Z",
+                "V",
+                "S",
+                "J",
+                "X"
+            ],
+            [
+                "O",
+                "O",
+                "X",
+                "F",
+                "B",
+                "C",
+                "I",
+                "F",
+                "G"
+            ],
+            [
+                "U",
+                "S",
+                "E",
+                "I",
+                "Q",
+                "O",
+                "O",
+                "P",
+                "S"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                7
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                5,
+                8
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_097_PHYSICS_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_097_PHYSICS_result.jpg",
+        "source_image": "Part4/word_no_start/task_097_PHYSICS_input.jpg",
+        "save_id": 2781,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2781.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_099",
+        "mode": "global_search",
+        "target_word": "BREAKFAST",
+        "prompt_en": "Find the word 'BREAKFAST'. Highlight its characters in red. Note: The word flows only Down or Right.",
+        "prompt_cn": "找到单词 'BREAKFAST' 并将其字符高亮为红色。注意：单词流向仅限向下或向右。",
+        "grid_layout": [
+            [
+                "Q",
+                "D",
+                "K",
+                "K",
+                "U",
+                "A",
+                "G",
+                "Q",
+                "Q",
+                "T"
+            ],
+            [
+                "G",
+                "L",
+                "H",
+                "K",
+                "K",
+                "O",
+                "T",
+                "V",
+                "C",
+                "Q"
+            ],
+            [
+                "M",
+                "W",
+                "H",
+                "W",
+                "P",
+                "E",
+                "S",
+                "V",
+                "M",
+                "M"
+            ],
+            [
+                "K",
+                "I",
+                "I",
+                "X",
+                "P",
+                "A",
+                "S",
+                "U",
+                "U",
+                "C"
+            ],
+            [
+                "N",
+                "I",
+                "M",
+                "L",
+                "V",
+                "E",
+                "A",
+                "H",
+                "L",
+                "S"
+            ],
+            [
+                "Q",
+                "F",
+                "A",
+                "H",
+                "X",
+                "W",
+                "T",
+                "K",
+                "R",
+                "A"
+            ],
+            [
+                "J",
+                "Z",
+                "B",
+                "N",
+                "H",
+                "Z",
+                "Q",
+                "E",
+                "R",
+                "K"
+            ],
+            [
+                "Y",
+                "Z",
+                "C",
+                "F",
+                "O",
+                "S",
+                "X",
+                "N",
+                "Q",
+                "R"
+            ],
+            [
+                "S",
+                "U",
+                "B",
+                "R",
+                "E",
+                "P",
+                "X",
+                "N",
+                "C",
+                "L"
+            ],
+            [
+                "M",
+                "F",
+                "U",
+                "Y",
+                "A",
+                "K",
+                "F",
+                "A",
+                "S",
+                "T"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                9,
+                6
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                9,
+                9
+            ]
+        ],
+        "input_image": "dataset_final_word_no_arrows/task_099_BREAKFAST_input.jpg",
+        "result_image": "dataset_final_word_no_arrows/task_099_BREAKFAST_result.jpg",
+        "source_image": "Part4/word_no_start/task_099_BREAKFAST_input.jpg",
+        "save_id": 2783,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_No_Start/2783.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/Find_Word_With_Start.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/Find_Word_With_Start.json
new file mode 100644
index 0000000000000000000000000000000000000000..1b1f256c7ffbe0d83218ed31c36d484ce9c8ca2c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/Find_Word_With_Start.json
@@ -0,0 +1,7127 @@
+[
+    {
+        "id": "task_001",
+        "mode": "fixed_start",
+        "target_word": "DOG",
+        "prompt_en": "Complete the red path for the word 'DOG' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'DOG' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "U",
+                "V",
+                "G",
+                "D",
+                "N",
+                "S",
+                "P"
+            ],
+            [
+                "C",
+                "G",
+                "S",
+                "T",
+                "X",
+                "P",
+                "H"
+            ],
+            [
+                "R",
+                "F",
+                "I",
+                "F",
+                "V",
+                "F",
+                "B"
+            ],
+            [
+                "Z",
+                "D",
+                "N",
+                "Y",
+                "C",
+                "U",
+                "F"
+            ],
+            [
+                "Q",
+                "O",
+                "G",
+                "Q",
+                "V",
+                "B",
+                "Q"
+            ],
+            [
+                "Y",
+                "B",
+                "Z",
+                "P",
+                "D",
+                "I",
+                "O"
+            ],
+            [
+                "P",
+                "L",
+                "W",
+                "F",
+                "G",
+                "Z",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                1
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                2
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_001_DOG_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_001_DOG_result.jpg",
+        "source_image": "Part4/word_with_start/task_001_DOG_input.jpg",
+        "save_id": 2785,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2785.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_003",
+        "mode": "fixed_start",
+        "target_word": "MAP",
+        "prompt_en": "Complete the red path for the word 'MAP' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'MAP' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "W",
+                "I",
+                "L",
+                "Q",
+                "V"
+            ],
+            [
+                "A",
+                "Y",
+                "D",
+                "S",
+                "Z"
+            ],
+            [
+                "L",
+                "W",
+                "I",
+                "Y",
+                "A"
+            ],
+            [
+                "D",
+                "V",
+                "I",
+                "V",
+                "Q"
+            ],
+            [
+                "T",
+                "M",
+                "A",
+                "P",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_003_MAP_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_003_MAP_result.jpg",
+        "source_image": "Part4/word_with_start/task_003_MAP_input.jpg",
+        "save_id": 2787,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2787.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_005",
+        "mode": "fixed_start",
+        "target_word": "BOX",
+        "prompt_en": "Complete the red path for the word 'BOX' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'BOX' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "B",
+                "I",
+                "U",
+                "N",
+                "F"
+            ],
+            [
+                "J",
+                "E",
+                "O",
+                "G",
+                "E"
+            ],
+            [
+                "G",
+                "S",
+                "D",
+                "U",
+                "K"
+            ],
+            [
+                "B",
+                "O",
+                "X",
+                "Z",
+                "Q"
+            ],
+            [
+                "G",
+                "W",
+                "J",
+                "K",
+                "I"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                0
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                3,
+                2
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_005_BOX_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_005_BOX_result.jpg",
+        "source_image": "Part4/word_with_start/task_005_BOX_input.jpg",
+        "save_id": 2789,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2789.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_007",
+        "mode": "fixed_start",
+        "target_word": "EYE",
+        "prompt_en": "Complete the red path for the word 'EYE' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'EYE' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "M",
+                "B",
+                "X",
+                "L",
+                "N"
+            ],
+            [
+                "P",
+                "Q",
+                "B",
+                "M",
+                "X"
+            ],
+            [
+                "A",
+                "V",
+                "C",
+                "Y",
+                "Q"
+            ],
+            [
+                "L",
+                "F",
+                "Z",
+                "E",
+                "Y"
+            ],
+            [
+                "V",
+                "P",
+                "U",
+                "P",
+                "E"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_007_EYE_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_007_EYE_result.jpg",
+        "source_image": "Part4/word_with_start/task_007_EYE_input.jpg",
+        "save_id": 2791,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2791.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_009",
+        "mode": "fixed_start",
+        "target_word": "TEA",
+        "prompt_en": "Complete the red path for the word 'TEA' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'TEA' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "S",
+                "Q",
+                "L",
+                "J",
+                "V",
+                "W"
+            ],
+            [
+                "F",
+                "Z",
+                "J",
+                "S",
+                "Q",
+                "G"
+            ],
+            [
+                "U",
+                "N",
+                "C",
+                "I",
+                "U",
+                "E"
+            ],
+            [
+                "T",
+                "E",
+                "A",
+                "Z",
+                "K",
+                "W"
+            ],
+            [
+                "Q",
+                "Z",
+                "X",
+                "B",
+                "B",
+                "D"
+            ],
+            [
+                "O",
+                "S",
+                "V",
+                "W",
+                "G",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                0
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                3,
+                2
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_009_TEA_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_009_TEA_result.jpg",
+        "source_image": "Part4/word_with_start/task_009_TEA_input.jpg",
+        "save_id": 2793,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2793.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_011",
+        "mode": "fixed_start",
+        "target_word": "FISH",
+        "prompt_en": "Complete the red path for the word 'FISH' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'FISH' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "R",
+                "E",
+                "K",
+                "M",
+                "X",
+                "R",
+                "X"
+            ],
+            [
+                "M",
+                "J",
+                "Y",
+                "Y",
+                "E",
+                "Y",
+                "F"
+            ],
+            [
+                "U",
+                "H",
+                "S",
+                "R",
+                "T",
+                "A",
+                "R"
+            ],
+            [
+                "V",
+                "V",
+                "N",
+                "H",
+                "G",
+                "S",
+                "S"
+            ],
+            [
+                "H",
+                "F",
+                "I",
+                "S",
+                "H",
+                "X",
+                "K"
+            ],
+            [
+                "S",
+                "Z",
+                "Z",
+                "S",
+                "Q",
+                "J",
+                "A"
+            ],
+            [
+                "L",
+                "H",
+                "P",
+                "W",
+                "S",
+                "J",
+                "Y"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_011_FISH_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_011_FISH_result.jpg",
+        "source_image": "Part4/word_with_start/task_011_FISH_input.jpg",
+        "save_id": 2795,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2795.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_013",
+        "mode": "fixed_start",
+        "target_word": "MILK",
+        "prompt_en": "Complete the red path for the word 'MILK' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'MILK' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "D",
+                "S",
+                "B",
+                "I",
+                "W",
+                "I",
+                "E",
+                "K"
+            ],
+            [
+                "U",
+                "E",
+                "J",
+                "K",
+                "V",
+                "G",
+                "D",
+                "P"
+            ],
+            [
+                "V",
+                "L",
+                "D",
+                "O",
+                "C",
+                "C",
+                "W",
+                "C"
+            ],
+            [
+                "C",
+                "I",
+                "S",
+                "E",
+                "H",
+                "G",
+                "E",
+                "V"
+            ],
+            [
+                "Y",
+                "E",
+                "N",
+                "A",
+                "Q",
+                "L",
+                "P",
+                "Y"
+            ],
+            [
+                "Z",
+                "W",
+                "S",
+                "E",
+                "W",
+                "F",
+                "J",
+                "N"
+            ],
+            [
+                "Z",
+                "D",
+                "M",
+                "O",
+                "V",
+                "W",
+                "T",
+                "X"
+            ],
+            [
+                "O",
+                "D",
+                "I",
+                "L",
+                "K",
+                "J",
+                "J",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                6,
+                2
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                7,
+                4
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_013_MILK_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_013_MILK_result.jpg",
+        "source_image": "Part4/word_with_start/task_013_MILK_input.jpg",
+        "save_id": 2797,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2797.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_015",
+        "mode": "fixed_start",
+        "target_word": "DUCK",
+        "prompt_en": "Complete the red path for the word 'DUCK' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'DUCK' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "A",
+                "L",
+                "K",
+                "F",
+                "Y",
+                "H",
+                "R"
+            ],
+            [
+                "P",
+                "V",
+                "Z",
+                "K",
+                "V",
+                "E",
+                "E"
+            ],
+            [
+                "D",
+                "R",
+                "P",
+                "I",
+                "K",
+                "W",
+                "N"
+            ],
+            [
+                "U",
+                "C",
+                "K",
+                "Z",
+                "B",
+                "X",
+                "R"
+            ],
+            [
+                "G",
+                "S",
+                "Q",
+                "E",
+                "T",
+                "S",
+                "N"
+            ],
+            [
+                "D",
+                "P",
+                "A",
+                "A",
+                "Q",
+                "V",
+                "X"
+            ],
+            [
+                "G",
+                "L",
+                "N",
+                "P",
+                "U",
+                "O",
+                "D"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                0
+            ],
+            [
+                3,
+                0
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                3,
+                2
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_015_DUCK_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_015_DUCK_result.jpg",
+        "source_image": "Part4/word_with_start/task_015_DUCK_input.jpg",
+        "save_id": 2799,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2799.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_017",
+        "mode": "fixed_start",
+        "target_word": "GOAT",
+        "prompt_en": "Complete the red path for the word 'GOAT' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'GOAT' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "T",
+                "L",
+                "T",
+                "Q",
+                "V",
+                "O",
+                "E",
+                "H"
+            ],
+            [
+                "S",
+                "Z",
+                "R",
+                "N",
+                "E",
+                "S",
+                "X",
+                "Y"
+            ],
+            [
+                "M",
+                "T",
+                "X",
+                "Z",
+                "U",
+                "H",
+                "A",
+                "Y"
+            ],
+            [
+                "N",
+                "G",
+                "Q",
+                "O",
+                "W",
+                "B",
+                "B",
+                "U"
+            ],
+            [
+                "G",
+                "K",
+                "G",
+                "T",
+                "Z",
+                "Z",
+                "Y",
+                "X"
+            ],
+            [
+                "O",
+                "I",
+                "O",
+                "T",
+                "E",
+                "K",
+                "J",
+                "O"
+            ],
+            [
+                "K",
+                "T",
+                "A",
+                "N",
+                "V",
+                "C",
+                "O",
+                "A"
+            ],
+            [
+                "K",
+                "V",
+                "T",
+                "Z",
+                "Q",
+                "L",
+                "V",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                7,
+                2
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_017_GOAT_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_017_GOAT_result.jpg",
+        "source_image": "Part4/word_with_start/task_017_GOAT_input.jpg",
+        "save_id": 2801,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2801.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_019",
+        "mode": "fixed_start",
+        "target_word": "CODE",
+        "prompt_en": "Complete the red path for the word 'CODE' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'CODE' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "G",
+                "D",
+                "Y",
+                "U",
+                "Y",
+                "D"
+            ],
+            [
+                "B",
+                "P",
+                "W",
+                "Y",
+                "S",
+                "C"
+            ],
+            [
+                "X",
+                "M",
+                "L",
+                "Z",
+                "R",
+                "O"
+            ],
+            [
+                "C",
+                "W",
+                "E",
+                "N",
+                "A",
+                "D"
+            ],
+            [
+                "T",
+                "V",
+                "L",
+                "L",
+                "O",
+                "E"
+            ],
+            [
+                "I",
+                "I",
+                "Y",
+                "Q",
+                "A",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_019_CODE_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_019_CODE_result.jpg",
+        "source_image": "Part4/word_with_start/task_019_CODE_input.jpg",
+        "save_id": 2803,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2803.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_021",
+        "mode": "fixed_start",
+        "target_word": "LIME",
+        "prompt_en": "Complete the red path for the word 'LIME' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'LIME' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "M",
+                "D",
+                "I",
+                "M",
+                "H",
+                "B"
+            ],
+            [
+                "Q",
+                "P",
+                "U",
+                "K",
+                "B",
+                "C"
+            ],
+            [
+                "L",
+                "H",
+                "Q",
+                "L",
+                "X",
+                "X"
+            ],
+            [
+                "N",
+                "V",
+                "L",
+                "N",
+                "I",
+                "S"
+            ],
+            [
+                "R",
+                "G",
+                "I",
+                "I",
+                "V",
+                "Z"
+            ],
+            [
+                "D",
+                "U",
+                "M",
+                "E",
+                "Q",
+                "C"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_021_LIME_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_021_LIME_result.jpg",
+        "source_image": "Part4/word_with_start/task_021_LIME_input.jpg",
+        "save_id": 2805,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2805.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_023",
+        "mode": "fixed_start",
+        "target_word": "BOAT",
+        "prompt_en": "Complete the red path for the word 'BOAT' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'BOAT' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "X",
+                "B",
+                "F",
+                "V",
+                "Z",
+                "E"
+            ],
+            [
+                "H",
+                "K",
+                "K",
+                "H",
+                "M",
+                "M"
+            ],
+            [
+                "D",
+                "Q",
+                "P",
+                "P",
+                "I",
+                "R"
+            ],
+            [
+                "Q",
+                "Z",
+                "J",
+                "B",
+                "Q",
+                "R"
+            ],
+            [
+                "R",
+                "R",
+                "R",
+                "O",
+                "A",
+                "J"
+            ],
+            [
+                "L",
+                "Q",
+                "E",
+                "W",
+                "T",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_023_BOAT_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_023_BOAT_result.jpg",
+        "source_image": "Part4/word_with_start/task_023_BOAT_input.jpg",
+        "save_id": 2807,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2807.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_025",
+        "mode": "fixed_start",
+        "target_word": "MOON",
+        "prompt_en": "Complete the red path for the word 'MOON' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'MOON' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "L",
+                "D",
+                "K",
+                "Q",
+                "Q",
+                "I",
+                "S"
+            ],
+            [
+                "T",
+                "U",
+                "T",
+                "M",
+                "P",
+                "J",
+                "P"
+            ],
+            [
+                "A",
+                "N",
+                "Y",
+                "M",
+                "M",
+                "Z",
+                "U"
+            ],
+            [
+                "Q",
+                "D",
+                "T",
+                "K",
+                "O",
+                "B",
+                "N"
+            ],
+            [
+                "T",
+                "H",
+                "P",
+                "D",
+                "O",
+                "U",
+                "E"
+            ],
+            [
+                "D",
+                "M",
+                "W",
+                "R",
+                "N",
+                "X",
+                "P"
+            ],
+            [
+                "R",
+                "E",
+                "L",
+                "Z",
+                "Z",
+                "V",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_025_MOON_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_025_MOON_result.jpg",
+        "source_image": "Part4/word_with_start/task_025_MOON_input.jpg",
+        "save_id": 2809,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2809.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_027",
+        "mode": "fixed_start",
+        "target_word": "WIND",
+        "prompt_en": "Complete the red path for the word 'WIND' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'WIND' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "W",
+                "W",
+                "I",
+                "O",
+                "A",
+                "D",
+                "U",
+                "B"
+            ],
+            [
+                "R",
+                "R",
+                "N",
+                "W",
+                "Y",
+                "L",
+                "X",
+                "B"
+            ],
+            [
+                "L",
+                "F",
+                "D",
+                "Q",
+                "A",
+                "I",
+                "K",
+                "M"
+            ],
+            [
+                "K",
+                "Z",
+                "J",
+                "Z",
+                "G",
+                "S",
+                "A",
+                "E"
+            ],
+            [
+                "J",
+                "Q",
+                "H",
+                "L",
+                "Z",
+                "X",
+                "T",
+                "S"
+            ],
+            [
+                "Y",
+                "K",
+                "O",
+                "N",
+                "J",
+                "Z",
+                "U",
+                "Q"
+            ],
+            [
+                "F",
+                "H",
+                "O",
+                "Y",
+                "F",
+                "Y",
+                "H",
+                "R"
+            ],
+            [
+                "C",
+                "A",
+                "W",
+                "H",
+                "S",
+                "E",
+                "T",
+                "T"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                1
+            ],
+            [
+                0,
+                2
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_027_WIND_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_027_WIND_result.jpg",
+        "source_image": "Part4/word_with_start/task_027_WIND_input.jpg",
+        "save_id": 2811,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2811.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_029",
+        "mode": "fixed_start",
+        "target_word": "SNOW",
+        "prompt_en": "Complete the red path for the word 'SNOW' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'SNOW' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "M",
+                "S",
+                "V",
+                "U",
+                "Y",
+                "A",
+                "T"
+            ],
+            [
+                "R",
+                "A",
+                "M",
+                "Q",
+                "M",
+                "U",
+                "U"
+            ],
+            [
+                "O",
+                "F",
+                "N",
+                "U",
+                "Z",
+                "A",
+                "H"
+            ],
+            [
+                "X",
+                "C",
+                "R",
+                "N",
+                "V",
+                "O",
+                "S"
+            ],
+            [
+                "G",
+                "G",
+                "B",
+                "C",
+                "N",
+                "O",
+                "N"
+            ],
+            [
+                "O",
+                "S",
+                "L",
+                "I",
+                "J",
+                "T",
+                "O"
+            ],
+            [
+                "I",
+                "J",
+                "H",
+                "I",
+                "N",
+                "H",
+                "W"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_029_SNOW_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_029_SNOW_result.jpg",
+        "source_image": "Part4/word_with_start/task_029_SNOW_input.jpg",
+        "save_id": 2813,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2813.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_031",
+        "mode": "fixed_start",
+        "target_word": "CORN",
+        "prompt_en": "Complete the red path for the word 'CORN' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'CORN' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "W",
+                "P",
+                "C",
+                "K",
+                "M",
+                "B",
+                "V",
+                "Z"
+            ],
+            [
+                "E",
+                "S",
+                "K",
+                "Q",
+                "M",
+                "E",
+                "C",
+                "O"
+            ],
+            [
+                "L",
+                "J",
+                "H",
+                "B",
+                "C",
+                "A",
+                "E",
+                "R"
+            ],
+            [
+                "P",
+                "E",
+                "S",
+                "O",
+                "Z",
+                "C",
+                "U",
+                "N"
+            ],
+            [
+                "Y",
+                "M",
+                "V",
+                "M",
+                "O",
+                "Z",
+                "M",
+                "X"
+            ],
+            [
+                "I",
+                "J",
+                "Q",
+                "R",
+                "V",
+                "U",
+                "J",
+                "Y"
+            ],
+            [
+                "Q",
+                "M",
+                "U",
+                "W",
+                "W",
+                "O",
+                "W",
+                "D"
+            ],
+            [
+                "Y",
+                "O",
+                "K",
+                "L",
+                "O",
+                "O",
+                "K",
+                "W"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                3,
+                7
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_031_CORN_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_031_CORN_result.jpg",
+        "source_image": "Part4/word_with_start/task_031_CORN_input.jpg",
+        "save_id": 2815,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2815.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_033",
+        "mode": "fixed_start",
+        "target_word": "SNAKE",
+        "prompt_en": "Complete the red path for the word 'SNAKE' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'SNAKE' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "O",
+                "B",
+                "K",
+                "D",
+                "Z",
+                "K",
+                "T",
+                "D",
+                "H"
+            ],
+            [
+                "U",
+                "R",
+                "Q",
+                "T",
+                "R",
+                "Z",
+                "W",
+                "P",
+                "T"
+            ],
+            [
+                "G",
+                "T",
+                "M",
+                "F",
+                "D",
+                "V",
+                "K",
+                "M",
+                "P"
+            ],
+            [
+                "A",
+                "X",
+                "Q",
+                "F",
+                "X",
+                "L",
+                "V",
+                "Y",
+                "K"
+            ],
+            [
+                "I",
+                "U",
+                "M",
+                "R",
+                "N",
+                "O",
+                "V",
+                "N",
+                "V"
+            ],
+            [
+                "V",
+                "O",
+                "A",
+                "B",
+                "H",
+                "X",
+                "D",
+                "M",
+                "H"
+            ],
+            [
+                "F",
+                "C",
+                "H",
+                "I",
+                "G",
+                "I",
+                "X",
+                "T",
+                "M"
+            ],
+            [
+                "C",
+                "J",
+                "Q",
+                "V",
+                "Y",
+                "L",
+                "W",
+                "A",
+                "W"
+            ],
+            [
+                "G",
+                "G",
+                "Y",
+                "S",
+                "N",
+                "A",
+                "K",
+                "E",
+                "Z"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_033_SNAKE_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_033_SNAKE_result.jpg",
+        "source_image": "Part4/word_with_start/task_033_SNAKE_input.jpg",
+        "save_id": 2817,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2817.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_035",
+        "mode": "fixed_start",
+        "target_word": "TIGER",
+        "prompt_en": "Complete the red path for the word 'TIGER' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'TIGER' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "L",
+                "U",
+                "R",
+                "I",
+                "I",
+                "Q",
+                "H",
+                "C"
+            ],
+            [
+                "U",
+                "O",
+                "T",
+                "L",
+                "V",
+                "H",
+                "L",
+                "L"
+            ],
+            [
+                "E",
+                "Y",
+                "T",
+                "F",
+                "G",
+                "A",
+                "O",
+                "X"
+            ],
+            [
+                "T",
+                "W",
+                "K",
+                "P",
+                "Y",
+                "O",
+                "G",
+                "B"
+            ],
+            [
+                "X",
+                "I",
+                "T",
+                "I",
+                "G",
+                "E",
+                "W",
+                "C"
+            ],
+            [
+                "S",
+                "A",
+                "N",
+                "W",
+                "X",
+                "R",
+                "J",
+                "N"
+            ],
+            [
+                "P",
+                "X",
+                "V",
+                "C",
+                "O",
+                "J",
+                "B",
+                "T"
+            ],
+            [
+                "T",
+                "C",
+                "V",
+                "S",
+                "M",
+                "Q",
+                "W",
+                "G"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_035_TIGER_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_035_TIGER_result.jpg",
+        "source_image": "Part4/word_with_start/task_035_TIGER_input.jpg",
+        "save_id": 2819,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2819.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_037",
+        "mode": "fixed_start",
+        "target_word": "PIZZA",
+        "prompt_en": "Complete the red path for the word 'PIZZA' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'PIZZA' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "O",
+                "M",
+                "M",
+                "D",
+                "A",
+                "L",
+                "G",
+                "N"
+            ],
+            [
+                "M",
+                "Y",
+                "U",
+                "H",
+                "G",
+                "O",
+                "K",
+                "D"
+            ],
+            [
+                "E",
+                "E",
+                "S",
+                "E",
+                "V",
+                "X",
+                "D",
+                "T"
+            ],
+            [
+                "Z",
+                "N",
+                "Z",
+                "J",
+                "R",
+                "T",
+                "M",
+                "Q"
+            ],
+            [
+                "S",
+                "C",
+                "R",
+                "N",
+                "W",
+                "U",
+                "F",
+                "W"
+            ],
+            [
+                "W",
+                "H",
+                "I",
+                "B",
+                "E",
+                "P",
+                "T",
+                "O"
+            ],
+            [
+                "N",
+                "L",
+                "R",
+                "B",
+                "L",
+                "I",
+                "A",
+                "H"
+            ],
+            [
+                "C",
+                "T",
+                "C",
+                "I",
+                "Y",
+                "Z",
+                "Z",
+                "A"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_037_PIZZA_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_037_PIZZA_result.jpg",
+        "source_image": "Part4/word_with_start/task_037_PIZZA_input.jpg",
+        "save_id": 2821,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2821.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_039",
+        "mode": "fixed_start",
+        "target_word": "MUSIC",
+        "prompt_en": "Complete the red path for the word 'MUSIC' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'MUSIC' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "B",
+                "U",
+                "Q",
+                "A",
+                "B",
+                "H",
+                "M",
+                "F"
+            ],
+            [
+                "W",
+                "R",
+                "H",
+                "N",
+                "H",
+                "C",
+                "U",
+                "K"
+            ],
+            [
+                "I",
+                "M",
+                "G",
+                "Z",
+                "L",
+                "P",
+                "S",
+                "I"
+            ],
+            [
+                "F",
+                "F",
+                "U",
+                "G",
+                "M",
+                "R",
+                "H",
+                "C"
+            ],
+            [
+                "C",
+                "B",
+                "C",
+                "E",
+                "G",
+                "U",
+                "Z",
+                "Q"
+            ],
+            [
+                "I",
+                "H",
+                "Y",
+                "J",
+                "V",
+                "C",
+                "N",
+                "J"
+            ],
+            [
+                "A",
+                "X",
+                "L",
+                "U",
+                "D",
+                "X",
+                "U",
+                "I"
+            ],
+            [
+                "V",
+                "Y",
+                "O",
+                "I",
+                "Z",
+                "L",
+                "Z",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                6
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                3,
+                7
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_039_MUSIC_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_039_MUSIC_result.jpg",
+        "source_image": "Part4/word_with_start/task_039_MUSIC_input.jpg",
+        "save_id": 2823,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2823.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_041",
+        "mode": "fixed_start",
+        "target_word": "MONKEY",
+        "prompt_en": "Complete the red path for the word 'MONKEY' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'MONKEY' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "N",
+                "I",
+                "M",
+                "X",
+                "N",
+                "W",
+                "E"
+            ],
+            [
+                "H",
+                "K",
+                "H",
+                "V",
+                "Q",
+                "H",
+                "K"
+            ],
+            [
+                "Q",
+                "T",
+                "A",
+                "Q",
+                "F",
+                "N",
+                "N"
+            ],
+            [
+                "Y",
+                "C",
+                "V",
+                "M",
+                "O",
+                "W",
+                "F"
+            ],
+            [
+                "R",
+                "D",
+                "R",
+                "G",
+                "N",
+                "Y",
+                "K"
+            ],
+            [
+                "P",
+                "F",
+                "M",
+                "C",
+                "K",
+                "O",
+                "A"
+            ],
+            [
+                "F",
+                "Q",
+                "J",
+                "F",
+                "E",
+                "Y",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_041_MONKEY_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_041_MONKEY_result.jpg",
+        "source_image": "Part4/word_with_start/task_041_MONKEY_input.jpg",
+        "save_id": 2825,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2825.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_043",
+        "mode": "fixed_start",
+        "target_word": "ORANGE",
+        "prompt_en": "Complete the red path for the word 'ORANGE' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'ORANGE' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "F",
+                "S",
+                "I",
+                "Y",
+                "Q",
+                "G",
+                "Z",
+                "Z",
+                "O"
+            ],
+            [
+                "W",
+                "D",
+                "S",
+                "D",
+                "O",
+                "C",
+                "T",
+                "J",
+                "T"
+            ],
+            [
+                "D",
+                "X",
+                "F",
+                "H",
+                "C",
+                "O",
+                "R",
+                "Q",
+                "I"
+            ],
+            [
+                "X",
+                "P",
+                "K",
+                "W",
+                "G",
+                "Z",
+                "A",
+                "X",
+                "Z"
+            ],
+            [
+                "F",
+                "M",
+                "C",
+                "O",
+                "V",
+                "W",
+                "N",
+                "G",
+                "O"
+            ],
+            [
+                "P",
+                "L",
+                "Y",
+                "F",
+                "G",
+                "J",
+                "C",
+                "E",
+                "Q"
+            ],
+            [
+                "S",
+                "C",
+                "S",
+                "N",
+                "F",
+                "W",
+                "B",
+                "X",
+                "L"
+            ],
+            [
+                "B",
+                "U",
+                "A",
+                "P",
+                "R",
+                "P",
+                "I",
+                "T",
+                "H"
+            ],
+            [
+                "Q",
+                "M",
+                "J",
+                "V",
+                "V",
+                "L",
+                "W",
+                "Q",
+                "A"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_043_ORANGE_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_043_ORANGE_result.jpg",
+        "source_image": "Part4/word_with_start/task_043_ORANGE_input.jpg",
+        "save_id": 2827,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2827.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_045",
+        "mode": "fixed_start",
+        "target_word": "DOCTOR",
+        "prompt_en": "Complete the red path for the word 'DOCTOR' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'DOCTOR' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "X",
+                "G",
+                "D",
+                "B",
+                "X",
+                "B",
+                "L",
+                "G"
+            ],
+            [
+                "V",
+                "D",
+                "O",
+                "C",
+                "E",
+                "X",
+                "U",
+                "I"
+            ],
+            [
+                "G",
+                "D",
+                "K",
+                "T",
+                "H",
+                "J",
+                "B",
+                "O"
+            ],
+            [
+                "Q",
+                "S",
+                "M",
+                "O",
+                "D",
+                "M",
+                "F",
+                "G"
+            ],
+            [
+                "X",
+                "S",
+                "T",
+                "R",
+                "J",
+                "P",
+                "J",
+                "M"
+            ],
+            [
+                "U",
+                "I",
+                "R",
+                "J",
+                "I",
+                "Y",
+                "L",
+                "R"
+            ],
+            [
+                "L",
+                "H",
+                "F",
+                "O",
+                "M",
+                "V",
+                "W",
+                "R"
+            ],
+            [
+                "E",
+                "S",
+                "E",
+                "A",
+                "H",
+                "Q",
+                "U",
+                "P"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_045_DOCTOR_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_045_DOCTOR_result.jpg",
+        "source_image": "Part4/word_with_start/task_045_DOCTOR_input.jpg",
+        "save_id": 2829,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2829.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_047",
+        "mode": "fixed_start",
+        "target_word": "FRIEND",
+        "prompt_en": "Complete the red path for the word 'FRIEND' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'FRIEND' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "J",
+                "R",
+                "B",
+                "R",
+                "J",
+                "D",
+                "W",
+                "C",
+                "J",
+                "J"
+            ],
+            [
+                "J",
+                "Q",
+                "Q",
+                "U",
+                "L",
+                "E",
+                "H",
+                "J",
+                "G",
+                "F"
+            ],
+            [
+                "F",
+                "P",
+                "W",
+                "N",
+                "W",
+                "U",
+                "R",
+                "L",
+                "E",
+                "R"
+            ],
+            [
+                "J",
+                "Z",
+                "S",
+                "W",
+                "X",
+                "H",
+                "H",
+                "N",
+                "D",
+                "I"
+            ],
+            [
+                "K",
+                "P",
+                "Z",
+                "Y",
+                "O",
+                "I",
+                "N",
+                "T",
+                "V",
+                "E"
+            ],
+            [
+                "I",
+                "N",
+                "Z",
+                "R",
+                "T",
+                "H",
+                "F",
+                "H",
+                "A",
+                "N"
+            ],
+            [
+                "Z",
+                "N",
+                "N",
+                "L",
+                "Q",
+                "Z",
+                "L",
+                "L",
+                "O",
+                "D"
+            ],
+            [
+                "C",
+                "N",
+                "F",
+                "C",
+                "C",
+                "H",
+                "I",
+                "K",
+                "S",
+                "Z"
+            ],
+            [
+                "Y",
+                "T",
+                "R",
+                "F",
+                "F",
+                "E",
+                "M",
+                "X",
+                "E",
+                "G"
+            ],
+            [
+                "W",
+                "S",
+                "M",
+                "E",
+                "W",
+                "C",
+                "D",
+                "T",
+                "G",
+                "Z"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                9
+            ],
+            [
+                2,
+                9
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                6,
+                9
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_047_FRIEND_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_047_FRIEND_result.jpg",
+        "source_image": "Part4/word_with_start/task_047_FRIEND_input.jpg",
+        "save_id": 2831,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2831.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_049",
+        "mode": "fixed_start",
+        "target_word": "PYTHON",
+        "prompt_en": "Complete the red path for the word 'PYTHON' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'PYTHON' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "R",
+                "C",
+                "G",
+                "X",
+                "F",
+                "R",
+                "P"
+            ],
+            [
+                "U",
+                "E",
+                "T",
+                "X",
+                "T",
+                "L",
+                "N"
+            ],
+            [
+                "G",
+                "E",
+                "I",
+                "S",
+                "P",
+                "Y",
+                "T"
+            ],
+            [
+                "B",
+                "A",
+                "W",
+                "E",
+                "K",
+                "H",
+                "H"
+            ],
+            [
+                "A",
+                "N",
+                "A",
+                "Z",
+                "U",
+                "G",
+                "O"
+            ],
+            [
+                "E",
+                "A",
+                "A",
+                "S",
+                "C",
+                "L",
+                "N"
+            ],
+            [
+                "U",
+                "S",
+                "K",
+                "M",
+                "S",
+                "I",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_049_PYTHON_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_049_PYTHON_result.jpg",
+        "source_image": "Part4/word_with_start/task_049_PYTHON_input.jpg",
+        "save_id": 2833,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2833.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_051",
+        "mode": "fixed_start",
+        "target_word": "GARDEN",
+        "prompt_en": "Complete the red path for the word 'GARDEN' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'GARDEN' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "N",
+                "X",
+                "Z",
+                "V",
+                "V",
+                "R",
+                "X",
+                "L",
+                "U",
+                "E"
+            ],
+            [
+                "I",
+                "E",
+                "G",
+                "I",
+                "O",
+                "P",
+                "G",
+                "C",
+                "N",
+                "D"
+            ],
+            [
+                "M",
+                "Y",
+                "Q",
+                "N",
+                "J",
+                "Q",
+                "J",
+                "J",
+                "E",
+                "G"
+            ],
+            [
+                "P",
+                "D",
+                "R",
+                "X",
+                "H",
+                "O",
+                "P",
+                "B",
+                "I",
+                "Q"
+            ],
+            [
+                "F",
+                "G",
+                "U",
+                "K",
+                "R",
+                "U",
+                "D",
+                "W",
+                "B",
+                "U"
+            ],
+            [
+                "R",
+                "J",
+                "A",
+                "Q",
+                "V",
+                "V",
+                "Y",
+                "C",
+                "N",
+                "A"
+            ],
+            [
+                "T",
+                "N",
+                "J",
+                "H",
+                "I",
+                "G",
+                "C",
+                "A",
+                "L",
+                "I"
+            ],
+            [
+                "C",
+                "M",
+                "O",
+                "G",
+                "H",
+                "R",
+                "B",
+                "A",
+                "P",
+                "D"
+            ],
+            [
+                "Q",
+                "L",
+                "D",
+                "U",
+                "A",
+                "M",
+                "Y",
+                "F",
+                "G",
+                "Q"
+            ],
+            [
+                "J",
+                "I",
+                "D",
+                "Q",
+                "G",
+                "A",
+                "R",
+                "D",
+                "E",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                9,
+                4
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                9,
+                6
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                9,
+                9
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_051_GARDEN_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_051_GARDEN_result.jpg",
+        "source_image": "Part4/word_with_start/task_051_GARDEN_input.jpg",
+        "save_id": 2835,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2835.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_053",
+        "mode": "fixed_start",
+        "target_word": "APPLE",
+        "prompt_en": "Complete the red path for the word 'APPLE' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'APPLE' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "D",
+                "O",
+                "M",
+                "B",
+                "A",
+                "P",
+                "R",
+                "G",
+                "H"
+            ],
+            [
+                "W",
+                "L",
+                "S",
+                "W",
+                "E",
+                "P",
+                "U",
+                "E",
+                "K"
+            ],
+            [
+                "A",
+                "O",
+                "M",
+                "B",
+                "P",
+                "L",
+                "E",
+                "J",
+                "J"
+            ],
+            [
+                "V",
+                "H",
+                "L",
+                "O",
+                "T",
+                "I",
+                "X",
+                "L",
+                "J"
+            ],
+            [
+                "R",
+                "Y",
+                "U",
+                "J",
+                "F",
+                "C",
+                "G",
+                "H",
+                "P"
+            ],
+            [
+                "C",
+                "R",
+                "M",
+                "S",
+                "R",
+                "K",
+                "F",
+                "E",
+                "B"
+            ],
+            [
+                "F",
+                "E",
+                "F",
+                "Q",
+                "R",
+                "Z",
+                "T",
+                "E",
+                "Y"
+            ],
+            [
+                "Q",
+                "B",
+                "S",
+                "K",
+                "Z",
+                "G",
+                "A",
+                "V",
+                "P"
+            ],
+            [
+                "A",
+                "J",
+                "C",
+                "G",
+                "B",
+                "K",
+                "I",
+                "F",
+                "B"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_053_APPLE_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_053_APPLE_result.jpg",
+        "source_image": "Part4/word_with_start/task_053_APPLE_input.jpg",
+        "save_id": 2837,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2837.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_055",
+        "mode": "fixed_start",
+        "target_word": "LEMON",
+        "prompt_en": "Complete the red path for the word 'LEMON' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'LEMON' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "K",
+                "X",
+                "H",
+                "G",
+                "F",
+                "O",
+                "U",
+                "R"
+            ],
+            [
+                "J",
+                "H",
+                "Y",
+                "H",
+                "R",
+                "V",
+                "L",
+                "B"
+            ],
+            [
+                "O",
+                "U",
+                "Y",
+                "A",
+                "K",
+                "K",
+                "E",
+                "X"
+            ],
+            [
+                "F",
+                "M",
+                "P",
+                "P",
+                "O",
+                "R",
+                "M",
+                "O"
+            ],
+            [
+                "Q",
+                "Q",
+                "P",
+                "L",
+                "O",
+                "T",
+                "P",
+                "N"
+            ],
+            [
+                "R",
+                "H",
+                "D",
+                "T",
+                "X",
+                "U",
+                "C",
+                "J"
+            ],
+            [
+                "J",
+                "H",
+                "Y",
+                "Q",
+                "E",
+                "R",
+                "M",
+                "Q"
+            ],
+            [
+                "R",
+                "R",
+                "F",
+                "R",
+                "I",
+                "R",
+                "R",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                6
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_055_LEMON_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_055_LEMON_result.jpg",
+        "source_image": "Part4/word_with_start/task_055_LEMON_input.jpg",
+        "save_id": 2839,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2839.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_057",
+        "mode": "fixed_start",
+        "target_word": "RIVER",
+        "prompt_en": "Complete the red path for the word 'RIVER' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'RIVER' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "C",
+                "K",
+                "R",
+                "T",
+                "H",
+                "Z",
+                "W"
+            ],
+            [
+                "K",
+                "A",
+                "I",
+                "V",
+                "Y",
+                "P",
+                "V"
+            ],
+            [
+                "E",
+                "B",
+                "A",
+                "E",
+                "G",
+                "I",
+                "U"
+            ],
+            [
+                "F",
+                "D",
+                "Q",
+                "R",
+                "J",
+                "M",
+                "K"
+            ],
+            [
+                "F",
+                "L",
+                "W",
+                "X",
+                "O",
+                "V",
+                "U"
+            ],
+            [
+                "N",
+                "N",
+                "H",
+                "O",
+                "D",
+                "M",
+                "S"
+            ],
+            [
+                "U",
+                "U",
+                "J",
+                "F",
+                "G",
+                "W",
+                "G"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                2
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_057_RIVER_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_057_RIVER_result.jpg",
+        "source_image": "Part4/word_with_start/task_057_RIVER_input.jpg",
+        "save_id": 2841,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2841.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_059",
+        "mode": "fixed_start",
+        "target_word": "CLOUD",
+        "prompt_en": "Complete the red path for the word 'CLOUD' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'CLOUD' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "X",
+                "D",
+                "E",
+                "C",
+                "L",
+                "A",
+                "E"
+            ],
+            [
+                "V",
+                "H",
+                "A",
+                "E",
+                "O",
+                "W",
+                "Q"
+            ],
+            [
+                "X",
+                "C",
+                "R",
+                "T",
+                "U",
+                "E",
+                "N"
+            ],
+            [
+                "O",
+                "G",
+                "A",
+                "Z",
+                "D",
+                "Q",
+                "F"
+            ],
+            [
+                "B",
+                "N",
+                "G",
+                "X",
+                "J",
+                "N",
+                "B"
+            ],
+            [
+                "Y",
+                "J",
+                "I",
+                "Q",
+                "V",
+                "K",
+                "T"
+            ],
+            [
+                "Q",
+                "G",
+                "X",
+                "T",
+                "M",
+                "J",
+                "W"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                3
+            ],
+            [
+                0,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_059_CLOUD_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_059_CLOUD_result.jpg",
+        "source_image": "Part4/word_with_start/task_059_CLOUD_input.jpg",
+        "save_id": 2843,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2843.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_061",
+        "mode": "fixed_start",
+        "target_word": "CHAIR",
+        "prompt_en": "Complete the red path for the word 'CHAIR' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'CHAIR' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "M",
+                "W",
+                "P",
+                "L",
+                "C",
+                "Q",
+                "P"
+            ],
+            [
+                "I",
+                "J",
+                "W",
+                "P",
+                "T",
+                "B",
+                "H"
+            ],
+            [
+                "X",
+                "J",
+                "J",
+                "R",
+                "H",
+                "Q",
+                "V"
+            ],
+            [
+                "Q",
+                "J",
+                "C",
+                "H",
+                "A",
+                "I",
+                "R"
+            ],
+            [
+                "W",
+                "S",
+                "L",
+                "Z",
+                "Q",
+                "Q",
+                "J"
+            ],
+            [
+                "O",
+                "Y",
+                "O",
+                "L",
+                "F",
+                "G",
+                "U"
+            ],
+            [
+                "P",
+                "S",
+                "D",
+                "V",
+                "T",
+                "S",
+                "G"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                3,
+                6
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_061_CHAIR_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_061_CHAIR_result.jpg",
+        "source_image": "Part4/word_with_start/task_061_CHAIR_input.jpg",
+        "save_id": 2845,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2845.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_063",
+        "mode": "fixed_start",
+        "target_word": "PLATE",
+        "prompt_en": "Complete the red path for the word 'PLATE' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'PLATE' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "U",
+                "A",
+                "A",
+                "K",
+                "P",
+                "V",
+                "G",
+                "U"
+            ],
+            [
+                "S",
+                "G",
+                "E",
+                "W",
+                "T",
+                "K",
+                "I",
+                "Z"
+            ],
+            [
+                "J",
+                "Q",
+                "E",
+                "F",
+                "N",
+                "R",
+                "B",
+                "S"
+            ],
+            [
+                "R",
+                "Y",
+                "I",
+                "V",
+                "U",
+                "X",
+                "R",
+                "E"
+            ],
+            [
+                "D",
+                "O",
+                "J",
+                "T",
+                "Q",
+                "P",
+                "Z",
+                "H"
+            ],
+            [
+                "K",
+                "L",
+                "D",
+                "O",
+                "C",
+                "L",
+                "A",
+                "F"
+            ],
+            [
+                "Q",
+                "A",
+                "A",
+                "S",
+                "G",
+                "H",
+                "T",
+                "P"
+            ],
+            [
+                "D",
+                "G",
+                "H",
+                "D",
+                "U",
+                "Y",
+                "E",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                7,
+                6
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_063_PLATE_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_063_PLATE_result.jpg",
+        "source_image": "Part4/word_with_start/task_063_PLATE_input.jpg",
+        "save_id": 2847,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2847.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_065",
+        "mode": "fixed_start",
+        "target_word": "KNIFE",
+        "prompt_en": "Complete the red path for the word 'KNIFE' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'KNIFE' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "L",
+                "J",
+                "J",
+                "I",
+                "B",
+                "S",
+                "O"
+            ],
+            [
+                "I",
+                "Z",
+                "T",
+                "K",
+                "C",
+                "H",
+                "O"
+            ],
+            [
+                "H",
+                "A",
+                "T",
+                "N",
+                "A",
+                "B",
+                "K"
+            ],
+            [
+                "X",
+                "Q",
+                "Y",
+                "I",
+                "X",
+                "Y",
+                "V"
+            ],
+            [
+                "P",
+                "R",
+                "Q",
+                "F",
+                "U",
+                "K",
+                "C"
+            ],
+            [
+                "V",
+                "B",
+                "H",
+                "E",
+                "Q",
+                "L",
+                "R"
+            ],
+            [
+                "P",
+                "V",
+                "M",
+                "Q",
+                "U",
+                "K",
+                "I"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_065_KNIFE_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_065_KNIFE_result.jpg",
+        "source_image": "Part4/word_with_start/task_065_KNIFE_input.jpg",
+        "save_id": 2849,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2849.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_067",
+        "mode": "fixed_start",
+        "target_word": "COMPUTER",
+        "prompt_en": "Complete the red path for the word 'COMPUTER' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'COMPUTER' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "Q",
+                "U",
+                "J",
+                "R",
+                "K",
+                "W",
+                "Q",
+                "J",
+                "P",
+                "J"
+            ],
+            [
+                "M",
+                "V",
+                "E",
+                "L",
+                "G",
+                "E",
+                "I",
+                "I",
+                "N",
+                "X"
+            ],
+            [
+                "J",
+                "E",
+                "M",
+                "Q",
+                "W",
+                "H",
+                "B",
+                "X",
+                "P",
+                "B"
+            ],
+            [
+                "I",
+                "F",
+                "N",
+                "S",
+                "E",
+                "W",
+                "B",
+                "Q",
+                "B",
+                "R"
+            ],
+            [
+                "F",
+                "T",
+                "X",
+                "C",
+                "G",
+                "L",
+                "C",
+                "T",
+                "A",
+                "N"
+            ],
+            [
+                "M",
+                "C",
+                "Q",
+                "V",
+                "J",
+                "M",
+                "Y",
+                "Z",
+                "J",
+                "Y"
+            ],
+            [
+                "E",
+                "O",
+                "K",
+                "E",
+                "L",
+                "R",
+                "G",
+                "Q",
+                "K",
+                "P"
+            ],
+            [
+                "S",
+                "M",
+                "D",
+                "G",
+                "Z",
+                "B",
+                "D",
+                "K",
+                "H",
+                "W"
+            ],
+            [
+                "V",
+                "P",
+                "U",
+                "T",
+                "E",
+                "R",
+                "J",
+                "H",
+                "J",
+                "L"
+            ],
+            [
+                "W",
+                "H",
+                "F",
+                "D",
+                "H",
+                "J",
+                "H",
+                "E",
+                "X",
+                "R"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                1
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                7,
+                1
+            ],
+            [
+                8,
+                1
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                5
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_067_COMPUTER_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_067_COMPUTER_result.jpg",
+        "source_image": "Part4/word_with_start/task_067_COMPUTER_input.jpg",
+        "save_id": 2851,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2851.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_069",
+        "mode": "fixed_start",
+        "target_word": "UMBRELLA",
+        "prompt_en": "Complete the red path for the word 'UMBRELLA' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'UMBRELLA' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "Q",
+                "S",
+                "F",
+                "Y",
+                "Z",
+                "T",
+                "J",
+                "L",
+                "Z",
+                "F",
+                "R"
+            ],
+            [
+                "J",
+                "T",
+                "L",
+                "C",
+                "X",
+                "P",
+                "Z",
+                "U",
+                "B",
+                "T",
+                "Z"
+            ],
+            [
+                "A",
+                "K",
+                "I",
+                "I",
+                "N",
+                "S",
+                "W",
+                "X",
+                "X",
+                "Z",
+                "V"
+            ],
+            [
+                "U",
+                "F",
+                "W",
+                "H",
+                "Q",
+                "E",
+                "J",
+                "P",
+                "X",
+                "R",
+                "C"
+            ],
+            [
+                "D",
+                "G",
+                "D",
+                "E",
+                "D",
+                "K",
+                "X",
+                "W",
+                "Z",
+                "M",
+                "Q"
+            ],
+            [
+                "X",
+                "N",
+                "R",
+                "X",
+                "O",
+                "A",
+                "B",
+                "S",
+                "S",
+                "S",
+                "O"
+            ],
+            [
+                "L",
+                "S",
+                "C",
+                "N",
+                "K",
+                "J",
+                "Q",
+                "H",
+                "L",
+                "P",
+                "E"
+            ],
+            [
+                "W",
+                "T",
+                "O",
+                "B",
+                "R",
+                "Z",
+                "G",
+                "Y",
+                "G",
+                "I",
+                "D"
+            ],
+            [
+                "F",
+                "U",
+                "C",
+                "T",
+                "H",
+                "E",
+                "U",
+                "P",
+                "G",
+                "C",
+                "R"
+            ],
+            [
+                "T",
+                "L",
+                "Y",
+                "U",
+                "F",
+                "L",
+                "Z",
+                "Y",
+                "U",
+                "T",
+                "D"
+            ],
+            [
+                "C",
+                "B",
+                "G",
+                "M",
+                "B",
+                "R",
+                "E",
+                "L",
+                "L",
+                "A",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                9,
+                3
+            ],
+            [
+                10,
+                3
+            ],
+            [
+                10,
+                4
+            ],
+            [
+                10,
+                5
+            ],
+            [
+                10,
+                6
+            ],
+            [
+                10,
+                7
+            ],
+            [
+                10,
+                8
+            ],
+            [
+                10,
+                9
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_069_UMBRELLA_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_069_UMBRELLA_result.jpg",
+        "source_image": "Part4/word_with_start/task_069_UMBRELLA_input.jpg",
+        "save_id": 2853,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2853.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_071",
+        "mode": "fixed_start",
+        "target_word": "KANGAROO",
+        "prompt_en": "Complete the red path for the word 'KANGAROO' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'KANGAROO' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "U",
+                "M",
+                "J",
+                "N",
+                "U",
+                "P",
+                "H",
+                "O",
+                "L"
+            ],
+            [
+                "O",
+                "S",
+                "G",
+                "D",
+                "P",
+                "G",
+                "G",
+                "E",
+                "T"
+            ],
+            [
+                "R",
+                "N",
+                "V",
+                "K",
+                "A",
+                "N",
+                "G",
+                "C",
+                "P"
+            ],
+            [
+                "U",
+                "E",
+                "R",
+                "J",
+                "L",
+                "K",
+                "A",
+                "E",
+                "U"
+            ],
+            [
+                "U",
+                "M",
+                "B",
+                "G",
+                "M",
+                "F",
+                "R",
+                "O",
+                "V"
+            ],
+            [
+                "O",
+                "J",
+                "Z",
+                "V",
+                "I",
+                "Z",
+                "Y",
+                "O",
+                "Q"
+            ],
+            [
+                "G",
+                "R",
+                "P",
+                "M",
+                "N",
+                "R",
+                "P",
+                "J",
+                "X"
+            ],
+            [
+                "P",
+                "W",
+                "Y",
+                "B",
+                "J",
+                "I",
+                "L",
+                "I",
+                "I"
+            ],
+            [
+                "V",
+                "J",
+                "F",
+                "L",
+                "M",
+                "Y",
+                "J",
+                "T",
+                "M"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_071_KANGAROO_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_071_KANGAROO_result.jpg",
+        "source_image": "Part4/word_with_start/task_071_KANGAROO_input.jpg",
+        "save_id": 2855,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2855.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_073",
+        "mode": "fixed_start",
+        "target_word": "SANDWICH",
+        "prompt_en": "Complete the red path for the word 'SANDWICH' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'SANDWICH' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "G",
+                "X",
+                "B",
+                "Q",
+                "R",
+                "V",
+                "P",
+                "Q",
+                "C"
+            ],
+            [
+                "V",
+                "X",
+                "S",
+                "A",
+                "N",
+                "D",
+                "I",
+                "A",
+                "D"
+            ],
+            [
+                "P",
+                "X",
+                "J",
+                "K",
+                "G",
+                "W",
+                "J",
+                "V",
+                "R"
+            ],
+            [
+                "R",
+                "T",
+                "V",
+                "T",
+                "Y",
+                "I",
+                "C",
+                "D",
+                "T"
+            ],
+            [
+                "N",
+                "V",
+                "H",
+                "Z",
+                "H",
+                "L",
+                "H",
+                "Z",
+                "P"
+            ],
+            [
+                "W",
+                "Q",
+                "M",
+                "Z",
+                "E",
+                "D",
+                "J",
+                "B",
+                "Y"
+            ],
+            [
+                "C",
+                "Y",
+                "E",
+                "C",
+                "A",
+                "H",
+                "F",
+                "M",
+                "S"
+            ],
+            [
+                "I",
+                "U",
+                "R",
+                "N",
+                "E",
+                "M",
+                "Y",
+                "L",
+                "V"
+            ],
+            [
+                "F",
+                "P",
+                "X",
+                "W",
+                "I",
+                "O",
+                "V",
+                "I",
+                "T"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_073_SANDWICH_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_073_SANDWICH_result.jpg",
+        "source_image": "Part4/word_with_start/task_073_SANDWICH_input.jpg",
+        "save_id": 2857,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2857.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_075",
+        "mode": "fixed_start",
+        "target_word": "ALGORITHM",
+        "prompt_en": "Complete the red path for the word 'ALGORITHM' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'ALGORITHM' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "R",
+                "D",
+                "J",
+                "Z",
+                "E",
+                "N",
+                "P",
+                "L",
+                "P",
+                "V",
+                "O",
+                "P",
+                "P"
+            ],
+            [
+                "Z",
+                "V",
+                "T",
+                "Z",
+                "A",
+                "M",
+                "P",
+                "T",
+                "C",
+                "F",
+                "A",
+                "S",
+                "T"
+            ],
+            [
+                "Q",
+                "I",
+                "D",
+                "W",
+                "M",
+                "T",
+                "K",
+                "W",
+                "B",
+                "U",
+                "X",
+                "E",
+                "F"
+            ],
+            [
+                "O",
+                "Q",
+                "O",
+                "B",
+                "E",
+                "J",
+                "S",
+                "I",
+                "O",
+                "H",
+                "L",
+                "H",
+                "J"
+            ],
+            [
+                "G",
+                "Z",
+                "E",
+                "A",
+                "L",
+                "G",
+                "P",
+                "K",
+                "B",
+                "K",
+                "S",
+                "Z",
+                "O"
+            ],
+            [
+                "A",
+                "W",
+                "U",
+                "S",
+                "R",
+                "O",
+                "P",
+                "Y",
+                "E",
+                "U",
+                "O",
+                "R",
+                "K"
+            ],
+            [
+                "P",
+                "R",
+                "D",
+                "E",
+                "N",
+                "R",
+                "I",
+                "W",
+                "B",
+                "X",
+                "E",
+                "T",
+                "Q"
+            ],
+            [
+                "K",
+                "B",
+                "V",
+                "X",
+                "O",
+                "U",
+                "T",
+                "H",
+                "A",
+                "P",
+                "V",
+                "T",
+                "X"
+            ],
+            [
+                "S",
+                "P",
+                "V",
+                "Y",
+                "R",
+                "Y",
+                "B",
+                "M",
+                "X",
+                "E",
+                "I",
+                "F",
+                "O"
+            ],
+            [
+                "N",
+                "T",
+                "B",
+                "K",
+                "W",
+                "H",
+                "C",
+                "J",
+                "D",
+                "M",
+                "R",
+                "X",
+                "D"
+            ],
+            [
+                "P",
+                "F",
+                "L",
+                "S",
+                "W",
+                "J",
+                "W",
+                "O",
+                "P",
+                "M",
+                "I",
+                "H",
+                "S"
+            ],
+            [
+                "A",
+                "O",
+                "I",
+                "W",
+                "R",
+                "C",
+                "H",
+                "J",
+                "A",
+                "P",
+                "Z",
+                "U",
+                "Q"
+            ],
+            [
+                "X",
+                "X",
+                "I",
+                "U",
+                "K",
+                "L",
+                "L",
+                "R",
+                "T",
+                "M",
+                "Y",
+                "X",
+                "P"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_075_ALGORITHM_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_075_ALGORITHM_result.jpg",
+        "source_image": "Part4/word_with_start/task_075_ALGORITHM_input.jpg",
+        "save_id": 2859,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2859.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_077",
+        "mode": "fixed_start",
+        "target_word": "STRAWBERRY",
+        "prompt_en": "Complete the red path for the word 'STRAWBERRY' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'STRAWBERRY' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "R",
+                "M",
+                "W",
+                "I",
+                "F",
+                "R",
+                "L",
+                "O",
+                "Z",
+                "J",
+                "P"
+            ],
+            [
+                "M",
+                "L",
+                "K",
+                "I",
+                "H",
+                "D",
+                "R",
+                "F",
+                "M",
+                "B",
+                "U"
+            ],
+            [
+                "Q",
+                "Y",
+                "H",
+                "T",
+                "M",
+                "E",
+                "O",
+                "B",
+                "N",
+                "H",
+                "J"
+            ],
+            [
+                "X",
+                "U",
+                "B",
+                "M",
+                "R",
+                "K",
+                "Z",
+                "Z",
+                "S",
+                "E",
+                "I"
+            ],
+            [
+                "Y",
+                "P",
+                "K",
+                "K",
+                "F",
+                "T",
+                "X",
+                "F",
+                "L",
+                "F",
+                "P"
+            ],
+            [
+                "Z",
+                "G",
+                "S",
+                "T",
+                "R",
+                "A",
+                "D",
+                "Q",
+                "M",
+                "D",
+                "R"
+            ],
+            [
+                "P",
+                "B",
+                "N",
+                "X",
+                "P",
+                "W",
+                "V",
+                "S",
+                "T",
+                "O",
+                "Z"
+            ],
+            [
+                "S",
+                "J",
+                "E",
+                "Q",
+                "B",
+                "B",
+                "E",
+                "R",
+                "G",
+                "M",
+                "V"
+            ],
+            [
+                "W",
+                "P",
+                "X",
+                "A",
+                "W",
+                "F",
+                "K",
+                "R",
+                "L",
+                "E",
+                "R"
+            ],
+            [
+                "A",
+                "K",
+                "K",
+                "Y",
+                "F",
+                "S",
+                "W",
+                "Y",
+                "Q",
+                "L",
+                "G"
+            ],
+            [
+                "T",
+                "B",
+                "B",
+                "J",
+                "N",
+                "M",
+                "H",
+                "Z",
+                "W",
+                "L",
+                "K"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                9,
+                7
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_077_STRAWBERRY_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_077_STRAWBERRY_result.jpg",
+        "source_image": "Part4/word_with_start/task_077_STRAWBERRY_input.jpg",
+        "save_id": 2861,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2861.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_079",
+        "mode": "fixed_start",
+        "target_word": "INTELLIGENCE",
+        "prompt_en": "Complete the red path for the word 'INTELLIGENCE' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'INTELLIGENCE' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "R",
+                "J",
+                "T",
+                "C",
+                "Y",
+                "H",
+                "M",
+                "F",
+                "O",
+                "I",
+                "N",
+                "T",
+                "I",
+                "N"
+            ],
+            [
+                "X",
+                "R",
+                "Y",
+                "Q",
+                "O",
+                "X",
+                "Z",
+                "Y",
+                "R",
+                "G",
+                "L",
+                "E",
+                "L",
+                "H"
+            ],
+            [
+                "F",
+                "Y",
+                "T",
+                "I",
+                "J",
+                "H",
+                "N",
+                "F",
+                "Z",
+                "O",
+                "V",
+                "C",
+                "L",
+                "I"
+            ],
+            [
+                "B",
+                "I",
+                "L",
+                "R",
+                "W",
+                "U",
+                "J",
+                "J",
+                "I",
+                "D",
+                "H",
+                "R",
+                "I",
+                "G"
+            ],
+            [
+                "S",
+                "F",
+                "X",
+                "S",
+                "A",
+                "J",
+                "I",
+                "U",
+                "P",
+                "H",
+                "K",
+                "X",
+                "B",
+                "E"
+            ],
+            [
+                "D",
+                "T",
+                "Q",
+                "B",
+                "K",
+                "A",
+                "O",
+                "W",
+                "N",
+                "N",
+                "B",
+                "T",
+                "C",
+                "N"
+            ],
+            [
+                "Z",
+                "A",
+                "F",
+                "F",
+                "Q",
+                "K",
+                "K",
+                "G",
+                "I",
+                "J",
+                "N",
+                "P",
+                "R",
+                "C"
+            ],
+            [
+                "Z",
+                "K",
+                "U",
+                "G",
+                "H",
+                "P",
+                "P",
+                "V",
+                "I",
+                "B",
+                "U",
+                "A",
+                "Q",
+                "E"
+            ],
+            [
+                "I",
+                "A",
+                "W",
+                "G",
+                "J",
+                "C",
+                "Z",
+                "K",
+                "B",
+                "L",
+                "U",
+                "O",
+                "X",
+                "J"
+            ],
+            [
+                "P",
+                "K",
+                "C",
+                "Z",
+                "Z",
+                "S",
+                "L",
+                "H",
+                "Z",
+                "M",
+                "S",
+                "V",
+                "X",
+                "F"
+            ],
+            [
+                "T",
+                "W",
+                "Z",
+                "W",
+                "M",
+                "X",
+                "N",
+                "U",
+                "M",
+                "Z",
+                "C",
+                "R",
+                "C",
+                "S"
+            ],
+            [
+                "N",
+                "D",
+                "T",
+                "E",
+                "Y",
+                "L",
+                "V",
+                "P",
+                "O",
+                "J",
+                "N",
+                "H",
+                "I",
+                "D"
+            ],
+            [
+                "O",
+                "E",
+                "K",
+                "D",
+                "M",
+                "S",
+                "P",
+                "L",
+                "X",
+                "N",
+                "V",
+                "G",
+                "M",
+                "K"
+            ],
+            [
+                "X",
+                "E",
+                "U",
+                "D",
+                "G",
+                "R",
+                "D",
+                "P",
+                "I",
+                "E",
+                "X",
+                "Q",
+                "W",
+                "R"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                9
+            ],
+            [
+                0,
+                10
+            ],
+            [
+                0,
+                11
+            ],
+            [
+                1,
+                11
+            ],
+            [
+                1,
+                12
+            ],
+            [
+                2,
+                12
+            ],
+            [
+                2,
+                13
+            ],
+            [
+                3,
+                13
+            ],
+            [
+                4,
+                13
+            ],
+            [
+                5,
+                13
+            ],
+            [
+                6,
+                13
+            ],
+            [
+                7,
+                13
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_079_INTELLIGENCE_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_079_INTELLIGENCE_result.jpg",
+        "source_image": "Part4/word_with_start/task_079_INTELLIGENCE_input.jpg",
+        "save_id": 2863,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2863.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_081",
+        "mode": "fixed_start",
+        "target_word": "TELEPHONE",
+        "prompt_en": "Complete the red path for the word 'TELEPHONE' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'TELEPHONE' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "W",
+                "R",
+                "N",
+                "G",
+                "G",
+                "S",
+                "A",
+                "G",
+                "A",
+                "G"
+            ],
+            [
+                "W",
+                "S",
+                "L",
+                "A",
+                "F",
+                "L",
+                "R",
+                "O",
+                "N",
+                "A"
+            ],
+            [
+                "Y",
+                "R",
+                "X",
+                "J",
+                "G",
+                "Y",
+                "C",
+                "D",
+                "X",
+                "K"
+            ],
+            [
+                "E",
+                "K",
+                "L",
+                "Y",
+                "H",
+                "Z",
+                "S",
+                "R",
+                "N",
+                "V"
+            ],
+            [
+                "Q",
+                "V",
+                "Z",
+                "Q",
+                "G",
+                "T",
+                "M",
+                "E",
+                "B",
+                "S"
+            ],
+            [
+                "D",
+                "F",
+                "O",
+                "G",
+                "T",
+                "W",
+                "G",
+                "E",
+                "Y",
+                "J"
+            ],
+            [
+                "N",
+                "F",
+                "K",
+                "L",
+                "E",
+                "P",
+                "B",
+                "V",
+                "S",
+                "F"
+            ],
+            [
+                "U",
+                "H",
+                "N",
+                "E",
+                "L",
+                "I",
+                "C",
+                "O",
+                "V",
+                "C"
+            ],
+            [
+                "H",
+                "P",
+                "W",
+                "M",
+                "E",
+                "O",
+                "Z",
+                "G",
+                "L",
+                "E"
+            ],
+            [
+                "H",
+                "D",
+                "V",
+                "M",
+                "P",
+                "H",
+                "O",
+                "N",
+                "E",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                9,
+                6
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                9,
+                8
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_081_TELEPHONE_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_081_TELEPHONE_result.jpg",
+        "source_image": "Part4/word_with_start/task_081_TELEPHONE_input.jpg",
+        "save_id": 2865,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2865.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_083",
+        "mode": "fixed_start",
+        "target_word": "ADVENTURE",
+        "prompt_en": "Complete the red path for the word 'ADVENTURE' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'ADVENTURE' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "J",
+                "H",
+                "R",
+                "P",
+                "Z",
+                "L",
+                "E",
+                "B",
+                "Y",
+                "H"
+            ],
+            [
+                "J",
+                "T",
+                "J",
+                "M",
+                "S",
+                "A",
+                "L",
+                "T",
+                "H",
+                "A"
+            ],
+            [
+                "H",
+                "W",
+                "R",
+                "L",
+                "W",
+                "Q",
+                "V",
+                "U",
+                "U",
+                "E"
+            ],
+            [
+                "X",
+                "N",
+                "A",
+                "E",
+                "O",
+                "K",
+                "U",
+                "X",
+                "C",
+                "J"
+            ],
+            [
+                "P",
+                "H",
+                "D",
+                "C",
+                "C",
+                "P",
+                "V",
+                "A",
+                "Z",
+                "F"
+            ],
+            [
+                "A",
+                "D",
+                "T",
+                "Y",
+                "V",
+                "C",
+                "Z",
+                "B",
+                "A",
+                "X"
+            ],
+            [
+                "N",
+                "V",
+                "K",
+                "D",
+                "H",
+                "Y",
+                "I",
+                "L",
+                "O",
+                "J"
+            ],
+            [
+                "X",
+                "E",
+                "J",
+                "V",
+                "U",
+                "H",
+                "T",
+                "V",
+                "Y",
+                "F"
+            ],
+            [
+                "X",
+                "N",
+                "T",
+                "K",
+                "F",
+                "M",
+                "D",
+                "R",
+                "V",
+                "J"
+            ],
+            [
+                "N",
+                "A",
+                "U",
+                "R",
+                "E",
+                "Q",
+                "R",
+                "X",
+                "Z",
+                "P"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                0
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                7,
+                1
+            ],
+            [
+                8,
+                1
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                9,
+                2
+            ],
+            [
+                9,
+                3
+            ],
+            [
+                9,
+                4
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_083_ADVENTURE_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_083_ADVENTURE_result.jpg",
+        "source_image": "Part4/word_with_start/task_083_ADVENTURE_input.jpg",
+        "save_id": 2867,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2867.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_085",
+        "mode": "fixed_start",
+        "target_word": "VACATION",
+        "prompt_en": "Complete the red path for the word 'VACATION' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'VACATION' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "X",
+                "O",
+                "P",
+                "N",
+                "V",
+                "A",
+                "W",
+                "B",
+                "C"
+            ],
+            [
+                "T",
+                "O",
+                "S",
+                "Z",
+                "F",
+                "C",
+                "N",
+                "B",
+                "W"
+            ],
+            [
+                "V",
+                "H",
+                "H",
+                "T",
+                "C",
+                "A",
+                "T",
+                "I",
+                "O"
+            ],
+            [
+                "N",
+                "B",
+                "A",
+                "X",
+                "X",
+                "K",
+                "L",
+                "A",
+                "N"
+            ],
+            [
+                "D",
+                "B",
+                "J",
+                "V",
+                "Z",
+                "C",
+                "U",
+                "O",
+                "Z"
+            ],
+            [
+                "G",
+                "H",
+                "Y",
+                "R",
+                "S",
+                "O",
+                "H",
+                "S",
+                "Y"
+            ],
+            [
+                "W",
+                "I",
+                "J",
+                "U",
+                "R",
+                "M",
+                "F",
+                "A",
+                "W"
+            ],
+            [
+                "N",
+                "E",
+                "H",
+                "D",
+                "C",
+                "T",
+                "J",
+                "B",
+                "K"
+            ],
+            [
+                "Q",
+                "C",
+                "K",
+                "M",
+                "Z",
+                "T",
+                "D",
+                "K",
+                "L"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_085_VACATION_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_085_VACATION_result.jpg",
+        "source_image": "Part4/word_with_start/task_085_VACATION_input.jpg",
+        "save_id": 2869,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2869.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_087",
+        "mode": "fixed_start",
+        "target_word": "ASTRONAUT",
+        "prompt_en": "Complete the red path for the word 'ASTRONAUT' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'ASTRONAUT' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "R",
+                "D",
+                "Q",
+                "F",
+                "L",
+                "M",
+                "O",
+                "H",
+                "N",
+                "A",
+                "S",
+                "X",
+                "Q"
+            ],
+            [
+                "O",
+                "I",
+                "A",
+                "K",
+                "G",
+                "V",
+                "T",
+                "P",
+                "I",
+                "N",
+                "T",
+                "R",
+                "O"
+            ],
+            [
+                "T",
+                "A",
+                "I",
+                "D",
+                "L",
+                "S",
+                "I",
+                "M",
+                "U",
+                "X",
+                "Y",
+                "Q",
+                "N"
+            ],
+            [
+                "O",
+                "W",
+                "F",
+                "X",
+                "Q",
+                "Z",
+                "P",
+                "J",
+                "N",
+                "S",
+                "L",
+                "D",
+                "A"
+            ],
+            [
+                "K",
+                "K",
+                "E",
+                "J",
+                "S",
+                "W",
+                "W",
+                "G",
+                "Z",
+                "W",
+                "T",
+                "V",
+                "U"
+            ],
+            [
+                "E",
+                "S",
+                "D",
+                "M",
+                "T",
+                "W",
+                "V",
+                "X",
+                "Q",
+                "X",
+                "P",
+                "X",
+                "T"
+            ],
+            [
+                "D",
+                "P",
+                "C",
+                "A",
+                "G",
+                "W",
+                "D",
+                "T",
+                "M",
+                "P",
+                "H",
+                "E",
+                "J"
+            ],
+            [
+                "V",
+                "P",
+                "T",
+                "R",
+                "N",
+                "C",
+                "R",
+                "G",
+                "Y",
+                "X",
+                "Z",
+                "C",
+                "O"
+            ],
+            [
+                "Y",
+                "N",
+                "I",
+                "B",
+                "N",
+                "K",
+                "A",
+                "B",
+                "C",
+                "K",
+                "I",
+                "H",
+                "F"
+            ],
+            [
+                "L",
+                "N",
+                "V",
+                "J",
+                "P",
+                "Y",
+                "Y",
+                "I",
+                "I",
+                "V",
+                "H",
+                "J",
+                "O"
+            ],
+            [
+                "Y",
+                "T",
+                "U",
+                "H",
+                "G",
+                "O",
+                "P",
+                "I",
+                "V",
+                "U",
+                "C",
+                "E",
+                "Z"
+            ],
+            [
+                "Q",
+                "E",
+                "Q",
+                "X",
+                "W",
+                "R",
+                "Q",
+                "M",
+                "A",
+                "X",
+                "C",
+                "V",
+                "B"
+            ],
+            [
+                "D",
+                "T",
+                "T",
+                "H",
+                "W",
+                "P",
+                "R",
+                "G",
+                "Q",
+                "E",
+                "Z",
+                "L",
+                "L"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                9
+            ],
+            [
+                0,
+                10
+            ],
+            [
+                1,
+                10
+            ],
+            [
+                1,
+                11
+            ],
+            [
+                1,
+                12
+            ],
+            [
+                2,
+                12
+            ],
+            [
+                3,
+                12
+            ],
+            [
+                4,
+                12
+            ],
+            [
+                5,
+                12
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_087_ASTRONAUT_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_087_ASTRONAUT_result.jpg",
+        "source_image": "Part4/word_with_start/task_087_ASTRONAUT_input.jpg",
+        "save_id": 2871,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2871.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_089",
+        "mode": "fixed_start",
+        "target_word": "PINEAPPLE",
+        "prompt_en": "Complete the red path for the word 'PINEAPPLE' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'PINEAPPLE' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "P",
+                "F",
+                "G",
+                "F",
+                "I",
+                "W",
+                "A",
+                "I",
+                "N",
+                "Y",
+                "M",
+                "S",
+                "L"
+            ],
+            [
+                "Y",
+                "I",
+                "R",
+                "U",
+                "Z",
+                "X",
+                "P",
+                "C",
+                "L",
+                "U",
+                "F",
+                "O",
+                "A"
+            ],
+            [
+                "Y",
+                "D",
+                "P",
+                "O",
+                "O",
+                "R",
+                "L",
+                "P",
+                "U",
+                "S",
+                "M",
+                "J",
+                "K"
+            ],
+            [
+                "C",
+                "N",
+                "M",
+                "K",
+                "G",
+                "E",
+                "L",
+                "G",
+                "I",
+                "D",
+                "T",
+                "H",
+                "T"
+            ],
+            [
+                "I",
+                "X",
+                "A",
+                "C",
+                "B",
+                "V",
+                "T",
+                "M",
+                "I",
+                "L",
+                "O",
+                "E",
+                "W"
+            ],
+            [
+                "B",
+                "W",
+                "H",
+                "N",
+                "P",
+                "E",
+                "R",
+                "E",
+                "E",
+                "B",
+                "R",
+                "K",
+                "U"
+            ],
+            [
+                "A",
+                "X",
+                "E",
+                "H",
+                "J",
+                "A",
+                "O",
+                "G",
+                "H",
+                "Y",
+                "M",
+                "V",
+                "C"
+            ],
+            [
+                "H",
+                "Y",
+                "M",
+                "J",
+                "V",
+                "J",
+                "M",
+                "W",
+                "B",
+                "Y",
+                "T",
+                "F",
+                "W"
+            ],
+            [
+                "F",
+                "W",
+                "L",
+                "H",
+                "S",
+                "O",
+                "W",
+                "I",
+                "S",
+                "L",
+                "L",
+                "A",
+                "P"
+            ],
+            [
+                "E",
+                "Z",
+                "G",
+                "F",
+                "D",
+                "H",
+                "S",
+                "W",
+                "L",
+                "U",
+                "F",
+                "R",
+                "H"
+            ],
+            [
+                "P",
+                "I",
+                "U",
+                "B",
+                "B",
+                "Y",
+                "X",
+                "Q",
+                "J",
+                "X",
+                "C",
+                "I",
+                "C"
+            ],
+            [
+                "F",
+                "N",
+                "E",
+                "A",
+                "J",
+                "F",
+                "D",
+                "J",
+                "Q",
+                "Y",
+                "X",
+                "H",
+                "H"
+            ],
+            [
+                "M",
+                "Y",
+                "Q",
+                "P",
+                "P",
+                "L",
+                "E",
+                "J",
+                "O",
+                "O",
+                "U",
+                "E",
+                "C"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                10,
+                0
+            ],
+            [
+                10,
+                1
+            ],
+            [
+                11,
+                1
+            ],
+            [
+                11,
+                2
+            ],
+            [
+                11,
+                3
+            ],
+            [
+                12,
+                3
+            ],
+            [
+                12,
+                4
+            ],
+            [
+                12,
+                5
+            ],
+            [
+                12,
+                6
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_089_PINEAPPLE_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_089_PINEAPPLE_result.jpg",
+        "source_image": "Part4/word_with_start/task_089_PINEAPPLE_input.jpg",
+        "save_id": 2873,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2873.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_091",
+        "mode": "fixed_start",
+        "target_word": "CHEMISTRY",
+        "prompt_en": "Complete the red path for the word 'CHEMISTRY' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'CHEMISTRY' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "Z",
+                "P",
+                "E",
+                "I",
+                "B",
+                "M",
+                "S",
+                "T",
+                "K",
+                "E",
+                "C",
+                "H",
+                "R"
+            ],
+            [
+                "S",
+                "A",
+                "L",
+                "G",
+                "H",
+                "D",
+                "S",
+                "P",
+                "B",
+                "Z",
+                "X",
+                "E",
+                "M"
+            ],
+            [
+                "D",
+                "P",
+                "S",
+                "E",
+                "A",
+                "Y",
+                "I",
+                "T",
+                "T",
+                "P",
+                "A",
+                "N",
+                "I"
+            ],
+            [
+                "Y",
+                "D",
+                "J",
+                "J",
+                "Z",
+                "L",
+                "M",
+                "A",
+                "P",
+                "G",
+                "L",
+                "Z",
+                "S"
+            ],
+            [
+                "R",
+                "B",
+                "J",
+                "A",
+                "E",
+                "F",
+                "I",
+                "R",
+                "N",
+                "N",
+                "K",
+                "G",
+                "T"
+            ],
+            [
+                "Z",
+                "P",
+                "Q",
+                "X",
+                "E",
+                "V",
+                "P",
+                "T",
+                "Q",
+                "K",
+                "K",
+                "K",
+                "R"
+            ],
+            [
+                "Y",
+                "S",
+                "E",
+                "F",
+                "B",
+                "U",
+                "F",
+                "M",
+                "V",
+                "Y",
+                "K",
+                "R",
+                "Y"
+            ],
+            [
+                "G",
+                "V",
+                "O",
+                "U",
+                "L",
+                "Y",
+                "M",
+                "X",
+                "O",
+                "J",
+                "Y",
+                "S",
+                "J"
+            ],
+            [
+                "L",
+                "X",
+                "V",
+                "S",
+                "V",
+                "V",
+                "Q",
+                "L",
+                "O",
+                "T",
+                "F",
+                "S",
+                "C"
+            ],
+            [
+                "C",
+                "K",
+                "M",
+                "F",
+                "H",
+                "U",
+                "F",
+                "N",
+                "P",
+                "V",
+                "A",
+                "O",
+                "J"
+            ],
+            [
+                "Z",
+                "W",
+                "S",
+                "F",
+                "B",
+                "V",
+                "N",
+                "E",
+                "X",
+                "L",
+                "J",
+                "F",
+                "U"
+            ],
+            [
+                "N",
+                "M",
+                "V",
+                "X",
+                "M",
+                "K",
+                "Y",
+                "Z",
+                "F",
+                "F",
+                "J",
+                "Q",
+                "B"
+            ],
+            [
+                "E",
+                "L",
+                "Q",
+                "V",
+                "A",
+                "S",
+                "S",
+                "R",
+                "H",
+                "P",
+                "A",
+                "J",
+                "I"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                10
+            ],
+            [
+                0,
+                11
+            ],
+            [
+                1,
+                11
+            ],
+            [
+                1,
+                12
+            ],
+            [
+                2,
+                12
+            ],
+            [
+                3,
+                12
+            ],
+            [
+                4,
+                12
+            ],
+            [
+                5,
+                12
+            ],
+            [
+                6,
+                12
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_091_CHEMISTRY_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_091_CHEMISTRY_result.jpg",
+        "source_image": "Part4/word_with_start/task_091_CHEMISTRY_input.jpg",
+        "save_id": 2875,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2875.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_093",
+        "mode": "fixed_start",
+        "target_word": "LANGUAGE",
+        "prompt_en": "Complete the red path for the word 'LANGUAGE' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'LANGUAGE' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "C",
+                "D",
+                "K",
+                "C",
+                "N",
+                "X",
+                "F",
+                "U",
+                "S",
+                "U",
+                "P",
+                "R"
+            ],
+            [
+                "E",
+                "Y",
+                "N",
+                "V",
+                "F",
+                "V",
+                "U",
+                "P",
+                "T",
+                "X",
+                "A",
+                "W"
+            ],
+            [
+                "C",
+                "H",
+                "G",
+                "L",
+                "S",
+                "A",
+                "M",
+                "Q",
+                "P",
+                "J",
+                "C",
+                "P"
+            ],
+            [
+                "G",
+                "L",
+                "C",
+                "H",
+                "I",
+                "N",
+                "L",
+                "M",
+                "S",
+                "A",
+                "M",
+                "L"
+            ],
+            [
+                "Q",
+                "R",
+                "G",
+                "V",
+                "T",
+                "Z",
+                "A",
+                "L",
+                "G",
+                "Y",
+                "S",
+                "U"
+            ],
+            [
+                "Q",
+                "Y",
+                "G",
+                "V",
+                "X",
+                "R",
+                "N",
+                "G",
+                "H",
+                "J",
+                "B",
+                "Z"
+            ],
+            [
+                "X",
+                "E",
+                "H",
+                "P",
+                "A",
+                "P",
+                "E",
+                "U",
+                "U",
+                "S",
+                "P",
+                "L"
+            ],
+            [
+                "M",
+                "K",
+                "I",
+                "D",
+                "F",
+                "L",
+                "V",
+                "A",
+                "G",
+                "E",
+                "Q",
+                "K"
+            ],
+            [
+                "G",
+                "Q",
+                "S",
+                "D",
+                "S",
+                "K",
+                "X",
+                "W",
+                "R",
+                "Z",
+                "D",
+                "Y"
+            ],
+            [
+                "U",
+                "W",
+                "W",
+                "C",
+                "H",
+                "L",
+                "C",
+                "E",
+                "K",
+                "L",
+                "D",
+                "O"
+            ],
+            [
+                "E",
+                "D",
+                "F",
+                "G",
+                "L",
+                "V",
+                "Z",
+                "R",
+                "P",
+                "Z",
+                "H",
+                "F"
+            ],
+            [
+                "K",
+                "Z",
+                "D",
+                "O",
+                "E",
+                "S",
+                "Z",
+                "Y",
+                "S",
+                "G",
+                "M",
+                "H"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                7,
+                9
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_093_LANGUAGE_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_093_LANGUAGE_result.jpg",
+        "source_image": "Part4/word_with_start/task_093_LANGUAGE_input.jpg",
+        "save_id": 2877,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2877.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_095",
+        "mode": "fixed_start",
+        "target_word": "GEOGRAPHY",
+        "prompt_en": "Complete the red path for the word 'GEOGRAPHY' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'GEOGRAPHY' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "W",
+                "G",
+                "N",
+                "R",
+                "R",
+                "Q",
+                "J",
+                "Z",
+                "P",
+                "E"
+            ],
+            [
+                "T",
+                "Z",
+                "F",
+                "D",
+                "E",
+                "S",
+                "E",
+                "N",
+                "Q",
+                "G"
+            ],
+            [
+                "L",
+                "Y",
+                "K",
+                "K",
+                "L",
+                "A",
+                "Y",
+                "C",
+                "P",
+                "H"
+            ],
+            [
+                "M",
+                "A",
+                "A",
+                "H",
+                "D",
+                "X",
+                "X",
+                "P",
+                "E",
+                "M"
+            ],
+            [
+                "N",
+                "G",
+                "G",
+                "U",
+                "T",
+                "N",
+                "B",
+                "R",
+                "K",
+                "J"
+            ],
+            [
+                "X",
+                "E",
+                "L",
+                "W",
+                "Q",
+                "H",
+                "E",
+                "D",
+                "N",
+                "I"
+            ],
+            [
+                "J",
+                "O",
+                "G",
+                "R",
+                "Z",
+                "N",
+                "H",
+                "D",
+                "C",
+                "Y"
+            ],
+            [
+                "U",
+                "Y",
+                "O",
+                "A",
+                "C",
+                "H",
+                "V",
+                "F",
+                "I",
+                "N"
+            ],
+            [
+                "B",
+                "M",
+                "M",
+                "P",
+                "W",
+                "I",
+                "T",
+                "J",
+                "K",
+                "F"
+            ],
+            [
+                "P",
+                "S",
+                "X",
+                "H",
+                "Y",
+                "Q",
+                "H",
+                "O",
+                "L",
+                "O"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                1
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                9,
+                3
+            ],
+            [
+                9,
+                4
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_095_GEOGRAPHY_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_095_GEOGRAPHY_result.jpg",
+        "source_image": "Part4/word_with_start/task_095_GEOGRAPHY_input.jpg",
+        "save_id": 2879,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2879.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_097",
+        "mode": "fixed_start",
+        "target_word": "PHYSICS",
+        "prompt_en": "Complete the red path for the word 'PHYSICS' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'PHYSICS' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "C",
+                "V",
+                "I",
+                "I",
+                "Y",
+                "J",
+                "G",
+                "W",
+                "Z"
+            ],
+            [
+                "H",
+                "Q",
+                "P",
+                "H",
+                "N",
+                "K",
+                "T",
+                "K",
+                "B"
+            ],
+            [
+                "X",
+                "W",
+                "D",
+                "Y",
+                "O",
+                "V",
+                "Z",
+                "K",
+                "U"
+            ],
+            [
+                "Z",
+                "K",
+                "S",
+                "S",
+                "I",
+                "C",
+                "S",
+                "X",
+                "Z"
+            ],
+            [
+                "G",
+                "H",
+                "T",
+                "N",
+                "S",
+                "V",
+                "X",
+                "G",
+                "M"
+            ],
+            [
+                "W",
+                "Z",
+                "M",
+                "Q",
+                "W",
+                "O",
+                "B",
+                "N",
+                "P"
+            ],
+            [
+                "M",
+                "I",
+                "G",
+                "F",
+                "U",
+                "R",
+                "C",
+                "A",
+                "O"
+            ],
+            [
+                "F",
+                "D",
+                "E",
+                "M",
+                "L",
+                "Q",
+                "P",
+                "W",
+                "N"
+            ],
+            [
+                "U",
+                "F",
+                "B",
+                "E",
+                "G",
+                "K",
+                "S",
+                "W",
+                "S"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                3,
+                6
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_097_PHYSICS_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_097_PHYSICS_result.jpg",
+        "source_image": "Part4/word_with_start/task_097_PHYSICS_input.jpg",
+        "save_id": 2881,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2881.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_099",
+        "mode": "fixed_start",
+        "target_word": "BREAKFAST",
+        "prompt_en": "Complete the red path for the word 'BREAKFAST' starting from the red cell. Move only Down or Right.",
+        "prompt_cn": "从红色方块开始，补全单词 'BREAKFAST' 的红色路径。只能向右或向下移动。",
+        "grid_layout": [
+            [
+                "F",
+                "X",
+                "H",
+                "W",
+                "M",
+                "M",
+                "K",
+                "K",
+                "C",
+                "S",
+                "A",
+                "G"
+            ],
+            [
+                "T",
+                "E",
+                "M",
+                "D",
+                "D",
+                "U",
+                "F",
+                "M",
+                "I",
+                "E",
+                "B",
+                "R"
+            ],
+            [
+                "Z",
+                "N",
+                "G",
+                "O",
+                "H",
+                "Q",
+                "J",
+                "N",
+                "D",
+                "G",
+                "P",
+                "E"
+            ],
+            [
+                "Y",
+                "O",
+                "C",
+                "T",
+                "M",
+                "R",
+                "W",
+                "I",
+                "Z",
+                "E",
+                "Q",
+                "A"
+            ],
+            [
+                "T",
+                "B",
+                "C",
+                "U",
+                "D",
+                "W",
+                "U",
+                "J",
+                "S",
+                "P",
+                "Y",
+                "K"
+            ],
+            [
+                "R",
+                "I",
+                "A",
+                "A",
+                "K",
+                "Z",
+                "L",
+                "C",
+                "G",
+                "Q",
+                "Y",
+                "F"
+            ],
+            [
+                "U",
+                "U",
+                "Y",
+                "E",
+                "J",
+                "H",
+                "C",
+                "E",
+                "T",
+                "E",
+                "O",
+                "A"
+            ],
+            [
+                "L",
+                "R",
+                "P",
+                "C",
+                "H",
+                "I",
+                "C",
+                "S",
+                "P",
+                "Q",
+                "Y",
+                "S"
+            ],
+            [
+                "O",
+                "L",
+                "D",
+                "E",
+                "E",
+                "A",
+                "P",
+                "S",
+                "A",
+                "N",
+                "R",
+                "T"
+            ],
+            [
+                "E",
+                "L",
+                "K",
+                "S",
+                "V",
+                "J",
+                "E",
+                "G",
+                "T",
+                "K",
+                "H",
+                "X"
+            ],
+            [
+                "P",
+                "P",
+                "Z",
+                "Y",
+                "Y",
+                "Y",
+                "F",
+                "T",
+                "I",
+                "R",
+                "I",
+                "D"
+            ],
+            [
+                "Y",
+                "U",
+                "E",
+                "X",
+                "Q",
+                "I",
+                "V",
+                "Z",
+                "E",
+                "D",
+                "T",
+                "T"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                10
+            ],
+            [
+                1,
+                11
+            ],
+            [
+                2,
+                11
+            ],
+            [
+                3,
+                11
+            ],
+            [
+                4,
+                11
+            ],
+            [
+                5,
+                11
+            ],
+            [
+                6,
+                11
+            ],
+            [
+                7,
+                11
+            ],
+            [
+                8,
+                11
+            ]
+        ],
+        "input_image": "dataset_find_word_start_no_arrows/task_099_BREAKFAST_input.jpg",
+        "result_image": "dataset_find_word_start_no_arrows/task_099_BREAKFAST_result.jpg",
+        "source_image": "Part4/word_with_start/task_099_BREAKFAST_input.jpg",
+        "save_id": 2883,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Find_Word_With_Start/2883.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2164.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2164.png
new file mode 100644
index 0000000000000000000000000000000000000000..6a5984aaed405ed11e49ef1b02bd897f2224c6bb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2164.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:83d1309b23f1ccf36ec15d9f8c45bb912b7c1ae488dc1124b67e8bf119a64fe5
+size 193086
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2166.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2166.png
new file mode 100644
index 0000000000000000000000000000000000000000..2ce1403941bfe010e746e9d6dffb6892038e168c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2166.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ee1e6db97e9ae8379bc36ad6c7b9c63d54608f27743dbf1fc9d55a60d3f4ece6
+size 197123
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2168.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2168.png
new file mode 100644
index 0000000000000000000000000000000000000000..9286f64a252eed57baf2afde59a1996f8f1162e2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2168.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c23fa4d432b411b37c741dc72f2553fd1a9295d029a2fda50b49e03041bd5603
+size 247343
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2170.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2170.png
new file mode 100644
index 0000000000000000000000000000000000000000..44338cd2d88472cb8a1610c380121129792d2eca
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2170.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f13c261d8871f240f82db30993b664854eb05a26b9eb46bd7ea3924f387b0d9e
+size 226309
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2172.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2172.png
new file mode 100644
index 0000000000000000000000000000000000000000..79fe95ab6a84184e74dfe429cd280edd72ef6b62
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2172.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:35e0ad503cac709c1d3e80fedee32cde18f6c93664f13383b8e9035e4e63e6f1
+size 205224
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2174.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2174.png
new file mode 100644
index 0000000000000000000000000000000000000000..b83798ca4d6c2cc9a2a1e102791e75f51122c4bf
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2174.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3af8645bc6693f0bbaebb1bddd4a734c940ffc4c61871091a4e17d6896d6ef6c
+size 201613
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2176.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2176.png
new file mode 100644
index 0000000000000000000000000000000000000000..a07a8763458f18fd8339e195c5756a3948c3c441
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2176.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ad3cc4489bc5b54a2ba0eeeb346cabf654fefbd7667c2dcc85402aa661a0af1a
+size 234705
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2178.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2178.png
new file mode 100644
index 0000000000000000000000000000000000000000..5e7985163f1ee00004488945db4a241138c893ed
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2178.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3cfb1a6dd3425ed703798e97f0b0e308f9491cbf70be7b3a49f6b54de42a0f30
+size 224928
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2180.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2180.png
new file mode 100644
index 0000000000000000000000000000000000000000..ab7e029f90fb945fc228d86212833ea22246998e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2180.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:34489ed03d691124bada34b26cb717ae0ff9938ba979911e1dacebfda3556663
+size 197868
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2182.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2182.png
new file mode 100644
index 0000000000000000000000000000000000000000..4265d264ab9dfecb5b071ae9c62155ce2dd0136b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2182.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:993c72eb29f185043223dc5c913180c9509ecde8c478fc25a099958194db6341
+size 227802
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2184.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2184.png
new file mode 100644
index 0000000000000000000000000000000000000000..47122bf8fca0cd8490bb7394801b0e07bb40a1b5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2184.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cc94a16ce803208c910b644ffcaa3099960a4394374d9129d0fd64229ce51324
+size 193773
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2186.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2186.png
new file mode 100644
index 0000000000000000000000000000000000000000..90a0a4714525e01e386b294c2000ea90108ce5e1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2186.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:95bc269eafae18b70f3e60aac021489ba16e8918ccc11b8dbd07e02e92eae753
+size 244529
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2188.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2188.png
new file mode 100644
index 0000000000000000000000000000000000000000..f9879cb66f5f25fc7b1b83329b269694d01f4676
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2188.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c22a98ab70cb161809f339eaeebac34d510151e4a65071dde467735ed5f590cc
+size 235904
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2190.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2190.png
new file mode 100644
index 0000000000000000000000000000000000000000..2bae0cf2fcdeb95d1b5d697aa59577558c08c70f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2190.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6686668d7170780ec02638765026968de33a7d4fea88a1c897082b7fc965cb4e
+size 209180
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2192.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2192.png
new file mode 100644
index 0000000000000000000000000000000000000000..222579ebd6d071af91f6e42f34b224d0f1fac9ac
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2192.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d4ce0ee04002d1be7fddf396fdc45466470a0f77fcd9c1521ed5f79815f31015
+size 222616
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2194.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2194.png
new file mode 100644
index 0000000000000000000000000000000000000000..1648df6982cb86706d3d4eb8768c0ce48c0c6aa1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2194.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:982b30386083ad892c2193ec66b8f16ec8da38982e3ef9be5716ce358cabeeb9
+size 225995
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2196.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2196.png
new file mode 100644
index 0000000000000000000000000000000000000000..3ec90330799f6699010f40aa3102f9eb7862f269
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2196.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a5be4bdf0e00a785472e7b281de685b68f07e10a439830df4b410a4c241c9fab
+size 188750
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2198.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2198.png
new file mode 100644
index 0000000000000000000000000000000000000000..ed9729428e8c4059588abe032b154dea49feca4a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2198.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bfcdcc0aa2b5747eb8e8d8207bfb920bc70a943d5776829af03c111e5ca26ec3
+size 183694
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2200.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2200.png
new file mode 100644
index 0000000000000000000000000000000000000000..90a6fe5d2d9c536c7ef7195e13f60982becfffe5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2200.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a944a6e350672393c6fe8086a98f3fea5c58418777f845bd02d09fb9b7c29558
+size 241889
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2202.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2202.png
new file mode 100644
index 0000000000000000000000000000000000000000..80bedce98f9194bca0b68f52ad672b15722fa464
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2202.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2cafda09500953efeb737984653a9044b816fdde47bd3e40197c785d590519e8
+size 253130
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2204.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2204.png
new file mode 100644
index 0000000000000000000000000000000000000000..d7d327513940b00376ba9c339babbaf234f632b5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2204.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3cb5bb0320a7b4f5c419deee1d8df72f4b11f671dedec2aea1fa9a63fd5d13bf
+size 221103
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2206.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2206.png
new file mode 100644
index 0000000000000000000000000000000000000000..2bb97f2d039639f4c70c5157ef085bc0700e3d68
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2206.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:728717bf8c918f44ae5cf90ad32717eba3fdd6687ceddd59a5415c3f4b4b1a89
+size 160447
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2208.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2208.png
new file mode 100644
index 0000000000000000000000000000000000000000..5a653683a79733cd4de9996643fcb2f2604c79ff
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2208.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4635a539c22f0649259be4359b0f0750759e2a4ef90edeee8e5172070ca7d2fe
+size 213369
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2210.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2210.png
new file mode 100644
index 0000000000000000000000000000000000000000..d0afc752f6774d84470aaefe15782baa16887169
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2210.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:087b93621721705468cd9eb8c081e7a5d8bf3498e2162ffc1976415326e12f94
+size 165586
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2212.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2212.png
new file mode 100644
index 0000000000000000000000000000000000000000..8cc9c0072746a553d371e249066126e98d890ad3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2212.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d49f1b501315312711a0973c9ffebfdda74fbd388996788c005e367ed77ff026
+size 181526
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2214.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2214.png
new file mode 100644
index 0000000000000000000000000000000000000000..d863f62d3987ada277a91d940b60f5f812813ee6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2214.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ebe87e7a7751e3b5ce66ad10c5b6a393a56f809c2f056356cd68a058b9de7bf9
+size 199430
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2216.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2216.png
new file mode 100644
index 0000000000000000000000000000000000000000..1893820b039c421b4bac7f26a1182da803bad093
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2216.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dc5490c0a31ad32a32530ec22fa58a07b2fc8982c28a8fc99a3329f20036ba99
+size 170397
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2218.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2218.png
new file mode 100644
index 0000000000000000000000000000000000000000..be98183f3449ffd815a344d5072b537c08e8d41a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2218.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f652814eea7fb9cfef56ea1b3db8800242f9730d70b6f2199bd365cef0b8a60a
+size 200555
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2220.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2220.png
new file mode 100644
index 0000000000000000000000000000000000000000..708c023c28acd8aa6d3125a4c27a6cdde8d38a66
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2220.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6bf96718efbe987b42b84f24fa53a9d6d32f5e48498d7daf9ac1dfd52c1f4303
+size 161864
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2222.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2222.png
new file mode 100644
index 0000000000000000000000000000000000000000..383e2cfd88ac05f3a1f08dff464f380508859553
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2222.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c2d8fef101f984ea92f1ee2fa67aee22b22e4e46217b5304a5db690c10d219aa
+size 198835
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2224.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2224.png
new file mode 100644
index 0000000000000000000000000000000000000000..1a8095ef7c877b6161e88eae1e1bf0f4315b2989
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2224.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bc82cdc7bcc732ec011adec8c51f631ac4ac4f8d42124872e33e4a4ec94cba65
+size 156985
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2226.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2226.png
new file mode 100644
index 0000000000000000000000000000000000000000..3c7783a18b5cf1e45696cf72027cc310cee9ce9d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2226.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bdc55d91c0ee3a5b84c0012f98f9d75c87b8f14c3514f9172c000dff15101507
+size 215350
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2228.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2228.png
new file mode 100644
index 0000000000000000000000000000000000000000..c46a87265e4f3d5e6bf084e068c9a86f886bad95
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2228.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:97abb15b7a558a23523b95861dee89d98ea2781a5d3d97a00d4ed29e08c68be4
+size 237727
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2230.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2230.png
new file mode 100644
index 0000000000000000000000000000000000000000..53ebbedee04d8cb95c65f9b06081ab802d0e55e1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2230.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:898697995c3ab893aec918183371df1043ff6fad1a2546c5fd762ba754cc40f5
+size 195904
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2232.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2232.png
new file mode 100644
index 0000000000000000000000000000000000000000..af5796f9be1fbb5b9b549698a1f1e4dbc577c008
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2232.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b4215092f94fd9f3b826704116ab69949978839004b532e771727ad44e889f92
+size 230261
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2234.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2234.png
new file mode 100644
index 0000000000000000000000000000000000000000..9d940b8d77b5b3083c161e03a119714b61917282
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2234.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bcfd23ce9e55d85baa492107dc796c7a1fc5cbba3812155722635a7bd826878f
+size 199377
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2236.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2236.png
new file mode 100644
index 0000000000000000000000000000000000000000..50e5e27a03cf8ae749366daec16e19616ce58114
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2236.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b80febdaeb743340dcebc2489d846786ff163498f80a6405a9aa17bea0a54b9a
+size 192242
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2238.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2238.png
new file mode 100644
index 0000000000000000000000000000000000000000..be31fc4b1b3ba8e91efb3e64021485065742ace6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2238.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9e69f10c84a9f5cd7627cdfd0ffe46c7398af943c70f138c08ee9bc258bcdc02
+size 230537
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2240.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2240.png
new file mode 100644
index 0000000000000000000000000000000000000000..5a9ec24f348ffa53a9671d872402198ec2e5a56f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2240.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:77ce497124e4dca722a8c8981de451c9f02114fad947d7bf09c54c82807931de
+size 219515
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2242.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2242.png
new file mode 100644
index 0000000000000000000000000000000000000000..5e62c15c3c33c950e1c3cb25aa746706612d9acb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2242.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5bd89eb6588de798f2ff4a4bb00d469874cd77b425ee6e8e59b95f40e653a16f
+size 237065
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2244.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2244.png
new file mode 100644
index 0000000000000000000000000000000000000000..362fea39e98666083489ca7a53e6cf2e08474e88
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2244.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6b49599c79d50d945cdf50a21a007666fd68efcec680c0b5e9c581d6bf710f4c
+size 222679
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2246.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2246.png
new file mode 100644
index 0000000000000000000000000000000000000000..b0d2afaec360dd915805ce7babd2e28e1cbcbabd
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2246.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d32947c389b47eee37d487d4f63d9bf13a03778269e18510e510de787973b66b
+size 233086
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2248.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2248.png
new file mode 100644
index 0000000000000000000000000000000000000000..adfc07bf59e458759ee471202cdb954b273da9d8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2248.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ff7c3d4644bb64e515820b318d35efad102e2a84f4293133d4b642caac35f02e
+size 211534
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2250.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2250.png
new file mode 100644
index 0000000000000000000000000000000000000000..a8bdd5d04c598e40d73727864c6405cbbc24b797
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2250.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3bec5766bf17d7e2cfdfd98170e2e533a2a41ac7d326e09e77cdcb6becce67bb
+size 187382
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2252.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2252.png
new file mode 100644
index 0000000000000000000000000000000000000000..3ace6640733d4fe4a0fc61f697b9bd80421138e2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2252.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1d8a699e837a02b03aa19c1af3e400f6af8f4ef6f3e2b78a429ef78f05a74a87
+size 194547
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2254.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2254.png
new file mode 100644
index 0000000000000000000000000000000000000000..f42f6aebba2d5cd780605d03ce645868a51787bc
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2254.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:489685f80b73feac1362abc2b72963a67848e637b0c6049eb65a9f3e0ba7479a
+size 244107
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2256.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2256.png
new file mode 100644
index 0000000000000000000000000000000000000000..b01ecf1f7f79d488744f2dea4a06d9c4ff42f986
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2256.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:70e7fc2a2e864253750be12b1e5e72dbb8f29de69c2af1e5e3da422778346709
+size 198470
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2258.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2258.png
new file mode 100644
index 0000000000000000000000000000000000000000..903ac795ab9a08334de10d6093375bba4eead94d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2258.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d5ed374b065b338c59a200237a49859557053732fd432eddb7a12e4a5379dcf6
+size 223179
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2260.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2260.png
new file mode 100644
index 0000000000000000000000000000000000000000..0cbc6230418e08954458700a1ef2d7af1e3c9663
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2260.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6d94afc08088e806fedd5f2b5a87fdda4ead17f5886c95316cae568b483e82fc
+size 239555
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2262.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2262.png
new file mode 100644
index 0000000000000000000000000000000000000000..9c04785fb3dc582e28efdfa859b7f95892626515
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2262.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2faab7f0c58c45134fb57069441de19f333141ea6394c0141f2b17885176a061
+size 196300
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/Longest_Word_No_Start.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/Longest_Word_No_Start.json
new file mode 100644
index 0000000000000000000000000000000000000000..d6b00c34e6c920f30d618bb33d615c072f458370
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/Longest_Word_No_Start.json
@@ -0,0 +1,12322 @@
+[
+    {
+        "id": "global_000",
+        "task": "global_longest_word_discovery",
+        "target_word": "CONSIDERATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 13,
+        "grid_size": 10,
+        "grid_layout": [
+            [
+                "Q",
+                "U",
+                "T",
+                "A",
+                "S",
+                "V",
+                "O",
+                "W",
+                "X",
+                "G"
+            ],
+            [
+                "W",
+                "M",
+                "X",
+                "W",
+                "L",
+                "L",
+                "T",
+                "H",
+                "S",
+                "V"
+            ],
+            [
+                "C",
+                "O",
+                "N",
+                "S",
+                "Y",
+                "B",
+                "S",
+                "D",
+                "W",
+                "N"
+            ],
+            [
+                "Q",
+                "F",
+                "R",
+                "I",
+                "Y",
+                "C",
+                "N",
+                "I",
+                "J",
+                "Z"
+            ],
+            [
+                "G",
+                "R",
+                "X",
+                "D",
+                "G",
+                "C",
+                "S",
+                "E",
+                "Q",
+                "B"
+            ],
+            [
+                "Y",
+                "Q",
+                "Z",
+                "E",
+                "R",
+                "G",
+                "F",
+                "P",
+                "B",
+                "V"
+            ],
+            [
+                "P",
+                "U",
+                "V",
+                "C",
+                "A",
+                "J",
+                "N",
+                "V",
+                "L",
+                "E"
+            ],
+            [
+                "P",
+                "A",
+                "I",
+                "J",
+                "T",
+                "I",
+                "O",
+                "P",
+                "P",
+                "F"
+            ],
+            [
+                "J",
+                "Y",
+                "B",
+                "Y",
+                "N",
+                "Z",
+                "N",
+                "X",
+                "G",
+                "U"
+            ],
+            [
+                "Z",
+                "A",
+                "D",
+                "F",
+                "W",
+                "B",
+                "X",
+                "I",
+                "J",
+                "T"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                0
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                8,
+                6
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_000_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_000_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_000_input.jpg",
+        "save_id": 2164,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is CONSIDERATION, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2164.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_002",
+        "task": "global_longest_word_discovery",
+        "target_word": "CONTRIBUTION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "D",
+                "Y",
+                "P",
+                "P",
+                "W",
+                "J",
+                "B",
+                "N",
+                "Y",
+                "K",
+                "O"
+            ],
+            [
+                "Y",
+                "N",
+                "D",
+                "D",
+                "Y",
+                "C",
+                "B",
+                "U",
+                "G",
+                "Z",
+                "O"
+            ],
+            [
+                "E",
+                "D",
+                "G",
+                "K",
+                "D",
+                "I",
+                "J",
+                "D",
+                "V",
+                "B",
+                "A"
+            ],
+            [
+                "P",
+                "Y",
+                "B",
+                "T",
+                "M",
+                "F",
+                "D",
+                "T",
+                "M",
+                "F",
+                "W"
+            ],
+            [
+                "F",
+                "B",
+                "O",
+                "G",
+                "O",
+                "C",
+                "O",
+                "N",
+                "F",
+                "F",
+                "B"
+            ],
+            [
+                "V",
+                "V",
+                "O",
+                "H",
+                "D",
+                "Q",
+                "C",
+                "T",
+                "Z",
+                "K",
+                "S"
+            ],
+            [
+                "S",
+                "P",
+                "U",
+                "X",
+                "C",
+                "D",
+                "Q",
+                "R",
+                "W",
+                "R",
+                "F"
+            ],
+            [
+                "Z",
+                "T",
+                "A",
+                "W",
+                "R",
+                "S",
+                "F",
+                "I",
+                "B",
+                "J",
+                "K"
+            ],
+            [
+                "T",
+                "F",
+                "I",
+                "D",
+                "B",
+                "Z",
+                "Q",
+                "Q",
+                "U",
+                "T",
+                "I"
+            ],
+            [
+                "U",
+                "N",
+                "T",
+                "D",
+                "F",
+                "B",
+                "T",
+                "S",
+                "O",
+                "T",
+                "O"
+            ],
+            [
+                "M",
+                "R",
+                "V",
+                "H",
+                "V",
+                "B",
+                "D",
+                "X",
+                "N",
+                "X",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                8,
+                10
+            ],
+            [
+                9,
+                10
+            ],
+            [
+                10,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_002_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_002_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_002_input.jpg",
+        "save_id": 2166,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is CONTRIBUTION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2166.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_004",
+        "task": "global_longest_word_discovery",
+        "target_word": "ACCOMPLISHMENT",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 14,
+        "grid_layout": [
+            [
+                "M",
+                "X",
+                "U",
+                "A",
+                "E",
+                "J",
+                "O",
+                "Y",
+                "A",
+                "V",
+                "R",
+                "Z",
+                "N",
+                "K"
+            ],
+            [
+                "N",
+                "X",
+                "Y",
+                "Y",
+                "M",
+                "F",
+                "Y",
+                "A",
+                "F",
+                "W",
+                "W",
+                "W",
+                "H",
+                "S"
+            ],
+            [
+                "T",
+                "Z",
+                "G",
+                "I",
+                "H",
+                "B",
+                "C",
+                "X",
+                "F",
+                "J",
+                "M",
+                "M",
+                "V",
+                "V"
+            ],
+            [
+                "G",
+                "C",
+                "M",
+                "Y",
+                "R",
+                "Q",
+                "D",
+                "F",
+                "B",
+                "V",
+                "U",
+                "H",
+                "G",
+                "M"
+            ],
+            [
+                "B",
+                "U",
+                "J",
+                "V",
+                "A",
+                "C",
+                "C",
+                "O",
+                "M",
+                "N",
+                "V",
+                "U",
+                "P",
+                "Q"
+            ],
+            [
+                "P",
+                "L",
+                "S",
+                "Z",
+                "V",
+                "N",
+                "T",
+                "P",
+                "P",
+                "L",
+                "E",
+                "Y",
+                "L",
+                "M"
+            ],
+            [
+                "T",
+                "G",
+                "Z",
+                "W",
+                "Z",
+                "S",
+                "V",
+                "I",
+                "I",
+                "I",
+                "S",
+                "V",
+                "K",
+                "O"
+            ],
+            [
+                "C",
+                "O",
+                "X",
+                "H",
+                "T",
+                "R",
+                "D",
+                "U",
+                "I",
+                "G",
+                "H",
+                "J",
+                "X",
+                "Q"
+            ],
+            [
+                "X",
+                "C",
+                "V",
+                "W",
+                "Z",
+                "E",
+                "E",
+                "J",
+                "P",
+                "P",
+                "M",
+                "F",
+                "H",
+                "X"
+            ],
+            [
+                "L",
+                "F",
+                "M",
+                "J",
+                "R",
+                "N",
+                "D",
+                "J",
+                "U",
+                "Z",
+                "E",
+                "N",
+                "T",
+                "M"
+            ],
+            [
+                "W",
+                "Q",
+                "U",
+                "G",
+                "D",
+                "N",
+                "O",
+                "D",
+                "S",
+                "U",
+                "N",
+                "O",
+                "R",
+                "S"
+            ],
+            [
+                "P",
+                "T",
+                "N",
+                "S",
+                "A",
+                "Y",
+                "H",
+                "A",
+                "V",
+                "A",
+                "T",
+                "Q",
+                "V",
+                "D"
+            ],
+            [
+                "W",
+                "N",
+                "J",
+                "D",
+                "X",
+                "C",
+                "N",
+                "A",
+                "H",
+                "T",
+                "X",
+                "G",
+                "U",
+                "E"
+            ],
+            [
+                "L",
+                "X",
+                "U",
+                "V",
+                "G",
+                "Z",
+                "D",
+                "N",
+                "R",
+                "F",
+                "Y",
+                "P",
+                "V",
+                "T"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                6,
+                10
+            ],
+            [
+                7,
+                10
+            ],
+            [
+                8,
+                10
+            ],
+            [
+                9,
+                10
+            ],
+            [
+                10,
+                10
+            ],
+            [
+                11,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_004_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_004_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_004_input.jpg",
+        "save_id": 2168,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ACCOMPLISHMENT, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2168.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_006",
+        "task": "global_longest_word_discovery",
+        "target_word": "TELECOMMUNICATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 17,
+        "grid_size": 13,
+        "grid_layout": [
+            [
+                "B",
+                "T",
+                "H",
+                "K",
+                "C",
+                "S",
+                "Y",
+                "I",
+                "Y",
+                "W",
+                "R",
+                "A",
+                "K"
+            ],
+            [
+                "Q",
+                "I",
+                "W",
+                "L",
+                "L",
+                "Q",
+                "Z",
+                "B",
+                "T",
+                "A",
+                "F",
+                "O",
+                "O"
+            ],
+            [
+                "N",
+                "X",
+                "M",
+                "Z",
+                "I",
+                "P",
+                "H",
+                "L",
+                "X",
+                "B",
+                "A",
+                "W",
+                "B"
+            ],
+            [
+                "D",
+                "L",
+                "K",
+                "H",
+                "O",
+                "Q",
+                "G",
+                "W",
+                "Q",
+                "R",
+                "P",
+                "B",
+                "P"
+            ],
+            [
+                "S",
+                "T",
+                "A",
+                "G",
+                "Q",
+                "P",
+                "B",
+                "B",
+                "U",
+                "A",
+                "B",
+                "N",
+                "R"
+            ],
+            [
+                "V",
+                "J",
+                "Q",
+                "L",
+                "D",
+                "O",
+                "B",
+                "S",
+                "D",
+                "A",
+                "Y",
+                "O",
+                "M"
+            ],
+            [
+                "D",
+                "F",
+                "L",
+                "X",
+                "B",
+                "D",
+                "T",
+                "T",
+                "Z",
+                "G",
+                "V",
+                "C",
+                "Q"
+            ],
+            [
+                "D",
+                "R",
+                "D",
+                "E",
+                "D",
+                "H",
+                "V",
+                "U",
+                "P",
+                "N",
+                "M",
+                "L",
+                "U"
+            ],
+            [
+                "T",
+                "E",
+                "L",
+                "E",
+                "P",
+                "K",
+                "H",
+                "Z",
+                "R",
+                "C",
+                "I",
+                "H",
+                "Y"
+            ],
+            [
+                "U",
+                "K",
+                "P",
+                "C",
+                "E",
+                "B",
+                "V",
+                "K",
+                "H",
+                "V",
+                "N",
+                "V",
+                "A"
+            ],
+            [
+                "O",
+                "L",
+                "X",
+                "O",
+                "M",
+                "G",
+                "Q",
+                "J",
+                "F",
+                "T",
+                "U",
+                "R",
+                "Q"
+            ],
+            [
+                "M",
+                "V",
+                "Z",
+                "G",
+                "M",
+                "U",
+                "N",
+                "I",
+                "C",
+                "A",
+                "T",
+                "I",
+                "O"
+            ],
+            [
+                "E",
+                "N",
+                "A",
+                "W",
+                "Z",
+                "N",
+                "V",
+                "U",
+                "F",
+                "H",
+                "V",
+                "B",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                8,
+                0
+            ],
+            [
+                8,
+                1
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                9,
+                3
+            ],
+            [
+                10,
+                3
+            ],
+            [
+                10,
+                4
+            ],
+            [
+                11,
+                4
+            ],
+            [
+                11,
+                5
+            ],
+            [
+                11,
+                6
+            ],
+            [
+                11,
+                7
+            ],
+            [
+                11,
+                8
+            ],
+            [
+                11,
+                9
+            ],
+            [
+                11,
+                10
+            ],
+            [
+                11,
+                11
+            ],
+            [
+                11,
+                12
+            ],
+            [
+                12,
+                12
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_006_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_006_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_006_input.jpg",
+        "save_id": 2170,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is TELECOMMUNICATION, length 17.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2170.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_008",
+        "task": "global_longest_word_discovery",
+        "target_word": "FORESHADOWING",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 13,
+        "grid_size": 12,
+        "grid_layout": [
+            [
+                "B",
+                "R",
+                "O",
+                "L",
+                "K",
+                "S",
+                "L",
+                "S",
+                "C",
+                "B",
+                "R",
+                "V"
+            ],
+            [
+                "N",
+                "T",
+                "D",
+                "M",
+                "M",
+                "S",
+                "H",
+                "L",
+                "Z",
+                "L",
+                "Z",
+                "G"
+            ],
+            [
+                "D",
+                "B",
+                "R",
+                "H",
+                "L",
+                "N",
+                "K",
+                "Z",
+                "B",
+                "N",
+                "M",
+                "T"
+            ],
+            [
+                "N",
+                "O",
+                "T",
+                "S",
+                "F",
+                "O",
+                "Z",
+                "I",
+                "I",
+                "U",
+                "R",
+                "S"
+            ],
+            [
+                "T",
+                "N",
+                "F",
+                "S",
+                "Z",
+                "R",
+                "Y",
+                "G",
+                "Y",
+                "N",
+                "M",
+                "O"
+            ],
+            [
+                "B",
+                "B",
+                "C",
+                "X",
+                "F",
+                "E",
+                "S",
+                "G",
+                "C",
+                "K",
+                "N",
+                "K"
+            ],
+            [
+                "A",
+                "Y",
+                "M",
+                "K",
+                "E",
+                "Y",
+                "H",
+                "A",
+                "D",
+                "O",
+                "I",
+                "Q"
+            ],
+            [
+                "L",
+                "X",
+                "Z",
+                "F",
+                "T",
+                "U",
+                "T",
+                "A",
+                "X",
+                "W",
+                "I",
+                "T"
+            ],
+            [
+                "T",
+                "T",
+                "D",
+                "W",
+                "J",
+                "M",
+                "I",
+                "L",
+                "S",
+                "D",
+                "N",
+                "G"
+            ],
+            [
+                "Y",
+                "U",
+                "T",
+                "Y",
+                "J",
+                "T",
+                "B",
+                "W",
+                "A",
+                "H",
+                "S",
+                "Z"
+            ],
+            [
+                "O",
+                "X",
+                "A",
+                "T",
+                "I",
+                "H",
+                "Z",
+                "G",
+                "Y",
+                "P",
+                "I",
+                "G"
+            ],
+            [
+                "R",
+                "F",
+                "R",
+                "T",
+                "D",
+                "N",
+                "J",
+                "W",
+                "I",
+                "B",
+                "L",
+                "P"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                7,
+                10
+            ],
+            [
+                8,
+                10
+            ],
+            [
+                8,
+                11
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_008_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_008_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_008_input.jpg",
+        "save_id": 2172,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is FORESHADOWING, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2172.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_010",
+        "task": "global_longest_word_discovery",
+        "target_word": "INTERPRETATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "L",
+                "V",
+                "N",
+                "B",
+                "Z",
+                "O",
+                "I",
+                "J",
+                "E",
+                "X",
+                "P"
+            ],
+            [
+                "S",
+                "R",
+                "T",
+                "G",
+                "Y",
+                "K",
+                "I",
+                "N",
+                "T",
+                "C",
+                "G"
+            ],
+            [
+                "V",
+                "S",
+                "R",
+                "P",
+                "V",
+                "U",
+                "Q",
+                "Q",
+                "E",
+                "R",
+                "P"
+            ],
+            [
+                "E",
+                "O",
+                "Y",
+                "M",
+                "K",
+                "R",
+                "X",
+                "G",
+                "B",
+                "B",
+                "R"
+            ],
+            [
+                "D",
+                "X",
+                "U",
+                "I",
+                "S",
+                "R",
+                "Z",
+                "C",
+                "E",
+                "R",
+                "E"
+            ],
+            [
+                "C",
+                "N",
+                "Q",
+                "Q",
+                "Z",
+                "Q",
+                "L",
+                "G",
+                "W",
+                "J",
+                "T"
+            ],
+            [
+                "G",
+                "H",
+                "P",
+                "J",
+                "U",
+                "S",
+                "E",
+                "Q",
+                "V",
+                "X",
+                "A"
+            ],
+            [
+                "N",
+                "D",
+                "K",
+                "L",
+                "E",
+                "S",
+                "Z",
+                "S",
+                "I",
+                "N",
+                "T"
+            ],
+            [
+                "W",
+                "V",
+                "L",
+                "A",
+                "U",
+                "T",
+                "S",
+                "C",
+                "Y",
+                "V",
+                "I"
+            ],
+            [
+                "O",
+                "Y",
+                "J",
+                "T",
+                "W",
+                "I",
+                "F",
+                "L",
+                "W",
+                "O",
+                "O"
+            ],
+            [
+                "F",
+                "Y",
+                "D",
+                "I",
+                "D",
+                "I",
+                "X",
+                "C",
+                "A",
+                "F",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                1,
+                8
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                2,
+                9
+            ],
+            [
+                2,
+                10
+            ],
+            [
+                3,
+                10
+            ],
+            [
+                4,
+                10
+            ],
+            [
+                5,
+                10
+            ],
+            [
+                6,
+                10
+            ],
+            [
+                7,
+                10
+            ],
+            [
+                8,
+                10
+            ],
+            [
+                9,
+                10
+            ],
+            [
+                10,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_010_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_010_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_010_input.jpg",
+        "save_id": 2174,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is INTERPRETATION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2174.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_012",
+        "task": "global_longest_word_discovery",
+        "target_word": "ADMINISTRATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 14,
+        "grid_layout": [
+            [
+                "P",
+                "K",
+                "Y",
+                "F",
+                "P",
+                "Q",
+                "S",
+                "S",
+                "M",
+                "P",
+                "N",
+                "B",
+                "C",
+                "H"
+            ],
+            [
+                "T",
+                "G",
+                "W",
+                "Y",
+                "S",
+                "P",
+                "M",
+                "J",
+                "W",
+                "R",
+                "V",
+                "J",
+                "U",
+                "X"
+            ],
+            [
+                "Z",
+                "E",
+                "D",
+                "Q",
+                "J",
+                "K",
+                "C",
+                "R",
+                "C",
+                "K",
+                "M",
+                "W",
+                "K",
+                "C"
+            ],
+            [
+                "I",
+                "V",
+                "K",
+                "R",
+                "H",
+                "L",
+                "W",
+                "X",
+                "A",
+                "J",
+                "A",
+                "D",
+                "M",
+                "O"
+            ],
+            [
+                "H",
+                "H",
+                "N",
+                "M",
+                "Q",
+                "K",
+                "E",
+                "S",
+                "V",
+                "Q",
+                "D",
+                "E",
+                "I",
+                "C"
+            ],
+            [
+                "C",
+                "N",
+                "W",
+                "G",
+                "S",
+                "L",
+                "E",
+                "M",
+                "Z",
+                "L",
+                "F",
+                "H",
+                "N",
+                "I"
+            ],
+            [
+                "G",
+                "N",
+                "O",
+                "O",
+                "M",
+                "B",
+                "Z",
+                "K",
+                "W",
+                "T",
+                "J",
+                "O",
+                "G",
+                "S"
+            ],
+            [
+                "O",
+                "P",
+                "W",
+                "D",
+                "E",
+                "L",
+                "H",
+                "X",
+                "R",
+                "G",
+                "V",
+                "Y",
+                "X",
+                "T"
+            ],
+            [
+                "U",
+                "Z",
+                "E",
+                "Q",
+                "M",
+                "W",
+                "B",
+                "B",
+                "G",
+                "Z",
+                "R",
+                "C",
+                "T",
+                "R"
+            ],
+            [
+                "V",
+                "F",
+                "Y",
+                "R",
+                "R",
+                "W",
+                "B",
+                "S",
+                "J",
+                "A",
+                "N",
+                "E",
+                "G",
+                "A"
+            ],
+            [
+                "O",
+                "K",
+                "R",
+                "Q",
+                "R",
+                "X",
+                "S",
+                "R",
+                "P",
+                "I",
+                "N",
+                "R",
+                "I",
+                "T"
+            ],
+            [
+                "L",
+                "X",
+                "A",
+                "R",
+                "A",
+                "Y",
+                "A",
+                "I",
+                "T",
+                "B",
+                "H",
+                "N",
+                "C",
+                "I"
+            ],
+            [
+                "Q",
+                "V",
+                "V",
+                "Y",
+                "U",
+                "E",
+                "E",
+                "F",
+                "W",
+                "D",
+                "A",
+                "H",
+                "Y",
+                "O"
+            ],
+            [
+                "O",
+                "C",
+                "B",
+                "C",
+                "F",
+                "Z",
+                "G",
+                "L",
+                "F",
+                "B",
+                "G",
+                "I",
+                "B",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                10
+            ],
+            [
+                3,
+                11
+            ],
+            [
+                3,
+                12
+            ],
+            [
+                4,
+                12
+            ],
+            [
+                5,
+                12
+            ],
+            [
+                5,
+                13
+            ],
+            [
+                6,
+                13
+            ],
+            [
+                7,
+                13
+            ],
+            [
+                8,
+                13
+            ],
+            [
+                9,
+                13
+            ],
+            [
+                10,
+                13
+            ],
+            [
+                11,
+                13
+            ],
+            [
+                12,
+                13
+            ],
+            [
+                13,
+                13
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_012_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_012_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_012_input.jpg",
+        "save_id": 2176,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ADMINISTRATION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2176.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_014",
+        "task": "global_longest_word_discovery",
+        "target_word": "APPRECIATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 12,
+        "grid_layout": [
+            [
+                "M",
+                "B",
+                "G",
+                "M",
+                "R",
+                "D",
+                "N",
+                "O",
+                "W",
+                "A",
+                "M",
+                "G"
+            ],
+            [
+                "K",
+                "W",
+                "D",
+                "A",
+                "U",
+                "N",
+                "Z",
+                "T",
+                "K",
+                "E",
+                "Y",
+                "O"
+            ],
+            [
+                "F",
+                "U",
+                "R",
+                "M",
+                "J",
+                "X",
+                "J",
+                "Q",
+                "B",
+                "Z",
+                "L",
+                "A"
+            ],
+            [
+                "R",
+                "H",
+                "Z",
+                "A",
+                "F",
+                "X",
+                "J",
+                "Q",
+                "J",
+                "V",
+                "G",
+                "Q"
+            ],
+            [
+                "G",
+                "H",
+                "Q",
+                "F",
+                "E",
+                "L",
+                "V",
+                "M",
+                "S",
+                "H",
+                "V",
+                "M"
+            ],
+            [
+                "T",
+                "B",
+                "Y",
+                "L",
+                "Y",
+                "U",
+                "G",
+                "K",
+                "F",
+                "P",
+                "F",
+                "V"
+            ],
+            [
+                "P",
+                "M",
+                "S",
+                "A",
+                "P",
+                "P",
+                "R",
+                "E",
+                "P",
+                "E",
+                "J",
+                "M"
+            ],
+            [
+                "H",
+                "N",
+                "C",
+                "A",
+                "O",
+                "C",
+                "K",
+                "C",
+                "N",
+                "W",
+                "I",
+                "E"
+            ],
+            [
+                "J",
+                "D",
+                "O",
+                "H",
+                "G",
+                "X",
+                "A",
+                "I",
+                "Z",
+                "V",
+                "P",
+                "X"
+            ],
+            [
+                "H",
+                "P",
+                "X",
+                "U",
+                "G",
+                "L",
+                "X",
+                "A",
+                "T",
+                "I",
+                "B",
+                "B"
+            ],
+            [
+                "A",
+                "O",
+                "V",
+                "N",
+                "W",
+                "V",
+                "U",
+                "P",
+                "N",
+                "O",
+                "N",
+                "J"
+            ],
+            [
+                "I",
+                "G",
+                "F",
+                "W",
+                "R",
+                "S",
+                "D",
+                "X",
+                "Y",
+                "N",
+                "J",
+                "K"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                6,
+                3
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                9,
+                9
+            ],
+            [
+                10,
+                9
+            ],
+            [
+                11,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_014_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_014_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_014_input.jpg",
+        "save_id": 2178,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is APPRECIATION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2178.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_016",
+        "task": "global_longest_word_discovery",
+        "target_word": "REQUIREMENT",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 11,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "G",
+                "R",
+                "E",
+                "V",
+                "X",
+                "T",
+                "S",
+                "G",
+                "X",
+                "J",
+                "X"
+            ],
+            [
+                "S",
+                "B",
+                "Q",
+                "I",
+                "F",
+                "J",
+                "Q",
+                "E",
+                "K",
+                "X",
+                "A"
+            ],
+            [
+                "A",
+                "K",
+                "U",
+                "Z",
+                "W",
+                "F",
+                "S",
+                "S",
+                "W",
+                "J",
+                "F"
+            ],
+            [
+                "T",
+                "M",
+                "I",
+                "M",
+                "V",
+                "P",
+                "T",
+                "E",
+                "U",
+                "Q",
+                "M"
+            ],
+            [
+                "D",
+                "J",
+                "R",
+                "E",
+                "O",
+                "I",
+                "U",
+                "Z",
+                "O",
+                "O",
+                "O"
+            ],
+            [
+                "T",
+                "E",
+                "R",
+                "M",
+                "E",
+                "N",
+                "T",
+                "Q",
+                "O",
+                "P",
+                "D"
+            ],
+            [
+                "O",
+                "Z",
+                "R",
+                "M",
+                "H",
+                "E",
+                "X",
+                "I",
+                "F",
+                "W",
+                "N"
+            ],
+            [
+                "X",
+                "D",
+                "I",
+                "J",
+                "T",
+                "X",
+                "F",
+                "K",
+                "M",
+                "U",
+                "V"
+            ],
+            [
+                "B",
+                "R",
+                "L",
+                "X",
+                "C",
+                "C",
+                "N",
+                "Z",
+                "N",
+                "Y",
+                "M"
+            ],
+            [
+                "X",
+                "J",
+                "W",
+                "Z",
+                "U",
+                "N",
+                "S",
+                "C",
+                "A",
+                "Z",
+                "K"
+            ],
+            [
+                "P",
+                "V",
+                "U",
+                "F",
+                "J",
+                "D",
+                "Y",
+                "N",
+                "P",
+                "M",
+                "S"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                1
+            ],
+            [
+                0,
+                2
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_016_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_016_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_016_input.jpg",
+        "save_id": 2180,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is REQUIREMENT, length 11.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2180.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_018",
+        "task": "global_longest_word_discovery",
+        "target_word": "ESTABLISHMENT",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 13,
+        "grid_size": 13,
+        "grid_layout": [
+            [
+                "U",
+                "N",
+                "B",
+                "C",
+                "A",
+                "N",
+                "E",
+                "D",
+                "C",
+                "D",
+                "E",
+                "R",
+                "C"
+            ],
+            [
+                "S",
+                "Y",
+                "M",
+                "X",
+                "Y",
+                "J",
+                "D",
+                "Y",
+                "L",
+                "Q",
+                "R",
+                "F",
+                "S"
+            ],
+            [
+                "O",
+                "L",
+                "X",
+                "Q",
+                "P",
+                "G",
+                "C",
+                "K",
+                "R",
+                "B",
+                "H",
+                "X",
+                "R"
+            ],
+            [
+                "X",
+                "C",
+                "V",
+                "V",
+                "U",
+                "N",
+                "F",
+                "R",
+                "L",
+                "O",
+                "R",
+                "T",
+                "S"
+            ],
+            [
+                "E",
+                "R",
+                "P",
+                "N",
+                "A",
+                "M",
+                "Z",
+                "X",
+                "Y",
+                "T",
+                "E",
+                "Q",
+                "I"
+            ],
+            [
+                "S",
+                "D",
+                "S",
+                "Y",
+                "Z",
+                "D",
+                "D",
+                "A",
+                "Z",
+                "C",
+                "R",
+                "I",
+                "Q"
+            ],
+            [
+                "T",
+                "X",
+                "Z",
+                "C",
+                "E",
+                "I",
+                "Y",
+                "D",
+                "J",
+                "A",
+                "Y",
+                "D",
+                "I"
+            ],
+            [
+                "A",
+                "J",
+                "H",
+                "V",
+                "J",
+                "U",
+                "J",
+                "J",
+                "P",
+                "P",
+                "N",
+                "R",
+                "K"
+            ],
+            [
+                "B",
+                "L",
+                "P",
+                "C",
+                "B",
+                "U",
+                "O",
+                "L",
+                "A",
+                "C",
+                "V",
+                "N",
+                "X"
+            ],
+            [
+                "B",
+                "I",
+                "M",
+                "M",
+                "C",
+                "K",
+                "W",
+                "D",
+                "R",
+                "X",
+                "E",
+                "O",
+                "M"
+            ],
+            [
+                "J",
+                "S",
+                "U",
+                "T",
+                "W",
+                "G",
+                "G",
+                "K",
+                "R",
+                "O",
+                "X",
+                "V",
+                "U"
+            ],
+            [
+                "I",
+                "H",
+                "M",
+                "E",
+                "N",
+                "S",
+                "Z",
+                "R",
+                "W",
+                "U",
+                "M",
+                "D",
+                "G"
+            ],
+            [
+                "I",
+                "M",
+                "M",
+                "S",
+                "T",
+                "J",
+                "Y",
+                "B",
+                "J",
+                "F",
+                "I",
+                "V",
+                "M"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                6,
+                0
+            ],
+            [
+                7,
+                0
+            ],
+            [
+                8,
+                0
+            ],
+            [
+                8,
+                1
+            ],
+            [
+                9,
+                1
+            ],
+            [
+                10,
+                1
+            ],
+            [
+                11,
+                1
+            ],
+            [
+                11,
+                2
+            ],
+            [
+                11,
+                3
+            ],
+            [
+                11,
+                4
+            ],
+            [
+                12,
+                4
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_018_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_018_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_018_input.jpg",
+        "save_id": 2182,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ESTABLISHMENT, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2182.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_020",
+        "task": "global_longest_word_discovery",
+        "target_word": "INFRASTRUCTURE",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "R",
+                "U",
+                "Z",
+                "T",
+                "A",
+                "T",
+                "H",
+                "T",
+                "N",
+                "J",
+                "E"
+            ],
+            [
+                "K",
+                "I",
+                "Z",
+                "O",
+                "S",
+                "N",
+                "P",
+                "N",
+                "L",
+                "E",
+                "Z"
+            ],
+            [
+                "N",
+                "N",
+                "P",
+                "I",
+                "T",
+                "N",
+                "L",
+                "B",
+                "D",
+                "K",
+                "F"
+            ],
+            [
+                "D",
+                "F",
+                "R",
+                "A",
+                "B",
+                "K",
+                "Y",
+                "K",
+                "B",
+                "E",
+                "H"
+            ],
+            [
+                "X",
+                "I",
+                "Q",
+                "S",
+                "T",
+                "V",
+                "G",
+                "T",
+                "Q",
+                "J",
+                "N"
+            ],
+            [
+                "M",
+                "P",
+                "C",
+                "L",
+                "R",
+                "N",
+                "B",
+                "C",
+                "L",
+                "W",
+                "V"
+            ],
+            [
+                "V",
+                "C",
+                "T",
+                "G",
+                "U",
+                "I",
+                "B",
+                "S",
+                "D",
+                "A",
+                "M"
+            ],
+            [
+                "W",
+                "G",
+                "L",
+                "B",
+                "C",
+                "U",
+                "T",
+                "U",
+                "F",
+                "H",
+                "U"
+            ],
+            [
+                "M",
+                "F",
+                "U",
+                "P",
+                "T",
+                "B",
+                "T",
+                "R",
+                "W",
+                "T",
+                "W"
+            ],
+            [
+                "T",
+                "L",
+                "O",
+                "V",
+                "U",
+                "M",
+                "I",
+                "S",
+                "E",
+                "V",
+                "E"
+            ],
+            [
+                "B",
+                "U",
+                "Z",
+                "E",
+                "R",
+                "E",
+                "Q",
+                "E",
+                "O",
+                "O",
+                "E"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                1
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                10,
+                4
+            ],
+            [
+                10,
+                5
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_020_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_020_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_020_input.jpg",
+        "save_id": 2184,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is INFRASTRUCTURE, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2184.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_022",
+        "task": "global_longest_word_discovery",
+        "target_word": "UNQUESTIONABLY",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 14,
+        "grid_layout": [
+            [
+                "E",
+                "N",
+                "M",
+                "Z",
+                "F",
+                "L",
+                "T",
+                "R",
+                "R",
+                "Z",
+                "M",
+                "F",
+                "P",
+                "Y"
+            ],
+            [
+                "T",
+                "U",
+                "Q",
+                "X",
+                "M",
+                "T",
+                "I",
+                "C",
+                "U",
+                "P",
+                "Q",
+                "U",
+                "B",
+                "U"
+            ],
+            [
+                "V",
+                "F",
+                "K",
+                "Q",
+                "F",
+                "D",
+                "F",
+                "K",
+                "N",
+                "P",
+                "U",
+                "N",
+                "Q",
+                "U"
+            ],
+            [
+                "G",
+                "O",
+                "W",
+                "U",
+                "N",
+                "Q",
+                "I",
+                "H",
+                "Z",
+                "L",
+                "Z",
+                "S",
+                "R",
+                "E"
+            ],
+            [
+                "P",
+                "J",
+                "C",
+                "P",
+                "Z",
+                "H",
+                "D",
+                "K",
+                "W",
+                "O",
+                "I",
+                "Y",
+                "X",
+                "S"
+            ],
+            [
+                "J",
+                "P",
+                "J",
+                "V",
+                "Y",
+                "J",
+                "O",
+                "X",
+                "S",
+                "L",
+                "J",
+                "F",
+                "B",
+                "T"
+            ],
+            [
+                "C",
+                "G",
+                "O",
+                "Z",
+                "U",
+                "F",
+                "Q",
+                "P",
+                "Z",
+                "O",
+                "N",
+                "I",
+                "G",
+                "I"
+            ],
+            [
+                "B",
+                "G",
+                "K",
+                "G",
+                "B",
+                "B",
+                "V",
+                "W",
+                "Y",
+                "H",
+                "R",
+                "Q",
+                "O",
+                "O"
+            ],
+            [
+                "Y",
+                "M",
+                "Y",
+                "M",
+                "J",
+                "K",
+                "O",
+                "Z",
+                "E",
+                "B",
+                "U",
+                "F",
+                "X",
+                "N"
+            ],
+            [
+                "E",
+                "Z",
+                "S",
+                "A",
+                "G",
+                "T",
+                "I",
+                "D",
+                "H",
+                "R",
+                "Z",
+                "O",
+                "F",
+                "A"
+            ],
+            [
+                "H",
+                "J",
+                "L",
+                "C",
+                "U",
+                "S",
+                "G",
+                "V",
+                "I",
+                "N",
+                "T",
+                "V",
+                "Q",
+                "B"
+            ],
+            [
+                "L",
+                "G",
+                "Q",
+                "G",
+                "J",
+                "E",
+                "S",
+                "X",
+                "U",
+                "R",
+                "L",
+                "J",
+                "Z",
+                "L"
+            ],
+            [
+                "R",
+                "S",
+                "X",
+                "P",
+                "L",
+                "H",
+                "B",
+                "T",
+                "H",
+                "D",
+                "O",
+                "X",
+                "P",
+                "Y"
+            ],
+            [
+                "V",
+                "G",
+                "Z",
+                "I",
+                "W",
+                "W",
+                "P",
+                "H",
+                "E",
+                "D",
+                "Y",
+                "G",
+                "R",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                10
+            ],
+            [
+                2,
+                11
+            ],
+            [
+                2,
+                12
+            ],
+            [
+                2,
+                13
+            ],
+            [
+                3,
+                13
+            ],
+            [
+                4,
+                13
+            ],
+            [
+                5,
+                13
+            ],
+            [
+                6,
+                13
+            ],
+            [
+                7,
+                13
+            ],
+            [
+                8,
+                13
+            ],
+            [
+                9,
+                13
+            ],
+            [
+                10,
+                13
+            ],
+            [
+                11,
+                13
+            ],
+            [
+                12,
+                13
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_022_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_022_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_022_input.jpg",
+        "save_id": 2186,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is UNQUESTIONABLY, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2186.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_024",
+        "task": "global_longest_word_discovery",
+        "target_word": "RECONSTRUCTION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 14,
+        "grid_layout": [
+            [
+                "J",
+                "A",
+                "Q",
+                "M",
+                "V",
+                "Y",
+                "X",
+                "S",
+                "X",
+                "F",
+                "U",
+                "Y",
+                "B",
+                "F"
+            ],
+            [
+                "Y",
+                "C",
+                "P",
+                "U",
+                "D",
+                "O",
+                "T",
+                "H",
+                "V",
+                "F",
+                "M",
+                "N",
+                "P",
+                "Y"
+            ],
+            [
+                "N",
+                "L",
+                "W",
+                "G",
+                "P",
+                "Y",
+                "U",
+                "Y",
+                "P",
+                "I",
+                "F",
+                "Q",
+                "O",
+                "X"
+            ],
+            [
+                "C",
+                "X",
+                "Z",
+                "J",
+                "B",
+                "A",
+                "H",
+                "F",
+                "Z",
+                "K",
+                "E",
+                "P",
+                "U",
+                "U"
+            ],
+            [
+                "D",
+                "J",
+                "X",
+                "U",
+                "R",
+                "P",
+                "D",
+                "E",
+                "T",
+                "Y",
+                "Q",
+                "M",
+                "T",
+                "N"
+            ],
+            [
+                "F",
+                "D",
+                "M",
+                "Y",
+                "E",
+                "K",
+                "P",
+                "F",
+                "D",
+                "P",
+                "I",
+                "T",
+                "S",
+                "H"
+            ],
+            [
+                "P",
+                "Y",
+                "N",
+                "G",
+                "C",
+                "I",
+                "S",
+                "N",
+                "Y",
+                "B",
+                "V",
+                "R",
+                "A",
+                "K"
+            ],
+            [
+                "W",
+                "F",
+                "E",
+                "I",
+                "O",
+                "G",
+                "T",
+                "L",
+                "O",
+                "Q",
+                "C",
+                "C",
+                "R",
+                "G"
+            ],
+            [
+                "K",
+                "K",
+                "S",
+                "O",
+                "N",
+                "N",
+                "A",
+                "L",
+                "H",
+                "F",
+                "I",
+                "W",
+                "G",
+                "C"
+            ],
+            [
+                "T",
+                "O",
+                "Q",
+                "U",
+                "S",
+                "F",
+                "G",
+                "H",
+                "X",
+                "B",
+                "A",
+                "J",
+                "V",
+                "M"
+            ],
+            [
+                "H",
+                "U",
+                "M",
+                "U",
+                "T",
+                "B",
+                "K",
+                "V",
+                "K",
+                "I",
+                "D",
+                "W",
+                "W",
+                "V"
+            ],
+            [
+                "O",
+                "V",
+                "T",
+                "P",
+                "R",
+                "U",
+                "C",
+                "Z",
+                "C",
+                "K",
+                "P",
+                "D",
+                "J",
+                "O"
+            ],
+            [
+                "C",
+                "D",
+                "J",
+                "W",
+                "P",
+                "E",
+                "T",
+                "I",
+                "O",
+                "N",
+                "X",
+                "K",
+                "R",
+                "H"
+            ],
+            [
+                "G",
+                "Z",
+                "V",
+                "Q",
+                "U",
+                "J",
+                "B",
+                "P",
+                "W",
+                "Q",
+                "R",
+                "X",
+                "G",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                10,
+                4
+            ],
+            [
+                11,
+                4
+            ],
+            [
+                11,
+                5
+            ],
+            [
+                11,
+                6
+            ],
+            [
+                12,
+                6
+            ],
+            [
+                12,
+                7
+            ],
+            [
+                12,
+                8
+            ],
+            [
+                12,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_024_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_024_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_024_input.jpg",
+        "save_id": 2188,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is RECONSTRUCTION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2188.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_026",
+        "task": "global_longest_word_discovery",
+        "target_word": "ORGANIZATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 12,
+        "grid_layout": [
+            [
+                "T",
+                "A",
+                "Y",
+                "P",
+                "Z",
+                "F",
+                "W",
+                "G",
+                "N",
+                "D",
+                "Q",
+                "B"
+            ],
+            [
+                "U",
+                "I",
+                "E",
+                "K",
+                "M",
+                "J",
+                "P",
+                "H",
+                "O",
+                "B",
+                "D",
+                "X"
+            ],
+            [
+                "E",
+                "H",
+                "C",
+                "Q",
+                "M",
+                "Z",
+                "O",
+                "G",
+                "N",
+                "R",
+                "B",
+                "A"
+            ],
+            [
+                "Z",
+                "N",
+                "U",
+                "E",
+                "Z",
+                "F",
+                "I",
+                "Y",
+                "A",
+                "U",
+                "S",
+                "L"
+            ],
+            [
+                "O",
+                "H",
+                "T",
+                "D",
+                "X",
+                "N",
+                "M",
+                "P",
+                "G",
+                "O",
+                "V",
+                "O"
+            ],
+            [
+                "R",
+                "G",
+                "A",
+                "N",
+                "I",
+                "Z",
+                "I",
+                "B",
+                "Z",
+                "N",
+                "Y",
+                "U"
+            ],
+            [
+                "A",
+                "X",
+                "I",
+                "N",
+                "R",
+                "A",
+                "P",
+                "L",
+                "K",
+                "A",
+                "L",
+                "B"
+            ],
+            [
+                "N",
+                "C",
+                "E",
+                "M",
+                "S",
+                "T",
+                "J",
+                "C",
+                "Z",
+                "I",
+                "G",
+                "F"
+            ],
+            [
+                "I",
+                "T",
+                "R",
+                "W",
+                "N",
+                "I",
+                "S",
+                "Z",
+                "F",
+                "R",
+                "J",
+                "W"
+            ],
+            [
+                "X",
+                "E",
+                "Y",
+                "Y",
+                "V",
+                "O",
+                "N",
+                "Q",
+                "I",
+                "P",
+                "D",
+                "L"
+            ],
+            [
+                "Q",
+                "E",
+                "T",
+                "U",
+                "Q",
+                "V",
+                "Z",
+                "V",
+                "V",
+                "S",
+                "W",
+                "U"
+            ],
+            [
+                "T",
+                "W",
+                "L",
+                "F",
+                "T",
+                "Q",
+                "Y",
+                "Y",
+                "M",
+                "D",
+                "I",
+                "L"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                9,
+                6
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_026_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_026_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_026_input.jpg",
+        "save_id": 2190,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ORGANIZATION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2190.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_028",
+        "task": "global_longest_word_discovery",
+        "target_word": "PHARMACEUTICAL",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 13,
+        "grid_layout": [
+            [
+                "H",
+                "X",
+                "Q",
+                "L",
+                "P",
+                "U",
+                "N",
+                "Z",
+                "J",
+                "P",
+                "H",
+                "A",
+                "T"
+            ],
+            [
+                "M",
+                "X",
+                "G",
+                "L",
+                "S",
+                "K",
+                "G",
+                "K",
+                "L",
+                "S",
+                "N",
+                "R",
+                "M"
+            ],
+            [
+                "X",
+                "Z",
+                "O",
+                "A",
+                "N",
+                "H",
+                "Z",
+                "U",
+                "W",
+                "H",
+                "N",
+                "K",
+                "A"
+            ],
+            [
+                "Y",
+                "N",
+                "U",
+                "E",
+                "H",
+                "O",
+                "P",
+                "N",
+                "C",
+                "R",
+                "P",
+                "T",
+                "C"
+            ],
+            [
+                "G",
+                "A",
+                "L",
+                "I",
+                "S",
+                "H",
+                "K",
+                "N",
+                "Y",
+                "M",
+                "X",
+                "X",
+                "E"
+            ],
+            [
+                "X",
+                "E",
+                "M",
+                "V",
+                "M",
+                "T",
+                "S",
+                "Q",
+                "H",
+                "Q",
+                "S",
+                "G",
+                "U"
+            ],
+            [
+                "L",
+                "T",
+                "C",
+                "X",
+                "K",
+                "Y",
+                "V",
+                "Y",
+                "J",
+                "R",
+                "I",
+                "L",
+                "T"
+            ],
+            [
+                "O",
+                "Y",
+                "Y",
+                "Q",
+                "A",
+                "W",
+                "L",
+                "E",
+                "I",
+                "V",
+                "P",
+                "F",
+                "I"
+            ],
+            [
+                "J",
+                "D",
+                "M",
+                "Y",
+                "I",
+                "U",
+                "N",
+                "E",
+                "Z",
+                "C",
+                "N",
+                "R",
+                "C"
+            ],
+            [
+                "X",
+                "Q",
+                "E",
+                "I",
+                "B",
+                "M",
+                "T",
+                "D",
+                "H",
+                "H",
+                "L",
+                "L",
+                "A"
+            ],
+            [
+                "M",
+                "D",
+                "O",
+                "U",
+                "W",
+                "P",
+                "Z",
+                "H",
+                "L",
+                "F",
+                "V",
+                "H",
+                "L"
+            ],
+            [
+                "Q",
+                "D",
+                "Y",
+                "Y",
+                "G",
+                "K",
+                "H",
+                "E",
+                "L",
+                "Y",
+                "V",
+                "J",
+                "Z"
+            ],
+            [
+                "C",
+                "X",
+                "N",
+                "Y",
+                "G",
+                "U",
+                "J",
+                "P",
+                "J",
+                "D",
+                "J",
+                "M",
+                "P"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                9
+            ],
+            [
+                0,
+                10
+            ],
+            [
+                0,
+                11
+            ],
+            [
+                1,
+                11
+            ],
+            [
+                1,
+                12
+            ],
+            [
+                2,
+                12
+            ],
+            [
+                3,
+                12
+            ],
+            [
+                4,
+                12
+            ],
+            [
+                5,
+                12
+            ],
+            [
+                6,
+                12
+            ],
+            [
+                7,
+                12
+            ],
+            [
+                8,
+                12
+            ],
+            [
+                9,
+                12
+            ],
+            [
+                10,
+                12
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_028_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_028_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_028_input.jpg",
+        "save_id": 2192,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is PHARMACEUTICAL, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2192.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_030",
+        "task": "global_longest_word_discovery",
+        "target_word": "BIOENGINEERING",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 12,
+        "grid_layout": [
+            [
+                "B",
+                "O",
+                "Z",
+                "G",
+                "H",
+                "U",
+                "L",
+                "J",
+                "V",
+                "M",
+                "R",
+                "E"
+            ],
+            [
+                "I",
+                "O",
+                "E",
+                "Y",
+                "Y",
+                "L",
+                "D",
+                "U",
+                "V",
+                "N",
+                "P",
+                "D"
+            ],
+            [
+                "T",
+                "J",
+                "N",
+                "J",
+                "D",
+                "U",
+                "V",
+                "N",
+                "Z",
+                "G",
+                "E",
+                "Q"
+            ],
+            [
+                "P",
+                "O",
+                "G",
+                "I",
+                "N",
+                "U",
+                "D",
+                "C",
+                "L",
+                "C",
+                "R",
+                "Z"
+            ],
+            [
+                "G",
+                "I",
+                "L",
+                "B",
+                "E",
+                "D",
+                "D",
+                "R",
+                "P",
+                "R",
+                "G",
+                "D"
+            ],
+            [
+                "Z",
+                "Y",
+                "P",
+                "A",
+                "E",
+                "I",
+                "X",
+                "S",
+                "A",
+                "N",
+                "R",
+                "R"
+            ],
+            [
+                "V",
+                "K",
+                "V",
+                "Q",
+                "R",
+                "O",
+                "C",
+                "L",
+                "T",
+                "A",
+                "Q",
+                "J"
+            ],
+            [
+                "O",
+                "V",
+                "R",
+                "J",
+                "I",
+                "N",
+                "U",
+                "G",
+                "S",
+                "M",
+                "Z",
+                "Q"
+            ],
+            [
+                "G",
+                "J",
+                "D",
+                "D",
+                "I",
+                "G",
+                "Q",
+                "V",
+                "F",
+                "L",
+                "A",
+                "J"
+            ],
+            [
+                "T",
+                "V",
+                "U",
+                "O",
+                "Z",
+                "Z",
+                "K",
+                "K",
+                "D",
+                "R",
+                "T",
+                "U"
+            ],
+            [
+                "Z",
+                "B",
+                "U",
+                "Z",
+                "A",
+                "E",
+                "I",
+                "Z",
+                "F",
+                "B",
+                "Z",
+                "X"
+            ],
+            [
+                "Z",
+                "N",
+                "E",
+                "U",
+                "P",
+                "V",
+                "D",
+                "U",
+                "I",
+                "N",
+                "D",
+                "O"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                0
+            ],
+            [
+                1,
+                0
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                8,
+                5
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_030_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_030_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_030_input.jpg",
+        "save_id": 2194,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is BIOENGINEERING, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2194.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_032",
+        "task": "global_longest_word_discovery",
+        "target_word": "COMPREHENSIVE",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 13,
+        "grid_size": 10,
+        "grid_layout": [
+            [
+                "E",
+                "V",
+                "K",
+                "J",
+                "M",
+                "D",
+                "I",
+                "Q",
+                "B",
+                "I"
+            ],
+            [
+                "A",
+                "O",
+                "U",
+                "K",
+                "W",
+                "C",
+                "F",
+                "R",
+                "Z",
+                "E"
+            ],
+            [
+                "N",
+                "Y",
+                "R",
+                "C",
+                "O",
+                "M",
+                "P",
+                "R",
+                "E",
+                "H"
+            ],
+            [
+                "Q",
+                "Q",
+                "Q",
+                "Z",
+                "D",
+                "G",
+                "E",
+                "P",
+                "F",
+                "E"
+            ],
+            [
+                "V",
+                "M",
+                "A",
+                "D",
+                "K",
+                "D",
+                "X",
+                "U",
+                "Z",
+                "N"
+            ],
+            [
+                "M",
+                "D",
+                "H",
+                "E",
+                "D",
+                "S",
+                "V",
+                "R",
+                "O",
+                "S"
+            ],
+            [
+                "H",
+                "J",
+                "C",
+                "X",
+                "H",
+                "Z",
+                "J",
+                "B",
+                "E",
+                "I"
+            ],
+            [
+                "H",
+                "N",
+                "O",
+                "P",
+                "I",
+                "L",
+                "L",
+                "H",
+                "L",
+                "V"
+            ],
+            [
+                "L",
+                "P",
+                "L",
+                "J",
+                "U",
+                "S",
+                "Q",
+                "H",
+                "H",
+                "E"
+            ],
+            [
+                "E",
+                "R",
+                "F",
+                "W",
+                "N",
+                "P",
+                "C",
+                "I",
+                "S",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                2,
+                9
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                8,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_032_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_032_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_032_input.jpg",
+        "save_id": 2196,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is COMPREHENSIVE, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2196.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_034",
+        "task": "global_longest_word_discovery",
+        "target_word": "JURISDICTION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 10,
+        "grid_layout": [
+            [
+                "M",
+                "R",
+                "T",
+                "W",
+                "F",
+                "L",
+                "R",
+                "W",
+                "E",
+                "E"
+            ],
+            [
+                "L",
+                "V",
+                "H",
+                "J",
+                "U",
+                "Y",
+                "O",
+                "U",
+                "V",
+                "H"
+            ],
+            [
+                "Q",
+                "X",
+                "V",
+                "I",
+                "R",
+                "H",
+                "K",
+                "J",
+                "Z",
+                "X"
+            ],
+            [
+                "S",
+                "F",
+                "J",
+                "J",
+                "I",
+                "S",
+                "U",
+                "X",
+                "N",
+                "A"
+            ],
+            [
+                "Q",
+                "V",
+                "J",
+                "V",
+                "S",
+                "A",
+                "F",
+                "P",
+                "P",
+                "W"
+            ],
+            [
+                "B",
+                "N",
+                "G",
+                "K",
+                "D",
+                "G",
+                "H",
+                "N",
+                "S",
+                "Z"
+            ],
+            [
+                "Z",
+                "L",
+                "Q",
+                "T",
+                "I",
+                "C",
+                "T",
+                "I",
+                "O",
+                "N"
+            ],
+            [
+                "R",
+                "I",
+                "A",
+                "P",
+                "E",
+                "K",
+                "L",
+                "C",
+                "S",
+                "Z"
+            ],
+            [
+                "S",
+                "S",
+                "B",
+                "X",
+                "U",
+                "C",
+                "M",
+                "M",
+                "S",
+                "V"
+            ],
+            [
+                "Z",
+                "B",
+                "I",
+                "I",
+                "F",
+                "W",
+                "U",
+                "J",
+                "W",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                6,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_034_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_034_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_034_input.jpg",
+        "save_id": 2198,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is JURISDICTION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2198.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_036",
+        "task": "global_longest_word_discovery",
+        "target_word": "AUTHENTICATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 14,
+        "grid_layout": [
+            [
+                "X",
+                "O",
+                "F",
+                "P",
+                "A",
+                "M",
+                "J",
+                "I",
+                "I",
+                "L",
+                "H",
+                "E",
+                "W",
+                "J"
+            ],
+            [
+                "F",
+                "Q",
+                "X",
+                "S",
+                "S",
+                "Z",
+                "H",
+                "Y",
+                "X",
+                "W",
+                "U",
+                "K",
+                "J",
+                "X"
+            ],
+            [
+                "Y",
+                "D",
+                "S",
+                "E",
+                "E",
+                "P",
+                "M",
+                "A",
+                "B",
+                "T",
+                "L",
+                "U",
+                "J",
+                "O"
+            ],
+            [
+                "G",
+                "W",
+                "E",
+                "J",
+                "B",
+                "X",
+                "K",
+                "D",
+                "A",
+                "Y",
+                "W",
+                "L",
+                "Z",
+                "P"
+            ],
+            [
+                "U",
+                "Z",
+                "P",
+                "Y",
+                "C",
+                "E",
+                "Y",
+                "U",
+                "M",
+                "L",
+                "Y",
+                "T",
+                "A",
+                "R"
+            ],
+            [
+                "L",
+                "A",
+                "Z",
+                "O",
+                "S",
+                "S",
+                "J",
+                "K",
+                "V",
+                "W",
+                "V",
+                "P",
+                "I",
+                "X"
+            ],
+            [
+                "S",
+                "C",
+                "T",
+                "I",
+                "D",
+                "T",
+                "D",
+                "T",
+                "L",
+                "V",
+                "N",
+                "A",
+                "T",
+                "E"
+            ],
+            [
+                "C",
+                "U",
+                "Z",
+                "C",
+                "L",
+                "U",
+                "L",
+                "T",
+                "P",
+                "E",
+                "C",
+                "N",
+                "K",
+                "Z"
+            ],
+            [
+                "L",
+                "V",
+                "J",
+                "I",
+                "Z",
+                "D",
+                "Q",
+                "J",
+                "I",
+                "Y",
+                "Z",
+                "W",
+                "M",
+                "U"
+            ],
+            [
+                "V",
+                "N",
+                "F",
+                "Q",
+                "J",
+                "S",
+                "N",
+                "E",
+                "S",
+                "P",
+                "Q",
+                "G",
+                "E",
+                "E"
+            ],
+            [
+                "E",
+                "H",
+                "A",
+                "A",
+                "U",
+                "L",
+                "X",
+                "G",
+                "V",
+                "X",
+                "P",
+                "A",
+                "D",
+                "V"
+            ],
+            [
+                "G",
+                "O",
+                "Q",
+                "A",
+                "T",
+                "B",
+                "Q",
+                "U",
+                "P",
+                "L",
+                "H",
+                "M",
+                "E",
+                "S"
+            ],
+            [
+                "X",
+                "Q",
+                "Z",
+                "J",
+                "H",
+                "G",
+                "M",
+                "L",
+                "U",
+                "B",
+                "U",
+                "I",
+                "H",
+                "T"
+            ],
+            [
+                "B",
+                "N",
+                "T",
+                "N",
+                "E",
+                "N",
+                "T",
+                "I",
+                "C",
+                "A",
+                "T",
+                "I",
+                "O",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                10,
+                3
+            ],
+            [
+                10,
+                4
+            ],
+            [
+                11,
+                4
+            ],
+            [
+                12,
+                4
+            ],
+            [
+                13,
+                4
+            ],
+            [
+                13,
+                5
+            ],
+            [
+                13,
+                6
+            ],
+            [
+                13,
+                7
+            ],
+            [
+                13,
+                8
+            ],
+            [
+                13,
+                9
+            ],
+            [
+                13,
+                10
+            ],
+            [
+                13,
+                11
+            ],
+            [
+                13,
+                12
+            ],
+            [
+                13,
+                13
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_036_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_036_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_036_input.jpg",
+        "save_id": 2200,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is AUTHENTICATION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2200.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_038",
+        "task": "global_longest_word_discovery",
+        "target_word": "DISCONTINUATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 15,
+        "grid_size": 15,
+        "grid_layout": [
+            [
+                "F",
+                "C",
+                "D",
+                "B",
+                "K",
+                "P",
+                "M",
+                "B",
+                "O",
+                "S",
+                "K",
+                "K",
+                "U",
+                "U",
+                "N"
+            ],
+            [
+                "I",
+                "G",
+                "B",
+                "V",
+                "X",
+                "L",
+                "X",
+                "Z",
+                "V",
+                "O",
+                "M",
+                "V",
+                "I",
+                "I",
+                "U"
+            ],
+            [
+                "F",
+                "N",
+                "Q",
+                "U",
+                "I",
+                "E",
+                "D",
+                "I",
+                "M",
+                "F",
+                "M",
+                "C",
+                "E",
+                "Y",
+                "C"
+            ],
+            [
+                "S",
+                "I",
+                "U",
+                "I",
+                "R",
+                "B",
+                "L",
+                "N",
+                "B",
+                "S",
+                "U",
+                "S",
+                "R",
+                "X",
+                "Y"
+            ],
+            [
+                "E",
+                "S",
+                "R",
+                "M",
+                "X",
+                "L",
+                "R",
+                "K",
+                "J",
+                "H",
+                "X",
+                "V",
+                "B",
+                "S",
+                "R"
+            ],
+            [
+                "M",
+                "D",
+                "H",
+                "U",
+                "M",
+                "R",
+                "G",
+                "G",
+                "M",
+                "T",
+                "R",
+                "E",
+                "U",
+                "B",
+                "J"
+            ],
+            [
+                "S",
+                "P",
+                "J",
+                "R",
+                "A",
+                "X",
+                "X",
+                "E",
+                "N",
+                "Y",
+                "T",
+                "V",
+                "S",
+                "C",
+                "W"
+            ],
+            [
+                "X",
+                "J",
+                "M",
+                "V",
+                "Y",
+                "C",
+                "U",
+                "D",
+                "F",
+                "F",
+                "T",
+                "A",
+                "D",
+                "E",
+                "X"
+            ],
+            [
+                "R",
+                "Z",
+                "F",
+                "P",
+                "A",
+                "G",
+                "D",
+                "Z",
+                "V",
+                "J",
+                "D",
+                "W",
+                "X",
+                "Y",
+                "A"
+            ],
+            [
+                "V",
+                "Y",
+                "B",
+                "I",
+                "K",
+                "J",
+                "I",
+                "E",
+                "P",
+                "T",
+                "S",
+                "S",
+                "Y",
+                "D",
+                "S"
+            ],
+            [
+                "W",
+                "V",
+                "W",
+                "E",
+                "J",
+                "Q",
+                "S",
+                "C",
+                "U",
+                "R",
+                "K",
+                "E",
+                "V",
+                "N",
+                "R"
+            ],
+            [
+                "B",
+                "A",
+                "M",
+                "E",
+                "P",
+                "H",
+                "A",
+                "O",
+                "B",
+                "W",
+                "I",
+                "D",
+                "P",
+                "Z",
+                "P"
+            ],
+            [
+                "S",
+                "D",
+                "R",
+                "Q",
+                "R",
+                "E",
+                "E",
+                "N",
+                "T",
+                "I",
+                "Y",
+                "F",
+                "W",
+                "C",
+                "X"
+            ],
+            [
+                "L",
+                "S",
+                "A",
+                "N",
+                "R",
+                "L",
+                "F",
+                "E",
+                "C",
+                "N",
+                "U",
+                "K",
+                "B",
+                "N",
+                "Y"
+            ],
+            [
+                "R",
+                "R",
+                "N",
+                "O",
+                "Y",
+                "R",
+                "P",
+                "U",
+                "K",
+                "C",
+                "A",
+                "T",
+                "I",
+                "O",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                8,
+                6
+            ],
+            [
+                9,
+                6
+            ],
+            [
+                10,
+                6
+            ],
+            [
+                10,
+                7
+            ],
+            [
+                11,
+                7
+            ],
+            [
+                12,
+                7
+            ],
+            [
+                12,
+                8
+            ],
+            [
+                12,
+                9
+            ],
+            [
+                13,
+                9
+            ],
+            [
+                13,
+                10
+            ],
+            [
+                14,
+                10
+            ],
+            [
+                14,
+                11
+            ],
+            [
+                14,
+                12
+            ],
+            [
+                14,
+                13
+            ],
+            [
+                14,
+                14
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_038_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_038_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_038_input.jpg",
+        "save_id": 2202,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is DISCONTINUATION, length 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2202.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_040",
+        "task": "global_longest_word_discovery",
+        "target_word": "VISUALIZATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 13,
+        "grid_size": 12,
+        "grid_layout": [
+            [
+                "H",
+                "U",
+                "E",
+                "F",
+                "L",
+                "F",
+                "H",
+                "Z",
+                "T",
+                "E",
+                "K",
+                "Z"
+            ],
+            [
+                "V",
+                "I",
+                "S",
+                "H",
+                "X",
+                "N",
+                "T",
+                "T",
+                "M",
+                "E",
+                "P",
+                "M"
+            ],
+            [
+                "H",
+                "L",
+                "U",
+                "A",
+                "L",
+                "M",
+                "E",
+                "V",
+                "Q",
+                "N",
+                "E",
+                "K"
+            ],
+            [
+                "B",
+                "V",
+                "R",
+                "L",
+                "D",
+                "F",
+                "H",
+                "I",
+                "E",
+                "Q",
+                "C",
+                "R"
+            ],
+            [
+                "B",
+                "C",
+                "E",
+                "I",
+                "A",
+                "B",
+                "R",
+                "J",
+                "P",
+                "J",
+                "Y",
+                "F"
+            ],
+            [
+                "W",
+                "I",
+                "W",
+                "Z",
+                "A",
+                "T",
+                "I",
+                "M",
+                "Y",
+                "Q",
+                "X",
+                "R"
+            ],
+            [
+                "W",
+                "O",
+                "W",
+                "T",
+                "D",
+                "C",
+                "O",
+                "B",
+                "V",
+                "A",
+                "T",
+                "M"
+            ],
+            [
+                "U",
+                "Z",
+                "Q",
+                "C",
+                "R",
+                "T",
+                "N",
+                "Z",
+                "L",
+                "U",
+                "A",
+                "L"
+            ],
+            [
+                "Z",
+                "J",
+                "Y",
+                "U",
+                "Z",
+                "M",
+                "Q",
+                "J",
+                "U",
+                "T",
+                "D",
+                "J"
+            ],
+            [
+                "M",
+                "A",
+                "N",
+                "J",
+                "R",
+                "A",
+                "W",
+                "J",
+                "Z",
+                "Y",
+                "B",
+                "Y"
+            ],
+            [
+                "X",
+                "R",
+                "F",
+                "S",
+                "B",
+                "M",
+                "I",
+                "T",
+                "E",
+                "Y",
+                "L",
+                "Q"
+            ],
+            [
+                "B",
+                "E",
+                "M",
+                "Y",
+                "A",
+                "H",
+                "N",
+                "A",
+                "H",
+                "I",
+                "G",
+                "Y"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                0
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                7,
+                6
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_040_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_040_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_040_input.jpg",
+        "save_id": 2204,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is VISUALIZATION, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2204.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_042",
+        "task": "global_longest_word_discovery",
+        "target_word": "ANTHROPOLOGY",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 9,
+        "grid_layout": [
+            [
+                "Y",
+                "I",
+                "L",
+                "Z",
+                "N",
+                "E",
+                "M",
+                "N",
+                "F"
+            ],
+            [
+                "Z",
+                "T",
+                "A",
+                "A",
+                "I",
+                "I",
+                "L",
+                "D",
+                "D"
+            ],
+            [
+                "L",
+                "A",
+                "N",
+                "T",
+                "H",
+                "R",
+                "O",
+                "P",
+                "Q"
+            ],
+            [
+                "P",
+                "I",
+                "I",
+                "A",
+                "K",
+                "I",
+                "Z",
+                "O",
+                "L"
+            ],
+            [
+                "E",
+                "W",
+                "Y",
+                "J",
+                "A",
+                "N",
+                "U",
+                "H",
+                "O"
+            ],
+            [
+                "E",
+                "I",
+                "D",
+                "K",
+                "B",
+                "O",
+                "Z",
+                "Y",
+                "G"
+            ],
+            [
+                "E",
+                "W",
+                "Y",
+                "D",
+                "C",
+                "C",
+                "V",
+                "Z",
+                "Y"
+            ],
+            [
+                "A",
+                "Z",
+                "M",
+                "C",
+                "M",
+                "W",
+                "G",
+                "A",
+                "J"
+            ],
+            [
+                "K",
+                "A",
+                "G",
+                "E",
+                "T",
+                "I",
+                "C",
+                "Q",
+                "O"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_042_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_042_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_042_input.jpg",
+        "save_id": 2206,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ANTHROPOLOGY, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2206.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_044",
+        "task": "global_longest_word_discovery",
+        "target_word": "REGISTRATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 12,
+        "grid_layout": [
+            [
+                "D",
+                "Y",
+                "U",
+                "O",
+                "W",
+                "K",
+                "B",
+                "G",
+                "Y",
+                "U",
+                "O",
+                "G"
+            ],
+            [
+                "D",
+                "T",
+                "N",
+                "Z",
+                "P",
+                "Z",
+                "L",
+                "X",
+                "B",
+                "K",
+                "S",
+                "R"
+            ],
+            [
+                "R",
+                "P",
+                "B",
+                "M",
+                "X",
+                "U",
+                "R",
+                "Q",
+                "O",
+                "Q",
+                "Z",
+                "U"
+            ],
+            [
+                "E",
+                "X",
+                "E",
+                "A",
+                "I",
+                "E",
+                "O",
+                "V",
+                "J",
+                "B",
+                "U",
+                "P"
+            ],
+            [
+                "G",
+                "I",
+                "C",
+                "O",
+                "Q",
+                "C",
+                "R",
+                "Q",
+                "F",
+                "B",
+                "B",
+                "V"
+            ],
+            [
+                "I",
+                "S",
+                "O",
+                "O",
+                "X",
+                "F",
+                "J",
+                "O",
+                "J",
+                "H",
+                "S",
+                "I"
+            ],
+            [
+                "H",
+                "T",
+                "R",
+                "A",
+                "T",
+                "O",
+                "P",
+                "J",
+                "C",
+                "Z",
+                "J",
+                "G"
+            ],
+            [
+                "X",
+                "K",
+                "F",
+                "G",
+                "I",
+                "O",
+                "N",
+                "Q",
+                "A",
+                "S",
+                "L",
+                "R"
+            ],
+            [
+                "C",
+                "X",
+                "Y",
+                "C",
+                "B",
+                "E",
+                "J",
+                "F",
+                "G",
+                "M",
+                "W",
+                "T"
+            ],
+            [
+                "I",
+                "M",
+                "V",
+                "V",
+                "P",
+                "M",
+                "B",
+                "R",
+                "S",
+                "H",
+                "N",
+                "S"
+            ],
+            [
+                "S",
+                "O",
+                "J",
+                "X",
+                "G",
+                "B",
+                "W",
+                "Q",
+                "W",
+                "P",
+                "I",
+                "N"
+            ],
+            [
+                "A",
+                "I",
+                "B",
+                "Y",
+                "L",
+                "K",
+                "F",
+                "C",
+                "O",
+                "I",
+                "D",
+                "F"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                0
+            ],
+            [
+                3,
+                0
+            ],
+            [
+                4,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_044_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_044_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_044_input.jpg",
+        "save_id": 2208,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is REGISTRATION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2208.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_046",
+        "task": "global_longest_word_discovery",
+        "target_word": "UNDERESTIMATE",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 13,
+        "grid_size": 9,
+        "grid_layout": [
+            [
+                "H",
+                "O",
+                "E",
+                "Z",
+                "R",
+                "X",
+                "G",
+                "A",
+                "K"
+            ],
+            [
+                "K",
+                "U",
+                "N",
+                "U",
+                "P",
+                "N",
+                "B",
+                "B",
+                "Y"
+            ],
+            [
+                "O",
+                "W",
+                "D",
+                "E",
+                "P",
+                "S",
+                "K",
+                "U",
+                "K"
+            ],
+            [
+                "C",
+                "U",
+                "T",
+                "R",
+                "Q",
+                "V",
+                "B",
+                "E",
+                "K"
+            ],
+            [
+                "N",
+                "B",
+                "W",
+                "E",
+                "S",
+                "T",
+                "I",
+                "M",
+                "K"
+            ],
+            [
+                "Y",
+                "P",
+                "R",
+                "J",
+                "X",
+                "D",
+                "A",
+                "A",
+                "H"
+            ],
+            [
+                "V",
+                "J",
+                "I",
+                "O",
+                "G",
+                "V",
+                "Y",
+                "T",
+                "X"
+            ],
+            [
+                "M",
+                "U",
+                "X",
+                "C",
+                "R",
+                "J",
+                "J",
+                "E",
+                "X"
+            ],
+            [
+                "B",
+                "Q",
+                "Q",
+                "V",
+                "C",
+                "C",
+                "U",
+                "J",
+                "S"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_046_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_046_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_046_input.jpg",
+        "save_id": 2210,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is UNDERESTIMATE, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2210.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_048",
+        "task": "global_longest_word_discovery",
+        "target_word": "LABORATORIES",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 10,
+        "grid_layout": [
+            [
+                "S",
+                "W",
+                "K",
+                "H",
+                "L",
+                "A",
+                "F",
+                "M",
+                "I",
+                "T"
+            ],
+            [
+                "O",
+                "V",
+                "S",
+                "S",
+                "T",
+                "B",
+                "H",
+                "Z",
+                "F",
+                "N"
+            ],
+            [
+                "F",
+                "E",
+                "B",
+                "P",
+                "F",
+                "O",
+                "R",
+                "Y",
+                "S",
+                "Z"
+            ],
+            [
+                "B",
+                "X",
+                "I",
+                "H",
+                "Y",
+                "Y",
+                "A",
+                "T",
+                "O",
+                "R"
+            ],
+            [
+                "E",
+                "E",
+                "H",
+                "E",
+                "I",
+                "J",
+                "G",
+                "O",
+                "N",
+                "I"
+            ],
+            [
+                "N",
+                "K",
+                "E",
+                "S",
+                "D",
+                "W",
+                "H",
+                "I",
+                "H",
+                "E"
+            ],
+            [
+                "A",
+                "E",
+                "O",
+                "L",
+                "X",
+                "F",
+                "A",
+                "P",
+                "W",
+                "S"
+            ],
+            [
+                "M",
+                "C",
+                "D",
+                "N",
+                "A",
+                "C",
+                "R",
+                "W",
+                "N",
+                "X"
+            ],
+            [
+                "I",
+                "Q",
+                "X",
+                "J",
+                "T",
+                "S",
+                "R",
+                "J",
+                "H",
+                "G"
+            ],
+            [
+                "J",
+                "N",
+                "R",
+                "M",
+                "G",
+                "E",
+                "M",
+                "S",
+                "R",
+                "Y"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                6,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_048_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_048_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_048_input.jpg",
+        "save_id": 2212,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is LABORATORIES, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2212.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_050",
+        "task": "global_longest_word_discovery",
+        "target_word": "CIVILIZATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "M",
+                "Q",
+                "G",
+                "J",
+                "C",
+                "I",
+                "G",
+                "L",
+                "R",
+                "A",
+                "P"
+            ],
+            [
+                "G",
+                "A",
+                "G",
+                "A",
+                "P",
+                "V",
+                "I",
+                "L",
+                "O",
+                "V",
+                "T"
+            ],
+            [
+                "D",
+                "K",
+                "N",
+                "X",
+                "W",
+                "T",
+                "L",
+                "I",
+                "K",
+                "Y",
+                "M"
+            ],
+            [
+                "E",
+                "M",
+                "G",
+                "R",
+                "Z",
+                "L",
+                "Y",
+                "Z",
+                "O",
+                "U",
+                "Z"
+            ],
+            [
+                "R",
+                "G",
+                "M",
+                "I",
+                "T",
+                "P",
+                "N",
+                "A",
+                "T",
+                "P",
+                "C"
+            ],
+            [
+                "A",
+                "Q",
+                "P",
+                "A",
+                "C",
+                "V",
+                "T",
+                "T",
+                "I",
+                "O",
+                "N"
+            ],
+            [
+                "O",
+                "Q",
+                "M",
+                "H",
+                "S",
+                "J",
+                "A",
+                "H",
+                "O",
+                "I",
+                "J"
+            ],
+            [
+                "D",
+                "N",
+                "A",
+                "U",
+                "P",
+                "E",
+                "R",
+                "N",
+                "H",
+                "C",
+                "L"
+            ],
+            [
+                "V",
+                "Z",
+                "F",
+                "Q",
+                "O",
+                "N",
+                "I",
+                "R",
+                "R",
+                "C",
+                "Q"
+            ],
+            [
+                "Z",
+                "M",
+                "D",
+                "C",
+                "F",
+                "K",
+                "B",
+                "E",
+                "I",
+                "S",
+                "D"
+            ],
+            [
+                "T",
+                "Z",
+                "D",
+                "I",
+                "W",
+                "L",
+                "Y",
+                "M",
+                "C",
+                "Q",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                5,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_050_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_050_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_050_input.jpg",
+        "save_id": 2214,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is CIVILIZATION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2214.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_052",
+        "task": "global_longest_word_discovery",
+        "target_word": "UNIVERSITIES",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 9,
+        "grid_layout": [
+            [
+                "H",
+                "M",
+                "B",
+                "I",
+                "X",
+                "Y",
+                "G",
+                "O",
+                "C"
+            ],
+            [
+                "U",
+                "C",
+                "W",
+                "Z",
+                "T",
+                "B",
+                "S",
+                "R",
+                "B"
+            ],
+            [
+                "N",
+                "I",
+                "V",
+                "L",
+                "A",
+                "F",
+                "Q",
+                "W",
+                "H"
+            ],
+            [
+                "I",
+                "P",
+                "E",
+                "D",
+                "V",
+                "P",
+                "T",
+                "V",
+                "S"
+            ],
+            [
+                "K",
+                "P",
+                "R",
+                "V",
+                "M",
+                "T",
+                "W",
+                "V",
+                "C"
+            ],
+            [
+                "G",
+                "I",
+                "S",
+                "Y",
+                "S",
+                "S",
+                "N",
+                "N",
+                "A"
+            ],
+            [
+                "F",
+                "G",
+                "I",
+                "T",
+                "B",
+                "A",
+                "E",
+                "P",
+                "V"
+            ],
+            [
+                "D",
+                "W",
+                "I",
+                "I",
+                "E",
+                "Q",
+                "Z",
+                "H",
+                "S"
+            ],
+            [
+                "O",
+                "X",
+                "M",
+                "E",
+                "S",
+                "Q",
+                "E",
+                "W",
+                "W"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                0
+            ],
+            [
+                2,
+                0
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_052_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_052_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_052_input.jpg",
+        "save_id": 2216,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is UNIVERSITIES, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2216.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_054",
+        "task": "global_longest_word_discovery",
+        "target_word": "ENTERTAINMENT",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 13,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "B",
+                "U",
+                "U",
+                "F",
+                "F",
+                "G",
+                "M",
+                "N",
+                "F",
+                "Z",
+                "V"
+            ],
+            [
+                "C",
+                "D",
+                "Y",
+                "C",
+                "A",
+                "I",
+                "F",
+                "M",
+                "U",
+                "L",
+                "C"
+            ],
+            [
+                "E",
+                "T",
+                "O",
+                "C",
+                "D",
+                "I",
+                "H",
+                "D",
+                "S",
+                "B",
+                "B"
+            ],
+            [
+                "N",
+                "E",
+                "V",
+                "I",
+                "S",
+                "S",
+                "S",
+                "W",
+                "E",
+                "W",
+                "X"
+            ],
+            [
+                "E",
+                "N",
+                "T",
+                "E",
+                "E",
+                "X",
+                "Q",
+                "Z",
+                "E",
+                "X",
+                "B"
+            ],
+            [
+                "Z",
+                "H",
+                "Q",
+                "R",
+                "Z",
+                "H",
+                "W",
+                "X",
+                "Z",
+                "K",
+                "A"
+            ],
+            [
+                "N",
+                "F",
+                "C",
+                "T",
+                "A",
+                "N",
+                "N",
+                "V",
+                "I",
+                "D",
+                "M"
+            ],
+            [
+                "F",
+                "K",
+                "G",
+                "I",
+                "I",
+                "G",
+                "D",
+                "V",
+                "K",
+                "L",
+                "J"
+            ],
+            [
+                "N",
+                "A",
+                "P",
+                "M",
+                "N",
+                "X",
+                "M",
+                "W",
+                "T",
+                "K",
+                "E"
+            ],
+            [
+                "Q",
+                "I",
+                "M",
+                "Y",
+                "M",
+                "E",
+                "N",
+                "T",
+                "J",
+                "E",
+                "O"
+            ],
+            [
+                "V",
+                "C",
+                "S",
+                "J",
+                "Z",
+                "A",
+                "G",
+                "J",
+                "X",
+                "M",
+                "D"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                0
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                9,
+                6
+            ],
+            [
+                9,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_054_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_054_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_054_input.jpg",
+        "save_id": 2218,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ENTERTAINMENT, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2218.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_056",
+        "task": "global_longest_word_discovery",
+        "target_word": "INDEPENDENCE",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 9,
+        "grid_layout": [
+            [
+                "T",
+                "S",
+                "E",
+                "G",
+                "H",
+                "V",
+                "K",
+                "Q",
+                "Y"
+            ],
+            [
+                "I",
+                "N",
+                "K",
+                "K",
+                "L",
+                "D",
+                "R",
+                "Y",
+                "V"
+            ],
+            [
+                "W",
+                "D",
+                "R",
+                "N",
+                "G",
+                "K",
+                "O",
+                "R",
+                "J"
+            ],
+            [
+                "E",
+                "E",
+                "G",
+                "D",
+                "B",
+                "Y",
+                "K",
+                "A",
+                "C"
+            ],
+            [
+                "L",
+                "P",
+                "A",
+                "W",
+                "S",
+                "M",
+                "V",
+                "C",
+                "I"
+            ],
+            [
+                "Q",
+                "E",
+                "X",
+                "A",
+                "H",
+                "X",
+                "N",
+                "D",
+                "D"
+            ],
+            [
+                "S",
+                "N",
+                "D",
+                "E",
+                "N",
+                "C",
+                "E",
+                "Z",
+                "D"
+            ],
+            [
+                "V",
+                "E",
+                "K",
+                "S",
+                "A",
+                "C",
+                "X",
+                "B",
+                "K"
+            ],
+            [
+                "B",
+                "R",
+                "D",
+                "N",
+                "T",
+                "K",
+                "L",
+                "V",
+                "R"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                0
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_056_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_056_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_056_input.jpg",
+        "save_id": 2220,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is INDEPENDENCE, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2220.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_058",
+        "task": "global_longest_word_discovery",
+        "target_word": "OBSERVATIONS",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "F",
+                "W",
+                "M",
+                "I",
+                "N",
+                "C",
+                "O",
+                "M",
+                "P",
+                "O",
+                "X"
+            ],
+            [
+                "U",
+                "L",
+                "N",
+                "B",
+                "N",
+                "P",
+                "B",
+                "X",
+                "N",
+                "G",
+                "I"
+            ],
+            [
+                "Y",
+                "Z",
+                "N",
+                "T",
+                "P",
+                "P",
+                "P",
+                "Q",
+                "J",
+                "R",
+                "R"
+            ],
+            [
+                "Z",
+                "V",
+                "E",
+                "N",
+                "S",
+                "Q",
+                "U",
+                "C",
+                "C",
+                "X",
+                "U"
+            ],
+            [
+                "O",
+                "Y",
+                "W",
+                "O",
+                "H",
+                "S",
+                "G",
+                "T",
+                "K",
+                "G",
+                "S"
+            ],
+            [
+                "B",
+                "S",
+                "E",
+                "R",
+                "Q",
+                "R",
+                "F",
+                "F",
+                "G",
+                "B",
+                "G"
+            ],
+            [
+                "L",
+                "W",
+                "U",
+                "V",
+                "Q",
+                "O",
+                "W",
+                "A",
+                "T",
+                "Q",
+                "J"
+            ],
+            [
+                "R",
+                "P",
+                "G",
+                "A",
+                "T",
+                "I",
+                "O",
+                "N",
+                "S",
+                "U",
+                "X"
+            ],
+            [
+                "W",
+                "K",
+                "W",
+                "B",
+                "N",
+                "Q",
+                "N",
+                "S",
+                "J",
+                "X",
+                "Y"
+            ],
+            [
+                "A",
+                "T",
+                "B",
+                "L",
+                "G",
+                "R",
+                "H",
+                "Z",
+                "J",
+                "U",
+                "D"
+            ],
+            [
+                "T",
+                "P",
+                "V",
+                "G",
+                "P",
+                "U",
+                "Z",
+                "U",
+                "K",
+                "F",
+                "W"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_058_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_058_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_058_input.jpg",
+        "save_id": 2222,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is OBSERVATIONS, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2222.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_060",
+        "task": "global_longest_word_discovery",
+        "target_word": "PUBLICATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 11,
+        "grid_size": 9,
+        "grid_layout": [
+            [
+                "Z",
+                "I",
+                "N",
+                "C",
+                "I",
+                "N",
+                "W",
+                "G",
+                "X"
+            ],
+            [
+                "L",
+                "Y",
+                "Y",
+                "I",
+                "C",
+                "O",
+                "Q",
+                "N",
+                "F"
+            ],
+            [
+                "U",
+                "Q",
+                "C",
+                "V",
+                "E",
+                "O",
+                "F",
+                "C",
+                "B"
+            ],
+            [
+                "C",
+                "T",
+                "Y",
+                "J",
+                "B",
+                "B",
+                "H",
+                "T",
+                "F"
+            ],
+            [
+                "J",
+                "S",
+                "P",
+                "U",
+                "B",
+                "L",
+                "I",
+                "F",
+                "G"
+            ],
+            [
+                "P",
+                "F",
+                "P",
+                "E",
+                "X",
+                "U",
+                "C",
+                "J",
+                "Y"
+            ],
+            [
+                "Z",
+                "R",
+                "V",
+                "Q",
+                "V",
+                "H",
+                "A",
+                "B",
+                "J"
+            ],
+            [
+                "H",
+                "W",
+                "Q",
+                "A",
+                "I",
+                "R",
+                "T",
+                "V",
+                "Z"
+            ],
+            [
+                "Y",
+                "X",
+                "W",
+                "B",
+                "Z",
+                "L",
+                "I",
+                "O",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_060_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_060_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_060_input.jpg",
+        "save_id": 2224,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is PUBLICATION, length 11.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2224.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_062",
+        "task": "global_longest_word_discovery",
+        "target_word": "INTERNATIONAL",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 13,
+        "grid_size": 13,
+        "grid_layout": [
+            [
+                "G",
+                "Y",
+                "D",
+                "L",
+                "Y",
+                "N",
+                "T",
+                "F",
+                "L",
+                "A",
+                "V",
+                "Z",
+                "Z"
+            ],
+            [
+                "L",
+                "D",
+                "O",
+                "A",
+                "C",
+                "X",
+                "V",
+                "M",
+                "Z",
+                "E",
+                "N",
+                "J",
+                "Z"
+            ],
+            [
+                "Y",
+                "T",
+                "P",
+                "E",
+                "G",
+                "V",
+                "G",
+                "X",
+                "V",
+                "U",
+                "R",
+                "S",
+                "R"
+            ],
+            [
+                "I",
+                "N",
+                "O",
+                "S",
+                "N",
+                "G",
+                "M",
+                "W",
+                "E",
+                "Y",
+                "B",
+                "V",
+                "I"
+            ],
+            [
+                "T",
+                "P",
+                "Z",
+                "B",
+                "J",
+                "B",
+                "Z",
+                "I",
+                "W",
+                "R",
+                "Z",
+                "I",
+                "I"
+            ],
+            [
+                "P",
+                "Y",
+                "S",
+                "D",
+                "W",
+                "Z",
+                "W",
+                "N",
+                "T",
+                "I",
+                "Y",
+                "W",
+                "L"
+            ],
+            [
+                "J",
+                "J",
+                "G",
+                "W",
+                "P",
+                "A",
+                "O",
+                "T",
+                "H",
+                "L",
+                "Q",
+                "E",
+                "W"
+            ],
+            [
+                "Z",
+                "N",
+                "R",
+                "P",
+                "A",
+                "T",
+                "S",
+                "E",
+                "K",
+                "G",
+                "L",
+                "I",
+                "G"
+            ],
+            [
+                "G",
+                "R",
+                "D",
+                "U",
+                "T",
+                "B",
+                "H",
+                "R",
+                "N",
+                "Y",
+                "M",
+                "H",
+                "N"
+            ],
+            [
+                "Y",
+                "V",
+                "A",
+                "W",
+                "P",
+                "A",
+                "Y",
+                "W",
+                "A",
+                "F",
+                "F",
+                "N",
+                "A"
+            ],
+            [
+                "A",
+                "U",
+                "X",
+                "S",
+                "B",
+                "O",
+                "F",
+                "M",
+                "T",
+                "I",
+                "O",
+                "J",
+                "J"
+            ],
+            [
+                "B",
+                "S",
+                "L",
+                "C",
+                "B",
+                "J",
+                "N",
+                "S",
+                "T",
+                "Z",
+                "N",
+                "A",
+                "L"
+            ],
+            [
+                "A",
+                "G",
+                "H",
+                "I",
+                "M",
+                "Z",
+                "P",
+                "Y",
+                "R",
+                "D",
+                "Q",
+                "L",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                10,
+                8
+            ],
+            [
+                10,
+                9
+            ],
+            [
+                10,
+                10
+            ],
+            [
+                11,
+                10
+            ],
+            [
+                11,
+                11
+            ],
+            [
+                12,
+                11
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_062_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_062_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_062_input.jpg",
+        "save_id": 2226,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is INTERNATIONAL, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2226.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_064",
+        "task": "global_longest_word_discovery",
+        "target_word": "PALEONTOLOGIST",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 14,
+        "grid_layout": [
+            [
+                "K",
+                "O",
+                "Y",
+                "Q",
+                "W",
+                "O",
+                "P",
+                "R",
+                "V",
+                "D",
+                "F",
+                "K",
+                "N",
+                "J"
+            ],
+            [
+                "X",
+                "W",
+                "H",
+                "Z",
+                "N",
+                "H",
+                "A",
+                "D",
+                "G",
+                "N",
+                "K",
+                "S",
+                "O",
+                "Q"
+            ],
+            [
+                "E",
+                "R",
+                "O",
+                "R",
+                "Y",
+                "Q",
+                "B",
+                "X",
+                "B",
+                "U",
+                "U",
+                "A",
+                "Y",
+                "Q"
+            ],
+            [
+                "E",
+                "X",
+                "U",
+                "P",
+                "A",
+                "J",
+                "N",
+                "C",
+                "D",
+                "N",
+                "I",
+                "X",
+                "D",
+                "K"
+            ],
+            [
+                "Z",
+                "R",
+                "F",
+                "U",
+                "L",
+                "E",
+                "J",
+                "H",
+                "Y",
+                "Z",
+                "Z",
+                "Z",
+                "D",
+                "Z"
+            ],
+            [
+                "V",
+                "R",
+                "O",
+                "S",
+                "Y",
+                "O",
+                "N",
+                "U",
+                "D",
+                "Y",
+                "E",
+                "Y",
+                "F",
+                "B"
+            ],
+            [
+                "U",
+                "I",
+                "F",
+                "G",
+                "X",
+                "F",
+                "T",
+                "W",
+                "B",
+                "U",
+                "X",
+                "R",
+                "F",
+                "I"
+            ],
+            [
+                "E",
+                "O",
+                "F",
+                "H",
+                "S",
+                "C",
+                "O",
+                "L",
+                "T",
+                "T",
+                "Z",
+                "Y",
+                "V",
+                "M"
+            ],
+            [
+                "F",
+                "V",
+                "E",
+                "A",
+                "X",
+                "F",
+                "R",
+                "O",
+                "J",
+                "Z",
+                "K",
+                "U",
+                "J",
+                "Z"
+            ],
+            [
+                "W",
+                "M",
+                "H",
+                "O",
+                "C",
+                "B",
+                "H",
+                "G",
+                "I",
+                "S",
+                "T",
+                "Q",
+                "I",
+                "R"
+            ],
+            [
+                "X",
+                "L",
+                "F",
+                "N",
+                "G",
+                "H",
+                "S",
+                "J",
+                "A",
+                "H",
+                "Z",
+                "C",
+                "D",
+                "Y"
+            ],
+            [
+                "J",
+                "K",
+                "G",
+                "F",
+                "J",
+                "N",
+                "Q",
+                "O",
+                "K",
+                "M",
+                "F",
+                "D",
+                "K",
+                "P"
+            ],
+            [
+                "Z",
+                "I",
+                "G",
+                "Z",
+                "V",
+                "L",
+                "C",
+                "T",
+                "B",
+                "O",
+                "I",
+                "Z",
+                "Z",
+                "X"
+            ],
+            [
+                "P",
+                "I",
+                "L",
+                "L",
+                "T",
+                "Z",
+                "B",
+                "W",
+                "K",
+                "A",
+                "T",
+                "M",
+                "A",
+                "S"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                9,
+                9
+            ],
+            [
+                9,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_064_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_064_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_064_input.jpg",
+        "save_id": 2228,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is PALEONTOLOGIST, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2228.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_066",
+        "task": "global_longest_word_discovery",
+        "target_word": "IMPLEMENTATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "Q",
+                "I",
+                "F",
+                "X",
+                "G",
+                "V",
+                "D",
+                "L",
+                "A",
+                "M",
+                "Y"
+            ],
+            [
+                "U",
+                "Z",
+                "L",
+                "Z",
+                "I",
+                "U",
+                "S",
+                "W",
+                "P",
+                "B",
+                "K"
+            ],
+            [
+                "X",
+                "L",
+                "L",
+                "F",
+                "H",
+                "Z",
+                "P",
+                "J",
+                "D",
+                "W",
+                "T"
+            ],
+            [
+                "W",
+                "P",
+                "V",
+                "K",
+                "Z",
+                "U",
+                "D",
+                "M",
+                "X",
+                "R",
+                "T"
+            ],
+            [
+                "J",
+                "Q",
+                "D",
+                "T",
+                "X",
+                "Q",
+                "L",
+                "K",
+                "O",
+                "X",
+                "Y"
+            ],
+            [
+                "D",
+                "R",
+                "C",
+                "E",
+                "Y",
+                "W",
+                "B",
+                "L",
+                "N",
+                "V",
+                "B"
+            ],
+            [
+                "U",
+                "R",
+                "K",
+                "K",
+                "X",
+                "U",
+                "G",
+                "S",
+                "Z",
+                "X",
+                "C"
+            ],
+            [
+                "I",
+                "M",
+                "P",
+                "S",
+                "K",
+                "B",
+                "H",
+                "M",
+                "N",
+                "P",
+                "M"
+            ],
+            [
+                "W",
+                "P",
+                "L",
+                "E",
+                "M",
+                "E",
+                "N",
+                "T",
+                "A",
+                "T",
+                "C"
+            ],
+            [
+                "O",
+                "U",
+                "Y",
+                "R",
+                "Z",
+                "A",
+                "U",
+                "W",
+                "T",
+                "I",
+                "K"
+            ],
+            [
+                "Y",
+                "R",
+                "V",
+                "P",
+                "R",
+                "I",
+                "Y",
+                "I",
+                "U",
+                "O",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                7,
+                0
+            ],
+            [
+                7,
+                1
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ],
+            [
+                10,
+                9
+            ],
+            [
+                10,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_066_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_066_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_066_input.jpg",
+        "save_id": 2230,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is IMPLEMENTATION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2230.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_068",
+        "task": "global_longest_word_discovery",
+        "target_word": "TRANSFORMATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 14,
+        "grid_layout": [
+            [
+                "H",
+                "C",
+                "A",
+                "G",
+                "K",
+                "A",
+                "R",
+                "Q",
+                "R",
+                "B",
+                "H",
+                "W",
+                "K",
+                "V"
+            ],
+            [
+                "J",
+                "P",
+                "O",
+                "P",
+                "O",
+                "G",
+                "K",
+                "Q",
+                "Z",
+                "W",
+                "V",
+                "Y",
+                "N",
+                "R"
+            ],
+            [
+                "U",
+                "V",
+                "X",
+                "Z",
+                "P",
+                "Z",
+                "I",
+                "X",
+                "R",
+                "G",
+                "B",
+                "P",
+                "I",
+                "Z"
+            ],
+            [
+                "T",
+                "R",
+                "S",
+                "B",
+                "Z",
+                "Q",
+                "Y",
+                "A",
+                "W",
+                "Q",
+                "D",
+                "D",
+                "L",
+                "H"
+            ],
+            [
+                "O",
+                "Y",
+                "R",
+                "O",
+                "K",
+                "S",
+                "T",
+                "K",
+                "Y",
+                "W",
+                "N",
+                "O",
+                "R",
+                "L"
+            ],
+            [
+                "J",
+                "D",
+                "L",
+                "H",
+                "D",
+                "J",
+                "G",
+                "X",
+                "R",
+                "I",
+                "N",
+                "B",
+                "U",
+                "Y"
+            ],
+            [
+                "I",
+                "T",
+                "Z",
+                "P",
+                "W",
+                "J",
+                "M",
+                "X",
+                "I",
+                "H",
+                "A",
+                "M",
+                "K",
+                "S"
+            ],
+            [
+                "D",
+                "C",
+                "R",
+                "B",
+                "S",
+                "T",
+                "C",
+                "W",
+                "T",
+                "P",
+                "H",
+                "K",
+                "T",
+                "M"
+            ],
+            [
+                "Y",
+                "B",
+                "H",
+                "V",
+                "U",
+                "G",
+                "I",
+                "M",
+                "N",
+                "Y",
+                "M",
+                "P",
+                "G",
+                "T"
+            ],
+            [
+                "S",
+                "G",
+                "X",
+                "I",
+                "H",
+                "A",
+                "Y",
+                "C",
+                "Q",
+                "V",
+                "C",
+                "Q",
+                "W",
+                "D"
+            ],
+            [
+                "L",
+                "H",
+                "T",
+                "R",
+                "A",
+                "N",
+                "R",
+                "Q",
+                "O",
+                "E",
+                "G",
+                "K",
+                "N",
+                "T"
+            ],
+            [
+                "I",
+                "M",
+                "L",
+                "W",
+                "L",
+                "S",
+                "X",
+                "S",
+                "Q",
+                "Z",
+                "C",
+                "H",
+                "I",
+                "Q"
+            ],
+            [
+                "W",
+                "N",
+                "M",
+                "N",
+                "U",
+                "F",
+                "O",
+                "A",
+                "Z",
+                "V",
+                "S",
+                "Q",
+                "O",
+                "N"
+            ],
+            [
+                "I",
+                "U",
+                "F",
+                "L",
+                "R",
+                "I",
+                "R",
+                "M",
+                "A",
+                "T",
+                "I",
+                "O",
+                "N",
+                "Z"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                10,
+                2
+            ],
+            [
+                10,
+                3
+            ],
+            [
+                10,
+                4
+            ],
+            [
+                10,
+                5
+            ],
+            [
+                11,
+                5
+            ],
+            [
+                12,
+                5
+            ],
+            [
+                12,
+                6
+            ],
+            [
+                13,
+                6
+            ],
+            [
+                13,
+                7
+            ],
+            [
+                13,
+                8
+            ],
+            [
+                13,
+                9
+            ],
+            [
+                13,
+                10
+            ],
+            [
+                13,
+                11
+            ],
+            [
+                13,
+                12
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_068_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_068_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_068_input.jpg",
+        "save_id": 2232,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is TRANSFORMATION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2232.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_070",
+        "task": "global_longest_word_discovery",
+        "target_word": "NEIGHBORHOOD",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "L",
+                "W",
+                "Q",
+                "M",
+                "L",
+                "P",
+                "T",
+                "D",
+                "F",
+                "T",
+                "H"
+            ],
+            [
+                "H",
+                "T",
+                "U",
+                "X",
+                "Q",
+                "X",
+                "X",
+                "N",
+                "M",
+                "G",
+                "E"
+            ],
+            [
+                "L",
+                "D",
+                "N",
+                "L",
+                "E",
+                "A",
+                "I",
+                "W",
+                "O",
+                "X",
+                "V"
+            ],
+            [
+                "R",
+                "L",
+                "E",
+                "I",
+                "B",
+                "Y",
+                "M",
+                "Z",
+                "C",
+                "E",
+                "M"
+            ],
+            [
+                "N",
+                "T",
+                "U",
+                "G",
+                "K",
+                "C",
+                "S",
+                "G",
+                "F",
+                "F",
+                "E"
+            ],
+            [
+                "B",
+                "Q",
+                "X",
+                "H",
+                "B",
+                "F",
+                "K",
+                "O",
+                "G",
+                "U",
+                "L"
+            ],
+            [
+                "F",
+                "F",
+                "A",
+                "T",
+                "O",
+                "R",
+                "P",
+                "I",
+                "G",
+                "P",
+                "W"
+            ],
+            [
+                "M",
+                "F",
+                "O",
+                "N",
+                "R",
+                "C",
+                "S",
+                "H",
+                "J",
+                "N",
+                "O"
+            ],
+            [
+                "B",
+                "G",
+                "V",
+                "D",
+                "H",
+                "E",
+                "U",
+                "O",
+                "I",
+                "X",
+                "H"
+            ],
+            [
+                "U",
+                "E",
+                "U",
+                "L",
+                "O",
+                "O",
+                "D",
+                "X",
+                "P",
+                "S",
+                "X"
+            ],
+            [
+                "D",
+                "A",
+                "B",
+                "J",
+                "P",
+                "H",
+                "J",
+                "E",
+                "I",
+                "T",
+                "H"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                9,
+                6
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_070_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_070_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_070_input.jpg",
+        "save_id": 2234,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is NEIGHBORHOOD, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2234.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_072",
+        "task": "global_longest_word_discovery",
+        "target_word": "NEGOTIATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 11,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "F",
+                "I",
+                "T",
+                "V",
+                "N",
+                "I",
+                "G",
+                "U",
+                "B",
+                "L",
+                "C"
+            ],
+            [
+                "W",
+                "B",
+                "J",
+                "Y",
+                "M",
+                "L",
+                "C",
+                "D",
+                "X",
+                "P",
+                "Q"
+            ],
+            [
+                "E",
+                "K",
+                "X",
+                "C",
+                "W",
+                "G",
+                "V",
+                "Z",
+                "I",
+                "Q",
+                "O"
+            ],
+            [
+                "V",
+                "S",
+                "F",
+                "F",
+                "A",
+                "X",
+                "Z",
+                "Q",
+                "O",
+                "T",
+                "N"
+            ],
+            [
+                "N",
+                "W",
+                "W",
+                "N",
+                "L",
+                "Z",
+                "C",
+                "I",
+                "N",
+                "S",
+                "I"
+            ],
+            [
+                "E",
+                "I",
+                "W",
+                "K",
+                "V",
+                "V",
+                "S",
+                "V",
+                "J",
+                "Z",
+                "E"
+            ],
+            [
+                "G",
+                "O",
+                "T",
+                "I",
+                "B",
+                "H",
+                "C",
+                "W",
+                "R",
+                "R",
+                "V"
+            ],
+            [
+                "A",
+                "D",
+                "A",
+                "A",
+                "W",
+                "G",
+                "C",
+                "V",
+                "U",
+                "V",
+                "Z"
+            ],
+            [
+                "B",
+                "Z",
+                "B",
+                "T",
+                "I",
+                "O",
+                "N",
+                "J",
+                "S",
+                "A",
+                "B"
+            ],
+            [
+                "F",
+                "O",
+                "N",
+                "O",
+                "I",
+                "E",
+                "Z",
+                "F",
+                "E",
+                "Y",
+                "V"
+            ],
+            [
+                "K",
+                "B",
+                "Y",
+                "K",
+                "K",
+                "T",
+                "N",
+                "N",
+                "W",
+                "R",
+                "H"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                6,
+                0
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                6
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_072_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_072_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_072_input.jpg",
+        "save_id": 2236,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is NEGOTIATION, length 11.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2236.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_074",
+        "task": "global_longest_word_discovery",
+        "target_word": "STANDARDIZATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 15,
+        "grid_size": 14,
+        "grid_layout": [
+            [
+                "K",
+                "D",
+                "D",
+                "J",
+                "B",
+                "C",
+                "S",
+                "J",
+                "A",
+                "G",
+                "E",
+                "E",
+                "S",
+                "G"
+            ],
+            [
+                "O",
+                "U",
+                "F",
+                "U",
+                "N",
+                "H",
+                "S",
+                "A",
+                "S",
+                "P",
+                "R",
+                "C",
+                "Z",
+                "T"
+            ],
+            [
+                "W",
+                "S",
+                "O",
+                "Z",
+                "W",
+                "R",
+                "V",
+                "U",
+                "T",
+                "A",
+                "W",
+                "B",
+                "D",
+                "E"
+            ],
+            [
+                "F",
+                "A",
+                "D",
+                "N",
+                "N",
+                "F",
+                "X",
+                "G",
+                "Y",
+                "N",
+                "D",
+                "X",
+                "C",
+                "D"
+            ],
+            [
+                "J",
+                "T",
+                "A",
+                "H",
+                "Z",
+                "J",
+                "U",
+                "X",
+                "M",
+                "E",
+                "A",
+                "R",
+                "G",
+                "L"
+            ],
+            [
+                "B",
+                "R",
+                "R",
+                "A",
+                "I",
+                "F",
+                "L",
+                "K",
+                "E",
+                "Z",
+                "Z",
+                "D",
+                "B",
+                "T"
+            ],
+            [
+                "G",
+                "F",
+                "M",
+                "D",
+                "U",
+                "F",
+                "X",
+                "E",
+                "T",
+                "X",
+                "M",
+                "I",
+                "Z",
+                "Z"
+            ],
+            [
+                "I",
+                "J",
+                "Z",
+                "A",
+                "J",
+                "H",
+                "M",
+                "W",
+                "A",
+                "U",
+                "H",
+                "L",
+                "A",
+                "S"
+            ],
+            [
+                "J",
+                "M",
+                "S",
+                "E",
+                "F",
+                "E",
+                "H",
+                "V",
+                "O",
+                "P",
+                "Y",
+                "L",
+                "T",
+                "I"
+            ],
+            [
+                "R",
+                "E",
+                "S",
+                "K",
+                "V",
+                "Q",
+                "Z",
+                "I",
+                "W",
+                "D",
+                "C",
+                "B",
+                "Z",
+                "O"
+            ],
+            [
+                "O",
+                "H",
+                "O",
+                "C",
+                "L",
+                "O",
+                "Q",
+                "M",
+                "O",
+                "B",
+                "K",
+                "Z",
+                "V",
+                "N"
+            ],
+            [
+                "H",
+                "M",
+                "Z",
+                "Z",
+                "H",
+                "G",
+                "W",
+                "Q",
+                "V",
+                "R",
+                "K",
+                "Z",
+                "O",
+                "Z"
+            ],
+            [
+                "R",
+                "W",
+                "Y",
+                "U",
+                "X",
+                "S",
+                "Z",
+                "L",
+                "A",
+                "C",
+                "I",
+                "P",
+                "W",
+                "E"
+            ],
+            [
+                "H",
+                "A",
+                "T",
+                "J",
+                "J",
+                "D",
+                "J",
+                "T",
+                "W",
+                "S",
+                "R",
+                "Q",
+                "J",
+                "V"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                8
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                2,
+                9
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                3,
+                10
+            ],
+            [
+                4,
+                10
+            ],
+            [
+                4,
+                11
+            ],
+            [
+                5,
+                11
+            ],
+            [
+                6,
+                11
+            ],
+            [
+                6,
+                12
+            ],
+            [
+                7,
+                12
+            ],
+            [
+                8,
+                12
+            ],
+            [
+                8,
+                13
+            ],
+            [
+                9,
+                13
+            ],
+            [
+                10,
+                13
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_074_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_074_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_074_input.jpg",
+        "save_id": 2238,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is STANDARDIZATION, length 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2238.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_076",
+        "task": "global_longest_word_discovery",
+        "target_word": "INVESTIGATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 13,
+        "grid_size": 12,
+        "grid_layout": [
+            [
+                "Y",
+                "Z",
+                "H",
+                "P",
+                "O",
+                "N",
+                "L",
+                "V",
+                "B",
+                "T",
+                "Q",
+                "O"
+            ],
+            [
+                "D",
+                "A",
+                "P",
+                "V",
+                "A",
+                "D",
+                "P",
+                "W",
+                "D",
+                "O",
+                "W",
+                "J"
+            ],
+            [
+                "T",
+                "V",
+                "V",
+                "C",
+                "I",
+                "K",
+                "T",
+                "P",
+                "M",
+                "M",
+                "C",
+                "J"
+            ],
+            [
+                "D",
+                "K",
+                "L",
+                "H",
+                "N",
+                "C",
+                "C",
+                "A",
+                "N",
+                "I",
+                "P",
+                "J"
+            ],
+            [
+                "J",
+                "W",
+                "A",
+                "N",
+                "V",
+                "E",
+                "F",
+                "M",
+                "L",
+                "Y",
+                "L",
+                "O"
+            ],
+            [
+                "U",
+                "E",
+                "B",
+                "V",
+                "K",
+                "S",
+                "M",
+                "K",
+                "Y",
+                "I",
+                "R",
+                "M"
+            ],
+            [
+                "H",
+                "I",
+                "Q",
+                "W",
+                "Z",
+                "T",
+                "I",
+                "G",
+                "A",
+                "K",
+                "B",
+                "Y"
+            ],
+            [
+                "N",
+                "T",
+                "B",
+                "A",
+                "A",
+                "M",
+                "I",
+                "P",
+                "T",
+                "I",
+                "F",
+                "B"
+            ],
+            [
+                "Z",
+                "I",
+                "T",
+                "U",
+                "L",
+                "O",
+                "O",
+                "F",
+                "J",
+                "O",
+                "M",
+                "B"
+            ],
+            [
+                "M",
+                "W",
+                "J",
+                "Q",
+                "U",
+                "U",
+                "E",
+                "Z",
+                "H",
+                "N",
+                "Z",
+                "I"
+            ],
+            [
+                "I",
+                "O",
+                "E",
+                "Q",
+                "Q",
+                "X",
+                "X",
+                "N",
+                "Q",
+                "X",
+                "N",
+                "Q"
+            ],
+            [
+                "P",
+                "U",
+                "N",
+                "U",
+                "A",
+                "E",
+                "R",
+                "I",
+                "A",
+                "U",
+                "P",
+                "M"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_076_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_076_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_076_input.jpg",
+        "save_id": 2240,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is INVESTIGATION, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2240.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_078",
+        "task": "global_longest_word_discovery",
+        "target_word": "SYSTEMATIZATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 15,
+        "grid_size": 14,
+        "grid_layout": [
+            [
+                "S",
+                "G",
+                "T",
+                "G",
+                "J",
+                "A",
+                "F",
+                "N",
+                "R",
+                "N",
+                "T",
+                "M",
+                "N",
+                "E"
+            ],
+            [
+                "F",
+                "L",
+                "B",
+                "K",
+                "A",
+                "O",
+                "G",
+                "O",
+                "J",
+                "C",
+                "T",
+                "A",
+                "O",
+                "H"
+            ],
+            [
+                "L",
+                "Z",
+                "Q",
+                "L",
+                "H",
+                "P",
+                "J",
+                "Z",
+                "X",
+                "C",
+                "K",
+                "C",
+                "C",
+                "Z"
+            ],
+            [
+                "Q",
+                "H",
+                "A",
+                "X",
+                "L",
+                "B",
+                "G",
+                "C",
+                "W",
+                "O",
+                "Y",
+                "J",
+                "U",
+                "V"
+            ],
+            [
+                "G",
+                "H",
+                "L",
+                "Z",
+                "C",
+                "M",
+                "S",
+                "S",
+                "T",
+                "S",
+                "R",
+                "Y",
+                "Z",
+                "X"
+            ],
+            [
+                "X",
+                "I",
+                "G",
+                "R",
+                "R",
+                "E",
+                "V",
+                "Z",
+                "J",
+                "B",
+                "O",
+                "Y",
+                "L",
+                "O"
+            ],
+            [
+                "N",
+                "H",
+                "P",
+                "V",
+                "B",
+                "X",
+                "B",
+                "G",
+                "X",
+                "K",
+                "F",
+                "Q",
+                "U",
+                "C"
+            ],
+            [
+                "P",
+                "V",
+                "B",
+                "O",
+                "S",
+                "H",
+                "E",
+                "D",
+                "G",
+                "M",
+                "N",
+                "S",
+                "U",
+                "X"
+            ],
+            [
+                "W",
+                "Z",
+                "V",
+                "W",
+                "M",
+                "Q",
+                "D",
+                "X",
+                "V",
+                "M",
+                "W",
+                "B",
+                "F",
+                "W"
+            ],
+            [
+                "S",
+                "G",
+                "Q",
+                "R",
+                "U",
+                "U",
+                "A",
+                "S",
+                "G",
+                "Z",
+                "R",
+                "Z",
+                "Z",
+                "M"
+            ],
+            [
+                "Y",
+                "T",
+                "E",
+                "Q",
+                "I",
+                "G",
+                "G",
+                "O",
+                "K",
+                "E",
+                "J",
+                "D",
+                "M",
+                "O"
+            ],
+            [
+                "S",
+                "N",
+                "G",
+                "E",
+                "E",
+                "B",
+                "L",
+                "Y",
+                "D",
+                "G",
+                "S",
+                "I",
+                "U",
+                "I"
+            ],
+            [
+                "T",
+                "E",
+                "M",
+                "R",
+                "G",
+                "G",
+                "B",
+                "E",
+                "K",
+                "J",
+                "C",
+                "D",
+                "D",
+                "G"
+            ],
+            [
+                "G",
+                "E",
+                "A",
+                "T",
+                "I",
+                "Z",
+                "A",
+                "T",
+                "I",
+                "O",
+                "N",
+                "J",
+                "X",
+                "H"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                9,
+                0
+            ],
+            [
+                10,
+                0
+            ],
+            [
+                11,
+                0
+            ],
+            [
+                12,
+                0
+            ],
+            [
+                12,
+                1
+            ],
+            [
+                12,
+                2
+            ],
+            [
+                13,
+                2
+            ],
+            [
+                13,
+                3
+            ],
+            [
+                13,
+                4
+            ],
+            [
+                13,
+                5
+            ],
+            [
+                13,
+                6
+            ],
+            [
+                13,
+                7
+            ],
+            [
+                13,
+                8
+            ],
+            [
+                13,
+                9
+            ],
+            [
+                13,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_078_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_078_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_078_input.jpg",
+        "save_id": 2242,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is SYSTEMATIZATION, length 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2242.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_080",
+        "task": "global_longest_word_discovery",
+        "target_word": "TRANSMISSION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 12,
+        "grid_layout": [
+            [
+                "T",
+                "N",
+                "E",
+                "S",
+                "A",
+                "W",
+                "M",
+                "R",
+                "L",
+                "P",
+                "X",
+                "I"
+            ],
+            [
+                "Z",
+                "O",
+                "D",
+                "T",
+                "P",
+                "F",
+                "S",
+                "D",
+                "O",
+                "R",
+                "S",
+                "S"
+            ],
+            [
+                "N",
+                "Y",
+                "J",
+                "C",
+                "S",
+                "S",
+                "E",
+                "T",
+                "Q",
+                "T",
+                "A",
+                "M"
+            ],
+            [
+                "Q",
+                "Z",
+                "N",
+                "E",
+                "U",
+                "C",
+                "H",
+                "K",
+                "V",
+                "W",
+                "J",
+                "Y"
+            ],
+            [
+                "X",
+                "F",
+                "D",
+                "V",
+                "T",
+                "R",
+                "W",
+                "U",
+                "L",
+                "K",
+                "F",
+                "M"
+            ],
+            [
+                "F",
+                "G",
+                "O",
+                "N",
+                "H",
+                "A",
+                "P",
+                "A",
+                "F",
+                "I",
+                "C",
+                "X"
+            ],
+            [
+                "J",
+                "T",
+                "F",
+                "I",
+                "P",
+                "N",
+                "E",
+                "C",
+                "C",
+                "P",
+                "N",
+                "O"
+            ],
+            [
+                "C",
+                "M",
+                "A",
+                "W",
+                "B",
+                "S",
+                "O",
+                "E",
+                "T",
+                "R",
+                "C",
+                "X"
+            ],
+            [
+                "T",
+                "C",
+                "L",
+                "G",
+                "Y",
+                "M",
+                "I",
+                "S",
+                "S",
+                "I",
+                "O",
+                "M"
+            ],
+            [
+                "A",
+                "F",
+                "K",
+                "H",
+                "V",
+                "S",
+                "T",
+                "H",
+                "V",
+                "R",
+                "N",
+                "X"
+            ],
+            [
+                "F",
+                "S",
+                "H",
+                "C",
+                "B",
+                "E",
+                "P",
+                "E",
+                "Z",
+                "G",
+                "J",
+                "Z"
+            ],
+            [
+                "P",
+                "I",
+                "B",
+                "T",
+                "Z",
+                "K",
+                "Q",
+                "B",
+                "Q",
+                "M",
+                "X",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                8,
+                10
+            ],
+            [
+                9,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_080_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_080_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_080_input.jpg",
+        "save_id": 2244,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is TRANSMISSION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2244.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_082",
+        "task": "global_longest_word_discovery",
+        "target_word": "INTERDISCIPLINARY",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 17,
+        "grid_size": 14,
+        "grid_layout": [
+            [
+                "N",
+                "J",
+                "I",
+                "N",
+                "D",
+                "A",
+                "Z",
+                "S",
+                "N",
+                "X",
+                "C",
+                "X",
+                "C",
+                "C"
+            ],
+            [
+                "H",
+                "H",
+                "D",
+                "D",
+                "M",
+                "G",
+                "K",
+                "Y",
+                "A",
+                "Z",
+                "I",
+                "W",
+                "E",
+                "T"
+            ],
+            [
+                "E",
+                "R",
+                "X",
+                "A",
+                "E",
+                "E",
+                "U",
+                "L",
+                "X",
+                "M",
+                "V",
+                "C",
+                "A",
+                "J"
+            ],
+            [
+                "R",
+                "C",
+                "I",
+                "Y",
+                "F",
+                "Q",
+                "R",
+                "A",
+                "Z",
+                "B",
+                "P",
+                "G",
+                "O",
+                "L"
+            ],
+            [
+                "T",
+                "V",
+                "C",
+                "G",
+                "H",
+                "J",
+                "F",
+                "X",
+                "B",
+                "V",
+                "W",
+                "M",
+                "T",
+                "R"
+            ],
+            [
+                "Q",
+                "V",
+                "S",
+                "S",
+                "M",
+                "M",
+                "X",
+                "W",
+                "F",
+                "O",
+                "L",
+                "X",
+                "T",
+                "K"
+            ],
+            [
+                "T",
+                "Z",
+                "B",
+                "V",
+                "Y",
+                "X",
+                "F",
+                "F",
+                "D",
+                "N",
+                "I",
+                "K",
+                "G",
+                "Z"
+            ],
+            [
+                "Z",
+                "S",
+                "Q",
+                "Z",
+                "P",
+                "F",
+                "C",
+                "X",
+                "B",
+                "S",
+                "V",
+                "U",
+                "D",
+                "I"
+            ],
+            [
+                "B",
+                "Z",
+                "N",
+                "Y",
+                "G",
+                "G",
+                "L",
+                "U",
+                "X",
+                "Z",
+                "W",
+                "W",
+                "R",
+                "W"
+            ],
+            [
+                "I",
+                "N",
+                "T",
+                "E",
+                "R",
+                "B",
+                "O",
+                "Q",
+                "F",
+                "Q",
+                "Q",
+                "O",
+                "G",
+                "P"
+            ],
+            [
+                "V",
+                "C",
+                "N",
+                "C",
+                "D",
+                "I",
+                "W",
+                "U",
+                "Z",
+                "P",
+                "O",
+                "Y",
+                "P",
+                "F"
+            ],
+            [
+                "Q",
+                "I",
+                "Z",
+                "L",
+                "X",
+                "S",
+                "E",
+                "C",
+                "Q",
+                "I",
+                "W",
+                "W",
+                "I",
+                "C"
+            ],
+            [
+                "O",
+                "Q",
+                "K",
+                "Y",
+                "B",
+                "C",
+                "W",
+                "E",
+                "O",
+                "O",
+                "C",
+                "X",
+                "T",
+                "T"
+            ],
+            [
+                "N",
+                "K",
+                "P",
+                "H",
+                "V",
+                "I",
+                "P",
+                "L",
+                "I",
+                "N",
+                "A",
+                "R",
+                "Y",
+                "Z"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                9,
+                0
+            ],
+            [
+                9,
+                1
+            ],
+            [
+                9,
+                2
+            ],
+            [
+                9,
+                3
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                10,
+                4
+            ],
+            [
+                10,
+                5
+            ],
+            [
+                11,
+                5
+            ],
+            [
+                12,
+                5
+            ],
+            [
+                13,
+                5
+            ],
+            [
+                13,
+                6
+            ],
+            [
+                13,
+                7
+            ],
+            [
+                13,
+                8
+            ],
+            [
+                13,
+                9
+            ],
+            [
+                13,
+                10
+            ],
+            [
+                13,
+                11
+            ],
+            [
+                13,
+                12
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_082_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_082_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_082_input.jpg",
+        "save_id": 2246,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is INTERDISCIPLINARY, length 17.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2246.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_084",
+        "task": "global_longest_word_discovery",
+        "target_word": "RELATIONSHIP",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 12,
+        "grid_layout": [
+            [
+                "V",
+                "B",
+                "O",
+                "I",
+                "O",
+                "E",
+                "A",
+                "Y",
+                "T",
+                "D",
+                "L",
+                "N"
+            ],
+            [
+                "K",
+                "E",
+                "R",
+                "E",
+                "P",
+                "X",
+                "R",
+                "E",
+                "L",
+                "I",
+                "I",
+                "F"
+            ],
+            [
+                "Z",
+                "M",
+                "P",
+                "Q",
+                "T",
+                "J",
+                "M",
+                "F",
+                "A",
+                "C",
+                "S",
+                "Z"
+            ],
+            [
+                "S",
+                "V",
+                "A",
+                "I",
+                "H",
+                "I",
+                "R",
+                "E",
+                "T",
+                "I",
+                "O",
+                "N"
+            ],
+            [
+                "Z",
+                "X",
+                "I",
+                "N",
+                "Z",
+                "E",
+                "S",
+                "B",
+                "N",
+                "D",
+                "B",
+                "S"
+            ],
+            [
+                "U",
+                "F",
+                "Z",
+                "T",
+                "L",
+                "U",
+                "P",
+                "J",
+                "X",
+                "D",
+                "U",
+                "H"
+            ],
+            [
+                "L",
+                "Z",
+                "U",
+                "J",
+                "W",
+                "X",
+                "V",
+                "H",
+                "E",
+                "O",
+                "R",
+                "I"
+            ],
+            [
+                "C",
+                "A",
+                "H",
+                "B",
+                "N",
+                "F",
+                "H",
+                "Z",
+                "K",
+                "M",
+                "H",
+                "P"
+            ],
+            [
+                "K",
+                "G",
+                "L",
+                "X",
+                "X",
+                "Z",
+                "J",
+                "G",
+                "L",
+                "Q",
+                "L",
+                "Z"
+            ],
+            [
+                "J",
+                "J",
+                "P",
+                "W",
+                "V",
+                "F",
+                "W",
+                "U",
+                "U",
+                "I",
+                "G",
+                "P"
+            ],
+            [
+                "F",
+                "C",
+                "Q",
+                "S",
+                "T",
+                "W",
+                "K",
+                "I",
+                "N",
+                "S",
+                "W",
+                "S"
+            ],
+            [
+                "V",
+                "O",
+                "K",
+                "V",
+                "W",
+                "V",
+                "P",
+                "P",
+                "X",
+                "W",
+                "Z",
+                "T"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                1,
+                8
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                3,
+                10
+            ],
+            [
+                3,
+                11
+            ],
+            [
+                4,
+                11
+            ],
+            [
+                5,
+                11
+            ],
+            [
+                6,
+                11
+            ],
+            [
+                7,
+                11
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_084_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_084_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_084_input.jpg",
+        "save_id": 2248,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is RELATIONSHIP, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2248.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_086",
+        "task": "global_longest_word_discovery",
+        "target_word": "MATHEMATICAL",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 10,
+        "grid_layout": [
+            [
+                "M",
+                "J",
+                "D",
+                "I",
+                "D",
+                "V",
+                "U",
+                "M",
+                "A",
+                "V"
+            ],
+            [
+                "E",
+                "T",
+                "C",
+                "J",
+                "B",
+                "S",
+                "B",
+                "F",
+                "T",
+                "H"
+            ],
+            [
+                "M",
+                "W",
+                "B",
+                "W",
+                "N",
+                "W",
+                "H",
+                "R",
+                "R",
+                "E"
+            ],
+            [
+                "G",
+                "X",
+                "E",
+                "D",
+                "D",
+                "V",
+                "P",
+                "S",
+                "Z",
+                "M"
+            ],
+            [
+                "T",
+                "Y",
+                "I",
+                "P",
+                "N",
+                "P",
+                "O",
+                "U",
+                "C",
+                "A"
+            ],
+            [
+                "C",
+                "H",
+                "I",
+                "L",
+                "K",
+                "D",
+                "T",
+                "H",
+                "E",
+                "T"
+            ],
+            [
+                "X",
+                "D",
+                "B",
+                "Y",
+                "R",
+                "P",
+                "M",
+                "J",
+                "I",
+                "I"
+            ],
+            [
+                "R",
+                "U",
+                "X",
+                "J",
+                "E",
+                "H",
+                "F",
+                "I",
+                "A",
+                "C"
+            ],
+            [
+                "J",
+                "Z",
+                "G",
+                "G",
+                "V",
+                "P",
+                "T",
+                "G",
+                "F",
+                "A"
+            ],
+            [
+                "Z",
+                "Y",
+                "M",
+                "V",
+                "N",
+                "L",
+                "E",
+                "K",
+                "I",
+                "L"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                7
+            ],
+            [
+                0,
+                8
+            ],
+            [
+                1,
+                8
+            ],
+            [
+                1,
+                9
+            ],
+            [
+                2,
+                9
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_086_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_086_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_086_input.jpg",
+        "save_id": 2250,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is MATHEMATICAL, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2250.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_088",
+        "task": "global_longest_word_discovery",
+        "target_word": "PHOTOGRAPHY",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 11,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "F",
+                "Q",
+                "R",
+                "J",
+                "V",
+                "Y",
+                "P",
+                "F",
+                "H",
+                "I",
+                "E"
+            ],
+            [
+                "G",
+                "M",
+                "V",
+                "G",
+                "G",
+                "N",
+                "H",
+                "W",
+                "P",
+                "H",
+                "J"
+            ],
+            [
+                "W",
+                "W",
+                "O",
+                "F",
+                "N",
+                "I",
+                "Q",
+                "M",
+                "H",
+                "Q",
+                "Z"
+            ],
+            [
+                "X",
+                "T",
+                "A",
+                "S",
+                "T",
+                "S",
+                "Q",
+                "Q",
+                "O",
+                "T",
+                "A"
+            ],
+            [
+                "S",
+                "H",
+                "D",
+                "B",
+                "X",
+                "O",
+                "P",
+                "E",
+                "R",
+                "O",
+                "G"
+            ],
+            [
+                "T",
+                "G",
+                "D",
+                "K",
+                "Y",
+                "W",
+                "B",
+                "S",
+                "U",
+                "J",
+                "R"
+            ],
+            [
+                "E",
+                "W",
+                "D",
+                "Z",
+                "N",
+                "N",
+                "J",
+                "P",
+                "D",
+                "P",
+                "A"
+            ],
+            [
+                "K",
+                "K",
+                "L",
+                "W",
+                "V",
+                "S",
+                "G",
+                "R",
+                "G",
+                "A",
+                "P"
+            ],
+            [
+                "Z",
+                "E",
+                "X",
+                "A",
+                "K",
+                "S",
+                "D",
+                "V",
+                "P",
+                "P",
+                "H"
+            ],
+            [
+                "K",
+                "Z",
+                "C",
+                "S",
+                "C",
+                "U",
+                "Y",
+                "G",
+                "S",
+                "J",
+                "Y"
+            ],
+            [
+                "S",
+                "C",
+                "S",
+                "N",
+                "O",
+                "Q",
+                "E",
+                "Q",
+                "W",
+                "Z",
+                "Z"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                8
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                4,
+                10
+            ],
+            [
+                5,
+                10
+            ],
+            [
+                6,
+                10
+            ],
+            [
+                7,
+                10
+            ],
+            [
+                8,
+                10
+            ],
+            [
+                9,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_088_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_088_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_088_input.jpg",
+        "save_id": 2252,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is PHOTOGRAPHY, length 11.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2252.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_090",
+        "task": "global_longest_word_discovery",
+        "target_word": "DISAPPOINTMENT",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 14,
+        "grid_layout": [
+            [
+                "C",
+                "N",
+                "F",
+                "O",
+                "Z",
+                "H",
+                "Y",
+                "W",
+                "D",
+                "F",
+                "H",
+                "V",
+                "W",
+                "X"
+            ],
+            [
+                "F",
+                "H",
+                "M",
+                "F",
+                "P",
+                "K",
+                "J",
+                "V",
+                "V",
+                "S",
+                "E",
+                "L",
+                "X",
+                "K"
+            ],
+            [
+                "N",
+                "U",
+                "L",
+                "A",
+                "Q",
+                "D",
+                "I",
+                "E",
+                "H",
+                "J",
+                "K",
+                "N",
+                "O",
+                "T"
+            ],
+            [
+                "R",
+                "U",
+                "M",
+                "S",
+                "Y",
+                "M",
+                "S",
+                "A",
+                "M",
+                "E",
+                "F",
+                "O",
+                "P",
+                "P"
+            ],
+            [
+                "P",
+                "G",
+                "M",
+                "C",
+                "Y",
+                "V",
+                "K",
+                "P",
+                "P",
+                "Y",
+                "K",
+                "W",
+                "I",
+                "T"
+            ],
+            [
+                "I",
+                "B",
+                "M",
+                "L",
+                "U",
+                "D",
+                "M",
+                "B",
+                "O",
+                "U",
+                "L",
+                "J",
+                "I",
+                "B"
+            ],
+            [
+                "J",
+                "I",
+                "W",
+                "D",
+                "K",
+                "F",
+                "Y",
+                "T",
+                "I",
+                "N",
+                "Z",
+                "V",
+                "C",
+                "B"
+            ],
+            [
+                "L",
+                "C",
+                "J",
+                "E",
+                "C",
+                "X",
+                "T",
+                "A",
+                "G",
+                "T",
+                "W",
+                "S",
+                "X",
+                "R"
+            ],
+            [
+                "Z",
+                "G",
+                "T",
+                "R",
+                "V",
+                "F",
+                "E",
+                "E",
+                "S",
+                "M",
+                "G",
+                "F",
+                "K",
+                "O"
+            ],
+            [
+                "Y",
+                "Y",
+                "X",
+                "F",
+                "A",
+                "O",
+                "B",
+                "P",
+                "E",
+                "E",
+                "N",
+                "T",
+                "X",
+                "W"
+            ],
+            [
+                "N",
+                "H",
+                "K",
+                "D",
+                "N",
+                "W",
+                "B",
+                "I",
+                "N",
+                "Z",
+                "C",
+                "Q",
+                "V",
+                "L"
+            ],
+            [
+                "K",
+                "M",
+                "N",
+                "Z",
+                "L",
+                "D",
+                "Z",
+                "X",
+                "L",
+                "N",
+                "U",
+                "J",
+                "C",
+                "T"
+            ],
+            [
+                "G",
+                "Z",
+                "B",
+                "S",
+                "Q",
+                "T",
+                "Y",
+                "Z",
+                "U",
+                "B",
+                "G",
+                "A",
+                "F",
+                "M"
+            ],
+            [
+                "U",
+                "R",
+                "N",
+                "C",
+                "G",
+                "V",
+                "L",
+                "Y",
+                "I",
+                "Q",
+                "H",
+                "D",
+                "D",
+                "A"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ],
+            [
+                9,
+                10
+            ],
+            [
+                9,
+                11
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_090_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_090_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_090_input.jpg",
+        "save_id": 2254,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is DISAPPOINTMENT, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2254.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_092",
+        "task": "global_longest_word_discovery",
+        "target_word": "MULTIDIMENSIONAL",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 16,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "M",
+                "W",
+                "G",
+                "F",
+                "Y",
+                "P",
+                "Q",
+                "S",
+                "P",
+                "A",
+                "J"
+            ],
+            [
+                "D",
+                "N",
+                "W",
+                "N",
+                "O",
+                "M",
+                "F",
+                "B",
+                "J",
+                "D",
+                "A"
+            ],
+            [
+                "M",
+                "U",
+                "L",
+                "T",
+                "F",
+                "K",
+                "X",
+                "B",
+                "P",
+                "V",
+                "Q"
+            ],
+            [
+                "V",
+                "V",
+                "K",
+                "I",
+                "D",
+                "I",
+                "L",
+                "Q",
+                "C",
+                "A",
+                "K"
+            ],
+            [
+                "Y",
+                "U",
+                "Q",
+                "B",
+                "H",
+                "M",
+                "E",
+                "C",
+                "Z",
+                "B",
+                "K"
+            ],
+            [
+                "T",
+                "L",
+                "J",
+                "J",
+                "J",
+                "C",
+                "N",
+                "S",
+                "L",
+                "V",
+                "K"
+            ],
+            [
+                "U",
+                "D",
+                "L",
+                "K",
+                "D",
+                "P",
+                "W",
+                "I",
+                "H",
+                "P",
+                "W"
+            ],
+            [
+                "N",
+                "T",
+                "L",
+                "E",
+                "D",
+                "E",
+                "U",
+                "O",
+                "S",
+                "H",
+                "P"
+            ],
+            [
+                "Q",
+                "R",
+                "W",
+                "E",
+                "Y",
+                "T",
+                "A",
+                "N",
+                "N",
+                "C",
+                "L"
+            ],
+            [
+                "W",
+                "F",
+                "C",
+                "P",
+                "E",
+                "E",
+                "B",
+                "A",
+                "T",
+                "N",
+                "A"
+            ],
+            [
+                "S",
+                "V",
+                "H",
+                "X",
+                "O",
+                "Q",
+                "K",
+                "L",
+                "Z",
+                "Y",
+                "I"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                0
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                10,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_092_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_092_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_092_input.jpg",
+        "save_id": 2256,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is MULTIDIMENSIONAL, length 16.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2256.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_094",
+        "task": "global_longest_word_discovery",
+        "target_word": "RECOMMENDATION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 14,
+        "grid_size": 13,
+        "grid_layout": [
+            [
+                "O",
+                "O",
+                "X",
+                "X",
+                "Z",
+                "S",
+                "K",
+                "W",
+                "A",
+                "M",
+                "N",
+                "R",
+                "M"
+            ],
+            [
+                "K",
+                "S",
+                "A",
+                "C",
+                "E",
+                "A",
+                "K",
+                "O",
+                "L",
+                "P",
+                "E",
+                "V",
+                "O"
+            ],
+            [
+                "Z",
+                "J",
+                "S",
+                "B",
+                "E",
+                "O",
+                "B",
+                "Y",
+                "R",
+                "D",
+                "O",
+                "G",
+                "R"
+            ],
+            [
+                "Z",
+                "M",
+                "V",
+                "S",
+                "M",
+                "V",
+                "E",
+                "P",
+                "E",
+                "W",
+                "P",
+                "N",
+                "A"
+            ],
+            [
+                "N",
+                "J",
+                "J",
+                "K",
+                "W",
+                "V",
+                "V",
+                "R",
+                "C",
+                "M",
+                "Q",
+                "K",
+                "G"
+            ],
+            [
+                "D",
+                "L",
+                "E",
+                "K",
+                "Y",
+                "E",
+                "Z",
+                "N",
+                "O",
+                "G",
+                "L",
+                "N",
+                "I"
+            ],
+            [
+                "L",
+                "U",
+                "H",
+                "M",
+                "G",
+                "U",
+                "P",
+                "E",
+                "M",
+                "Y",
+                "R",
+                "Z",
+                "Y"
+            ],
+            [
+                "X",
+                "V",
+                "J",
+                "O",
+                "Z",
+                "B",
+                "O",
+                "Q",
+                "M",
+                "F",
+                "K",
+                "I",
+                "X"
+            ],
+            [
+                "B",
+                "J",
+                "A",
+                "P",
+                "F",
+                "M",
+                "B",
+                "Z",
+                "E",
+                "N",
+                "Y",
+                "H",
+                "W"
+            ],
+            [
+                "H",
+                "M",
+                "A",
+                "J",
+                "Y",
+                "R",
+                "X",
+                "K",
+                "P",
+                "D",
+                "H",
+                "M",
+                "I"
+            ],
+            [
+                "K",
+                "L",
+                "T",
+                "S",
+                "F",
+                "N",
+                "Y",
+                "M",
+                "Z",
+                "A",
+                "T",
+                "J",
+                "Z"
+            ],
+            [
+                "H",
+                "S",
+                "T",
+                "W",
+                "U",
+                "O",
+                "Z",
+                "N",
+                "S",
+                "H",
+                "I",
+                "O",
+                "S"
+            ],
+            [
+                "X",
+                "P",
+                "U",
+                "N",
+                "T",
+                "Z",
+                "Q",
+                "G",
+                "R",
+                "G",
+                "R",
+                "N",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ],
+            [
+                10,
+                9
+            ],
+            [
+                10,
+                10
+            ],
+            [
+                11,
+                10
+            ],
+            [
+                11,
+                11
+            ],
+            [
+                12,
+                11
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_094_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_094_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_094_input.jpg",
+        "save_id": 2258,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is RECOMMENDATION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2258.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_096",
+        "task": "global_longest_word_discovery",
+        "target_word": "INTERCHANGEABLE",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 15,
+        "grid_size": 14,
+        "grid_layout": [
+            [
+                "F",
+                "T",
+                "H",
+                "C",
+                "S",
+                "U",
+                "Y",
+                "B",
+                "D",
+                "B",
+                "C",
+                "I",
+                "C",
+                "Z"
+            ],
+            [
+                "R",
+                "I",
+                "J",
+                "I",
+                "N",
+                "T",
+                "A",
+                "Q",
+                "J",
+                "I",
+                "S",
+                "V",
+                "D",
+                "T"
+            ],
+            [
+                "T",
+                "P",
+                "X",
+                "P",
+                "O",
+                "E",
+                "U",
+                "Y",
+                "R",
+                "Y",
+                "S",
+                "X",
+                "F",
+                "T"
+            ],
+            [
+                "U",
+                "P",
+                "D",
+                "N",
+                "Y",
+                "R",
+                "R",
+                "G",
+                "W",
+                "R",
+                "K",
+                "I",
+                "F",
+                "U"
+            ],
+            [
+                "A",
+                "N",
+                "M",
+                "M",
+                "K",
+                "C",
+                "A",
+                "J",
+                "O",
+                "T",
+                "T",
+                "B",
+                "H",
+                "C"
+            ],
+            [
+                "T",
+                "G",
+                "W",
+                "T",
+                "B",
+                "H",
+                "O",
+                "C",
+                "W",
+                "P",
+                "H",
+                "N",
+                "S",
+                "S"
+            ],
+            [
+                "Q",
+                "P",
+                "L",
+                "H",
+                "E",
+                "A",
+                "Y",
+                "G",
+                "A",
+                "E",
+                "N",
+                "T",
+                "T",
+                "G"
+            ],
+            [
+                "B",
+                "X",
+                "T",
+                "J",
+                "V",
+                "N",
+                "N",
+                "I",
+                "W",
+                "D",
+                "N",
+                "F",
+                "B",
+                "Z"
+            ],
+            [
+                "D",
+                "P",
+                "T",
+                "A",
+                "C",
+                "G",
+                "T",
+                "A",
+                "G",
+                "Z",
+                "B",
+                "V",
+                "A",
+                "D"
+            ],
+            [
+                "O",
+                "L",
+                "F",
+                "W",
+                "B",
+                "E",
+                "A",
+                "A",
+                "N",
+                "V",
+                "A",
+                "N",
+                "Z",
+                "O"
+            ],
+            [
+                "G",
+                "Q",
+                "O",
+                "D",
+                "Q",
+                "O",
+                "B",
+                "L",
+                "M",
+                "J",
+                "G",
+                "L",
+                "R",
+                "U"
+            ],
+            [
+                "W",
+                "Z",
+                "A",
+                "D",
+                "U",
+                "U",
+                "L",
+                "E",
+                "Q",
+                "Q",
+                "V",
+                "D",
+                "U",
+                "U"
+            ],
+            [
+                "S",
+                "H",
+                "O",
+                "Y",
+                "P",
+                "C",
+                "Z",
+                "Z",
+                "N",
+                "Z",
+                "K",
+                "V",
+                "D",
+                "A"
+            ],
+            [
+                "A",
+                "Q",
+                "V",
+                "B",
+                "Z",
+                "W",
+                "V",
+                "S",
+                "J",
+                "S",
+                "B",
+                "M",
+                "N",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                9,
+                6
+            ],
+            [
+                10,
+                6
+            ],
+            [
+                11,
+                6
+            ],
+            [
+                11,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_096_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_096_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_096_input.jpg",
+        "save_id": 2260,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is INTERCHANGEABLE, length 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2260.png",
+        "status": "skipped"
+    },
+    {
+        "id": "global_098",
+        "task": "global_longest_word_discovery",
+        "target_word": "DISTRIBUTION",
+        "prompt_en": "Help me find the longest word in this image. It can only go down or right. Please highlight the path in green.",
+        "prompt_cn": "帮我找一下图像里面最长的单词，只能向下或向右走，把路径染成绿色。",
+        "length": 12,
+        "grid_size": 11,
+        "grid_layout": [
+            [
+                "T",
+                "Q",
+                "Z",
+                "O",
+                "I",
+                "R",
+                "J",
+                "I",
+                "K",
+                "U",
+                "H"
+            ],
+            [
+                "O",
+                "Q",
+                "D",
+                "T",
+                "K",
+                "E",
+                "G",
+                "A",
+                "R",
+                "H",
+                "E"
+            ],
+            [
+                "A",
+                "R",
+                "U",
+                "B",
+                "N",
+                "P",
+                "P",
+                "T",
+                "B",
+                "H",
+                "H"
+            ],
+            [
+                "X",
+                "X",
+                "G",
+                "Z",
+                "K",
+                "Q",
+                "P",
+                "N",
+                "I",
+                "Z",
+                "S"
+            ],
+            [
+                "K",
+                "C",
+                "Y",
+                "R",
+                "M",
+                "D",
+                "I",
+                "S",
+                "T",
+                "Z",
+                "Y"
+            ],
+            [
+                "T",
+                "Z",
+                "Z",
+                "O",
+                "P",
+                "I",
+                "Z",
+                "X",
+                "R",
+                "C",
+                "A"
+            ],
+            [
+                "A",
+                "T",
+                "C",
+                "N",
+                "L",
+                "R",
+                "L",
+                "P",
+                "I",
+                "S",
+                "C"
+            ],
+            [
+                "V",
+                "Y",
+                "G",
+                "J",
+                "Z",
+                "M",
+                "N",
+                "T",
+                "B",
+                "A",
+                "U"
+            ],
+            [
+                "J",
+                "O",
+                "F",
+                "G",
+                "R",
+                "C",
+                "C",
+                "A",
+                "U",
+                "T",
+                "I"
+            ],
+            [
+                "F",
+                "W",
+                "N",
+                "V",
+                "N",
+                "Q",
+                "D",
+                "V",
+                "C",
+                "Y",
+                "O"
+            ],
+            [
+                "T",
+                "D",
+                "D",
+                "E",
+                "L",
+                "E",
+                "G",
+                "O",
+                "K",
+                "C",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                8,
+                10
+            ],
+            [
+                9,
+                10
+            ],
+            [
+                10,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_anywhere_no_arrows/global_098_input.jpg",
+        "result_image": "dataset_longest_anywhere_no_arrows/global_098_result.jpg",
+        "source_image": "Part4/Longest_Word_no_start/global_098_input.jpg",
+        "save_id": 2262,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is DISTRIBUTION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_No_Start/2262.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2265.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2265.png
new file mode 100644
index 0000000000000000000000000000000000000000..ab6f4c538cdf797bbd3e077e68b59ed4faafd0c0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2265.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:90fd33eafe44632918dcc2b30e5448c2d97d449d432b13406194e206a1998c62
+size 241096
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2267.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2267.png
new file mode 100644
index 0000000000000000000000000000000000000000..773c91fea9a373179e60aa06521437bcd866d5c9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2267.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:53eeb35dccbea947fb222dbe9133175db0d22332f1f236c0f4cdefd122f62bd9
+size 244620
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2269.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2269.png
new file mode 100644
index 0000000000000000000000000000000000000000..8c9fb6fe216cb924a1288e1b469530a65aafdb75
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2269.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a439641cf26338883c2e21e1e174ad8f0a5c1bc26708e4cafde7978e12caf213
+size 241010
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2271.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2271.png
new file mode 100644
index 0000000000000000000000000000000000000000..0a857ae02695e19c969905aa1370366e737b158b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2271.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d6802291786ed2a67d460c61ef0e4c29091be31d62d63e7a944ba1dc941f2556
+size 226028
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2273.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2273.png
new file mode 100644
index 0000000000000000000000000000000000000000..c32a2e4cf00c365f3c99171c8cdfdbadcf161e0a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2273.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2b5602b03ed1963439e8f566c876283e9488965733abea1eede53817740c6feb
+size 245053
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2275.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2275.png
new file mode 100644
index 0000000000000000000000000000000000000000..2c500cb39674a01451f15f2966331aca86305a4e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2275.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9ea10c79ffe36194fed3ba546d625d238093872a1221cbaf9071bb515a2d1fd5
+size 235817
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2277.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2277.png
new file mode 100644
index 0000000000000000000000000000000000000000..bd88343e1dda6721dae7ade2e608e15a96851a39
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2277.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9b126e5e6a40a804a6e9b33677de9f8d309e8718aa2b89a4517b1db1de56f69c
+size 239329
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2279.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2279.png
new file mode 100644
index 0000000000000000000000000000000000000000..5aeee7c5ed73a0a81f571d02b48958f87ce26593
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2279.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d72f022f1c2fae5ca094b65dea9af0c7084e67ad61d9c8e7561a7e4cf21358f8
+size 238297
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2281.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2281.png
new file mode 100644
index 0000000000000000000000000000000000000000..8f94ada58c64b21cb2cfe6793b68aa3dca576097
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2281.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c0ec8256cafcd65ce42575a3d75452476dcba8921f09976ec691145a9e760abd
+size 245904
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2283.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2283.png
new file mode 100644
index 0000000000000000000000000000000000000000..c9ad1087d5ecc1ddef3e44a60f0967913ba5c08e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2283.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9694edd0261a41546aa54d788f9437572a2be46f27ad761bdbcb4c320241db88
+size 251176
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2285.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2285.png
new file mode 100644
index 0000000000000000000000000000000000000000..6b109b0b696684d950b68817cfb828dbaab0e67e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2285.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:454645afb4319123153b0d81a1d9a6e15bc998afa03e5cbee2ead40475ce0b81
+size 246677
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2287.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2287.png
new file mode 100644
index 0000000000000000000000000000000000000000..fc9d6101d22a91907920cd10e1dd02c9eb78a54c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2287.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e6ec2e5b2e9bfd10d0371eb2c0644a1b386468a969ca5f1d159d9915d82352c3
+size 231130
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2289.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2289.png
new file mode 100644
index 0000000000000000000000000000000000000000..ebbc6657d380636d1b5cb6cac40801b8fa410917
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2289.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1495320c74a75ba25b05c9a20f32601d4528237b5e336c49da62b78ac0aa6794
+size 251705
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2291.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2291.png
new file mode 100644
index 0000000000000000000000000000000000000000..53394f374ec04200f0b8657c12be340186e65808
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2291.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cb03ca898e881d8b27e899be5c7fb15c208bac79abcbab8b4db3dd2c6a98ad73
+size 225483
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2293.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2293.png
new file mode 100644
index 0000000000000000000000000000000000000000..2ee742d3a04a68283994e98739100187372cc12e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2293.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:384038f0156e7fb29b5ac131ce03f6eebc7c8cab988c9bf14b205a934471acdb
+size 248502
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2295.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2295.png
new file mode 100644
index 0000000000000000000000000000000000000000..3ef2b7d9992f2f97cb3e4a15c49eda7677ceed11
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2295.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:75cb25d61f1260a02e5b1d1792de6151f9a8d99edca34f27c45f8f479b484d11
+size 248220
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2297.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2297.png
new file mode 100644
index 0000000000000000000000000000000000000000..4559e6846ce19a13ef03a0a774c708be85214b74
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2297.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7f6b98eb6a79c279772b89627ee7f8b7d17198c8889ca9c4af73b3e3159635ce
+size 225884
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2299.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2299.png
new file mode 100644
index 0000000000000000000000000000000000000000..071ca5f5e93b04d7b9de23e86ec45f37d4e25fb3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2299.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8ff4952df4eece70f8d861e77311ec521b35001ee2a6a1400d3162b9758f0dd0
+size 253600
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2301.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2301.png
new file mode 100644
index 0000000000000000000000000000000000000000..f3eb169a4409226b3d949da2ab5c7f54e77bbed9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2301.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:122a31ea5f17ed44a016ed4bbe61f979f0ca1b9a2c3c9e9c55fb4862599b9a06
+size 253975
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2303.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2303.png
new file mode 100644
index 0000000000000000000000000000000000000000..abadafb611aa88203f5d4668761f0b691444d4b5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2303.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5f7934bbad2f6fa217bb68ae578d3b9f5052653869fbad8d548859229781e946
+size 222171
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2305.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2305.png
new file mode 100644
index 0000000000000000000000000000000000000000..9b8260b06408718254fb53972ee012d0d3df3f7c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2305.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8f8e58907640618a91134182b9173f09dd70e442ec4b3a2d04164e7b5602af48
+size 223707
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2307.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2307.png
new file mode 100644
index 0000000000000000000000000000000000000000..1b7571a778945a831e966950fe8bf471753d219d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2307.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1603f02485d312fe80cce7c469022ed4fde57037e3db3bb91eaa7430a5411a8e
+size 218844
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2309.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2309.png
new file mode 100644
index 0000000000000000000000000000000000000000..629f2ae4b580e5e582d960a5f3d8857324c5d402
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2309.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:87232e221de9335583fec8d96cebe43e320eea61e515eed29211ac3c2fd144f6
+size 269692
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2311.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2311.png
new file mode 100644
index 0000000000000000000000000000000000000000..56bb1c8a5529a8d6543f0810b2c777ea58ec9fbf
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2311.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7cbb7415c3aee27f859dcdfcd24a30d107d8f6158d4bcd7a78a87a6402248bed
+size 177529
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2313.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2313.png
new file mode 100644
index 0000000000000000000000000000000000000000..ceee86cba4f41b9e2be7e4b4828130dced5a367d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2313.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3bd3c4d163866b11ce791e3e1e9232a03e399042063281f83c2e4bc6e4294e40
+size 217149
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2315.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2315.png
new file mode 100644
index 0000000000000000000000000000000000000000..9044da1956dbb8cc0fb2c5775dc6ef958947df0b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2315.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:77012fb29458053b121a96aad122abf171f42b5a834fda6c8280406506ff6a45
+size 266246
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2317.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2317.png
new file mode 100644
index 0000000000000000000000000000000000000000..2926b6fb8e66b2335fe022b299ad6d926d068ba2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2317.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:33abc372605c28531af1d380fcd8dd557887ee6ea69b7b7fb185a4943bbd9960
+size 168146
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2319.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2319.png
new file mode 100644
index 0000000000000000000000000000000000000000..ad26f9dffa36b4249a9830290c4a7f2ca8c18495
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2319.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:36475e5af888eb55ca7b193a405b7a04be9cec069125c377c784e327d6ca3e80
+size 248967
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2321.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2321.png
new file mode 100644
index 0000000000000000000000000000000000000000..1cd6d2f1be933f47ce8688caf25f7abd41542877
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2321.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2b332a2068c0907387efeb8f6f8aea9a85608e083ff8e8aa1df9d64999462ebd
+size 220862
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2323.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2323.png
new file mode 100644
index 0000000000000000000000000000000000000000..72d8e54db539080fadf49385683ab1314aba2f05
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2323.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9016b16362ddb742d91bba6b7bb84fe1c0a864fb2fd87ce0088f69c9dc15c766
+size 217364
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2325.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2325.png
new file mode 100644
index 0000000000000000000000000000000000000000..889f3d1c049d90f57f0eede1a8ece5c07e3e5466
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2325.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4f97b1ae2fd7062719516836e8a2d231ad4aa50cd17a998478b77b5a73c25f3b
+size 231140
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2327.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2327.png
new file mode 100644
index 0000000000000000000000000000000000000000..fa447f6ba27fad8197a600dfff2ab5074acaa6a9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2327.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9ad23ed802a0c73a0c1e6e2173a9c78105fd61c6dad34b564b78b908798fb3ba
+size 173991
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2329.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2329.png
new file mode 100644
index 0000000000000000000000000000000000000000..5ccb632f2f31fb892d74ad05a26dc4154f68d09a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2329.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dd4e6b35493bf974b3dca1cb04bda6504aa9d7f68de406451e0fddf0239f1eae
+size 217911
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2331.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2331.png
new file mode 100644
index 0000000000000000000000000000000000000000..52fd9c21b8ed0658ffab4503c506d032b27fe6a2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2331.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:762c735b1c0247cc79da1573ce4b52cfe42ac11991d863e8b53343208e9caeb9
+size 170494
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2333.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2333.png
new file mode 100644
index 0000000000000000000000000000000000000000..0aa69a1da5ceec0612f030c0a66744a7c1f373ab
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2333.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:94151ac776eaa1d98ddacd31ab82248cbd3fe046107614d987d9374eca038806
+size 261389
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2335.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2335.png
new file mode 100644
index 0000000000000000000000000000000000000000..f9e967319dbe539308aac9a844a209344dc3ed76
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2335.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b96296d838179e3709f4f58b320332f412930ead6556e16fb51eea92f1469125
+size 231599
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2337.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2337.png
new file mode 100644
index 0000000000000000000000000000000000000000..c4dda41956bbcb5da99af37348e87a863c01b50e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2337.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e898061a5789efb9590c2bbfcf8eac009e40a5b0be58c1dbebf9ed29d0763a28
+size 218530
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2339.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2339.png
new file mode 100644
index 0000000000000000000000000000000000000000..c6d2b5b4c49ec4676cd055516b347085d286d7ba
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2339.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9e5b25e897fba2ab2ce8308b9c3e5c1f6910fd5311c38331c7de821a24604217
+size 239744
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2341.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2341.png
new file mode 100644
index 0000000000000000000000000000000000000000..335f134475bce0c2a02dba5d7a95b859e58b43fc
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2341.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a4a9fa68372b720195e317024c55de9b2f9023ef0b1b72e3ca554892d2c2ae7f
+size 253097
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2343.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2343.png
new file mode 100644
index 0000000000000000000000000000000000000000..e3951372d8ffb2eb8e83723a10c55db73c071a75
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2343.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b4007efe43eefaa3c42eb98f16bc9a9cff60a66c895a10918cac7eb3356f110b
+size 262376
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2345.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2345.png
new file mode 100644
index 0000000000000000000000000000000000000000..00814ad503ee93314de9bf2ee05f0b5a9e03ba03
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2345.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:16c06315f1b34edb7844a0157f79aa2a04fd845aedf5b496a7309b4f28371e31
+size 180381
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2347.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2347.png
new file mode 100644
index 0000000000000000000000000000000000000000..1b899cb67ef112a149790842acf44e151833abc9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2347.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:84cfa2e37161f74f86a90ce0c89cf76d57c1dd15c18fa591b8768227e49a526b
+size 256986
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2349.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2349.png
new file mode 100644
index 0000000000000000000000000000000000000000..e5fd38d8b93610692e45ac953a7a3f3b75527495
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2349.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f5ecc45121a13f7c2492cc725abe7185441e200cd4042b10dca325da8c4c215f
+size 231778
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2351.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2351.png
new file mode 100644
index 0000000000000000000000000000000000000000..87bf5a77d18209dfe21bf5e72772dc8a0c118c63
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2351.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:12f216db6dcaa08e06821bfad50ba6ef1632941c4b8b3ea91966979ab7f5e2ee
+size 222254
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2353.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2353.png
new file mode 100644
index 0000000000000000000000000000000000000000..8ea515e7fed10e17dd862ee82bfc93c5485869b3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2353.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c91408605332460f84074c2181f74d5665282da7599bb9dc913d22d714308ce9
+size 169827
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2355.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2355.png
new file mode 100644
index 0000000000000000000000000000000000000000..b7d4a7b9b725813de4e1da562541801d4f612a83
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2355.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:aa0f4c7f4d97ba6a4078cd93e953b9170955305251f46a7f8111b69ab1e15891
+size 171683
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2357.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2357.png
new file mode 100644
index 0000000000000000000000000000000000000000..e025f06abf79e9237da91c2216a42d5bc0ccf4c8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2357.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:827591c30832e13ed264b3d68004a593df4826b36f45a95301d67559dc5081fa
+size 178191
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2359.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2359.png
new file mode 100644
index 0000000000000000000000000000000000000000..d88ab869ff06923e59700c03ccb92497f0844b72
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2359.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:498430c1d505919903d203611af2047647251a13a2ddc1c4b03a09b38c0edb1f
+size 232829
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2361.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2361.png
new file mode 100644
index 0000000000000000000000000000000000000000..bfa159f532b98a677002e64096c85d1de39f99f0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2361.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b8c46dd451830f08a7d451d88c952e771ff15be1f8da3aa396e6423349afb407
+size 240040
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2363.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2363.png
new file mode 100644
index 0000000000000000000000000000000000000000..6d858515f7532e1d1de86d7c5960f875dba59d2e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2363.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:eb2227c1e26733030e4275aea2a74f658fc8ee828b53401b07725128a0262c0e
+size 173448
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/Longest_Word_With_Start.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/Longest_Word_With_Start.json
new file mode 100644
index 0000000000000000000000000000000000000000..6c3585506413d1b3e86804506e709d229a8b9e4b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/Longest_Word_With_Start.json
@@ -0,0 +1,11892 @@
+[
+    {
+        "id": "task_start_001",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "NOTIFICATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            0,
+            0
+        ],
+        "grid_layout": [
+            [
+                "N",
+                "F",
+                "S",
+                "A",
+                "H",
+                "D",
+                "I",
+                "K",
+                "F",
+                "Q",
+                "W",
+                "L"
+            ],
+            [
+                "O",
+                "T",
+                "Q",
+                "V",
+                "S",
+                "Z",
+                "A",
+                "Z",
+                "K",
+                "S",
+                "T",
+                "T"
+            ],
+            [
+                "H",
+                "I",
+                "F",
+                "I",
+                "C",
+                "A",
+                "T",
+                "I",
+                "R",
+                "R",
+                "M",
+                "W"
+            ],
+            [
+                "A",
+                "F",
+                "J",
+                "F",
+                "V",
+                "M",
+                "N",
+                "O",
+                "N",
+                "J",
+                "J",
+                "F"
+            ],
+            [
+                "C",
+                "Y",
+                "M",
+                "J",
+                "Z",
+                "S",
+                "E",
+                "W",
+                "X",
+                "E",
+                "L",
+                "L"
+            ],
+            [
+                "J",
+                "H",
+                "C",
+                "X",
+                "N",
+                "S",
+                "X",
+                "D",
+                "J",
+                "M",
+                "L",
+                "S"
+            ],
+            [
+                "U",
+                "O",
+                "R",
+                "Q",
+                "C",
+                "Z",
+                "E",
+                "K",
+                "M",
+                "L",
+                "E",
+                "A"
+            ],
+            [
+                "E",
+                "J",
+                "E",
+                "H",
+                "I",
+                "R",
+                "G",
+                "G",
+                "C",
+                "V",
+                "U",
+                "I"
+            ],
+            [
+                "A",
+                "V",
+                "V",
+                "Z",
+                "O",
+                "G",
+                "L",
+                "V",
+                "P",
+                "D",
+                "I",
+                "X"
+            ],
+            [
+                "U",
+                "S",
+                "Y",
+                "A",
+                "I",
+                "L",
+                "I",
+                "R",
+                "U",
+                "S",
+                "U",
+                "Q"
+            ],
+            [
+                "W",
+                "P",
+                "K",
+                "R",
+                "V",
+                "F",
+                "M",
+                "F",
+                "S",
+                "X",
+                "Z",
+                "J"
+            ],
+            [
+                "K",
+                "A",
+                "H",
+                "U",
+                "L",
+                "E",
+                "B",
+                "G",
+                "K",
+                "D",
+                "U",
+                "P"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                0
+            ],
+            [
+                1,
+                0
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                3,
+                8
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_001_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_001_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_001_input.jpg",
+        "save_id": 2265,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is NOTIFICATION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2265.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_003",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "EXPERIMENTATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 15,
+        "start_node": [
+            5,
+            0
+        ],
+        "grid_layout": [
+            [
+                "H",
+                "P",
+                "L",
+                "H",
+                "O",
+                "J",
+                "Y",
+                "K",
+                "T",
+                "O",
+                "Z",
+                "L",
+                "L"
+            ],
+            [
+                "U",
+                "M",
+                "U",
+                "A",
+                "H",
+                "T",
+                "B",
+                "T",
+                "Z",
+                "W",
+                "I",
+                "Y",
+                "G"
+            ],
+            [
+                "A",
+                "Z",
+                "A",
+                "V",
+                "J",
+                "M",
+                "C",
+                "N",
+                "E",
+                "Z",
+                "B",
+                "H",
+                "G"
+            ],
+            [
+                "T",
+                "J",
+                "E",
+                "X",
+                "O",
+                "Q",
+                "W",
+                "X",
+                "H",
+                "F",
+                "N",
+                "S",
+                "H"
+            ],
+            [
+                "A",
+                "I",
+                "R",
+                "N",
+                "D",
+                "P",
+                "L",
+                "L",
+                "K",
+                "S",
+                "M",
+                "D",
+                "T"
+            ],
+            [
+                "E",
+                "X",
+                "P",
+                "E",
+                "R",
+                "I",
+                "M",
+                "E",
+                "N",
+                "V",
+                "V",
+                "E",
+                "T"
+            ],
+            [
+                "N",
+                "I",
+                "X",
+                "C",
+                "P",
+                "W",
+                "K",
+                "N",
+                "N",
+                "H",
+                "C",
+                "C",
+                "Y"
+            ],
+            [
+                "C",
+                "I",
+                "O",
+                "R",
+                "X",
+                "J",
+                "N",
+                "T",
+                "A",
+                "F",
+                "I",
+                "I",
+                "H"
+            ],
+            [
+                "K",
+                "Z",
+                "Y",
+                "C",
+                "J",
+                "O",
+                "Y",
+                "G",
+                "T",
+                "I",
+                "S",
+                "S",
+                "B"
+            ],
+            [
+                "M",
+                "E",
+                "G",
+                "X",
+                "U",
+                "R",
+                "O",
+                "O",
+                "Z",
+                "O",
+                "P",
+                "T",
+                "P"
+            ],
+            [
+                "X",
+                "C",
+                "K",
+                "L",
+                "L",
+                "D",
+                "E",
+                "Y",
+                "P",
+                "N",
+                "X",
+                "S",
+                "S"
+            ],
+            [
+                "Q",
+                "R",
+                "E",
+                "V",
+                "L",
+                "U",
+                "K",
+                "B",
+                "S",
+                "J",
+                "S",
+                "V",
+                "Z"
+            ],
+            [
+                "N",
+                "M",
+                "N",
+                "L",
+                "J",
+                "X",
+                "M",
+                "G",
+                "N",
+                "D",
+                "A",
+                "H",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                0
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ],
+            [
+                10,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_003_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_003_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_003_input.jpg",
+        "save_id": 2267,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is EXPERIMENTATION, length 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2267.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_005",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "ANTHROPOLOGY",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            3,
+            7
+        ],
+        "grid_layout": [
+            [
+                "I",
+                "W",
+                "V",
+                "B",
+                "D",
+                "W",
+                "L",
+                "E",
+                "K",
+                "V",
+                "S",
+                "X"
+            ],
+            [
+                "L",
+                "U",
+                "L",
+                "J",
+                "D",
+                "L",
+                "D",
+                "A",
+                "U",
+                "J",
+                "G",
+                "O"
+            ],
+            [
+                "N",
+                "X",
+                "C",
+                "E",
+                "T",
+                "T",
+                "P",
+                "E",
+                "T",
+                "B",
+                "Z",
+                "M"
+            ],
+            [
+                "W",
+                "M",
+                "W",
+                "G",
+                "P",
+                "U",
+                "O",
+                "A",
+                "V",
+                "T",
+                "Z",
+                "X"
+            ],
+            [
+                "V",
+                "Y",
+                "T",
+                "A",
+                "Y",
+                "T",
+                "Z",
+                "N",
+                "T",
+                "H",
+                "F",
+                "V"
+            ],
+            [
+                "H",
+                "P",
+                "T",
+                "T",
+                "L",
+                "K",
+                "L",
+                "I",
+                "Z",
+                "R",
+                "R",
+                "V"
+            ],
+            [
+                "Y",
+                "L",
+                "H",
+                "H",
+                "H",
+                "N",
+                "I",
+                "V",
+                "H",
+                "O",
+                "W",
+                "P"
+            ],
+            [
+                "R",
+                "K",
+                "Y",
+                "I",
+                "Y",
+                "K",
+                "R",
+                "S",
+                "F",
+                "P",
+                "D",
+                "P"
+            ],
+            [
+                "B",
+                "U",
+                "H",
+                "M",
+                "X",
+                "Q",
+                "L",
+                "Z",
+                "T",
+                "O",
+                "L",
+                "N"
+            ],
+            [
+                "U",
+                "K",
+                "M",
+                "O",
+                "Y",
+                "O",
+                "K",
+                "X",
+                "M",
+                "O",
+                "O",
+                "F"
+            ],
+            [
+                "E",
+                "S",
+                "V",
+                "P",
+                "Q",
+                "W",
+                "Q",
+                "K",
+                "S",
+                "X",
+                "G",
+                "B"
+            ],
+            [
+                "Q",
+                "T",
+                "Z",
+                "K",
+                "A",
+                "V",
+                "J",
+                "R",
+                "I",
+                "T",
+                "Y",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                8,
+                10
+            ],
+            [
+                9,
+                10
+            ],
+            [
+                10,
+                10
+            ],
+            [
+                11,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_005_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_005_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_005_input.jpg",
+        "save_id": 2269,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ANTHROPOLOGY, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2269.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_007",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "RECOGNITION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 11,
+        "start_node": [
+            6,
+            0
+        ],
+        "grid_layout": [
+            [
+                "J",
+                "J",
+                "X",
+                "H",
+                "B",
+                "I",
+                "F",
+                "C",
+                "L",
+                "S",
+                "V"
+            ],
+            [
+                "Z",
+                "Q",
+                "J",
+                "L",
+                "I",
+                "V",
+                "W",
+                "M",
+                "F",
+                "P",
+                "Z"
+            ],
+            [
+                "C",
+                "R",
+                "P",
+                "R",
+                "A",
+                "D",
+                "V",
+                "Y",
+                "N",
+                "H",
+                "I"
+            ],
+            [
+                "E",
+                "J",
+                "Q",
+                "R",
+                "H",
+                "F",
+                "T",
+                "N",
+                "U",
+                "Y",
+                "A"
+            ],
+            [
+                "B",
+                "I",
+                "P",
+                "Z",
+                "T",
+                "Y",
+                "I",
+                "T",
+                "H",
+                "W",
+                "Y"
+            ],
+            [
+                "Z",
+                "V",
+                "K",
+                "D",
+                "F",
+                "P",
+                "V",
+                "K",
+                "D",
+                "A",
+                "E"
+            ],
+            [
+                "R",
+                "W",
+                "C",
+                "I",
+                "D",
+                "W",
+                "T",
+                "L",
+                "H",
+                "O",
+                "L"
+            ],
+            [
+                "E",
+                "C",
+                "F",
+                "B",
+                "T",
+                "Y",
+                "S",
+                "Q",
+                "O",
+                "R",
+                "B"
+            ],
+            [
+                "G",
+                "O",
+                "G",
+                "N",
+                "I",
+                "T",
+                "I",
+                "O",
+                "R",
+                "V",
+                "G"
+            ],
+            [
+                "W",
+                "M",
+                "C",
+                "O",
+                "R",
+                "M",
+                "M",
+                "N",
+                "J",
+                "K",
+                "K"
+            ],
+            [
+                "K",
+                "X",
+                "F",
+                "V",
+                "N",
+                "N",
+                "M",
+                "Z",
+                "H",
+                "D",
+                "H"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                6,
+                0
+            ],
+            [
+                7,
+                0
+            ],
+            [
+                7,
+                1
+            ],
+            [
+                8,
+                1
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                9,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_007_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_007_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_007_input.jpg",
+        "save_id": 2271,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is RECOGNITION, length 11.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2271.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_009",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "VISUALIZATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            1,
+            8
+        ],
+        "grid_layout": [
+            [
+                "U",
+                "H",
+                "A",
+                "C",
+                "F",
+                "R",
+                "N",
+                "T",
+                "H",
+                "H",
+                "I",
+                "W"
+            ],
+            [
+                "V",
+                "S",
+                "A",
+                "C",
+                "W",
+                "V",
+                "Y",
+                "U",
+                "V",
+                "J",
+                "P",
+                "M"
+            ],
+            [
+                "E",
+                "B",
+                "D",
+                "J",
+                "F",
+                "L",
+                "O",
+                "G",
+                "I",
+                "W",
+                "A",
+                "W"
+            ],
+            [
+                "J",
+                "X",
+                "K",
+                "R",
+                "W",
+                "M",
+                "O",
+                "T",
+                "S",
+                "U",
+                "A",
+                "S"
+            ],
+            [
+                "B",
+                "U",
+                "S",
+                "G",
+                "U",
+                "N",
+                "V",
+                "A",
+                "E",
+                "G",
+                "L",
+                "I"
+            ],
+            [
+                "Q",
+                "O",
+                "U",
+                "J",
+                "X",
+                "U",
+                "N",
+                "E",
+                "H",
+                "O",
+                "I",
+                "Z"
+            ],
+            [
+                "I",
+                "V",
+                "M",
+                "L",
+                "T",
+                "Y",
+                "Y",
+                "K",
+                "Z",
+                "W",
+                "C",
+                "A"
+            ],
+            [
+                "X",
+                "M",
+                "N",
+                "J",
+                "I",
+                "N",
+                "F",
+                "G",
+                "Z",
+                "W",
+                "K",
+                "T"
+            ],
+            [
+                "T",
+                "V",
+                "W",
+                "S",
+                "X",
+                "P",
+                "R",
+                "T",
+                "H",
+                "I",
+                "O",
+                "I"
+            ],
+            [
+                "Z",
+                "O",
+                "R",
+                "Y",
+                "F",
+                "H",
+                "P",
+                "T",
+                "M",
+                "O",
+                "J",
+                "O"
+            ],
+            [
+                "I",
+                "E",
+                "L",
+                "H",
+                "U",
+                "Y",
+                "H",
+                "Y",
+                "P",
+                "V",
+                "T",
+                "N"
+            ],
+            [
+                "O",
+                "W",
+                "K",
+                "V",
+                "O",
+                "W",
+                "F",
+                "C",
+                "O",
+                "U",
+                "Y",
+                "Z"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                8
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                3,
+                10
+            ],
+            [
+                4,
+                10
+            ],
+            [
+                4,
+                11
+            ],
+            [
+                5,
+                11
+            ],
+            [
+                6,
+                11
+            ],
+            [
+                7,
+                11
+            ],
+            [
+                8,
+                11
+            ],
+            [
+                9,
+                11
+            ],
+            [
+                10,
+                11
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_009_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_009_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_009_input.jpg",
+        "save_id": 2273,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is VISUALIZATION, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2273.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_011",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "PARTICIPATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            6,
+            5
+        ],
+        "grid_layout": [
+            [
+                "Q",
+                "T",
+                "L",
+                "B",
+                "B",
+                "V",
+                "L",
+                "B",
+                "U",
+                "J",
+                "J",
+                "B",
+                "V"
+            ],
+            [
+                "L",
+                "Z",
+                "R",
+                "K",
+                "E",
+                "J",
+                "M",
+                "A",
+                "J",
+                "S",
+                "D",
+                "E",
+                "R"
+            ],
+            [
+                "G",
+                "O",
+                "R",
+                "M",
+                "D",
+                "X",
+                "E",
+                "X",
+                "I",
+                "T",
+                "C",
+                "P",
+                "A"
+            ],
+            [
+                "Z",
+                "N",
+                "Y",
+                "V",
+                "A",
+                "R",
+                "E",
+                "H",
+                "S",
+                "Y",
+                "D",
+                "X",
+                "X"
+            ],
+            [
+                "K",
+                "Q",
+                "S",
+                "O",
+                "F",
+                "D",
+                "Q",
+                "I",
+                "P",
+                "M",
+                "O",
+                "M",
+                "G"
+            ],
+            [
+                "I",
+                "E",
+                "D",
+                "R",
+                "P",
+                "A",
+                "T",
+                "A",
+                "E",
+                "W",
+                "O",
+                "R",
+                "P"
+            ],
+            [
+                "X",
+                "Y",
+                "N",
+                "P",
+                "L",
+                "P",
+                "A",
+                "R",
+                "B",
+                "I",
+                "N",
+                "A",
+                "F"
+            ],
+            [
+                "M",
+                "S",
+                "B",
+                "I",
+                "T",
+                "C",
+                "W",
+                "T",
+                "X",
+                "J",
+                "M",
+                "I",
+                "C"
+            ],
+            [
+                "C",
+                "M",
+                "R",
+                "K",
+                "N",
+                "U",
+                "C",
+                "I",
+                "O",
+                "Q",
+                "M",
+                "G",
+                "Q"
+            ],
+            [
+                "N",
+                "J",
+                "R",
+                "X",
+                "Z",
+                "T",
+                "M",
+                "C",
+                "S",
+                "A",
+                "V",
+                "K",
+                "L"
+            ],
+            [
+                "L",
+                "R",
+                "U",
+                "Y",
+                "M",
+                "W",
+                "B",
+                "I",
+                "P",
+                "I",
+                "E",
+                "K",
+                "G"
+            ],
+            [
+                "J",
+                "N",
+                "B",
+                "B",
+                "Z",
+                "Z",
+                "E",
+                "X",
+                "A",
+                "T",
+                "N",
+                "C",
+                "R"
+            ],
+            [
+                "F",
+                "Z",
+                "D",
+                "Q",
+                "M",
+                "W",
+                "T",
+                "O",
+                "X",
+                "I",
+                "O",
+                "N",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                10,
+                7
+            ],
+            [
+                10,
+                8
+            ],
+            [
+                11,
+                8
+            ],
+            [
+                11,
+                9
+            ],
+            [
+                12,
+                9
+            ],
+            [
+                12,
+                10
+            ],
+            [
+                12,
+                11
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_011_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_011_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_011_input.jpg",
+        "save_id": 2275,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is PARTICIPATION, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2275.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_013",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "ENVIRONMENTAL",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            2,
+            2
+        ],
+        "grid_layout": [
+            [
+                "J",
+                "W",
+                "C",
+                "E",
+                "P",
+                "Q",
+                "H",
+                "K",
+                "G",
+                "Q",
+                "H",
+                "S",
+                "O"
+            ],
+            [
+                "K",
+                "N",
+                "D",
+                "H",
+                "D",
+                "G",
+                "M",
+                "Z",
+                "H",
+                "P",
+                "P",
+                "Z",
+                "X"
+            ],
+            [
+                "B",
+                "T",
+                "E",
+                "N",
+                "E",
+                "W",
+                "Z",
+                "B",
+                "Q",
+                "Z",
+                "R",
+                "O",
+                "A"
+            ],
+            [
+                "Z",
+                "B",
+                "N",
+                "M",
+                "B",
+                "Z",
+                "P",
+                "Z",
+                "V",
+                "M",
+                "S",
+                "V",
+                "W"
+            ],
+            [
+                "X",
+                "Z",
+                "V",
+                "I",
+                "U",
+                "M",
+                "W",
+                "B",
+                "S",
+                "N",
+                "E",
+                "E",
+                "Q"
+            ],
+            [
+                "C",
+                "C",
+                "T",
+                "R",
+                "O",
+                "N",
+                "M",
+                "E",
+                "M",
+                "U",
+                "X",
+                "M",
+                "L"
+            ],
+            [
+                "F",
+                "K",
+                "N",
+                "L",
+                "S",
+                "N",
+                "T",
+                "N",
+                "B",
+                "X",
+                "N",
+                "I",
+                "M"
+            ],
+            [
+                "U",
+                "J",
+                "C",
+                "L",
+                "H",
+                "F",
+                "L",
+                "T",
+                "A",
+                "L",
+                "Z",
+                "T",
+                "J"
+            ],
+            [
+                "I",
+                "M",
+                "P",
+                "M",
+                "T",
+                "H",
+                "M",
+                "F",
+                "Y",
+                "J",
+                "T",
+                "Z",
+                "T"
+            ],
+            [
+                "S",
+                "X",
+                "A",
+                "X",
+                "U",
+                "S",
+                "R",
+                "A",
+                "L",
+                "N",
+                "A",
+                "L",
+                "W"
+            ],
+            [
+                "N",
+                "J",
+                "P",
+                "Q",
+                "O",
+                "Q",
+                "C",
+                "A",
+                "C",
+                "L",
+                "A",
+                "V",
+                "P"
+            ],
+            [
+                "H",
+                "J",
+                "Z",
+                "N",
+                "R",
+                "X",
+                "K",
+                "D",
+                "G",
+                "U",
+                "M",
+                "O",
+                "U"
+            ],
+            [
+                "Z",
+                "C",
+                "G",
+                "U",
+                "N",
+                "H",
+                "T",
+                "K",
+                "J",
+                "B",
+                "M",
+                "F",
+                "Y"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                7,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_013_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_013_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_013_input.jpg",
+        "save_id": 2277,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ENVIRONMENTAL, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2277.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_015",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "ARCHITECTURE",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            1,
+            8
+        ],
+        "grid_layout": [
+            [
+                "I",
+                "V",
+                "L",
+                "U",
+                "H",
+                "X",
+                "L",
+                "W",
+                "F",
+                "X",
+                "O",
+                "T"
+            ],
+            [
+                "R",
+                "T",
+                "K",
+                "E",
+                "D",
+                "N",
+                "J",
+                "Y",
+                "A",
+                "R",
+                "C",
+                "H"
+            ],
+            [
+                "I",
+                "N",
+                "H",
+                "E",
+                "F",
+                "Y",
+                "I",
+                "N",
+                "L",
+                "Z",
+                "I",
+                "I"
+            ],
+            [
+                "N",
+                "C",
+                "M",
+                "I",
+                "S",
+                "C",
+                "Q",
+                "K",
+                "Q",
+                "L",
+                "B",
+                "T"
+            ],
+            [
+                "K",
+                "D",
+                "E",
+                "P",
+                "K",
+                "Y",
+                "E",
+                "Q",
+                "K",
+                "K",
+                "D",
+                "E"
+            ],
+            [
+                "X",
+                "B",
+                "S",
+                "Z",
+                "N",
+                "K",
+                "W",
+                "M",
+                "O",
+                "R",
+                "T",
+                "C"
+            ],
+            [
+                "K",
+                "V",
+                "N",
+                "K",
+                "X",
+                "V",
+                "D",
+                "Y",
+                "J",
+                "Z",
+                "U",
+                "T"
+            ],
+            [
+                "Z",
+                "A",
+                "U",
+                "Y",
+                "L",
+                "N",
+                "Y",
+                "U",
+                "F",
+                "D",
+                "E",
+                "U"
+            ],
+            [
+                "D",
+                "Z",
+                "B",
+                "A",
+                "I",
+                "L",
+                "L",
+                "G",
+                "Y",
+                "H",
+                "J",
+                "R"
+            ],
+            [
+                "D",
+                "F",
+                "A",
+                "V",
+                "B",
+                "O",
+                "E",
+                "A",
+                "S",
+                "D",
+                "R",
+                "E"
+            ],
+            [
+                "Z",
+                "H",
+                "I",
+                "E",
+                "S",
+                "M",
+                "Y",
+                "E",
+                "F",
+                "L",
+                "J",
+                "J"
+            ],
+            [
+                "D",
+                "T",
+                "D",
+                "C",
+                "I",
+                "U",
+                "H",
+                "S",
+                "U",
+                "I",
+                "S",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                8
+            ],
+            [
+                1,
+                9
+            ],
+            [
+                1,
+                10
+            ],
+            [
+                1,
+                11
+            ],
+            [
+                2,
+                11
+            ],
+            [
+                3,
+                11
+            ],
+            [
+                4,
+                11
+            ],
+            [
+                5,
+                11
+            ],
+            [
+                6,
+                11
+            ],
+            [
+                7,
+                11
+            ],
+            [
+                8,
+                11
+            ],
+            [
+                9,
+                11
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_015_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_015_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_015_input.jpg",
+        "save_id": 2279,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ARCHITECTURE, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2279.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_017",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "ENTHUSIASTIC",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            5,
+            4
+        ],
+        "grid_layout": [
+            [
+                "K",
+                "K",
+                "C",
+                "J",
+                "R",
+                "K",
+                "P",
+                "O",
+                "O",
+                "V",
+                "U",
+                "O"
+            ],
+            [
+                "X",
+                "T",
+                "B",
+                "Q",
+                "O",
+                "I",
+                "J",
+                "L",
+                "I",
+                "R",
+                "N",
+                "F"
+            ],
+            [
+                "Q",
+                "A",
+                "U",
+                "U",
+                "B",
+                "K",
+                "I",
+                "O",
+                "P",
+                "S",
+                "B",
+                "U"
+            ],
+            [
+                "M",
+                "X",
+                "U",
+                "H",
+                "F",
+                "I",
+                "P",
+                "C",
+                "T",
+                "N",
+                "Y",
+                "J"
+            ],
+            [
+                "D",
+                "W",
+                "R",
+                "D",
+                "A",
+                "N",
+                "M",
+                "Z",
+                "P",
+                "A",
+                "Q",
+                "S"
+            ],
+            [
+                "R",
+                "V",
+                "F",
+                "T",
+                "E",
+                "W",
+                "W",
+                "T",
+                "Q",
+                "J",
+                "P",
+                "U"
+            ],
+            [
+                "W",
+                "T",
+                "Y",
+                "V",
+                "N",
+                "T",
+                "T",
+                "M",
+                "K",
+                "G",
+                "X",
+                "R"
+            ],
+            [
+                "D",
+                "B",
+                "G",
+                "Z",
+                "Q",
+                "H",
+                "I",
+                "F",
+                "S",
+                "K",
+                "N",
+                "D"
+            ],
+            [
+                "Z",
+                "T",
+                "R",
+                "V",
+                "W",
+                "U",
+                "I",
+                "W",
+                "U",
+                "P",
+                "D",
+                "K"
+            ],
+            [
+                "Q",
+                "N",
+                "V",
+                "U",
+                "H",
+                "S",
+                "W",
+                "I",
+                "O",
+                "J",
+                "S",
+                "D"
+            ],
+            [
+                "Z",
+                "Q",
+                "N",
+                "Z",
+                "H",
+                "I",
+                "R",
+                "C",
+                "B",
+                "Y",
+                "U",
+                "Y"
+            ],
+            [
+                "S",
+                "G",
+                "H",
+                "L",
+                "H",
+                "A",
+                "S",
+                "T",
+                "I",
+                "C",
+                "Z",
+                "F"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                10,
+                5
+            ],
+            [
+                11,
+                5
+            ],
+            [
+                11,
+                6
+            ],
+            [
+                11,
+                7
+            ],
+            [
+                11,
+                8
+            ],
+            [
+                11,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_017_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_017_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_017_input.jpg",
+        "save_id": 2281,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ENTHUSIASTIC, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2281.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_019",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "INDIVIDUALITY",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            1,
+            1
+        ],
+        "grid_layout": [
+            [
+                "X",
+                "A",
+                "N",
+                "I",
+                "P",
+                "L",
+                "M",
+                "S",
+                "L",
+                "G",
+                "S",
+                "G",
+                "I"
+            ],
+            [
+                "O",
+                "I",
+                "S",
+                "M",
+                "J",
+                "Q",
+                "X",
+                "U",
+                "X",
+                "G",
+                "P",
+                "X",
+                "U"
+            ],
+            [
+                "V",
+                "N",
+                "D",
+                "B",
+                "U",
+                "X",
+                "S",
+                "J",
+                "P",
+                "E",
+                "A",
+                "J",
+                "S"
+            ],
+            [
+                "P",
+                "R",
+                "I",
+                "I",
+                "S",
+                "A",
+                "H",
+                "Y",
+                "Q",
+                "O",
+                "X",
+                "H",
+                "U"
+            ],
+            [
+                "U",
+                "J",
+                "V",
+                "Z",
+                "X",
+                "H",
+                "Y",
+                "C",
+                "S",
+                "M",
+                "P",
+                "E",
+                "J"
+            ],
+            [
+                "Q",
+                "H",
+                "I",
+                "D",
+                "U",
+                "A",
+                "T",
+                "T",
+                "Y",
+                "Z",
+                "K",
+                "Q",
+                "S"
+            ],
+            [
+                "B",
+                "S",
+                "O",
+                "W",
+                "C",
+                "L",
+                "Y",
+                "M",
+                "N",
+                "R",
+                "S",
+                "B",
+                "K"
+            ],
+            [
+                "Q",
+                "H",
+                "R",
+                "H",
+                "M",
+                "I",
+                "T",
+                "Y",
+                "Z",
+                "U",
+                "N",
+                "J",
+                "O"
+            ],
+            [
+                "Q",
+                "R",
+                "F",
+                "C",
+                "J",
+                "Q",
+                "L",
+                "Z",
+                "G",
+                "S",
+                "E",
+                "I",
+                "G"
+            ],
+            [
+                "W",
+                "U",
+                "E",
+                "J",
+                "S",
+                "Z",
+                "C",
+                "G",
+                "F",
+                "H",
+                "N",
+                "T",
+                "E"
+            ],
+            [
+                "V",
+                "A",
+                "D",
+                "U",
+                "E",
+                "R",
+                "Q",
+                "N",
+                "U",
+                "J",
+                "Y",
+                "A",
+                "X"
+            ],
+            [
+                "B",
+                "I",
+                "B",
+                "J",
+                "Y",
+                "M",
+                "A",
+                "C",
+                "V",
+                "K",
+                "U",
+                "D",
+                "K"
+            ],
+            [
+                "O",
+                "I",
+                "E",
+                "D",
+                "K",
+                "W",
+                "O",
+                "I",
+                "R",
+                "J",
+                "P",
+                "F",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                1
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_019_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_019_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_019_input.jpg",
+        "save_id": 2283,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is INDIVIDUALITY, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2283.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_021",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "PHARMACEUTICAL",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 14,
+        "start_node": [
+            1,
+            4
+        ],
+        "grid_layout": [
+            [
+                "D",
+                "V",
+                "Z",
+                "V",
+                "H",
+                "O",
+                "W",
+                "Q",
+                "T",
+                "Q",
+                "F",
+                "K",
+                "Q"
+            ],
+            [
+                "U",
+                "Z",
+                "L",
+                "P",
+                "P",
+                "P",
+                "N",
+                "D",
+                "B",
+                "P",
+                "I",
+                "V",
+                "A"
+            ],
+            [
+                "F",
+                "T",
+                "Z",
+                "B",
+                "H",
+                "B",
+                "F",
+                "R",
+                "M",
+                "C",
+                "I",
+                "S",
+                "Z"
+            ],
+            [
+                "K",
+                "D",
+                "P",
+                "I",
+                "A",
+                "Q",
+                "B",
+                "T",
+                "H",
+                "K",
+                "Y",
+                "C",
+                "M"
+            ],
+            [
+                "G",
+                "N",
+                "Y",
+                "O",
+                "R",
+                "M",
+                "A",
+                "C",
+                "E",
+                "J",
+                "W",
+                "W",
+                "S"
+            ],
+            [
+                "W",
+                "E",
+                "W",
+                "A",
+                "M",
+                "D",
+                "V",
+                "M",
+                "U",
+                "R",
+                "V",
+                "G",
+                "E"
+            ],
+            [
+                "W",
+                "C",
+                "M",
+                "A",
+                "D",
+                "Z",
+                "W",
+                "Z",
+                "T",
+                "I",
+                "N",
+                "B",
+                "H"
+            ],
+            [
+                "W",
+                "B",
+                "V",
+                "M",
+                "M",
+                "B",
+                "W",
+                "V",
+                "R",
+                "C",
+                "O",
+                "M",
+                "Z"
+            ],
+            [
+                "X",
+                "N",
+                "Q",
+                "T",
+                "P",
+                "S",
+                "B",
+                "O",
+                "B",
+                "A",
+                "L",
+                "Q",
+                "B"
+            ],
+            [
+                "Y",
+                "O",
+                "B",
+                "G",
+                "P",
+                "V",
+                "O",
+                "G",
+                "T",
+                "U",
+                "J",
+                "F",
+                "J"
+            ],
+            [
+                "L",
+                "A",
+                "C",
+                "Q",
+                "S",
+                "S",
+                "J",
+                "D",
+                "I",
+                "M",
+                "T",
+                "V",
+                "L"
+            ],
+            [
+                "C",
+                "V",
+                "C",
+                "Z",
+                "U",
+                "V",
+                "U",
+                "S",
+                "K",
+                "C",
+                "N",
+                "P",
+                "C"
+            ],
+            [
+                "B",
+                "B",
+                "E",
+                "E",
+                "Q",
+                "I",
+                "R",
+                "D",
+                "C",
+                "O",
+                "L",
+                "G",
+                "P"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                8,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_021_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_021_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_021_input.jpg",
+        "save_id": 2285,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is PHARMACEUTICAL, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2285.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_023",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "NEIGHBORHOOD",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            2,
+            2
+        ],
+        "grid_layout": [
+            [
+                "A",
+                "G",
+                "H",
+                "T",
+                "B",
+                "K",
+                "X",
+                "C",
+                "T",
+                "L"
+            ],
+            [
+                "N",
+                "O",
+                "M",
+                "M",
+                "R",
+                "Q",
+                "C",
+                "H",
+                "X",
+                "T"
+            ],
+            [
+                "O",
+                "V",
+                "N",
+                "E",
+                "I",
+                "Y",
+                "W",
+                "M",
+                "S",
+                "Q"
+            ],
+            [
+                "D",
+                "Q",
+                "S",
+                "I",
+                "G",
+                "E",
+                "N",
+                "F",
+                "Q",
+                "M"
+            ],
+            [
+                "K",
+                "C",
+                "R",
+                "W",
+                "H",
+                "B",
+                "O",
+                "R",
+                "H",
+                "O"
+            ],
+            [
+                "X",
+                "P",
+                "B",
+                "V",
+                "F",
+                "N",
+                "I",
+                "A",
+                "L",
+                "O"
+            ],
+            [
+                "N",
+                "G",
+                "M",
+                "R",
+                "P",
+                "Z",
+                "A",
+                "Q",
+                "F",
+                "D"
+            ],
+            [
+                "V",
+                "O",
+                "O",
+                "K",
+                "B",
+                "N",
+                "P",
+                "Y",
+                "I",
+                "Q"
+            ],
+            [
+                "V",
+                "B",
+                "G",
+                "B",
+                "J",
+                "L",
+                "S",
+                "D",
+                "F",
+                "B"
+            ],
+            [
+                "G",
+                "F",
+                "F",
+                "M",
+                "R",
+                "P",
+                "W",
+                "I",
+                "D",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                6,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_023_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_023_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_023_input.jpg",
+        "save_id": 2287,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is NEIGHBORHOOD, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2287.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_025",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "UNDERSTANDING",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            1,
+            5
+        ],
+        "grid_layout": [
+            [
+                "X",
+                "T",
+                "G",
+                "L",
+                "M",
+                "Z",
+                "F",
+                "O",
+                "T",
+                "I",
+                "K",
+                "P"
+            ],
+            [
+                "G",
+                "L",
+                "R",
+                "K",
+                "P",
+                "U",
+                "N",
+                "P",
+                "I",
+                "V",
+                "O",
+                "G"
+            ],
+            [
+                "Q",
+                "F",
+                "X",
+                "G",
+                "A",
+                "K",
+                "D",
+                "E",
+                "R",
+                "S",
+                "J",
+                "Q"
+            ],
+            [
+                "E",
+                "V",
+                "W",
+                "T",
+                "G",
+                "T",
+                "U",
+                "A",
+                "L",
+                "T",
+                "A",
+                "N"
+            ],
+            [
+                "T",
+                "J",
+                "B",
+                "Z",
+                "Q",
+                "Q",
+                "R",
+                "P",
+                "F",
+                "I",
+                "Y",
+                "D"
+            ],
+            [
+                "N",
+                "X",
+                "B",
+                "R",
+                "I",
+                "K",
+                "B",
+                "E",
+                "O",
+                "T",
+                "G",
+                "I"
+            ],
+            [
+                "O",
+                "E",
+                "T",
+                "K",
+                "G",
+                "R",
+                "J",
+                "L",
+                "R",
+                "R",
+                "M",
+                "N"
+            ],
+            [
+                "B",
+                "M",
+                "H",
+                "M",
+                "O",
+                "T",
+                "B",
+                "D",
+                "M",
+                "Y",
+                "K",
+                "G"
+            ],
+            [
+                "X",
+                "Z",
+                "C",
+                "I",
+                "D",
+                "Y",
+                "G",
+                "H",
+                "S",
+                "C",
+                "G",
+                "J"
+            ],
+            [
+                "J",
+                "X",
+                "Y",
+                "Q",
+                "K",
+                "C",
+                "I",
+                "N",
+                "J",
+                "G",
+                "K",
+                "B"
+            ],
+            [
+                "V",
+                "E",
+                "P",
+                "V",
+                "G",
+                "H",
+                "Z",
+                "N",
+                "Q",
+                "W",
+                "B",
+                "W"
+            ],
+            [
+                "Y",
+                "U",
+                "K",
+                "P",
+                "Q",
+                "D",
+                "F",
+                "M",
+                "Z",
+                "P",
+                "E",
+                "Z"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                2,
+                9
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                3,
+                10
+            ],
+            [
+                3,
+                11
+            ],
+            [
+                4,
+                11
+            ],
+            [
+                5,
+                11
+            ],
+            [
+                6,
+                11
+            ],
+            [
+                7,
+                11
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_025_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_025_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_025_input.jpg",
+        "save_id": 2289,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is UNDERSTANDING, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2289.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_027",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "REQUIREMENT",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 11,
+        "start_node": [
+            3,
+            5
+        ],
+        "grid_layout": [
+            [
+                "X",
+                "Q",
+                "N",
+                "G",
+                "E",
+                "Z",
+                "W",
+                "A",
+                "X",
+                "N"
+            ],
+            [
+                "G",
+                "H",
+                "K",
+                "E",
+                "D",
+                "N",
+                "P",
+                "H",
+                "P",
+                "B"
+            ],
+            [
+                "E",
+                "H",
+                "U",
+                "S",
+                "G",
+                "H",
+                "Q",
+                "C",
+                "Q",
+                "J"
+            ],
+            [
+                "P",
+                "Z",
+                "K",
+                "M",
+                "M",
+                "R",
+                "T",
+                "X",
+                "B",
+                "Y"
+            ],
+            [
+                "U",
+                "E",
+                "M",
+                "W",
+                "V",
+                "E",
+                "W",
+                "Z",
+                "R",
+                "D"
+            ],
+            [
+                "O",
+                "U",
+                "F",
+                "X",
+                "J",
+                "Q",
+                "U",
+                "I",
+                "C",
+                "E"
+            ],
+            [
+                "K",
+                "A",
+                "Y",
+                "C",
+                "L",
+                "B",
+                "H",
+                "R",
+                "F",
+                "A"
+            ],
+            [
+                "C",
+                "R",
+                "B",
+                "G",
+                "C",
+                "I",
+                "Q",
+                "E",
+                "M",
+                "D"
+            ],
+            [
+                "A",
+                "Y",
+                "B",
+                "A",
+                "M",
+                "I",
+                "H",
+                "I",
+                "E",
+                "N"
+            ],
+            [
+                "R",
+                "X",
+                "O",
+                "O",
+                "O",
+                "V",
+                "L",
+                "E",
+                "S",
+                "T"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_027_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_027_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_027_input.jpg",
+        "save_id": 2291,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is REQUIREMENT, length 11.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2291.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_029",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "MANUFACTURING",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            3,
+            7
+        ],
+        "grid_layout": [
+            [
+                "W",
+                "W",
+                "W",
+                "O",
+                "N",
+                "Z",
+                "Q",
+                "K",
+                "J",
+                "O",
+                "S",
+                "D",
+                "D"
+            ],
+            [
+                "I",
+                "K",
+                "W",
+                "H",
+                "Y",
+                "C",
+                "T",
+                "Y",
+                "Y",
+                "X",
+                "L",
+                "S",
+                "E"
+            ],
+            [
+                "C",
+                "K",
+                "Q",
+                "L",
+                "A",
+                "K",
+                "Z",
+                "P",
+                "A",
+                "U",
+                "R",
+                "R",
+                "N"
+            ],
+            [
+                "I",
+                "Z",
+                "A",
+                "W",
+                "R",
+                "L",
+                "O",
+                "M",
+                "A",
+                "N",
+                "U",
+                "P",
+                "K"
+            ],
+            [
+                "H",
+                "S",
+                "X",
+                "H",
+                "N",
+                "C",
+                "N",
+                "C",
+                "J",
+                "V",
+                "F",
+                "A",
+                "C"
+            ],
+            [
+                "R",
+                "G",
+                "J",
+                "M",
+                "L",
+                "L",
+                "P",
+                "G",
+                "C",
+                "W",
+                "S",
+                "Q",
+                "T"
+            ],
+            [
+                "Q",
+                "R",
+                "Q",
+                "I",
+                "Y",
+                "F",
+                "M",
+                "Z",
+                "G",
+                "Z",
+                "Y",
+                "C",
+                "U"
+            ],
+            [
+                "Y",
+                "A",
+                "R",
+                "L",
+                "G",
+                "R",
+                "F",
+                "W",
+                "Y",
+                "R",
+                "O",
+                "J",
+                "R"
+            ],
+            [
+                "B",
+                "I",
+                "G",
+                "R",
+                "E",
+                "Q",
+                "A",
+                "K",
+                "F",
+                "Y",
+                "Q",
+                "P",
+                "I"
+            ],
+            [
+                "D",
+                "H",
+                "K",
+                "D",
+                "A",
+                "X",
+                "D",
+                "F",
+                "F",
+                "I",
+                "L",
+                "G",
+                "N"
+            ],
+            [
+                "V",
+                "G",
+                "M",
+                "D",
+                "R",
+                "E",
+                "M",
+                "R",
+                "D",
+                "P",
+                "F",
+                "E",
+                "G"
+            ],
+            [
+                "M",
+                "K",
+                "O",
+                "R",
+                "U",
+                "F",
+                "F",
+                "R",
+                "F",
+                "W",
+                "L",
+                "N",
+                "Z"
+            ],
+            [
+                "N",
+                "B",
+                "B",
+                "P",
+                "A",
+                "O",
+                "J",
+                "X",
+                "Y",
+                "J",
+                "C",
+                "D",
+                "R"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                7
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                3,
+                10
+            ],
+            [
+                4,
+                10
+            ],
+            [
+                4,
+                11
+            ],
+            [
+                4,
+                12
+            ],
+            [
+                5,
+                12
+            ],
+            [
+                6,
+                12
+            ],
+            [
+                7,
+                12
+            ],
+            [
+                8,
+                12
+            ],
+            [
+                9,
+                12
+            ],
+            [
+                10,
+                12
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_029_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_029_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_029_input.jpg",
+        "save_id": 2293,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is MANUFACTURING, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2293.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_031",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "CHARACTERIZATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 16,
+        "start_node": [
+            4,
+            2
+        ],
+        "grid_layout": [
+            [
+                "F",
+                "L",
+                "T",
+                "G",
+                "R",
+                "L",
+                "W",
+                "P",
+                "A",
+                "O",
+                "B",
+                "L"
+            ],
+            [
+                "K",
+                "D",
+                "E",
+                "N",
+                "E",
+                "X",
+                "O",
+                "M",
+                "B",
+                "Z",
+                "H",
+                "N"
+            ],
+            [
+                "L",
+                "F",
+                "Y",
+                "V",
+                "A",
+                "R",
+                "R",
+                "P",
+                "W",
+                "O",
+                "J",
+                "Q"
+            ],
+            [
+                "O",
+                "R",
+                "G",
+                "P",
+                "A",
+                "K",
+                "V",
+                "J",
+                "O",
+                "N",
+                "B",
+                "F"
+            ],
+            [
+                "E",
+                "J",
+                "C",
+                "H",
+                "X",
+                "F",
+                "O",
+                "B",
+                "P",
+                "B",
+                "Y",
+                "X"
+            ],
+            [
+                "U",
+                "T",
+                "Y",
+                "A",
+                "R",
+                "G",
+                "R",
+                "B",
+                "E",
+                "C",
+                "I",
+                "Q"
+            ],
+            [
+                "A",
+                "P",
+                "Z",
+                "J",
+                "A",
+                "F",
+                "B",
+                "G",
+                "E",
+                "V",
+                "M",
+                "D"
+            ],
+            [
+                "H",
+                "X",
+                "K",
+                "P",
+                "C",
+                "O",
+                "Z",
+                "T",
+                "I",
+                "I",
+                "E",
+                "Y"
+            ],
+            [
+                "C",
+                "Y",
+                "K",
+                "P",
+                "T",
+                "Z",
+                "V",
+                "O",
+                "Z",
+                "J",
+                "P",
+                "C"
+            ],
+            [
+                "V",
+                "A",
+                "K",
+                "Y",
+                "E",
+                "P",
+                "G",
+                "W",
+                "P",
+                "V",
+                "Y",
+                "C"
+            ],
+            [
+                "E",
+                "F",
+                "U",
+                "A",
+                "R",
+                "U",
+                "X",
+                "P",
+                "W",
+                "S",
+                "M",
+                "B"
+            ],
+            [
+                "D",
+                "W",
+                "K",
+                "X",
+                "I",
+                "Z",
+                "A",
+                "T",
+                "I",
+                "O",
+                "N",
+                "Z"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                10,
+                4
+            ],
+            [
+                11,
+                4
+            ],
+            [
+                11,
+                5
+            ],
+            [
+                11,
+                6
+            ],
+            [
+                11,
+                7
+            ],
+            [
+                11,
+                8
+            ],
+            [
+                11,
+                9
+            ],
+            [
+                11,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_031_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_031_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_031_input.jpg",
+        "save_id": 2295,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is CHARACTERIZATION, length 16.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2295.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_033",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "MANUFACTURER",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            1,
+            0
+        ],
+        "grid_layout": [
+            [
+                "E",
+                "L",
+                "Q",
+                "N",
+                "R",
+                "J",
+                "O",
+                "K",
+                "D",
+                "D",
+                "D"
+            ],
+            [
+                "M",
+                "A",
+                "N",
+                "C",
+                "I",
+                "R",
+                "P",
+                "P",
+                "G",
+                "G",
+                "X"
+            ],
+            [
+                "F",
+                "H",
+                "U",
+                "M",
+                "D",
+                "H",
+                "M",
+                "G",
+                "I",
+                "L",
+                "X"
+            ],
+            [
+                "M",
+                "I",
+                "F",
+                "H",
+                "R",
+                "G",
+                "C",
+                "J",
+                "M",
+                "Z",
+                "R"
+            ],
+            [
+                "V",
+                "B",
+                "A",
+                "I",
+                "N",
+                "A",
+                "R",
+                "J",
+                "L",
+                "A",
+                "M"
+            ],
+            [
+                "D",
+                "W",
+                "C",
+                "T",
+                "L",
+                "O",
+                "D",
+                "K",
+                "V",
+                "G",
+                "T"
+            ],
+            [
+                "B",
+                "A",
+                "M",
+                "U",
+                "R",
+                "M",
+                "L",
+                "G",
+                "V",
+                "U",
+                "G"
+            ],
+            [
+                "O",
+                "N",
+                "U",
+                "N",
+                "E",
+                "R",
+                "X",
+                "A",
+                "Q",
+                "G",
+                "M"
+            ],
+            [
+                "B",
+                "W",
+                "T",
+                "J",
+                "N",
+                "Q",
+                "K",
+                "U",
+                "Z",
+                "L",
+                "U"
+            ],
+            [
+                "U",
+                "J",
+                "U",
+                "R",
+                "R",
+                "Q",
+                "W",
+                "O",
+                "L",
+                "F",
+                "H"
+            ],
+            [
+                "R",
+                "G",
+                "G",
+                "U",
+                "X",
+                "K",
+                "F",
+                "P",
+                "O",
+                "F",
+                "W"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                0
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                5
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_033_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_033_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_033_input.jpg",
+        "save_id": 2297,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is MANUFACTURER, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2297.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_035",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "IMPLEMENTATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 14,
+        "start_node": [
+            8,
+            2
+        ],
+        "grid_layout": [
+            [
+                "A",
+                "N",
+                "B",
+                "D",
+                "F",
+                "G",
+                "F",
+                "F",
+                "S",
+                "I",
+                "O",
+                "A",
+                "B"
+            ],
+            [
+                "L",
+                "V",
+                "F",
+                "L",
+                "D",
+                "Y",
+                "I",
+                "G",
+                "A",
+                "T",
+                "P",
+                "L",
+                "E"
+            ],
+            [
+                "A",
+                "G",
+                "A",
+                "J",
+                "X",
+                "W",
+                "V",
+                "M",
+                "P",
+                "O",
+                "E",
+                "F",
+                "W"
+            ],
+            [
+                "J",
+                "Y",
+                "Z",
+                "W",
+                "C",
+                "P",
+                "H",
+                "Z",
+                "D",
+                "S",
+                "S",
+                "T",
+                "J"
+            ],
+            [
+                "R",
+                "T",
+                "F",
+                "V",
+                "C",
+                "V",
+                "E",
+                "F",
+                "D",
+                "Q",
+                "G",
+                "P",
+                "A"
+            ],
+            [
+                "P",
+                "O",
+                "I",
+                "A",
+                "J",
+                "A",
+                "E",
+                "P",
+                "Z",
+                "O",
+                "Y",
+                "C",
+                "I"
+            ],
+            [
+                "G",
+                "H",
+                "H",
+                "K",
+                "X",
+                "N",
+                "G",
+                "W",
+                "A",
+                "L",
+                "G",
+                "M",
+                "W"
+            ],
+            [
+                "Y",
+                "S",
+                "O",
+                "V",
+                "O",
+                "G",
+                "N",
+                "B",
+                "L",
+                "F",
+                "Y",
+                "E",
+                "E"
+            ],
+            [
+                "Q",
+                "X",
+                "I",
+                "M",
+                "P",
+                "U",
+                "D",
+                "M",
+                "U",
+                "H",
+                "F",
+                "S",
+                "X"
+            ],
+            [
+                "L",
+                "I",
+                "O",
+                "B",
+                "L",
+                "Y",
+                "H",
+                "A",
+                "U",
+                "T",
+                "V",
+                "M",
+                "E"
+            ],
+            [
+                "H",
+                "A",
+                "F",
+                "L",
+                "E",
+                "O",
+                "F",
+                "F",
+                "Q",
+                "Y",
+                "O",
+                "Q",
+                "L"
+            ],
+            [
+                "Y",
+                "O",
+                "G",
+                "B",
+                "M",
+                "K",
+                "L",
+                "G",
+                "Q",
+                "L",
+                "S",
+                "G",
+                "P"
+            ],
+            [
+                "K",
+                "J",
+                "O",
+                "M",
+                "E",
+                "N",
+                "T",
+                "A",
+                "T",
+                "I",
+                "O",
+                "N",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                10,
+                4
+            ],
+            [
+                11,
+                4
+            ],
+            [
+                12,
+                4
+            ],
+            [
+                12,
+                5
+            ],
+            [
+                12,
+                6
+            ],
+            [
+                12,
+                7
+            ],
+            [
+                12,
+                8
+            ],
+            [
+                12,
+                9
+            ],
+            [
+                12,
+                10
+            ],
+            [
+                12,
+                11
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_035_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_035_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_035_input.jpg",
+        "save_id": 2299,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is IMPLEMENTATION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2299.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_037",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "SOPHISTICATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 14,
+        "start_node": [
+            5,
+            0
+        ],
+        "grid_layout": [
+            [
+                "T",
+                "P",
+                "U",
+                "E",
+                "T",
+                "A",
+                "M",
+                "F",
+                "G",
+                "M",
+                "W",
+                "G"
+            ],
+            [
+                "M",
+                "Y",
+                "H",
+                "H",
+                "O",
+                "R",
+                "Y",
+                "Q",
+                "J",
+                "D",
+                "V",
+                "N"
+            ],
+            [
+                "Q",
+                "J",
+                "V",
+                "V",
+                "V",
+                "S",
+                "D",
+                "A",
+                "V",
+                "R",
+                "L",
+                "S"
+            ],
+            [
+                "E",
+                "I",
+                "R",
+                "N",
+                "E",
+                "E",
+                "X",
+                "H",
+                "J",
+                "G",
+                "Z",
+                "U"
+            ],
+            [
+                "L",
+                "L",
+                "B",
+                "X",
+                "E",
+                "H",
+                "C",
+                "D",
+                "I",
+                "B",
+                "U",
+                "R"
+            ],
+            [
+                "S",
+                "O",
+                "M",
+                "Z",
+                "Q",
+                "I",
+                "U",
+                "J",
+                "Y",
+                "O",
+                "D",
+                "P"
+            ],
+            [
+                "N",
+                "P",
+                "H",
+                "I",
+                "X",
+                "X",
+                "E",
+                "P",
+                "D",
+                "V",
+                "G",
+                "Y"
+            ],
+            [
+                "T",
+                "F",
+                "C",
+                "S",
+                "U",
+                "Z",
+                "L",
+                "X",
+                "I",
+                "F",
+                "V",
+                "S"
+            ],
+            [
+                "W",
+                "Q",
+                "X",
+                "T",
+                "I",
+                "A",
+                "U",
+                "L",
+                "G",
+                "H",
+                "P",
+                "J"
+            ],
+            [
+                "Y",
+                "G",
+                "B",
+                "N",
+                "C",
+                "A",
+                "O",
+                "B",
+                "X",
+                "Y",
+                "W",
+                "L"
+            ],
+            [
+                "E",
+                "E",
+                "Y",
+                "Y",
+                "J",
+                "T",
+                "Z",
+                "K",
+                "G",
+                "H",
+                "L",
+                "X"
+            ],
+            [
+                "R",
+                "T",
+                "R",
+                "A",
+                "U",
+                "I",
+                "O",
+                "N",
+                "J",
+                "H",
+                "P",
+                "P"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                0
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                10,
+                5
+            ],
+            [
+                11,
+                5
+            ],
+            [
+                11,
+                6
+            ],
+            [
+                11,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_037_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_037_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_037_input.jpg",
+        "save_id": 2301,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is SOPHISTICATION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2301.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_039",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "SOPHISTICATED",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            4,
+            2
+        ],
+        "grid_layout": [
+            [
+                "C",
+                "Y",
+                "B",
+                "Y",
+                "F",
+                "M",
+                "I",
+                "B",
+                "L",
+                "F"
+            ],
+            [
+                "I",
+                "Y",
+                "S",
+                "M",
+                "G",
+                "L",
+                "V",
+                "B",
+                "N",
+                "G"
+            ],
+            [
+                "L",
+                "W",
+                "V",
+                "E",
+                "N",
+                "K",
+                "L",
+                "S",
+                "D",
+                "S"
+            ],
+            [
+                "C",
+                "A",
+                "A",
+                "K",
+                "S",
+                "W",
+                "U",
+                "O",
+                "Q",
+                "I"
+            ],
+            [
+                "S",
+                "M",
+                "S",
+                "O",
+                "R",
+                "I",
+                "F",
+                "V",
+                "Y",
+                "S"
+            ],
+            [
+                "E",
+                "N",
+                "N",
+                "P",
+                "H",
+                "D",
+                "F",
+                "D",
+                "X",
+                "S"
+            ],
+            [
+                "I",
+                "D",
+                "M",
+                "L",
+                "I",
+                "V",
+                "I",
+                "J",
+                "Y",
+                "P"
+            ],
+            [
+                "B",
+                "N",
+                "P",
+                "F",
+                "S",
+                "T",
+                "I",
+                "C",
+                "J",
+                "G"
+            ],
+            [
+                "B",
+                "H",
+                "H",
+                "U",
+                "X",
+                "K",
+                "R",
+                "A",
+                "V",
+                "N"
+            ],
+            [
+                "K",
+                "K",
+                "B",
+                "L",
+                "X",
+                "H",
+                "Q",
+                "T",
+                "E",
+                "D"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                9,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_039_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_039_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_039_input.jpg",
+        "save_id": 2303,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is SOPHISTICATED, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2303.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_041",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "REHABILITATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 14,
+        "start_node": [
+            7,
+            0
+        ],
+        "grid_layout": [
+            [
+                "T",
+                "Z",
+                "R",
+                "V",
+                "E",
+                "N",
+                "F",
+                "N",
+                "B",
+                "X",
+                "P"
+            ],
+            [
+                "U",
+                "K",
+                "B",
+                "M",
+                "H",
+                "P",
+                "P",
+                "T",
+                "V",
+                "O",
+                "A"
+            ],
+            [
+                "H",
+                "J",
+                "G",
+                "Z",
+                "R",
+                "F",
+                "R",
+                "X",
+                "U",
+                "U",
+                "J"
+            ],
+            [
+                "M",
+                "L",
+                "D",
+                "P",
+                "A",
+                "O",
+                "M",
+                "O",
+                "Y",
+                "D",
+                "F"
+            ],
+            [
+                "L",
+                "Y",
+                "O",
+                "F",
+                "A",
+                "Q",
+                "P",
+                "C",
+                "K",
+                "I",
+                "L"
+            ],
+            [
+                "C",
+                "O",
+                "Z",
+                "N",
+                "W",
+                "E",
+                "E",
+                "N",
+                "P",
+                "T",
+                "Z"
+            ],
+            [
+                "T",
+                "D",
+                "V",
+                "P",
+                "N",
+                "J",
+                "Y",
+                "Z",
+                "B",
+                "S",
+                "P"
+            ],
+            [
+                "R",
+                "E",
+                "V",
+                "V",
+                "Q",
+                "R",
+                "I",
+                "U",
+                "Z",
+                "S",
+                "W"
+            ],
+            [
+                "X",
+                "H",
+                "C",
+                "O",
+                "D",
+                "H",
+                "F",
+                "I",
+                "B",
+                "X",
+                "W"
+            ],
+            [
+                "L",
+                "A",
+                "B",
+                "I",
+                "R",
+                "R",
+                "X",
+                "X",
+                "S",
+                "Q",
+                "M"
+            ],
+            [
+                "P",
+                "H",
+                "R",
+                "L",
+                "I",
+                "T",
+                "A",
+                "T",
+                "I",
+                "O",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                7,
+                0
+            ],
+            [
+                7,
+                1
+            ],
+            [
+                8,
+                1
+            ],
+            [
+                9,
+                1
+            ],
+            [
+                9,
+                2
+            ],
+            [
+                9,
+                3
+            ],
+            [
+                10,
+                3
+            ],
+            [
+                10,
+                4
+            ],
+            [
+                10,
+                5
+            ],
+            [
+                10,
+                6
+            ],
+            [
+                10,
+                7
+            ],
+            [
+                10,
+                8
+            ],
+            [
+                10,
+                9
+            ],
+            [
+                10,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_041_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_041_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_041_input.jpg",
+        "save_id": 2305,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is REHABILITATION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2305.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_043",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "KNOWLEDGEABLE",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            2,
+            0
+        ],
+        "grid_layout": [
+            [
+                "B",
+                "R",
+                "V",
+                "Y",
+                "B",
+                "X",
+                "S",
+                "L",
+                "L",
+                "L"
+            ],
+            [
+                "B",
+                "H",
+                "N",
+                "Q",
+                "I",
+                "V",
+                "O",
+                "Y",
+                "X",
+                "P"
+            ],
+            [
+                "K",
+                "S",
+                "Z",
+                "D",
+                "J",
+                "G",
+                "X",
+                "P",
+                "S",
+                "B"
+            ],
+            [
+                "N",
+                "S",
+                "E",
+                "C",
+                "D",
+                "T",
+                "M",
+                "L",
+                "A",
+                "D"
+            ],
+            [
+                "O",
+                "W",
+                "L",
+                "E",
+                "D",
+                "G",
+                "N",
+                "C",
+                "G",
+                "N"
+            ],
+            [
+                "T",
+                "X",
+                "B",
+                "O",
+                "F",
+                "E",
+                "S",
+                "V",
+                "M",
+                "Q"
+            ],
+            [
+                "K",
+                "C",
+                "H",
+                "K",
+                "A",
+                "A",
+                "B",
+                "L",
+                "E",
+                "Q"
+            ],
+            [
+                "D",
+                "D",
+                "P",
+                "W",
+                "N",
+                "X",
+                "C",
+                "F",
+                "Q",
+                "H"
+            ],
+            [
+                "Z",
+                "L",
+                "S",
+                "V",
+                "K",
+                "R",
+                "J",
+                "E",
+                "G",
+                "Q"
+            ],
+            [
+                "Z",
+                "Z",
+                "E",
+                "B",
+                "C",
+                "F",
+                "I",
+                "C",
+                "C",
+                "K"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                0
+            ],
+            [
+                3,
+                0
+            ],
+            [
+                4,
+                0
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                8
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_043_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_043_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_043_input.jpg",
+        "save_id": 2307,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is KNOWLEDGEABLE, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2307.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_045",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "INTERCHANGEABLE",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 15,
+        "start_node": [
+            5,
+            7
+        ],
+        "grid_layout": [
+            [
+                "W",
+                "X",
+                "G",
+                "A",
+                "W",
+                "Q",
+                "O",
+                "A",
+                "J",
+                "B",
+                "G",
+                "Y",
+                "P",
+                "T",
+                "G"
+            ],
+            [
+                "C",
+                "Z",
+                "V",
+                "I",
+                "C",
+                "G",
+                "Y",
+                "X",
+                "W",
+                "N",
+                "J",
+                "C",
+                "H",
+                "V",
+                "D"
+            ],
+            [
+                "D",
+                "V",
+                "N",
+                "X",
+                "A",
+                "O",
+                "D",
+                "Y",
+                "X",
+                "L",
+                "U",
+                "B",
+                "H",
+                "G",
+                "U"
+            ],
+            [
+                "L",
+                "T",
+                "A",
+                "B",
+                "D",
+                "V",
+                "V",
+                "T",
+                "N",
+                "J",
+                "O",
+                "A",
+                "C",
+                "F",
+                "X"
+            ],
+            [
+                "J",
+                "L",
+                "M",
+                "U",
+                "A",
+                "C",
+                "A",
+                "T",
+                "K",
+                "W",
+                "J",
+                "V",
+                "A",
+                "X",
+                "H"
+            ],
+            [
+                "F",
+                "J",
+                "I",
+                "S",
+                "G",
+                "I",
+                "V",
+                "I",
+                "S",
+                "G",
+                "W",
+                "J",
+                "M",
+                "G",
+                "P"
+            ],
+            [
+                "U",
+                "K",
+                "Q",
+                "T",
+                "Z",
+                "L",
+                "M",
+                "N",
+                "T",
+                "N",
+                "K",
+                "R",
+                "U",
+                "Z",
+                "R"
+            ],
+            [
+                "M",
+                "B",
+                "Y",
+                "J",
+                "D",
+                "E",
+                "B",
+                "M",
+                "E",
+                "R",
+                "C",
+                "H",
+                "A",
+                "K",
+                "H"
+            ],
+            [
+                "V",
+                "X",
+                "Z",
+                "Y",
+                "G",
+                "Q",
+                "F",
+                "T",
+                "S",
+                "G",
+                "Z",
+                "O",
+                "N",
+                "G",
+                "A"
+            ],
+            [
+                "U",
+                "Z",
+                "F",
+                "U",
+                "X",
+                "M",
+                "F",
+                "U",
+                "U",
+                "B",
+                "Z",
+                "T",
+                "Q",
+                "E",
+                "A"
+            ],
+            [
+                "O",
+                "Z",
+                "K",
+                "A",
+                "U",
+                "J",
+                "L",
+                "R",
+                "P",
+                "O",
+                "C",
+                "W",
+                "N",
+                "L",
+                "B"
+            ],
+            [
+                "T",
+                "L",
+                "V",
+                "X",
+                "L",
+                "P",
+                "P",
+                "J",
+                "B",
+                "Y",
+                "S",
+                "Q",
+                "V",
+                "F",
+                "L"
+            ],
+            [
+                "T",
+                "B",
+                "M",
+                "D",
+                "Z",
+                "P",
+                "G",
+                "S",
+                "C",
+                "V",
+                "P",
+                "X",
+                "P",
+                "S",
+                "E"
+            ],
+            [
+                "W",
+                "V",
+                "J",
+                "E",
+                "X",
+                "N",
+                "B",
+                "P",
+                "I",
+                "D",
+                "X",
+                "S",
+                "E",
+                "S",
+                "J"
+            ],
+            [
+                "B",
+                "N",
+                "I",
+                "L",
+                "T",
+                "T",
+                "O",
+                "R",
+                "T",
+                "P",
+                "V",
+                "C",
+                "U",
+                "X",
+                "R"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                7,
+                10
+            ],
+            [
+                7,
+                11
+            ],
+            [
+                7,
+                12
+            ],
+            [
+                8,
+                12
+            ],
+            [
+                8,
+                13
+            ],
+            [
+                9,
+                13
+            ],
+            [
+                9,
+                14
+            ],
+            [
+                10,
+                14
+            ],
+            [
+                11,
+                14
+            ],
+            [
+                12,
+                14
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_045_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_045_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_045_input.jpg",
+        "save_id": 2309,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is INTERCHANGEABLE, length 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2309.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_047",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "TRANSMISSION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            0,
+            4
+        ],
+        "grid_layout": [
+            [
+                "Z",
+                "P",
+                "V",
+                "Z",
+                "T",
+                "R",
+                "S",
+                "L",
+                "V"
+            ],
+            [
+                "O",
+                "K",
+                "H",
+                "H",
+                "Q",
+                "A",
+                "D",
+                "S",
+                "I"
+            ],
+            [
+                "Q",
+                "C",
+                "J",
+                "T",
+                "S",
+                "N",
+                "S",
+                "M",
+                "I"
+            ],
+            [
+                "S",
+                "U",
+                "Z",
+                "Q",
+                "A",
+                "W",
+                "C",
+                "T",
+                "S"
+            ],
+            [
+                "D",
+                "P",
+                "T",
+                "H",
+                "Q",
+                "F",
+                "X",
+                "H",
+                "S"
+            ],
+            [
+                "J",
+                "Y",
+                "L",
+                "K",
+                "Q",
+                "Y",
+                "F",
+                "P",
+                "I"
+            ],
+            [
+                "W",
+                "G",
+                "L",
+                "O",
+                "U",
+                "S",
+                "J",
+                "I",
+                "O"
+            ],
+            [
+                "J",
+                "X",
+                "W",
+                "B",
+                "O",
+                "Q",
+                "H",
+                "O",
+                "N"
+            ],
+            [
+                "Z",
+                "P",
+                "Q",
+                "M",
+                "Z",
+                "D",
+                "R",
+                "Q",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_047_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_047_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_047_input.jpg",
+        "save_id": 2311,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is TRANSMISSION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2311.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_049",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "DISTRIBUTION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            0,
+            2
+        ],
+        "grid_layout": [
+            [
+                "O",
+                "M",
+                "D",
+                "Q",
+                "V",
+                "X",
+                "K",
+                "T",
+                "B",
+                "J",
+                "D"
+            ],
+            [
+                "L",
+                "I",
+                "I",
+                "S",
+                "F",
+                "F",
+                "X",
+                "I",
+                "E",
+                "T",
+                "T"
+            ],
+            [
+                "V",
+                "E",
+                "B",
+                "T",
+                "R",
+                "I",
+                "L",
+                "R",
+                "H",
+                "Z",
+                "X"
+            ],
+            [
+                "T",
+                "D",
+                "G",
+                "Z",
+                "M",
+                "B",
+                "N",
+                "J",
+                "O",
+                "Q",
+                "Y"
+            ],
+            [
+                "A",
+                "S",
+                "N",
+                "M",
+                "B",
+                "U",
+                "P",
+                "N",
+                "A",
+                "K",
+                "J"
+            ],
+            [
+                "D",
+                "P",
+                "E",
+                "K",
+                "D",
+                "T",
+                "I",
+                "E",
+                "P",
+                "D",
+                "D"
+            ],
+            [
+                "Q",
+                "D",
+                "V",
+                "S",
+                "L",
+                "I",
+                "O",
+                "N",
+                "X",
+                "D",
+                "T"
+            ],
+            [
+                "Z",
+                "H",
+                "N",
+                "K",
+                "H",
+                "M",
+                "A",
+                "Q",
+                "L",
+                "X",
+                "B"
+            ],
+            [
+                "Z",
+                "G",
+                "S",
+                "S",
+                "Z",
+                "B",
+                "I",
+                "E",
+                "F",
+                "C",
+                "Y"
+            ],
+            [
+                "M",
+                "Y",
+                "D",
+                "I",
+                "N",
+                "D",
+                "Q",
+                "B",
+                "A",
+                "H",
+                "H"
+            ],
+            [
+                "C",
+                "N",
+                "G",
+                "N",
+                "N",
+                "L",
+                "Z",
+                "K",
+                "P",
+                "Q",
+                "Z"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                2
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_049_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_049_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_049_input.jpg",
+        "save_id": 2313,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is DISTRIBUTION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2313.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_051",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "DIFFERENTIATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 15,
+        "start_node": [
+            2,
+            11
+        ],
+        "grid_layout": [
+            [
+                "H",
+                "Q",
+                "G",
+                "I",
+                "A",
+                "G",
+                "E",
+                "K",
+                "S",
+                "E",
+                "U",
+                "D",
+                "T",
+                "I",
+                "K"
+            ],
+            [
+                "E",
+                "C",
+                "P",
+                "T",
+                "X",
+                "A",
+                "Z",
+                "E",
+                "V",
+                "D",
+                "G",
+                "Z",
+                "J",
+                "W",
+                "K"
+            ],
+            [
+                "P",
+                "F",
+                "I",
+                "L",
+                "B",
+                "M",
+                "D",
+                "E",
+                "Z",
+                "U",
+                "I",
+                "D",
+                "W",
+                "W",
+                "G"
+            ],
+            [
+                "S",
+                "K",
+                "K",
+                "P",
+                "H",
+                "B",
+                "L",
+                "Z",
+                "Z",
+                "Q",
+                "W",
+                "I",
+                "K",
+                "W",
+                "A"
+            ],
+            [
+                "C",
+                "S",
+                "F",
+                "O",
+                "I",
+                "L",
+                "H",
+                "Q",
+                "V",
+                "O",
+                "Z",
+                "F",
+                "I",
+                "S",
+                "Y"
+            ],
+            [
+                "Y",
+                "Q",
+                "E",
+                "M",
+                "E",
+                "M",
+                "F",
+                "T",
+                "B",
+                "T",
+                "O",
+                "F",
+                "E",
+                "W",
+                "X"
+            ],
+            [
+                "G",
+                "Q",
+                "B",
+                "A",
+                "C",
+                "S",
+                "D",
+                "P",
+                "H",
+                "I",
+                "J",
+                "L",
+                "R",
+                "U",
+                "Y"
+            ],
+            [
+                "T",
+                "J",
+                "N",
+                "P",
+                "Y",
+                "P",
+                "B",
+                "Y",
+                "E",
+                "F",
+                "D",
+                "P",
+                "E",
+                "E",
+                "J"
+            ],
+            [
+                "D",
+                "C",
+                "T",
+                "Z",
+                "X",
+                "W",
+                "A",
+                "L",
+                "F",
+                "F",
+                "J",
+                "Q",
+                "N",
+                "T",
+                "I"
+            ],
+            [
+                "Y",
+                "Y",
+                "N",
+                "V",
+                "Q",
+                "Q",
+                "O",
+                "Q",
+                "O",
+                "Y",
+                "K",
+                "K",
+                "F",
+                "T",
+                "A"
+            ],
+            [
+                "B",
+                "F",
+                "K",
+                "U",
+                "D",
+                "T",
+                "O",
+                "B",
+                "K",
+                "I",
+                "C",
+                "D",
+                "Y",
+                "S",
+                "T"
+            ],
+            [
+                "P",
+                "F",
+                "Q",
+                "F",
+                "O",
+                "Z",
+                "F",
+                "M",
+                "K",
+                "A",
+                "D",
+                "N",
+                "H",
+                "U",
+                "I"
+            ],
+            [
+                "P",
+                "Q",
+                "V",
+                "B",
+                "A",
+                "K",
+                "F",
+                "G",
+                "P",
+                "Y",
+                "H",
+                "H",
+                "H",
+                "K",
+                "O"
+            ],
+            [
+                "O",
+                "V",
+                "K",
+                "J",
+                "C",
+                "M",
+                "L",
+                "H",
+                "Y",
+                "H",
+                "Z",
+                "F",
+                "X",
+                "Y",
+                "N"
+            ],
+            [
+                "I",
+                "J",
+                "S",
+                "T",
+                "X",
+                "Z",
+                "K",
+                "G",
+                "Z",
+                "E",
+                "J",
+                "L",
+                "N",
+                "L",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                11
+            ],
+            [
+                3,
+                11
+            ],
+            [
+                4,
+                11
+            ],
+            [
+                5,
+                11
+            ],
+            [
+                5,
+                12
+            ],
+            [
+                6,
+                12
+            ],
+            [
+                7,
+                12
+            ],
+            [
+                8,
+                12
+            ],
+            [
+                8,
+                13
+            ],
+            [
+                8,
+                14
+            ],
+            [
+                9,
+                14
+            ],
+            [
+                10,
+                14
+            ],
+            [
+                11,
+                14
+            ],
+            [
+                12,
+                14
+            ],
+            [
+                13,
+                14
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_051_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_051_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_051_input.jpg",
+        "save_id": 2315,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is DIFFERENTIATION, length 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2315.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_053",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "ORGANIZATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            0,
+            3
+        ],
+        "grid_layout": [
+            [
+                "Z",
+                "D",
+                "J",
+                "O",
+                "R",
+                "G",
+                "A",
+                "N",
+                "A"
+            ],
+            [
+                "Z",
+                "N",
+                "U",
+                "I",
+                "R",
+                "A",
+                "R",
+                "I",
+                "Z"
+            ],
+            [
+                "E",
+                "Y",
+                "S",
+                "N",
+                "F",
+                "D",
+                "R",
+                "Y",
+                "A"
+            ],
+            [
+                "X",
+                "J",
+                "R",
+                "T",
+                "G",
+                "D",
+                "D",
+                "P",
+                "T"
+            ],
+            [
+                "U",
+                "H",
+                "I",
+                "D",
+                "E",
+                "O",
+                "H",
+                "Y",
+                "I"
+            ],
+            [
+                "W",
+                "S",
+                "L",
+                "K",
+                "Y",
+                "D",
+                "T",
+                "Y",
+                "O"
+            ],
+            [
+                "M",
+                "M",
+                "E",
+                "Y",
+                "R",
+                "Y",
+                "L",
+                "K",
+                "N"
+            ],
+            [
+                "I",
+                "S",
+                "R",
+                "R",
+                "W",
+                "K",
+                "A",
+                "R",
+                "Z"
+            ],
+            [
+                "N",
+                "T",
+                "D",
+                "J",
+                "H",
+                "L",
+                "O",
+                "P",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                3
+            ],
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                5
+            ],
+            [
+                0,
+                6
+            ],
+            [
+                0,
+                7
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                1,
+                8
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_053_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_053_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_053_input.jpg",
+        "save_id": 2317,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ORGANIZATION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2317.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_055",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "UNEXPECTEDLY",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            0,
+            5
+        ],
+        "grid_layout": [
+            [
+                "A",
+                "S",
+                "I",
+                "P",
+                "M",
+                "U",
+                "W",
+                "Q",
+                "D",
+                "X",
+                "Y",
+                "C"
+            ],
+            [
+                "S",
+                "I",
+                "P",
+                "U",
+                "M",
+                "N",
+                "E",
+                "C",
+                "H",
+                "L",
+                "B",
+                "P"
+            ],
+            [
+                "H",
+                "E",
+                "Z",
+                "V",
+                "V",
+                "D",
+                "X",
+                "P",
+                "U",
+                "X",
+                "K",
+                "H"
+            ],
+            [
+                "T",
+                "D",
+                "O",
+                "G",
+                "X",
+                "N",
+                "F",
+                "E",
+                "Q",
+                "K",
+                "Z",
+                "O"
+            ],
+            [
+                "G",
+                "I",
+                "B",
+                "J",
+                "O",
+                "F",
+                "Q",
+                "C",
+                "F",
+                "I",
+                "F",
+                "U"
+            ],
+            [
+                "I",
+                "C",
+                "U",
+                "A",
+                "P",
+                "X",
+                "H",
+                "T",
+                "W",
+                "A",
+                "K",
+                "T"
+            ],
+            [
+                "O",
+                "D",
+                "M",
+                "A",
+                "H",
+                "V",
+                "Y",
+                "E",
+                "D",
+                "L",
+                "U",
+                "D"
+            ],
+            [
+                "H",
+                "C",
+                "B",
+                "T",
+                "R",
+                "D",
+                "M",
+                "D",
+                "U",
+                "Y",
+                "J",
+                "M"
+            ],
+            [
+                "I",
+                "G",
+                "O",
+                "D",
+                "B",
+                "E",
+                "B",
+                "E",
+                "J",
+                "Z",
+                "G",
+                "G"
+            ],
+            [
+                "W",
+                "E",
+                "N",
+                "D",
+                "Y",
+                "S",
+                "S",
+                "Q",
+                "A",
+                "R",
+                "G",
+                "G"
+            ],
+            [
+                "W",
+                "M",
+                "S",
+                "G",
+                "U",
+                "F",
+                "X",
+                "F",
+                "A",
+                "M",
+                "I",
+                "Q"
+            ],
+            [
+                "D",
+                "H",
+                "O",
+                "R",
+                "M",
+                "U",
+                "D",
+                "H",
+                "O",
+                "L",
+                "X",
+                "H"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_055_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_055_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_055_input.jpg",
+        "save_id": 2319,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is UNEXPECTEDLY, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2319.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_057",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "REGISTRATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            5,
+            3
+        ],
+        "grid_layout": [
+            [
+                "S",
+                "Y",
+                "R",
+                "W",
+                "K",
+                "G",
+                "B",
+                "A",
+                "H",
+                "Y",
+                "A"
+            ],
+            [
+                "I",
+                "K",
+                "A",
+                "R",
+                "N",
+                "G",
+                "X",
+                "I",
+                "U",
+                "X",
+                "A"
+            ],
+            [
+                "J",
+                "O",
+                "Z",
+                "M",
+                "A",
+                "B",
+                "T",
+                "F",
+                "U",
+                "E",
+                "F"
+            ],
+            [
+                "H",
+                "C",
+                "H",
+                "O",
+                "T",
+                "U",
+                "Q",
+                "L",
+                "B",
+                "E",
+                "C"
+            ],
+            [
+                "J",
+                "X",
+                "J",
+                "C",
+                "D",
+                "P",
+                "G",
+                "P",
+                "H",
+                "J",
+                "H"
+            ],
+            [
+                "U",
+                "W",
+                "S",
+                "R",
+                "E",
+                "G",
+                "I",
+                "I",
+                "B",
+                "R",
+                "P"
+            ],
+            [
+                "C",
+                "T",
+                "H",
+                "K",
+                "U",
+                "T",
+                "S",
+                "T",
+                "J",
+                "Q",
+                "D"
+            ],
+            [
+                "C",
+                "Q",
+                "W",
+                "N",
+                "C",
+                "H",
+                "Q",
+                "R",
+                "B",
+                "H",
+                "Y"
+            ],
+            [
+                "F",
+                "H",
+                "T",
+                "X",
+                "N",
+                "O",
+                "Y",
+                "A",
+                "T",
+                "R",
+                "V"
+            ],
+            [
+                "A",
+                "Y",
+                "H",
+                "X",
+                "Q",
+                "G",
+                "W",
+                "X",
+                "I",
+                "J",
+                "R"
+            ],
+            [
+                "I",
+                "H",
+                "O",
+                "N",
+                "O",
+                "K",
+                "E",
+                "D",
+                "O",
+                "N",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                10,
+                8
+            ],
+            [
+                10,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_057_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_057_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_057_input.jpg",
+        "save_id": 2321,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is REGISTRATION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2321.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_059",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "PUBLICATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 11,
+        "start_node": [
+            2,
+            6
+        ],
+        "grid_layout": [
+            [
+                "O",
+                "P",
+                "H",
+                "E",
+                "T",
+                "D",
+                "D",
+                "N",
+                "Y",
+                "I"
+            ],
+            [
+                "X",
+                "Z",
+                "L",
+                "G",
+                "P",
+                "X",
+                "W",
+                "D",
+                "E",
+                "Q"
+            ],
+            [
+                "N",
+                "Y",
+                "E",
+                "D",
+                "C",
+                "D",
+                "P",
+                "U",
+                "B",
+                "L"
+            ],
+            [
+                "F",
+                "H",
+                "I",
+                "F",
+                "R",
+                "N",
+                "P",
+                "N",
+                "A",
+                "I"
+            ],
+            [
+                "W",
+                "Q",
+                "M",
+                "W",
+                "Y",
+                "U",
+                "N",
+                "T",
+                "C",
+                "C"
+            ],
+            [
+                "F",
+                "Q",
+                "S",
+                "W",
+                "P",
+                "I",
+                "J",
+                "M",
+                "G",
+                "A"
+            ],
+            [
+                "E",
+                "L",
+                "L",
+                "W",
+                "H",
+                "R",
+                "W",
+                "Q",
+                "J",
+                "T"
+            ],
+            [
+                "N",
+                "Y",
+                "G",
+                "A",
+                "H",
+                "E",
+                "Z",
+                "B",
+                "W",
+                "I"
+            ],
+            [
+                "U",
+                "B",
+                "G",
+                "E",
+                "Z",
+                "Y",
+                "Z",
+                "K",
+                "P",
+                "O"
+            ],
+            [
+                "Z",
+                "C",
+                "H",
+                "Y",
+                "D",
+                "A",
+                "Z",
+                "N",
+                "K",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                2,
+                9
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_059_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_059_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_059_input.jpg",
+        "save_id": 2323,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is PUBLICATION, length 11.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2323.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_061",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "ENTERTAINMENT",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            6,
+            1
+        ],
+        "grid_layout": [
+            [
+                "S",
+                "C",
+                "S",
+                "F",
+                "R",
+                "L",
+                "Q",
+                "D",
+                "K",
+                "C",
+                "C"
+            ],
+            [
+                "Q",
+                "I",
+                "E",
+                "J",
+                "W",
+                "E",
+                "J",
+                "I",
+                "W",
+                "L",
+                "T"
+            ],
+            [
+                "E",
+                "B",
+                "J",
+                "L",
+                "T",
+                "A",
+                "I",
+                "N",
+                "K",
+                "Q",
+                "D"
+            ],
+            [
+                "I",
+                "W",
+                "L",
+                "Q",
+                "H",
+                "C",
+                "U",
+                "X",
+                "V",
+                "F",
+                "X"
+            ],
+            [
+                "F",
+                "D",
+                "H",
+                "B",
+                "U",
+                "R",
+                "N",
+                "H",
+                "I",
+                "N",
+                "H"
+            ],
+            [
+                "M",
+                "F",
+                "X",
+                "W",
+                "V",
+                "B",
+                "U",
+                "A",
+                "B",
+                "H",
+                "X"
+            ],
+            [
+                "M",
+                "E",
+                "H",
+                "N",
+                "S",
+                "H",
+                "B",
+                "L",
+                "L",
+                "S",
+                "Y"
+            ],
+            [
+                "R",
+                "N",
+                "T",
+                "O",
+                "X",
+                "Y",
+                "S",
+                "I",
+                "P",
+                "Y",
+                "O"
+            ],
+            [
+                "R",
+                "T",
+                "E",
+                "R",
+                "T",
+                "E",
+                "B",
+                "T",
+                "L",
+                "D",
+                "H"
+            ],
+            [
+                "F",
+                "K",
+                "L",
+                "W",
+                "A",
+                "V",
+                "Z",
+                "A",
+                "R",
+                "M",
+                "D"
+            ],
+            [
+                "Y",
+                "K",
+                "O",
+                "I",
+                "I",
+                "N",
+                "M",
+                "E",
+                "N",
+                "T",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                6,
+                1
+            ],
+            [
+                7,
+                1
+            ],
+            [
+                8,
+                1
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                10,
+                4
+            ],
+            [
+                10,
+                5
+            ],
+            [
+                10,
+                6
+            ],
+            [
+                10,
+                7
+            ],
+            [
+                10,
+                8
+            ],
+            [
+                10,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_061_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_061_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_061_input.jpg",
+        "save_id": 2325,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ENTERTAINMENT, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2325.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_063",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "MATHEMATICIAN",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            0,
+            4
+        ],
+        "grid_layout": [
+            [
+                "R",
+                "E",
+                "T",
+                "U",
+                "M",
+                "A",
+                "Y",
+                "X",
+                "R"
+            ],
+            [
+                "V",
+                "E",
+                "C",
+                "H",
+                "E",
+                "T",
+                "A",
+                "D",
+                "I"
+            ],
+            [
+                "F",
+                "L",
+                "D",
+                "B",
+                "V",
+                "H",
+                "B",
+                "D",
+                "N"
+            ],
+            [
+                "L",
+                "R",
+                "Z",
+                "Y",
+                "U",
+                "E",
+                "B",
+                "W",
+                "S"
+            ],
+            [
+                "D",
+                "Y",
+                "E",
+                "U",
+                "Q",
+                "M",
+                "A",
+                "B",
+                "H"
+            ],
+            [
+                "R",
+                "O",
+                "H",
+                "Y",
+                "C",
+                "N",
+                "T",
+                "I",
+                "Z"
+            ],
+            [
+                "S",
+                "C",
+                "B",
+                "F",
+                "R",
+                "W",
+                "W",
+                "C",
+                "E"
+            ],
+            [
+                "L",
+                "P",
+                "D",
+                "N",
+                "R",
+                "F",
+                "M",
+                "I",
+                "A"
+            ],
+            [
+                "H",
+                "Z",
+                "E",
+                "A",
+                "C",
+                "A",
+                "N",
+                "S",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                8,
+                8
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_063_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_063_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_063_input.jpg",
+        "save_id": 2327,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is MATHEMATICIAN, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2327.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_065",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "ADMINISTRATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 14,
+        "start_node": [
+            4,
+            1
+        ],
+        "grid_layout": [
+            [
+                "U",
+                "B",
+                "M",
+                "L",
+                "U",
+                "L",
+                "K",
+                "Y",
+                "B",
+                "J"
+            ],
+            [
+                "Y",
+                "H",
+                "I",
+                "L",
+                "L",
+                "V",
+                "F",
+                "S",
+                "E",
+                "K"
+            ],
+            [
+                "C",
+                "M",
+                "K",
+                "K",
+                "W",
+                "Q",
+                "G",
+                "K",
+                "S",
+                "E"
+            ],
+            [
+                "J",
+                "P",
+                "R",
+                "V",
+                "D",
+                "S",
+                "W",
+                "G",
+                "Z",
+                "Y"
+            ],
+            [
+                "M",
+                "A",
+                "D",
+                "T",
+                "Y",
+                "E",
+                "R",
+                "W",
+                "G",
+                "W"
+            ],
+            [
+                "P",
+                "D",
+                "M",
+                "G",
+                "W",
+                "B",
+                "V",
+                "U",
+                "T",
+                "B"
+            ],
+            [
+                "N",
+                "U",
+                "I",
+                "D",
+                "C",
+                "P",
+                "N",
+                "P",
+                "N",
+                "T"
+            ],
+            [
+                "R",
+                "K",
+                "N",
+                "L",
+                "N",
+                "M",
+                "U",
+                "E",
+                "D",
+                "T"
+            ],
+            [
+                "N",
+                "O",
+                "I",
+                "S",
+                "L",
+                "R",
+                "W",
+                "Z",
+                "X",
+                "H"
+            ],
+            [
+                "S",
+                "X",
+                "N",
+                "T",
+                "R",
+                "A",
+                "T",
+                "I",
+                "O",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                1
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                9,
+                3
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                9,
+                6
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                9,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_065_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_065_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_065_input.jpg",
+        "save_id": 2329,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ADMINISTRATION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2329.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_067",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "DETERMINATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            1,
+            0
+        ],
+        "grid_layout": [
+            [
+                "I",
+                "M",
+                "R",
+                "B",
+                "J",
+                "P",
+                "I",
+                "N",
+                "O"
+            ],
+            [
+                "D",
+                "J",
+                "D",
+                "B",
+                "N",
+                "I",
+                "A",
+                "S",
+                "F"
+            ],
+            [
+                "E",
+                "G",
+                "J",
+                "Q",
+                "J",
+                "I",
+                "I",
+                "H",
+                "I"
+            ],
+            [
+                "T",
+                "K",
+                "Y",
+                "A",
+                "F",
+                "X",
+                "T",
+                "K",
+                "K"
+            ],
+            [
+                "E",
+                "R",
+                "L",
+                "F",
+                "C",
+                "Z",
+                "H",
+                "F",
+                "F"
+            ],
+            [
+                "E",
+                "M",
+                "V",
+                "M",
+                "O",
+                "K",
+                "S",
+                "G",
+                "F"
+            ],
+            [
+                "N",
+                "I",
+                "N",
+                "N",
+                "V",
+                "R",
+                "D",
+                "S",
+                "C"
+            ],
+            [
+                "O",
+                "Z",
+                "A",
+                "D",
+                "E",
+                "D",
+                "V",
+                "I",
+                "L"
+            ],
+            [
+                "H",
+                "R",
+                "T",
+                "I",
+                "O",
+                "N",
+                "J",
+                "S",
+                "A"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                0
+            ],
+            [
+                2,
+                0
+            ],
+            [
+                3,
+                0
+            ],
+            [
+                4,
+                0
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                5
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_067_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_067_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_067_input.jpg",
+        "save_id": 2331,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is DETERMINATION, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2331.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_069",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "DISCONTINUATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 15,
+        "start_node": [
+            6,
+            6
+        ],
+        "grid_layout": [
+            [
+                "B",
+                "E",
+                "M",
+                "P",
+                "B",
+                "L",
+                "N",
+                "W",
+                "K",
+                "O",
+                "M",
+                "J",
+                "W",
+                "C"
+            ],
+            [
+                "H",
+                "R",
+                "W",
+                "C",
+                "B",
+                "E",
+                "S",
+                "K",
+                "G",
+                "Z",
+                "R",
+                "H",
+                "J",
+                "T"
+            ],
+            [
+                "M",
+                "F",
+                "M",
+                "B",
+                "H",
+                "J",
+                "Q",
+                "W",
+                "U",
+                "D",
+                "E",
+                "V",
+                "X",
+                "X"
+            ],
+            [
+                "L",
+                "S",
+                "Q",
+                "A",
+                "X",
+                "H",
+                "R",
+                "Y",
+                "Q",
+                "X",
+                "C",
+                "H",
+                "G",
+                "F"
+            ],
+            [
+                "D",
+                "W",
+                "U",
+                "L",
+                "D",
+                "T",
+                "K",
+                "K",
+                "F",
+                "D",
+                "X",
+                "E",
+                "J",
+                "X"
+            ],
+            [
+                "S",
+                "J",
+                "C",
+                "C",
+                "B",
+                "O",
+                "R",
+                "L",
+                "M",
+                "W",
+                "O",
+                "G",
+                "Y",
+                "X"
+            ],
+            [
+                "E",
+                "K",
+                "J",
+                "J",
+                "Z",
+                "N",
+                "D",
+                "I",
+                "S",
+                "Z",
+                "T",
+                "Q",
+                "F",
+                "C"
+            ],
+            [
+                "K",
+                "G",
+                "B",
+                "X",
+                "M",
+                "D",
+                "Y",
+                "R",
+                "C",
+                "O",
+                "Z",
+                "U",
+                "Y",
+                "C"
+            ],
+            [
+                "B",
+                "R",
+                "A",
+                "O",
+                "U",
+                "O",
+                "I",
+                "J",
+                "A",
+                "N",
+                "U",
+                "T",
+                "Q",
+                "F"
+            ],
+            [
+                "O",
+                "D",
+                "U",
+                "C",
+                "C",
+                "P",
+                "S",
+                "C",
+                "K",
+                "T",
+                "I",
+                "L",
+                "Y",
+                "K"
+            ],
+            [
+                "H",
+                "I",
+                "Q",
+                "N",
+                "G",
+                "S",
+                "J",
+                "B",
+                "J",
+                "J",
+                "N",
+                "U",
+                "A",
+                "O"
+            ],
+            [
+                "P",
+                "Z",
+                "R",
+                "B",
+                "G",
+                "Y",
+                "T",
+                "F",
+                "W",
+                "J",
+                "A",
+                "E",
+                "T",
+                "I"
+            ],
+            [
+                "Q",
+                "Y",
+                "V",
+                "D",
+                "N",
+                "F",
+                "E",
+                "X",
+                "V",
+                "S",
+                "W",
+                "L",
+                "T",
+                "O"
+            ],
+            [
+                "C",
+                "B",
+                "X",
+                "I",
+                "S",
+                "K",
+                "Y",
+                "Z",
+                "J",
+                "A",
+                "G",
+                "D",
+                "A",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ],
+            [
+                9,
+                10
+            ],
+            [
+                10,
+                10
+            ],
+            [
+                10,
+                11
+            ],
+            [
+                10,
+                12
+            ],
+            [
+                11,
+                12
+            ],
+            [
+                11,
+                13
+            ],
+            [
+                12,
+                13
+            ],
+            [
+                13,
+                13
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_069_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_069_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_069_input.jpg",
+        "save_id": 2333,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is DISCONTINUATION, length 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2333.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_071",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "INVESTIGATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            4,
+            4
+        ],
+        "grid_layout": [
+            [
+                "V",
+                "A",
+                "H",
+                "M",
+                "V",
+                "X",
+                "A",
+                "K",
+                "R",
+                "J",
+                "U"
+            ],
+            [
+                "K",
+                "C",
+                "G",
+                "E",
+                "F",
+                "N",
+                "G",
+                "T",
+                "V",
+                "I",
+                "R"
+            ],
+            [
+                "I",
+                "V",
+                "R",
+                "D",
+                "Q",
+                "H",
+                "G",
+                "E",
+                "C",
+                "B",
+                "J"
+            ],
+            [
+                "V",
+                "O",
+                "K",
+                "B",
+                "T",
+                "K",
+                "P",
+                "B",
+                "I",
+                "Q",
+                "M"
+            ],
+            [
+                "S",
+                "A",
+                "S",
+                "C",
+                "I",
+                "N",
+                "V",
+                "X",
+                "P",
+                "G",
+                "T"
+            ],
+            [
+                "A",
+                "H",
+                "Q",
+                "P",
+                "F",
+                "Y",
+                "E",
+                "S",
+                "U",
+                "Z",
+                "P"
+            ],
+            [
+                "K",
+                "B",
+                "R",
+                "U",
+                "Y",
+                "A",
+                "A",
+                "T",
+                "I",
+                "G",
+                "I"
+            ],
+            [
+                "H",
+                "B",
+                "V",
+                "O",
+                "N",
+                "I",
+                "D",
+                "E",
+                "K",
+                "A",
+                "T"
+            ],
+            [
+                "O",
+                "X",
+                "E",
+                "H",
+                "K",
+                "I",
+                "B",
+                "R",
+                "Q",
+                "G",
+                "I"
+            ],
+            [
+                "D",
+                "U",
+                "Z",
+                "R",
+                "N",
+                "N",
+                "I",
+                "F",
+                "T",
+                "N",
+                "O"
+            ],
+            [
+                "N",
+                "C",
+                "G",
+                "V",
+                "W",
+                "G",
+                "N",
+                "L",
+                "S",
+                "P",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                7,
+                10
+            ],
+            [
+                8,
+                10
+            ],
+            [
+                9,
+                10
+            ],
+            [
+                10,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_071_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_071_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_071_input.jpg",
+        "save_id": 2335,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is INVESTIGATION, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2335.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_073",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "MICROBIOLOGY",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            3,
+            4
+        ],
+        "grid_layout": [
+            [
+                "I",
+                "T",
+                "N",
+                "K",
+                "Z",
+                "E",
+                "G",
+                "R",
+                "A",
+                "Y"
+            ],
+            [
+                "H",
+                "V",
+                "Z",
+                "F",
+                "S",
+                "A",
+                "J",
+                "S",
+                "X",
+                "D"
+            ],
+            [
+                "K",
+                "G",
+                "K",
+                "E",
+                "Z",
+                "T",
+                "W",
+                "H",
+                "U",
+                "A"
+            ],
+            [
+                "C",
+                "G",
+                "X",
+                "D",
+                "M",
+                "C",
+                "S",
+                "S",
+                "P",
+                "R"
+            ],
+            [
+                "C",
+                "V",
+                "J",
+                "L",
+                "I",
+                "C",
+                "R",
+                "O",
+                "O",
+                "Z"
+            ],
+            [
+                "N",
+                "H",
+                "T",
+                "Q",
+                "R",
+                "B",
+                "G",
+                "B",
+                "I",
+                "O"
+            ],
+            [
+                "P",
+                "U",
+                "M",
+                "T",
+                "V",
+                "W",
+                "E",
+                "S",
+                "X",
+                "L"
+            ],
+            [
+                "P",
+                "W",
+                "Z",
+                "D",
+                "U",
+                "O",
+                "J",
+                "L",
+                "M",
+                "O"
+            ],
+            [
+                "M",
+                "S",
+                "I",
+                "L",
+                "K",
+                "P",
+                "M",
+                "O",
+                "H",
+                "G"
+            ],
+            [
+                "F",
+                "C",
+                "V",
+                "F",
+                "S",
+                "V",
+                "E",
+                "V",
+                "S",
+                "Y"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_073_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_073_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_073_input.jpg",
+        "save_id": 2337,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is MICROBIOLOGY, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2337.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_075",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "IDENTIFICATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 14,
+        "start_node": [
+            4,
+            2
+        ],
+        "grid_layout": [
+            [
+                "A",
+                "V",
+                "L",
+                "C",
+                "Y",
+                "L",
+                "H",
+                "X",
+                "U",
+                "O",
+                "H",
+                "V",
+                "S"
+            ],
+            [
+                "Z",
+                "G",
+                "D",
+                "M",
+                "J",
+                "E",
+                "T",
+                "B",
+                "C",
+                "N",
+                "C",
+                "O",
+                "H"
+            ],
+            [
+                "Q",
+                "W",
+                "D",
+                "H",
+                "V",
+                "E",
+                "U",
+                "B",
+                "I",
+                "D",
+                "R",
+                "N",
+                "M"
+            ],
+            [
+                "Q",
+                "W",
+                "Q",
+                "L",
+                "W",
+                "C",
+                "Z",
+                "J",
+                "P",
+                "X",
+                "W",
+                "Q",
+                "I"
+            ],
+            [
+                "J",
+                "E",
+                "I",
+                "L",
+                "I",
+                "C",
+                "H",
+                "N",
+                "O",
+                "O",
+                "M",
+                "Y",
+                "X"
+            ],
+            [
+                "U",
+                "D",
+                "D",
+                "E",
+                "N",
+                "F",
+                "S",
+                "Y",
+                "O",
+                "P",
+                "W",
+                "U",
+                "Z"
+            ],
+            [
+                "V",
+                "Z",
+                "I",
+                "Z",
+                "T",
+                "I",
+                "F",
+                "I",
+                "S",
+                "K",
+                "C",
+                "N",
+                "X"
+            ],
+            [
+                "M",
+                "N",
+                "N",
+                "H",
+                "S",
+                "J",
+                "W",
+                "C",
+                "J",
+                "G",
+                "R",
+                "G",
+                "G"
+            ],
+            [
+                "I",
+                "Q",
+                "Z",
+                "G",
+                "F",
+                "B",
+                "E",
+                "A",
+                "Q",
+                "N",
+                "A",
+                "H",
+                "Z"
+            ],
+            [
+                "R",
+                "I",
+                "A",
+                "Y",
+                "A",
+                "L",
+                "Z",
+                "T",
+                "I",
+                "T",
+                "Q",
+                "D",
+                "B"
+            ],
+            [
+                "G",
+                "L",
+                "Y",
+                "W",
+                "W",
+                "N",
+                "M",
+                "Z",
+                "O",
+                "K",
+                "H",
+                "N",
+                "T"
+            ],
+            [
+                "O",
+                "Z",
+                "P",
+                "J",
+                "S",
+                "O",
+                "H",
+                "X",
+                "N",
+                "J",
+                "K",
+                "V",
+                "W"
+            ],
+            [
+                "E",
+                "P",
+                "L",
+                "B",
+                "G",
+                "U",
+                "X",
+                "I",
+                "Z",
+                "I",
+                "J",
+                "R",
+                "E"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                10,
+                8
+            ],
+            [
+                11,
+                8
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_075_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_075_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_075_input.jpg",
+        "save_id": 2339,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is IDENTIFICATION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2339.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_077",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "EPIDEMIOLOGIST",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 14,
+        "start_node": [
+            1,
+            10
+        ],
+        "grid_layout": [
+            [
+                "O",
+                "V",
+                "A",
+                "F",
+                "J",
+                "A",
+                "U",
+                "Z",
+                "J",
+                "X",
+                "O",
+                "X",
+                "N",
+                "J"
+            ],
+            [
+                "X",
+                "K",
+                "U",
+                "W",
+                "J",
+                "L",
+                "U",
+                "K",
+                "T",
+                "Q",
+                "E",
+                "P",
+                "I",
+                "G"
+            ],
+            [
+                "J",
+                "O",
+                "A",
+                "J",
+                "X",
+                "U",
+                "O",
+                "S",
+                "U",
+                "Z",
+                "K",
+                "E",
+                "D",
+                "L"
+            ],
+            [
+                "O",
+                "X",
+                "F",
+                "T",
+                "G",
+                "D",
+                "G",
+                "H",
+                "H",
+                "U",
+                "Q",
+                "B",
+                "E",
+                "M"
+            ],
+            [
+                "N",
+                "U",
+                "X",
+                "A",
+                "G",
+                "O",
+                "B",
+                "X",
+                "C",
+                "O",
+                "S",
+                "S",
+                "B",
+                "I"
+            ],
+            [
+                "O",
+                "E",
+                "R",
+                "D",
+                "U",
+                "K",
+                "T",
+                "I",
+                "T",
+                "I",
+                "G",
+                "R",
+                "E",
+                "O"
+            ],
+            [
+                "T",
+                "T",
+                "U",
+                "A",
+                "P",
+                "F",
+                "J",
+                "Y",
+                "K",
+                "N",
+                "M",
+                "K",
+                "O",
+                "L"
+            ],
+            [
+                "L",
+                "F",
+                "B",
+                "P",
+                "W",
+                "W",
+                "P",
+                "Z",
+                "A",
+                "O",
+                "L",
+                "J",
+                "S",
+                "O"
+            ],
+            [
+                "L",
+                "X",
+                "D",
+                "A",
+                "I",
+                "X",
+                "E",
+                "M",
+                "S",
+                "D",
+                "S",
+                "X",
+                "J",
+                "G"
+            ],
+            [
+                "Z",
+                "Q",
+                "T",
+                "Y",
+                "E",
+                "O",
+                "I",
+                "A",
+                "E",
+                "P",
+                "A",
+                "I",
+                "L",
+                "I"
+            ],
+            [
+                "W",
+                "U",
+                "J",
+                "A",
+                "Y",
+                "P",
+                "R",
+                "F",
+                "P",
+                "H",
+                "C",
+                "J",
+                "R",
+                "S"
+            ],
+            [
+                "O",
+                "U",
+                "I",
+                "K",
+                "I",
+                "N",
+                "A",
+                "R",
+                "E",
+                "F",
+                "E",
+                "N",
+                "W",
+                "T"
+            ],
+            [
+                "X",
+                "J",
+                "A",
+                "R",
+                "P",
+                "O",
+                "A",
+                "J",
+                "L",
+                "C",
+                "R",
+                "L",
+                "N",
+                "J"
+            ],
+            [
+                "I",
+                "W",
+                "S",
+                "P",
+                "K",
+                "S",
+                "R",
+                "T",
+                "N",
+                "H",
+                "M",
+                "Y",
+                "X",
+                "R"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                10
+            ],
+            [
+                1,
+                11
+            ],
+            [
+                1,
+                12
+            ],
+            [
+                2,
+                12
+            ],
+            [
+                3,
+                12
+            ],
+            [
+                3,
+                13
+            ],
+            [
+                4,
+                13
+            ],
+            [
+                5,
+                13
+            ],
+            [
+                6,
+                13
+            ],
+            [
+                7,
+                13
+            ],
+            [
+                8,
+                13
+            ],
+            [
+                9,
+                13
+            ],
+            [
+                10,
+                13
+            ],
+            [
+                11,
+                13
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_077_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_077_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_077_input.jpg",
+        "save_id": 2341,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is EPIDEMIOLOGIST, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2341.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_079",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "RATIONALIZATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 15,
+        "start_node": [
+            3,
+            3
+        ],
+        "grid_layout": [
+            [
+                "B",
+                "W",
+                "G",
+                "C",
+                "I",
+                "Z",
+                "A",
+                "R",
+                "L",
+                "Z",
+                "G",
+                "S",
+                "C",
+                "Y",
+                "C"
+            ],
+            [
+                "H",
+                "V",
+                "X",
+                "V",
+                "Y",
+                "U",
+                "X",
+                "O",
+                "T",
+                "X",
+                "H",
+                "N",
+                "D",
+                "S",
+                "O"
+            ],
+            [
+                "M",
+                "Q",
+                "P",
+                "R",
+                "O",
+                "U",
+                "L",
+                "F",
+                "T",
+                "E",
+                "K",
+                "W",
+                "P",
+                "D",
+                "B"
+            ],
+            [
+                "O",
+                "R",
+                "D",
+                "R",
+                "A",
+                "D",
+                "I",
+                "W",
+                "N",
+                "T",
+                "O",
+                "W",
+                "J",
+                "I",
+                "L"
+            ],
+            [
+                "D",
+                "K",
+                "A",
+                "A",
+                "T",
+                "D",
+                "B",
+                "B",
+                "F",
+                "X",
+                "G",
+                "F",
+                "P",
+                "T",
+                "N"
+            ],
+            [
+                "M",
+                "Z",
+                "E",
+                "K",
+                "I",
+                "M",
+                "P",
+                "C",
+                "X",
+                "Y",
+                "L",
+                "K",
+                "F",
+                "J",
+                "V"
+            ],
+            [
+                "K",
+                "U",
+                "Q",
+                "O",
+                "O",
+                "N",
+                "A",
+                "W",
+                "X",
+                "D",
+                "J",
+                "N",
+                "F",
+                "O",
+                "A"
+            ],
+            [
+                "J",
+                "S",
+                "L",
+                "T",
+                "J",
+                "D",
+                "L",
+                "I",
+                "N",
+                "L",
+                "F",
+                "M",
+                "P",
+                "P",
+                "Y"
+            ],
+            [
+                "Q",
+                "O",
+                "Q",
+                "N",
+                "S",
+                "R",
+                "X",
+                "Z",
+                "J",
+                "R",
+                "H",
+                "K",
+                "Q",
+                "Z",
+                "O"
+            ],
+            [
+                "S",
+                "D",
+                "X",
+                "W",
+                "M",
+                "P",
+                "R",
+                "A",
+                "T",
+                "I",
+                "O",
+                "M",
+                "S",
+                "B",
+                "S"
+            ],
+            [
+                "W",
+                "Y",
+                "N",
+                "P",
+                "A",
+                "M",
+                "J",
+                "S",
+                "B",
+                "I",
+                "N",
+                "Q",
+                "Y",
+                "Z",
+                "M"
+            ],
+            [
+                "J",
+                "H",
+                "I",
+                "S",
+                "A",
+                "J",
+                "N",
+                "K",
+                "R",
+                "S",
+                "Z",
+                "M",
+                "Y",
+                "C",
+                "K"
+            ],
+            [
+                "O",
+                "Q",
+                "E",
+                "B",
+                "U",
+                "D",
+                "W",
+                "A",
+                "D",
+                "L",
+                "G",
+                "L",
+                "J",
+                "P",
+                "O"
+            ],
+            [
+                "F",
+                "N",
+                "N",
+                "X",
+                "G",
+                "Q",
+                "T",
+                "M",
+                "T",
+                "L",
+                "G",
+                "B",
+                "U",
+                "B",
+                "I"
+            ],
+            [
+                "C",
+                "I",
+                "D",
+                "K",
+                "Z",
+                "F",
+                "I",
+                "Q",
+                "B",
+                "H",
+                "Q",
+                "M",
+                "M",
+                "P",
+                "G"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                9,
+                9
+            ],
+            [
+                9,
+                10
+            ],
+            [
+                10,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_079_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_079_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_079_input.jpg",
+        "save_id": 2343,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is RATIONALIZATION, length 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2343.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_081",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "CONSTRUCTION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            0,
+            2
+        ],
+        "grid_layout": [
+            [
+                "Y",
+                "O",
+                "C",
+                "Q",
+                "G",
+                "U",
+                "D",
+                "E",
+                "W"
+            ],
+            [
+                "P",
+                "P",
+                "O",
+                "N",
+                "S",
+                "Z",
+                "I",
+                "T",
+                "J"
+            ],
+            [
+                "S",
+                "A",
+                "J",
+                "X",
+                "T",
+                "C",
+                "L",
+                "R",
+                "H"
+            ],
+            [
+                "N",
+                "B",
+                "R",
+                "Q",
+                "R",
+                "U",
+                "Q",
+                "K",
+                "Q"
+            ],
+            [
+                "Y",
+                "Q",
+                "X",
+                "H",
+                "H",
+                "C",
+                "T",
+                "I",
+                "D"
+            ],
+            [
+                "G",
+                "D",
+                "K",
+                "W",
+                "Z",
+                "U",
+                "I",
+                "O",
+                "S"
+            ],
+            [
+                "X",
+                "A",
+                "T",
+                "Q",
+                "Z",
+                "J",
+                "M",
+                "N",
+                "Z"
+            ],
+            [
+                "X",
+                "R",
+                "G",
+                "V",
+                "G",
+                "Q",
+                "F",
+                "Q",
+                "P"
+            ],
+            [
+                "S",
+                "R",
+                "M",
+                "Y",
+                "V",
+                "Z",
+                "R",
+                "A",
+                "J"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                2
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_081_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_081_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_081_input.jpg",
+        "save_id": 2345,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is CONSTRUCTION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2345.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_083",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "INTERPRETATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 14,
+        "start_node": [
+            9,
+            1
+        ],
+        "grid_layout": [
+            [
+                "J",
+                "O",
+                "P",
+                "H",
+                "J",
+                "S",
+                "R",
+                "U",
+                "Z",
+                "I",
+                "M",
+                "G",
+                "X",
+                "R"
+            ],
+            [
+                "K",
+                "R",
+                "B",
+                "P",
+                "H",
+                "Q",
+                "K",
+                "A",
+                "H",
+                "N",
+                "W",
+                "Y",
+                "I",
+                "Y"
+            ],
+            [
+                "T",
+                "Y",
+                "W",
+                "B",
+                "M",
+                "K",
+                "W",
+                "Y",
+                "B",
+                "L",
+                "I",
+                "R",
+                "L",
+                "X"
+            ],
+            [
+                "T",
+                "I",
+                "D",
+                "B",
+                "C",
+                "T",
+                "D",
+                "C",
+                "B",
+                "C",
+                "S",
+                "I",
+                "R",
+                "V"
+            ],
+            [
+                "A",
+                "X",
+                "O",
+                "E",
+                "H",
+                "J",
+                "L",
+                "Q",
+                "S",
+                "B",
+                "X",
+                "X",
+                "W",
+                "H"
+            ],
+            [
+                "O",
+                "S",
+                "X",
+                "H",
+                "I",
+                "A",
+                "K",
+                "W",
+                "C",
+                "J",
+                "F",
+                "H",
+                "Y",
+                "C"
+            ],
+            [
+                "O",
+                "S",
+                "D",
+                "T",
+                "L",
+                "L",
+                "W",
+                "Q",
+                "S",
+                "P",
+                "H",
+                "V",
+                "Q",
+                "W"
+            ],
+            [
+                "X",
+                "K",
+                "S",
+                "T",
+                "G",
+                "J",
+                "R",
+                "P",
+                "S",
+                "T",
+                "Y",
+                "S",
+                "O",
+                "V"
+            ],
+            [
+                "G",
+                "P",
+                "F",
+                "K",
+                "M",
+                "J",
+                "Y",
+                "A",
+                "H",
+                "T",
+                "M",
+                "O",
+                "X",
+                "C"
+            ],
+            [
+                "J",
+                "I",
+                "N",
+                "T",
+                "R",
+                "B",
+                "E",
+                "D",
+                "H",
+                "Z",
+                "I",
+                "G",
+                "K",
+                "T"
+            ],
+            [
+                "C",
+                "W",
+                "Y",
+                "E",
+                "T",
+                "U",
+                "N",
+                "X",
+                "I",
+                "Y",
+                "L",
+                "L",
+                "Z",
+                "I"
+            ],
+            [
+                "H",
+                "P",
+                "T",
+                "R",
+                "P",
+                "R",
+                "E",
+                "D",
+                "Y",
+                "W",
+                "U",
+                "G",
+                "N",
+                "P"
+            ],
+            [
+                "P",
+                "K",
+                "T",
+                "A",
+                "Z",
+                "R",
+                "T",
+                "L",
+                "U",
+                "M",
+                "Y",
+                "U",
+                "I",
+                "O"
+            ],
+            [
+                "M",
+                "H",
+                "A",
+                "N",
+                "E",
+                "M",
+                "A",
+                "T",
+                "I",
+                "O",
+                "N",
+                "X",
+                "F",
+                "W"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                9,
+                1
+            ],
+            [
+                9,
+                2
+            ],
+            [
+                9,
+                3
+            ],
+            [
+                10,
+                3
+            ],
+            [
+                11,
+                3
+            ],
+            [
+                11,
+                4
+            ],
+            [
+                11,
+                5
+            ],
+            [
+                11,
+                6
+            ],
+            [
+                12,
+                6
+            ],
+            [
+                13,
+                6
+            ],
+            [
+                13,
+                7
+            ],
+            [
+                13,
+                8
+            ],
+            [
+                13,
+                9
+            ],
+            [
+                13,
+                10
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_083_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_083_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_083_input.jpg",
+        "save_id": 2347,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is INTERPRETATION, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2347.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_085",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "PHILANTHROPIST",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 14,
+        "start_node": [
+            1,
+            7
+        ],
+        "grid_layout": [
+            [
+                "F",
+                "T",
+                "Q",
+                "Q",
+                "W",
+                "V",
+                "V",
+                "Z",
+                "A",
+                "O",
+                "H",
+                "O"
+            ],
+            [
+                "R",
+                "I",
+                "O",
+                "V",
+                "B",
+                "D",
+                "Q",
+                "P",
+                "N",
+                "J",
+                "T",
+                "T"
+            ],
+            [
+                "I",
+                "C",
+                "C",
+                "Z",
+                "T",
+                "H",
+                "S",
+                "H",
+                "I",
+                "S",
+                "X",
+                "A"
+            ],
+            [
+                "E",
+                "V",
+                "E",
+                "A",
+                "R",
+                "M",
+                "F",
+                "C",
+                "L",
+                "S",
+                "M",
+                "M"
+            ],
+            [
+                "M",
+                "J",
+                "N",
+                "R",
+                "S",
+                "B",
+                "V",
+                "S",
+                "A",
+                "N",
+                "I",
+                "X"
+            ],
+            [
+                "S",
+                "Q",
+                "C",
+                "L",
+                "S",
+                "V",
+                "A",
+                "P",
+                "E",
+                "T",
+                "H",
+                "A"
+            ],
+            [
+                "B",
+                "U",
+                "K",
+                "T",
+                "Q",
+                "D",
+                "H",
+                "G",
+                "C",
+                "R",
+                "R",
+                "I"
+            ],
+            [
+                "P",
+                "A",
+                "L",
+                "K",
+                "Y",
+                "Y",
+                "Y",
+                "B",
+                "H",
+                "T",
+                "O",
+                "P"
+            ],
+            [
+                "V",
+                "V",
+                "M",
+                "P",
+                "M",
+                "P",
+                "T",
+                "C",
+                "G",
+                "E",
+                "H",
+                "I"
+            ],
+            [
+                "I",
+                "V",
+                "J",
+                "Y",
+                "A",
+                "R",
+                "K",
+                "D",
+                "O",
+                "G",
+                "T",
+                "S"
+            ],
+            [
+                "Y",
+                "L",
+                "T",
+                "I",
+                "Z",
+                "W",
+                "F",
+                "V",
+                "Q",
+                "R",
+                "D",
+                "T"
+            ],
+            [
+                "S",
+                "H",
+                "I",
+                "V",
+                "F",
+                "G",
+                "P",
+                "E",
+                "I",
+                "N",
+                "B",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                7
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                5,
+                10
+            ],
+            [
+                6,
+                10
+            ],
+            [
+                7,
+                10
+            ],
+            [
+                7,
+                11
+            ],
+            [
+                8,
+                11
+            ],
+            [
+                9,
+                11
+            ],
+            [
+                10,
+                11
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_085_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_085_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_085_input.jpg",
+        "save_id": 2349,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is PHILANTHROPIST, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2349.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_087",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "PHOTOGRAPHY",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 11,
+        "start_node": [
+            0,
+            1
+        ],
+        "grid_layout": [
+            [
+                "K",
+                "P",
+                "H",
+                "O",
+                "Z",
+                "W",
+                "J",
+                "G",
+                "Y",
+                "Z"
+            ],
+            [
+                "J",
+                "V",
+                "L",
+                "T",
+                "F",
+                "M",
+                "Q",
+                "W",
+                "Z",
+                "A"
+            ],
+            [
+                "U",
+                "F",
+                "X",
+                "O",
+                "G",
+                "R",
+                "X",
+                "X",
+                "N",
+                "V"
+            ],
+            [
+                "A",
+                "X",
+                "G",
+                "S",
+                "R",
+                "A",
+                "L",
+                "I",
+                "A",
+                "G"
+            ],
+            [
+                "D",
+                "I",
+                "W",
+                "H",
+                "G",
+                "P",
+                "H",
+                "Y",
+                "Z",
+                "X"
+            ],
+            [
+                "R",
+                "O",
+                "G",
+                "M",
+                "J",
+                "P",
+                "P",
+                "Q",
+                "W",
+                "P"
+            ],
+            [
+                "B",
+                "Z",
+                "V",
+                "H",
+                "J",
+                "B",
+                "X",
+                "K",
+                "C",
+                "D"
+            ],
+            [
+                "K",
+                "X",
+                "L",
+                "T",
+                "V",
+                "W",
+                "Q",
+                "D",
+                "B",
+                "M"
+            ],
+            [
+                "L",
+                "N",
+                "E",
+                "X",
+                "N",
+                "Z",
+                "A",
+                "H",
+                "C",
+                "M"
+            ],
+            [
+                "J",
+                "P",
+                "A",
+                "U",
+                "R",
+                "F",
+                "S",
+                "Y",
+                "I",
+                "P"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                1
+            ],
+            [
+                0,
+                2
+            ],
+            [
+                0,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_087_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_087_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_087_input.jpg",
+        "save_id": 2351,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is PHOTOGRAPHY, length 11.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2351.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_089",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "QUALIFICATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            1,
+            1
+        ],
+        "grid_layout": [
+            [
+                "Q",
+                "M",
+                "B",
+                "M",
+                "C",
+                "X",
+                "C",
+                "G",
+                "A"
+            ],
+            [
+                "Z",
+                "Q",
+                "U",
+                "R",
+                "W",
+                "K",
+                "O",
+                "L",
+                "L"
+            ],
+            [
+                "E",
+                "W",
+                "A",
+                "D",
+                "P",
+                "Z",
+                "G",
+                "Y",
+                "O"
+            ],
+            [
+                "Q",
+                "D",
+                "L",
+                "Z",
+                "E",
+                "K",
+                "H",
+                "G",
+                "Q"
+            ],
+            [
+                "Z",
+                "S",
+                "I",
+                "U",
+                "D",
+                "H",
+                "F",
+                "F",
+                "Q"
+            ],
+            [
+                "L",
+                "S",
+                "F",
+                "I",
+                "C",
+                "A",
+                "T",
+                "I",
+                "G"
+            ],
+            [
+                "A",
+                "F",
+                "T",
+                "A",
+                "Z",
+                "J",
+                "I",
+                "O",
+                "M"
+            ],
+            [
+                "L",
+                "J",
+                "C",
+                "F",
+                "Y",
+                "G",
+                "U",
+                "N",
+                "Z"
+            ],
+            [
+                "E",
+                "M",
+                "W",
+                "P",
+                "L",
+                "O",
+                "Z",
+                "Q",
+                "W"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_089_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_089_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_089_input.jpg",
+        "save_id": 2353,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is QUALIFICATION, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2353.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_091",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "OBSERVATIONS",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            0,
+            3
+        ],
+        "grid_layout": [
+            [
+                "L",
+                "C",
+                "N",
+                "O",
+                "B",
+                "A",
+                "N",
+                "J",
+                "G"
+            ],
+            [
+                "M",
+                "B",
+                "E",
+                "J",
+                "S",
+                "E",
+                "R",
+                "V",
+                "O"
+            ],
+            [
+                "S",
+                "G",
+                "V",
+                "M",
+                "N",
+                "H",
+                "E",
+                "A",
+                "R"
+            ],
+            [
+                "B",
+                "R",
+                "G",
+                "M",
+                "C",
+                "P",
+                "P",
+                "T",
+                "C"
+            ],
+            [
+                "A",
+                "T",
+                "D",
+                "J",
+                "M",
+                "S",
+                "D",
+                "I",
+                "Z"
+            ],
+            [
+                "Q",
+                "A",
+                "R",
+                "V",
+                "A",
+                "I",
+                "P",
+                "O",
+                "N"
+            ],
+            [
+                "B",
+                "F",
+                "B",
+                "H",
+                "G",
+                "T",
+                "U",
+                "O",
+                "S"
+            ],
+            [
+                "B",
+                "L",
+                "B",
+                "G",
+                "B",
+                "V",
+                "N",
+                "U",
+                "X"
+            ],
+            [
+                "R",
+                "V",
+                "R",
+                "S",
+                "P",
+                "B",
+                "W",
+                "B",
+                "X"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                0,
+                3
+            ],
+            [
+                0,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_091_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_091_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_091_input.jpg",
+        "save_id": 2355,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is OBSERVATIONS, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2355.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_093",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "COLLABORATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            2,
+            2
+        ],
+        "grid_layout": [
+            [
+                "D",
+                "J",
+                "X",
+                "U",
+                "T",
+                "Z",
+                "A",
+                "H",
+                "D"
+            ],
+            [
+                "H",
+                "U",
+                "K",
+                "M",
+                "P",
+                "G",
+                "H",
+                "W",
+                "X"
+            ],
+            [
+                "K",
+                "S",
+                "C",
+                "O",
+                "L",
+                "U",
+                "D",
+                "N",
+                "C"
+            ],
+            [
+                "X",
+                "L",
+                "D",
+                "K",
+                "L",
+                "N",
+                "S",
+                "G",
+                "H"
+            ],
+            [
+                "V",
+                "X",
+                "W",
+                "C",
+                "A",
+                "K",
+                "W",
+                "B",
+                "B"
+            ],
+            [
+                "I",
+                "Z",
+                "E",
+                "F",
+                "B",
+                "O",
+                "J",
+                "H",
+                "A"
+            ],
+            [
+                "B",
+                "S",
+                "C",
+                "C",
+                "V",
+                "R",
+                "D",
+                "C",
+                "Q"
+            ],
+            [
+                "I",
+                "J",
+                "L",
+                "S",
+                "D",
+                "A",
+                "F",
+                "D",
+                "J"
+            ],
+            [
+                "Y",
+                "G",
+                "N",
+                "P",
+                "G",
+                "T",
+                "I",
+                "O",
+                "N"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_093_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_093_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_093_input.jpg",
+        "save_id": 2357,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is COLLABORATION, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2357.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_095",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "FORESHADOWING",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 13,
+        "start_node": [
+            1,
+            0
+        ],
+        "grid_layout": [
+            [
+                "G",
+                "V",
+                "M",
+                "A",
+                "L",
+                "P",
+                "G",
+                "F",
+                "C",
+                "Q",
+                "K"
+            ],
+            [
+                "F",
+                "O",
+                "O",
+                "R",
+                "G",
+                "H",
+                "M",
+                "N",
+                "S",
+                "Y",
+                "V"
+            ],
+            [
+                "N",
+                "R",
+                "E",
+                "S",
+                "U",
+                "T",
+                "A",
+                "K",
+                "C",
+                "H",
+                "Y"
+            ],
+            [
+                "E",
+                "D",
+                "Y",
+                "H",
+                "G",
+                "P",
+                "G",
+                "C",
+                "N",
+                "C",
+                "I"
+            ],
+            [
+                "J",
+                "V",
+                "X",
+                "A",
+                "D",
+                "O",
+                "W",
+                "I",
+                "F",
+                "G",
+                "V"
+            ],
+            [
+                "T",
+                "O",
+                "L",
+                "R",
+                "K",
+                "J",
+                "Q",
+                "N",
+                "G",
+                "Q",
+                "H"
+            ],
+            [
+                "U",
+                "W",
+                "E",
+                "E",
+                "L",
+                "Z",
+                "M",
+                "C",
+                "J",
+                "F",
+                "I"
+            ],
+            [
+                "P",
+                "P",
+                "A",
+                "V",
+                "P",
+                "Y",
+                "C",
+                "V",
+                "G",
+                "Q",
+                "F"
+            ],
+            [
+                "O",
+                "N",
+                "T",
+                "B",
+                "X",
+                "F",
+                "B",
+                "D",
+                "V",
+                "K",
+                "P"
+            ],
+            [
+                "H",
+                "R",
+                "K",
+                "F",
+                "Q",
+                "C",
+                "Q",
+                "H",
+                "Z",
+                "T",
+                "R"
+            ],
+            [
+                "P",
+                "M",
+                "S",
+                "Y",
+                "O",
+                "B",
+                "T",
+                "U",
+                "C",
+                "S",
+                "D"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                1,
+                0
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                5,
+                8
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_095_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_095_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_095_input.jpg",
+        "save_id": 2359,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is FORESHADOWING, length 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2359.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_097",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "ACCOMPLISHMENT",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 14,
+        "start_node": [
+            7,
+            0
+        ],
+        "grid_layout": [
+            [
+                "K",
+                "Y",
+                "E",
+                "H",
+                "E",
+                "L",
+                "E",
+                "X",
+                "C",
+                "M",
+                "E",
+                "G"
+            ],
+            [
+                "L",
+                "C",
+                "T",
+                "H",
+                "T",
+                "N",
+                "T",
+                "Z",
+                "A",
+                "N",
+                "H",
+                "G"
+            ],
+            [
+                "R",
+                "R",
+                "S",
+                "P",
+                "S",
+                "L",
+                "J",
+                "D",
+                "R",
+                "P",
+                "W",
+                "K"
+            ],
+            [
+                "U",
+                "H",
+                "F",
+                "N",
+                "C",
+                "T",
+                "O",
+                "H",
+                "F",
+                "I",
+                "J",
+                "O"
+            ],
+            [
+                "H",
+                "G",
+                "O",
+                "Z",
+                "J",
+                "C",
+                "R",
+                "H",
+                "Y",
+                "Q",
+                "L",
+                "I"
+            ],
+            [
+                "D",
+                "Y",
+                "P",
+                "G",
+                "S",
+                "M",
+                "T",
+                "J",
+                "C",
+                "I",
+                "Y",
+                "E"
+            ],
+            [
+                "S",
+                "T",
+                "B",
+                "O",
+                "M",
+                "A",
+                "V",
+                "X",
+                "J",
+                "M",
+                "H",
+                "H"
+            ],
+            [
+                "A",
+                "C",
+                "C",
+                "D",
+                "Q",
+                "X",
+                "I",
+                "U",
+                "E",
+                "H",
+                "R",
+                "B"
+            ],
+            [
+                "N",
+                "J",
+                "O",
+                "Y",
+                "M",
+                "K",
+                "K",
+                "D",
+                "V",
+                "O",
+                "Q",
+                "K"
+            ],
+            [
+                "W",
+                "P",
+                "M",
+                "H",
+                "L",
+                "W",
+                "V",
+                "X",
+                "G",
+                "R",
+                "B",
+                "F"
+            ],
+            [
+                "J",
+                "R",
+                "P",
+                "L",
+                "B",
+                "I",
+                "S",
+                "R",
+                "L",
+                "P",
+                "V",
+                "G"
+            ],
+            [
+                "E",
+                "P",
+                "V",
+                "I",
+                "S",
+                "H",
+                "M",
+                "E",
+                "N",
+                "T",
+                "Z",
+                "C"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                7,
+                0
+            ],
+            [
+                7,
+                1
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                9,
+                2
+            ],
+            [
+                10,
+                2
+            ],
+            [
+                10,
+                3
+            ],
+            [
+                11,
+                3
+            ],
+            [
+                11,
+                4
+            ],
+            [
+                11,
+                5
+            ],
+            [
+                11,
+                6
+            ],
+            [
+                11,
+                7
+            ],
+            [
+                11,
+                8
+            ],
+            [
+                11,
+                9
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_097_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_097_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_097_input.jpg",
+        "save_id": 2361,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is ACCOMPLISHMENT, length 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2361.png",
+        "status": "skipped"
+    },
+    {
+        "id": "task_start_099",
+        "task": "longest_word_from_fixed_start",
+        "target_word": "PRESENTATION",
+        "prompt_en": "Starting from the yellow cell, find the longest valid English word by moving only Down or Right, and highlight its path in yellow.",
+        "prompt_cn": "从黄色方块出发，通过仅向下或向右移动找到最长的有效英语单词，并将其路径高亮为黄色。",
+        "length": 12,
+        "start_node": [
+            4,
+            0
+        ],
+        "grid_layout": [
+            [
+                "T",
+                "W",
+                "F",
+                "W",
+                "R",
+                "B",
+                "A",
+                "M",
+                "Q"
+            ],
+            [
+                "W",
+                "C",
+                "R",
+                "K",
+                "D",
+                "D",
+                "T",
+                "K",
+                "P"
+            ],
+            [
+                "R",
+                "E",
+                "V",
+                "J",
+                "R",
+                "E",
+                "P",
+                "L",
+                "P"
+            ],
+            [
+                "U",
+                "L",
+                "P",
+                "E",
+                "I",
+                "O",
+                "X",
+                "J",
+                "Q"
+            ],
+            [
+                "P",
+                "S",
+                "R",
+                "U",
+                "K",
+                "U",
+                "S",
+                "H",
+                "M"
+            ],
+            [
+                "R",
+                "I",
+                "O",
+                "U",
+                "I",
+                "I",
+                "X",
+                "M",
+                "R"
+            ],
+            [
+                "E",
+                "S",
+                "X",
+                "L",
+                "J",
+                "I",
+                "T",
+                "S",
+                "L"
+            ],
+            [
+                "P",
+                "E",
+                "Z",
+                "F",
+                "F",
+                "Y",
+                "S",
+                "O",
+                "A"
+            ],
+            [
+                "K",
+                "N",
+                "T",
+                "A",
+                "T",
+                "I",
+                "O",
+                "N",
+                "Q"
+            ]
+        ],
+        "ground_truth_path": [
+            [
+                4,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                6,
+                0
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                7,
+                1
+            ],
+            [
+                8,
+                1
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ]
+        ],
+        "input_image": "dataset_longest_word_no_arrows/task_start_099_input.jpg",
+        "result_image": "dataset_longest_word_no_arrows/task_start_099_result.jpg",
+        "source_image": "Part4/Longest_Word_with_start/task_start_099_input.jpg",
+        "save_id": 2363,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "The longest word is PRESENTATION, length 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Longest_Word_With_Start/2363.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/Max_Bonus.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/Max_Bonus.json
new file mode 100644
index 0000000000000000000000000000000000000000..0dc6d2c408ddb5626459cfeb486b46d996bf4d6d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/Max_Bonus.json
@@ -0,0 +1,8986 @@
+[
+    {
+        "id": "flex_000",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 10,
+        "grid_values": [
+            [
+                8,
+                7,
+                4,
+                -3,
+                -1,
+                -4,
+                -4,
+                -3,
+                8,
+                0
+            ],
+            [
+                7,
+                1,
+                3,
+                -1,
+                1,
+                7,
+                -5,
+                6,
+                -3,
+                2
+            ],
+            [
+                4,
+                1,
+                -1,
+                7,
+                7,
+                4,
+                7,
+                7,
+                6,
+                3
+            ],
+            [
+                3,
+                4,
+                8,
+                5,
+                9,
+                0,
+                6,
+                0,
+                1,
+                9
+            ],
+            [
+                1,
+                2,
+                4,
+                2,
+                -5,
+                4,
+                1,
+                -3,
+                7,
+                -3
+            ],
+            [
+                -1,
+                -5,
+                7,
+                -4,
+                -5,
+                8,
+                -5,
+                2,
+                -1,
+                0
+            ],
+            [
+                -5,
+                8,
+                -5,
+                0,
+                3,
+                5,
+                -3,
+                4,
+                4,
+                0
+            ],
+            [
+                1,
+                2,
+                -2,
+                9,
+                -1,
+                1,
+                1,
+                -5,
+                -1,
+                2
+            ],
+            [
+                4,
+                -1,
+                7,
+                4,
+                -5,
+                1,
+                -1,
+                0,
+                -5,
+                3
+            ],
+            [
+                6,
+                3,
+                4,
+                -1,
+                3,
+                0,
+                -2,
+                -3,
+                -3,
+                -5
+            ]
+        ],
+        "start_node": [
+            4,
+            5
+        ],
+        "end_node": [
+            9,
+            8
+        ],
+        "optimal_score": 13,
+        "optimal_path": [
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                9,
+                8
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_000_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_000_result.jpg",
+        "source_image": "Part4/max_bonus/flex_000_input.jpg",
+        "save_id": 2364,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2364.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_004",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 7,
+        "grid_values": [
+            [
+                6,
+                6,
+                6,
+                2,
+                -2,
+                7,
+                2
+            ],
+            [
+                7,
+                -4,
+                9,
+                -4,
+                6,
+                4,
+                2
+            ],
+            [
+                -1,
+                -2,
+                4,
+                -5,
+                7,
+                -4,
+                5
+            ],
+            [
+                2,
+                -4,
+                5,
+                3,
+                -1,
+                1,
+                0
+            ],
+            [
+                7,
+                -3,
+                8,
+                -3,
+                4,
+                3,
+                4
+            ],
+            [
+                5,
+                9,
+                4,
+                6,
+                5,
+                -2,
+                3
+            ],
+            [
+                -1,
+                -1,
+                -3,
+                8,
+                -5,
+                9,
+                3
+            ]
+        ],
+        "start_node": [
+            2,
+            5
+        ],
+        "end_node": [
+            4,
+            6
+        ],
+        "optimal_score": 5,
+        "optimal_path": [
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_004_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_004_result.jpg",
+        "source_image": "Part4/max_bonus/flex_004_input.jpg",
+        "save_id": 2368,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2368.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_008",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 8,
+        "grid_values": [
+            [
+                6,
+                8,
+                -4,
+                9,
+                -3,
+                6,
+                9,
+                5
+            ],
+            [
+                -1,
+                5,
+                -3,
+                8,
+                2,
+                0,
+                -4,
+                6
+            ],
+            [
+                -3,
+                -5,
+                -1,
+                -5,
+                7,
+                4,
+                9,
+                -1
+            ],
+            [
+                -3,
+                0,
+                -2,
+                3,
+                7,
+                -4,
+                -2,
+                -2
+            ],
+            [
+                -2,
+                7,
+                -1,
+                6,
+                8,
+                -3,
+                -2,
+                7
+            ],
+            [
+                6,
+                3,
+                -4,
+                7,
+                6,
+                3,
+                -3,
+                -4
+            ],
+            [
+                7,
+                -5,
+                -2,
+                6,
+                2,
+                -2,
+                3,
+                -2
+            ],
+            [
+                -3,
+                9,
+                1,
+                6,
+                -1,
+                -3,
+                9,
+                3
+            ]
+        ],
+        "start_node": [
+            0,
+            1
+        ],
+        "end_node": [
+            0,
+            6
+        ],
+        "optimal_score": 25,
+        "optimal_path": [
+            [
+                0,
+                1
+            ],
+            [
+                0,
+                2
+            ],
+            [
+                0,
+                3
+            ],
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                5
+            ],
+            [
+                0,
+                6
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_008_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_008_result.jpg",
+        "source_image": "Part4/max_bonus/flex_008_input.jpg",
+        "save_id": 2372,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2372.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_012",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 6,
+        "grid_values": [
+            [
+                3,
+                -2,
+                1,
+                2,
+                1,
+                0
+            ],
+            [
+                0,
+                6,
+                2,
+                -3,
+                7,
+                5
+            ],
+            [
+                -5,
+                2,
+                9,
+                9,
+                -3,
+                8
+            ],
+            [
+                1,
+                -2,
+                -3,
+                -5,
+                7,
+                7
+            ],
+            [
+                9,
+                1,
+                -5,
+                -1,
+                5,
+                3
+            ],
+            [
+                -3,
+                2,
+                -4,
+                7,
+                -4,
+                8
+            ]
+        ],
+        "start_node": [
+            2,
+            2
+        ],
+        "end_node": [
+            4,
+            4
+        ],
+        "optimal_score": 27,
+        "optimal_path": [
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_012_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_012_result.jpg",
+        "source_image": "Part4/max_bonus/flex_012_input.jpg",
+        "save_id": 2376,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2376.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_016",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 12,
+        "grid_values": [
+            [
+                -5,
+                -1,
+                -4,
+                9,
+                8,
+                9,
+                -3,
+                5,
+                8,
+                3,
+                7,
+                -5
+            ],
+            [
+                -1,
+                -3,
+                -1,
+                8,
+                4,
+                2,
+                9,
+                -2,
+                -5,
+                3,
+                -1,
+                -3
+            ],
+            [
+                7,
+                1,
+                9,
+                2,
+                -4,
+                9,
+                -2,
+                0,
+                8,
+                6,
+                5,
+                4
+            ],
+            [
+                9,
+                0,
+                3,
+                2,
+                -3,
+                6,
+                0,
+                7,
+                1,
+                -4,
+                -5,
+                2
+            ],
+            [
+                4,
+                -1,
+                -2,
+                7,
+                0,
+                -2,
+                -3,
+                6,
+                9,
+                1,
+                2,
+                9
+            ],
+            [
+                8,
+                3,
+                6,
+                9,
+                8,
+                4,
+                -3,
+                -3,
+                4,
+                -4,
+                0,
+                6
+            ],
+            [
+                9,
+                1,
+                4,
+                9,
+                8,
+                -5,
+                -3,
+                9,
+                1,
+                6,
+                -3,
+                6
+            ],
+            [
+                3,
+                8,
+                -2,
+                4,
+                2,
+                -1,
+                -4,
+                3,
+                2,
+                7,
+                9,
+                -3
+            ],
+            [
+                -4,
+                6,
+                8,
+                5,
+                4,
+                5,
+                5,
+                8,
+                5,
+                1,
+                6,
+                -4
+            ],
+            [
+                5,
+                6,
+                7,
+                -2,
+                -4,
+                8,
+                -2,
+                0,
+                5,
+                8,
+                0,
+                9
+            ],
+            [
+                6,
+                1,
+                1,
+                1,
+                9,
+                8,
+                2,
+                -3,
+                9,
+                6,
+                7,
+                7
+            ],
+            [
+                4,
+                7,
+                6,
+                8,
+                -4,
+                6,
+                2,
+                8,
+                -3,
+                8,
+                1,
+                5
+            ]
+        ],
+        "start_node": [
+            3,
+            7
+        ],
+        "end_node": [
+            5,
+            8
+        ],
+        "optimal_score": 26,
+        "optimal_path": [
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                5,
+                8
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_016_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_016_result.jpg",
+        "source_image": "Part4/max_bonus/flex_016_input.jpg",
+        "save_id": 2380,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2380.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_020",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 11,
+        "grid_values": [
+            [
+                4,
+                -5,
+                6,
+                2,
+                6,
+                9,
+                4,
+                3,
+                -1,
+                1,
+                -3
+            ],
+            [
+                2,
+                -4,
+                0,
+                6,
+                -3,
+                -1,
+                7,
+                -3,
+                -4,
+                8,
+                -4
+            ],
+            [
+                3,
+                -3,
+                5,
+                -3,
+                0,
+                -5,
+                -5,
+                -3,
+                7,
+                3,
+                -2
+            ],
+            [
+                7,
+                4,
+                -2,
+                8,
+                5,
+                8,
+                -1,
+                6,
+                3,
+                0,
+                4
+            ],
+            [
+                6,
+                4,
+                9,
+                3,
+                -3,
+                -5,
+                -5,
+                -2,
+                3,
+                -3,
+                0
+            ],
+            [
+                -5,
+                2,
+                -2,
+                -1,
+                -1,
+                4,
+                8,
+                1,
+                4,
+                -5,
+                -3
+            ],
+            [
+                -3,
+                -1,
+                1,
+                -1,
+                6,
+                -1,
+                -5,
+                6,
+                4,
+                1,
+                -2
+            ],
+            [
+                -5,
+                -2,
+                4,
+                -2,
+                5,
+                3,
+                2,
+                9,
+                8,
+                -3,
+                4
+            ],
+            [
+                8,
+                6,
+                -2,
+                -5,
+                6,
+                -5,
+                -4,
+                3,
+                8,
+                0,
+                5
+            ],
+            [
+                7,
+                9,
+                8,
+                4,
+                9,
+                3,
+                9,
+                -1,
+                9,
+                7,
+                3
+            ],
+            [
+                6,
+                -5,
+                9,
+                -4,
+                -3,
+                -2,
+                2,
+                -2,
+                -3,
+                0,
+                -3
+            ]
+        ],
+        "start_node": [
+            7,
+            4
+        ],
+        "end_node": [
+            9,
+            6
+        ],
+        "optimal_score": 32,
+        "optimal_path": [
+            [
+                7,
+                4
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                9,
+                6
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_020_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_020_result.jpg",
+        "source_image": "Part4/max_bonus/flex_020_input.jpg",
+        "save_id": 2384,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2384.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_024",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 6,
+        "grid_values": [
+            [
+                2,
+                -5,
+                3,
+                -4,
+                5,
+                8
+            ],
+            [
+                5,
+                7,
+                -1,
+                -3,
+                -1,
+                1
+            ],
+            [
+                9,
+                -2,
+                3,
+                8,
+                -5,
+                -2
+            ],
+            [
+                7,
+                6,
+                0,
+                5,
+                5,
+                -5
+            ],
+            [
+                6,
+                3,
+                6,
+                -4,
+                -4,
+                3
+            ],
+            [
+                5,
+                -4,
+                1,
+                4,
+                -2,
+                1
+            ]
+        ],
+        "start_node": [
+            2,
+            3
+        ],
+        "end_node": [
+            5,
+            5
+        ],
+        "optimal_score": 18,
+        "optimal_path": [
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_024_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_024_result.jpg",
+        "source_image": "Part4/max_bonus/flex_024_input.jpg",
+        "save_id": 2388,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2388.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_028",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 7,
+        "grid_values": [
+            [
+                0,
+                1,
+                -4,
+                -1,
+                6,
+                -3,
+                1
+            ],
+            [
+                7,
+                -2,
+                3,
+                0,
+                8,
+                6,
+                -1
+            ],
+            [
+                -1,
+                -2,
+                6,
+                3,
+                0,
+                -3,
+                5
+            ],
+            [
+                7,
+                6,
+                -4,
+                -3,
+                8,
+                7,
+                -5
+            ],
+            [
+                0,
+                9,
+                -5,
+                -1,
+                3,
+                7,
+                3
+            ],
+            [
+                3,
+                -3,
+                -1,
+                9,
+                0,
+                3,
+                -4
+            ],
+            [
+                -2,
+                0,
+                -3,
+                1,
+                4,
+                2,
+                -5
+            ]
+        ],
+        "start_node": [
+            2,
+            4
+        ],
+        "end_node": [
+            4,
+            5
+        ],
+        "optimal_score": 22,
+        "optimal_path": [
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_028_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_028_result.jpg",
+        "source_image": "Part4/max_bonus/flex_028_input.jpg",
+        "save_id": 2392,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2392.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_032",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 5,
+        "grid_values": [
+            [
+                1,
+                -5,
+                -4,
+                4,
+                -2
+            ],
+            [
+                5,
+                -3,
+                5,
+                -1,
+                6
+            ],
+            [
+                4,
+                8,
+                -4,
+                4,
+                -4
+            ],
+            [
+                -1,
+                1,
+                1,
+                9,
+                2
+            ],
+            [
+                -4,
+                6,
+                -5,
+                9,
+                -4
+            ]
+        ],
+        "start_node": [
+            0,
+            3
+        ],
+        "end_node": [
+            3,
+            3
+        ],
+        "optimal_score": 16,
+        "optimal_path": [
+            [
+                0,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_032_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_032_result.jpg",
+        "source_image": "Part4/max_bonus/flex_032_input.jpg",
+        "save_id": 2396,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2396.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_036",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 12,
+        "grid_values": [
+            [
+                -5,
+                -1,
+                -1,
+                -2,
+                2,
+                -4,
+                -3,
+                7,
+                5,
+                7,
+                -3,
+                4
+            ],
+            [
+                9,
+                8,
+                -3,
+                1,
+                -1,
+                -2,
+                4,
+                8,
+                9,
+                4,
+                9,
+                -1
+            ],
+            [
+                5,
+                -3,
+                -5,
+                6,
+                6,
+                6,
+                0,
+                6,
+                -5,
+                2,
+                4,
+                -1
+            ],
+            [
+                -5,
+                2,
+                9,
+                -3,
+                9,
+                4,
+                9,
+                9,
+                0,
+                1,
+                -5,
+                -1
+            ],
+            [
+                3,
+                8,
+                -4,
+                4,
+                -1,
+                9,
+                -3,
+                6,
+                3,
+                -2,
+                8,
+                -1
+            ],
+            [
+                3,
+                8,
+                5,
+                3,
+                2,
+                3,
+                0,
+                2,
+                -3,
+                2,
+                -3,
+                7
+            ],
+            [
+                -1,
+                3,
+                0,
+                4,
+                5,
+                9,
+                4,
+                -5,
+                3,
+                2,
+                7,
+                0
+            ],
+            [
+                2,
+                -3,
+                6,
+                4,
+                -5,
+                7,
+                0,
+                6,
+                6,
+                2,
+                8,
+                2
+            ],
+            [
+                9,
+                3,
+                9,
+                -5,
+                7,
+                0,
+                -2,
+                0,
+                1,
+                2,
+                4,
+                4
+            ],
+            [
+                4,
+                -2,
+                8,
+                5,
+                -5,
+                9,
+                9,
+                5,
+                -1,
+                7,
+                -1,
+                8
+            ],
+            [
+                0,
+                2,
+                6,
+                -3,
+                8,
+                8,
+                -3,
+                6,
+                -5,
+                -4,
+                0,
+                3
+            ],
+            [
+                3,
+                5,
+                -4,
+                0,
+                -5,
+                9,
+                0,
+                0,
+                2,
+                -5,
+                4,
+                4
+            ]
+        ],
+        "start_node": [
+            4,
+            8
+        ],
+        "end_node": [
+            4,
+            11
+        ],
+        "optimal_score": 8,
+        "optimal_path": [
+            [
+                4,
+                8
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                4,
+                10
+            ],
+            [
+                4,
+                11
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_036_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_036_result.jpg",
+        "source_image": "Part4/max_bonus/flex_036_input.jpg",
+        "save_id": 2400,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2400.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_040",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 7,
+        "grid_values": [
+            [
+                -4,
+                -4,
+                6,
+                2,
+                9,
+                -2,
+                -3
+            ],
+            [
+                -4,
+                -4,
+                3,
+                7,
+                -5,
+                -5,
+                2
+            ],
+            [
+                8,
+                3,
+                -1,
+                1,
+                0,
+                6,
+                6
+            ],
+            [
+                4,
+                -3,
+                -3,
+                8,
+                4,
+                5,
+                -3
+            ],
+            [
+                2,
+                7,
+                -3,
+                7,
+                -3,
+                1,
+                9
+            ],
+            [
+                9,
+                2,
+                -1,
+                4,
+                -3,
+                0,
+                1
+            ],
+            [
+                1,
+                8,
+                0,
+                -3,
+                5,
+                9,
+                1
+            ]
+        ],
+        "start_node": [
+            2,
+            4
+        ],
+        "end_node": [
+            5,
+            6
+        ],
+        "optimal_score": 22,
+        "optimal_path": [
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_040_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_040_result.jpg",
+        "source_image": "Part4/max_bonus/flex_040_input.jpg",
+        "save_id": 2404,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2404.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_042",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 6,
+        "grid_values": [
+            [
+                1,
+                9,
+                5,
+                6,
+                -4,
+                9
+            ],
+            [
+                0,
+                0,
+                2,
+                9,
+                0,
+                6
+            ],
+            [
+                -5,
+                9,
+                6,
+                -2,
+                -4,
+                -4
+            ],
+            [
+                -3,
+                -1,
+                9,
+                -3,
+                -5,
+                9
+            ],
+            [
+                1,
+                8,
+                0,
+                1,
+                9,
+                5
+            ],
+            [
+                0,
+                -1,
+                -4,
+                2,
+                7,
+                -3
+            ]
+        ],
+        "start_node": [
+            4,
+            1
+        ],
+        "end_node": [
+            5,
+            3
+        ],
+        "optimal_score": 11,
+        "optimal_path": [
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_042_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_042_result.jpg",
+        "source_image": "Part4/max_bonus/flex_042_input.jpg",
+        "save_id": 2406,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2406.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_044",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 11,
+        "grid_values": [
+            [
+                -5,
+                7,
+                5,
+                -3,
+                5,
+                0,
+                5,
+                -4,
+                6,
+                7,
+                1
+            ],
+            [
+                2,
+                4,
+                1,
+                8,
+                4,
+                2,
+                -5,
+                0,
+                2,
+                8,
+                7
+            ],
+            [
+                1,
+                -3,
+                7,
+                6,
+                7,
+                -3,
+                1,
+                -5,
+                5,
+                -1,
+                0
+            ],
+            [
+                8,
+                3,
+                3,
+                4,
+                2,
+                1,
+                5,
+                9,
+                -5,
+                7,
+                -3
+            ],
+            [
+                3,
+                2,
+                2,
+                -4,
+                6,
+                3,
+                3,
+                -5,
+                7,
+                -3,
+                0
+            ],
+            [
+                3,
+                -5,
+                5,
+                2,
+                -2,
+                7,
+                -2,
+                9,
+                0,
+                5,
+                0
+            ],
+            [
+                -2,
+                -2,
+                -1,
+                0,
+                5,
+                3,
+                5,
+                -3,
+                5,
+                1,
+                -4
+            ],
+            [
+                3,
+                2,
+                -4,
+                0,
+                2,
+                5,
+                -2,
+                -4,
+                -4,
+                6,
+                3
+            ],
+            [
+                -1,
+                -5,
+                7,
+                -3,
+                -5,
+                5,
+                6,
+                2,
+                -2,
+                4,
+                -2
+            ],
+            [
+                7,
+                -2,
+                7,
+                -1,
+                -3,
+                4,
+                2,
+                7,
+                -3,
+                4,
+                1
+            ],
+            [
+                4,
+                -4,
+                7,
+                3,
+                1,
+                1,
+                2,
+                -2,
+                -1,
+                3,
+                2
+            ]
+        ],
+        "start_node": [
+            9,
+            0
+        ],
+        "end_node": [
+            10,
+            4
+        ],
+        "optimal_score": 23,
+        "optimal_path": [
+            [
+                9,
+                0
+            ],
+            [
+                9,
+                1
+            ],
+            [
+                9,
+                2
+            ],
+            [
+                10,
+                2
+            ],
+            [
+                10,
+                3
+            ],
+            [
+                10,
+                4
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_044_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_044_result.jpg",
+        "source_image": "Part4/max_bonus/flex_044_input.jpg",
+        "save_id": 2408,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2408.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_046",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 7,
+        "grid_values": [
+            [
+                8,
+                -1,
+                -1,
+                -3,
+                -2,
+                -3,
+                5
+            ],
+            [
+                9,
+                -5,
+                -5,
+                -2,
+                -2,
+                6,
+                2
+            ],
+            [
+                4,
+                8,
+                6,
+                0,
+                8,
+                -2,
+                3
+            ],
+            [
+                6,
+                4,
+                3,
+                9,
+                -4,
+                -2,
+                -1
+            ],
+            [
+                -2,
+                1,
+                -1,
+                -2,
+                -4,
+                5,
+                9
+            ],
+            [
+                -1,
+                0,
+                2,
+                9,
+                -3,
+                2,
+                9
+            ],
+            [
+                -3,
+                -1,
+                4,
+                8,
+                6,
+                8,
+                -3
+            ]
+        ],
+        "start_node": [
+            3,
+            3
+        ],
+        "end_node": [
+            4,
+            6
+        ],
+        "optimal_score": 17,
+        "optimal_path": [
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_046_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_046_result.jpg",
+        "source_image": "Part4/max_bonus/flex_046_input.jpg",
+        "save_id": 2410,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2410.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_048",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 9,
+        "grid_values": [
+            [
+                7,
+                -5,
+                2,
+                -5,
+                9,
+                -2,
+                -5,
+                -4,
+                1
+            ],
+            [
+                9,
+                3,
+                4,
+                -5,
+                -5,
+                1,
+                -4,
+                9,
+                -2
+            ],
+            [
+                1,
+                5,
+                5,
+                3,
+                9,
+                6,
+                -1,
+                -5,
+                7
+            ],
+            [
+                6,
+                7,
+                0,
+                8,
+                4,
+                9,
+                9,
+                5,
+                6
+            ],
+            [
+                -3,
+                3,
+                4,
+                -5,
+                3,
+                5,
+                -4,
+                -2,
+                3
+            ],
+            [
+                4,
+                1,
+                -4,
+                6,
+                5,
+                7,
+                7,
+                1,
+                1
+            ],
+            [
+                0,
+                -1,
+                5,
+                -3,
+                5,
+                0,
+                -5,
+                8,
+                -2
+            ],
+            [
+                -1,
+                1,
+                0,
+                -1,
+                7,
+                0,
+                2,
+                8,
+                7
+            ],
+            [
+                3,
+                2,
+                9,
+                6,
+                -3,
+                -2,
+                -2,
+                7,
+                -1
+            ]
+        ],
+        "start_node": [
+            7,
+            4
+        ],
+        "end_node": [
+            8,
+            8
+        ],
+        "optimal_score": 23,
+        "optimal_path": [
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_048_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_048_result.jpg",
+        "source_image": "Part4/max_bonus/flex_048_input.jpg",
+        "save_id": 2412,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2412.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_050",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 8,
+        "grid_values": [
+            [
+                -2,
+                -3,
+                3,
+                6,
+                8,
+                -3,
+                -5,
+                -5
+            ],
+            [
+                2,
+                3,
+                -3,
+                -3,
+                2,
+                2,
+                -1,
+                9
+            ],
+            [
+                -4,
+                5,
+                5,
+                5,
+                0,
+                6,
+                2,
+                7
+            ],
+            [
+                6,
+                1,
+                8,
+                -3,
+                -2,
+                2,
+                0,
+                5
+            ],
+            [
+                9,
+                -4,
+                -2,
+                5,
+                0,
+                5,
+                1,
+                -2
+            ],
+            [
+                7,
+                4,
+                1,
+                -3,
+                3,
+                2,
+                1,
+                1
+            ],
+            [
+                7,
+                -1,
+                8,
+                5,
+                -5,
+                0,
+                6,
+                -2
+            ],
+            [
+                5,
+                -2,
+                4,
+                0,
+                -3,
+                -3,
+                4,
+                2
+            ]
+        ],
+        "start_node": [
+            0,
+            4
+        ],
+        "end_node": [
+            4,
+            7
+        ],
+        "optimal_score": 30,
+        "optimal_path": [
+            [
+                0,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_050_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_050_result.jpg",
+        "source_image": "Part4/max_bonus/flex_050_input.jpg",
+        "save_id": 2414,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2414.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_052",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 6,
+        "grid_values": [
+            [
+                7,
+                6,
+                2,
+                7,
+                5,
+                3
+            ],
+            [
+                -3,
+                9,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                -3,
+                0,
+                5,
+                -2,
+                -2,
+                2
+            ],
+            [
+                9,
+                1,
+                0,
+                6,
+                1,
+                1
+            ],
+            [
+                9,
+                9,
+                0,
+                -2,
+                2,
+                -2
+            ],
+            [
+                -3,
+                -1,
+                9,
+                9,
+                1,
+                -5
+            ]
+        ],
+        "start_node": [
+            2,
+            4
+        ],
+        "end_node": [
+            4,
+            5
+        ],
+        "optimal_score": -1,
+        "optimal_path": [
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_052_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_052_result.jpg",
+        "source_image": "Part4/max_bonus/flex_052_input.jpg",
+        "save_id": 2416,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2416.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_054",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 10,
+        "grid_values": [
+            [
+                3,
+                -1,
+                2,
+                -2,
+                -1,
+                -4,
+                0,
+                -5,
+                -3,
+                -1
+            ],
+            [
+                -3,
+                0,
+                9,
+                6,
+                -2,
+                0,
+                2,
+                3,
+                2,
+                8
+            ],
+            [
+                2,
+                9,
+                2,
+                6,
+                9,
+                2,
+                2,
+                9,
+                0,
+                -1
+            ],
+            [
+                6,
+                -4,
+                -1,
+                -5,
+                5,
+                6,
+                9,
+                -5,
+                7,
+                -3
+            ],
+            [
+                -3,
+                6,
+                7,
+                6,
+                -2,
+                1,
+                -2,
+                5,
+                8,
+                4
+            ],
+            [
+                5,
+                0,
+                4,
+                5,
+                1,
+                0,
+                0,
+                5,
+                5,
+                -5
+            ],
+            [
+                -4,
+                -5,
+                8,
+                -1,
+                3,
+                3,
+                4,
+                3,
+                -5,
+                -4
+            ],
+            [
+                -2,
+                9,
+                -1,
+                4,
+                -1,
+                7,
+                8,
+                -3,
+                7,
+                6
+            ],
+            [
+                8,
+                -5,
+                7,
+                2,
+                1,
+                -3,
+                1,
+                -2,
+                -3,
+                -2
+            ],
+            [
+                1,
+                -3,
+                2,
+                7,
+                3,
+                0,
+                6,
+                9,
+                -5,
+                0
+            ]
+        ],
+        "start_node": [
+            1,
+            1
+        ],
+        "end_node": [
+            9,
+            5
+        ],
+        "optimal_score": 49,
+        "optimal_path": [
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                9,
+                5
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_054_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_054_result.jpg",
+        "source_image": "Part4/max_bonus/flex_054_input.jpg",
+        "save_id": 2418,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2418.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_056",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 8,
+        "grid_values": [
+            [
+                5,
+                3,
+                7,
+                -3,
+                2,
+                5,
+                4,
+                4
+            ],
+            [
+                2,
+                1,
+                7,
+                6,
+                -3,
+                -3,
+                0,
+                6
+            ],
+            [
+                -3,
+                -5,
+                5,
+                5,
+                -3,
+                -2,
+                2,
+                -4
+            ],
+            [
+                -3,
+                -3,
+                9,
+                9,
+                -3,
+                4,
+                -2,
+                4
+            ],
+            [
+                8,
+                8,
+                -3,
+                -4,
+                7,
+                -1,
+                2,
+                9
+            ],
+            [
+                6,
+                3,
+                -4,
+                0,
+                -1,
+                1,
+                2,
+                9
+            ],
+            [
+                6,
+                -3,
+                8,
+                -5,
+                4,
+                -5,
+                0,
+                -1
+            ],
+            [
+                4,
+                -5,
+                9,
+                5,
+                -3,
+                -3,
+                -5,
+                8
+            ]
+        ],
+        "start_node": [
+            0,
+            5
+        ],
+        "end_node": [
+            2,
+            6
+        ],
+        "optimal_score": 11,
+        "optimal_path": [
+            [
+                0,
+                5
+            ],
+            [
+                0,
+                6
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                2,
+                6
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_056_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_056_result.jpg",
+        "source_image": "Part4/max_bonus/flex_056_input.jpg",
+        "save_id": 2420,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2420.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_058",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 10,
+        "grid_values": [
+            [
+                3,
+                5,
+                7,
+                6,
+                1,
+                5,
+                7,
+                9,
+                -4,
+                2
+            ],
+            [
+                0,
+                4,
+                6,
+                7,
+                6,
+                4,
+                0,
+                9,
+                9,
+                5
+            ],
+            [
+                -2,
+                -5,
+                6,
+                5,
+                -2,
+                4,
+                -3,
+                6,
+                4,
+                1
+            ],
+            [
+                6,
+                7,
+                2,
+                2,
+                -3,
+                5,
+                8,
+                -5,
+                -4,
+                0
+            ],
+            [
+                6,
+                1,
+                -4,
+                3,
+                9,
+                2,
+                -5,
+                7,
+                9,
+                6
+            ],
+            [
+                3,
+                4,
+                -5,
+                5,
+                -5,
+                4,
+                9,
+                7,
+                -2,
+                8
+            ],
+            [
+                -5,
+                4,
+                9,
+                5,
+                4,
+                6,
+                -5,
+                -3,
+                5,
+                1
+            ],
+            [
+                -1,
+                5,
+                -4,
+                -4,
+                4,
+                -3,
+                -2,
+                2,
+                2,
+                -3
+            ],
+            [
+                4,
+                9,
+                8,
+                8,
+                7,
+                -4,
+                5,
+                5,
+                8,
+                2
+            ],
+            [
+                1,
+                -2,
+                1,
+                0,
+                4,
+                2,
+                -4,
+                3,
+                0,
+                5
+            ]
+        ],
+        "start_node": [
+            4,
+            3
+        ],
+        "end_node": [
+            7,
+            7
+        ],
+        "optimal_score": 33,
+        "optimal_path": [
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_058_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_058_result.jpg",
+        "source_image": "Part4/max_bonus/flex_058_input.jpg",
+        "save_id": 2422,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2422.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_060",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 9,
+        "grid_values": [
+            [
+                6,
+                -1,
+                0,
+                3,
+                2,
+                3,
+                7,
+                1,
+                -3
+            ],
+            [
+                8,
+                9,
+                6,
+                3,
+                5,
+                9,
+                5,
+                -4,
+                4
+            ],
+            [
+                0,
+                1,
+                2,
+                -3,
+                9,
+                6,
+                2,
+                3,
+                -5
+            ],
+            [
+                7,
+                -1,
+                -5,
+                0,
+                4,
+                -3,
+                0,
+                -5,
+                4
+            ],
+            [
+                -3,
+                7,
+                -1,
+                3,
+                -3,
+                -4,
+                7,
+                -1,
+                4
+            ],
+            [
+                5,
+                6,
+                0,
+                7,
+                8,
+                -2,
+                -5,
+                1,
+                5
+            ],
+            [
+                0,
+                9,
+                4,
+                7,
+                -5,
+                7,
+                9,
+                3,
+                6
+            ],
+            [
+                3,
+                -4,
+                -1,
+                6,
+                -2,
+                4,
+                2,
+                -3,
+                4
+            ],
+            [
+                2,
+                5,
+                -5,
+                8,
+                -1,
+                4,
+                5,
+                -5,
+                -3
+            ]
+        ],
+        "start_node": [
+            3,
+            2
+        ],
+        "end_node": [
+            3,
+            5
+        ],
+        "optimal_score": -4,
+        "optimal_path": [
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_060_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_060_result.jpg",
+        "source_image": "Part4/max_bonus/flex_060_input.jpg",
+        "save_id": 2424,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2424.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_061",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 6,
+        "grid_values": [
+            [
+                6,
+                0,
+                6,
+                -3,
+                3,
+                4
+            ],
+            [
+                -3,
+                -2,
+                6,
+                8,
+                -3,
+                -4
+            ],
+            [
+                0,
+                2,
+                -3,
+                8,
+                -1,
+                7
+            ],
+            [
+                8,
+                1,
+                1,
+                -1,
+                2,
+                7
+            ],
+            [
+                -3,
+                3,
+                5,
+                3,
+                -2,
+                4
+            ],
+            [
+                -2,
+                5,
+                4,
+                2,
+                7,
+                8
+            ]
+        ],
+        "start_node": [
+            2,
+            1
+        ],
+        "end_node": [
+            5,
+            5
+        ],
+        "optimal_score": 32,
+        "optimal_path": [
+            [
+                2,
+                1
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_061_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_061_result.jpg",
+        "source_image": "Part4/max_bonus/flex_061_input.jpg",
+        "save_id": 2425,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2425.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_062",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 8,
+        "grid_values": [
+            [
+                9,
+                -4,
+                5,
+                -5,
+                5,
+                -3,
+                -5,
+                5
+            ],
+            [
+                -3,
+                6,
+                -1,
+                3,
+                -4,
+                -5,
+                6,
+                -4
+            ],
+            [
+                7,
+                0,
+                7,
+                9,
+                -2,
+                3,
+                3,
+                -5
+            ],
+            [
+                4,
+                5,
+                5,
+                8,
+                8,
+                1,
+                1,
+                6
+            ],
+            [
+                -5,
+                9,
+                7,
+                -2,
+                1,
+                8,
+                3,
+                3
+            ],
+            [
+                5,
+                9,
+                8,
+                2,
+                1,
+                6,
+                -2,
+                -2
+            ],
+            [
+                8,
+                9,
+                5,
+                7,
+                9,
+                -5,
+                -1,
+                0
+            ],
+            [
+                6,
+                -2,
+                -4,
+                -2,
+                -3,
+                -2,
+                -5,
+                -1
+            ]
+        ],
+        "start_node": [
+            6,
+            4
+        ],
+        "end_node": [
+            7,
+            6
+        ],
+        "optimal_score": -1,
+        "optimal_path": [
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_062_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_062_result.jpg",
+        "source_image": "Part4/max_bonus/flex_062_input.jpg",
+        "save_id": 2426,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2426.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_063",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 9,
+        "grid_values": [
+            [
+                2,
+                1,
+                1,
+                -3,
+                -1,
+                2,
+                3,
+                -5,
+                3
+            ],
+            [
+                6,
+                9,
+                5,
+                9,
+                0,
+                -1,
+                -2,
+                -5,
+                6
+            ],
+            [
+                2,
+                4,
+                9,
+                6,
+                4,
+                -2,
+                3,
+                3,
+                3
+            ],
+            [
+                -3,
+                6,
+                -3,
+                7,
+                3,
+                3,
+                7,
+                0,
+                2
+            ],
+            [
+                4,
+                4,
+                -1,
+                -2,
+                7,
+                0,
+                4,
+                6,
+                -2
+            ],
+            [
+                6,
+                0,
+                9,
+                7,
+                6,
+                2,
+                8,
+                7,
+                5
+            ],
+            [
+                6,
+                9,
+                9,
+                4,
+                5,
+                3,
+                1,
+                2,
+                3
+            ],
+            [
+                0,
+                7,
+                -2,
+                -4,
+                2,
+                4,
+                6,
+                5,
+                -3
+            ],
+            [
+                7,
+                7,
+                -5,
+                -4,
+                8,
+                -3,
+                3,
+                -2,
+                6
+            ]
+        ],
+        "start_node": [
+            3,
+            0
+        ],
+        "end_node": [
+            7,
+            3
+        ],
+        "optimal_score": 31,
+        "optimal_path": [
+            [
+                3,
+                0
+            ],
+            [
+                4,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                6,
+                0
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                7,
+                3
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_063_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_063_result.jpg",
+        "source_image": "Part4/max_bonus/flex_063_input.jpg",
+        "save_id": 2427,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2427.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_064",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 12,
+        "grid_values": [
+            [
+                -3,
+                6,
+                1,
+                1,
+                8,
+                -2,
+                2,
+                -5,
+                5,
+                4,
+                3,
+                5
+            ],
+            [
+                3,
+                9,
+                2,
+                9,
+                3,
+                8,
+                -2,
+                4,
+                -4,
+                8,
+                5,
+                9
+            ],
+            [
+                7,
+                3,
+                5,
+                -2,
+                -4,
+                -4,
+                0,
+                0,
+                8,
+                9,
+                7,
+                4
+            ],
+            [
+                -2,
+                -3,
+                -3,
+                5,
+                -4,
+                3,
+                9,
+                5,
+                8,
+                -1,
+                5,
+                -5
+            ],
+            [
+                4,
+                -1,
+                -2,
+                1,
+                5,
+                5,
+                5,
+                3,
+                -4,
+                -2,
+                -3,
+                4
+            ],
+            [
+                8,
+                2,
+                -5,
+                7,
+                -4,
+                7,
+                5,
+                -2,
+                -4,
+                1,
+                -1,
+                6
+            ],
+            [
+                1,
+                -5,
+                -4,
+                6,
+                3,
+                7,
+                0,
+                1,
+                -3,
+                2,
+                -2,
+                2
+            ],
+            [
+                9,
+                -3,
+                -1,
+                6,
+                7,
+                9,
+                -5,
+                9,
+                3,
+                -5,
+                1,
+                -1
+            ],
+            [
+                9,
+                -3,
+                3,
+                8,
+                5,
+                2,
+                0,
+                8,
+                9,
+                8,
+                9,
+                4
+            ],
+            [
+                -4,
+                2,
+                7,
+                3,
+                0,
+                0,
+                1,
+                4,
+                8,
+                -2,
+                2,
+                3
+            ],
+            [
+                -1,
+                -1,
+                -2,
+                0,
+                -4,
+                1,
+                -3,
+                9,
+                -3,
+                -1,
+                -2,
+                -2
+            ],
+            [
+                1,
+                6,
+                8,
+                7,
+                5,
+                2,
+                -3,
+                6,
+                0,
+                6,
+                -5,
+                8
+            ]
+        ],
+        "start_node": [
+            9,
+            5
+        ],
+        "end_node": [
+            10,
+            8
+        ],
+        "optimal_score": 11,
+        "optimal_path": [
+            [
+                9,
+                5
+            ],
+            [
+                9,
+                6
+            ],
+            [
+                9,
+                7
+            ],
+            [
+                10,
+                7
+            ],
+            [
+                10,
+                8
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_064_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_064_result.jpg",
+        "source_image": "Part4/max_bonus/flex_064_input.jpg",
+        "save_id": 2428,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2428.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_065",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 11,
+        "grid_values": [
+            [
+                -5,
+                -2,
+                -2,
+                3,
+                5,
+                -4,
+                9,
+                -3,
+                4,
+                1,
+                -1
+            ],
+            [
+                3,
+                9,
+                1,
+                5,
+                6,
+                4,
+                1,
+                2,
+                -5,
+                -3,
+                4
+            ],
+            [
+                7,
+                -3,
+                4,
+                6,
+                -3,
+                2,
+                2,
+                -5,
+                1,
+                0,
+                -1
+            ],
+            [
+                1,
+                -1,
+                0,
+                2,
+                -5,
+                7,
+                3,
+                -2,
+                -1,
+                2,
+                2
+            ],
+            [
+                -5,
+                7,
+                4,
+                0,
+                8,
+                -5,
+                0,
+                6,
+                -2,
+                0,
+                -4
+            ],
+            [
+                0,
+                7,
+                4,
+                2,
+                5,
+                9,
+                5,
+                7,
+                0,
+                3,
+                9
+            ],
+            [
+                3,
+                0,
+                2,
+                7,
+                -2,
+                9,
+                -3,
+                6,
+                9,
+                9,
+                -3
+            ],
+            [
+                5,
+                7,
+                2,
+                2,
+                4,
+                -4,
+                -3,
+                2,
+                -2,
+                8,
+                5
+            ],
+            [
+                7,
+                -5,
+                0,
+                4,
+                -2,
+                8,
+                1,
+                9,
+                -4,
+                6,
+                2
+            ],
+            [
+                2,
+                -3,
+                0,
+                5,
+                6,
+                7,
+                2,
+                -4,
+                -1,
+                3,
+                -1
+            ],
+            [
+                4,
+                -3,
+                8,
+                0,
+                5,
+                -5,
+                -1,
+                7,
+                5,
+                9,
+                6
+            ]
+        ],
+        "start_node": [
+            8,
+            2
+        ],
+        "end_node": [
+            9,
+            7
+        ],
+        "optimal_score": 20,
+        "optimal_path": [
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                9,
+                3
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                9,
+                6
+            ],
+            [
+                9,
+                7
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_065_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_065_result.jpg",
+        "source_image": "Part4/max_bonus/flex_065_input.jpg",
+        "save_id": 2429,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2429.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_066",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 8,
+        "grid_values": [
+            [
+                6,
+                -4,
+                -3,
+                8,
+                4,
+                -1,
+                1,
+                4
+            ],
+            [
+                -1,
+                7,
+                -4,
+                9,
+                -2,
+                3,
+                2,
+                8
+            ],
+            [
+                8,
+                3,
+                -5,
+                -3,
+                6,
+                9,
+                -1,
+                0
+            ],
+            [
+                5,
+                0,
+                6,
+                9,
+                4,
+                8,
+                -5,
+                6
+            ],
+            [
+                6,
+                7,
+                -2,
+                -5,
+                -4,
+                -2,
+                -2,
+                2
+            ],
+            [
+                -2,
+                7,
+                4,
+                -1,
+                -2,
+                -1,
+                9,
+                1
+            ],
+            [
+                6,
+                4,
+                6,
+                0,
+                -5,
+                4,
+                7,
+                6
+            ],
+            [
+                -3,
+                4,
+                7,
+                -1,
+                -5,
+                -2,
+                5,
+                2
+            ]
+        ],
+        "start_node": [
+            3,
+            6
+        ],
+        "end_node": [
+            6,
+            7
+        ],
+        "optimal_score": 15,
+        "optimal_path": [
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_066_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_066_result.jpg",
+        "source_image": "Part4/max_bonus/flex_066_input.jpg",
+        "save_id": 2430,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2430.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_067",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 12,
+        "grid_values": [
+            [
+                6,
+                2,
+                3,
+                7,
+                6,
+                2,
+                -2,
+                9,
+                3,
+                -1,
+                1,
+                -2
+            ],
+            [
+                -5,
+                3,
+                -2,
+                2,
+                7,
+                -1,
+                7,
+                2,
+                -2,
+                2,
+                7,
+                -1
+            ],
+            [
+                5,
+                1,
+                5,
+                4,
+                9,
+                -2,
+                4,
+                -3,
+                -4,
+                5,
+                6,
+                2
+            ],
+            [
+                5,
+                -2,
+                7,
+                6,
+                -2,
+                0,
+                -1,
+                6,
+                5,
+                -2,
+                6,
+                9
+            ],
+            [
+                4,
+                -4,
+                3,
+                8,
+                -5,
+                -4,
+                -3,
+                3,
+                -5,
+                1,
+                1,
+                -5
+            ],
+            [
+                -4,
+                5,
+                0,
+                4,
+                1,
+                7,
+                -1,
+                1,
+                -2,
+                -4,
+                1,
+                -1
+            ],
+            [
+                6,
+                8,
+                -5,
+                9,
+                -5,
+                2,
+                1,
+                -1,
+                0,
+                -1,
+                1,
+                -4
+            ],
+            [
+                -2,
+                5,
+                8,
+                0,
+                4,
+                0,
+                -1,
+                1,
+                -4,
+                3,
+                -3,
+                9
+            ],
+            [
+                3,
+                -3,
+                -1,
+                2,
+                8,
+                7,
+                -3,
+                6,
+                8,
+                7,
+                -3,
+                7
+            ],
+            [
+                9,
+                5,
+                -1,
+                1,
+                0,
+                -3,
+                2,
+                4,
+                9,
+                4,
+                -3,
+                7
+            ],
+            [
+                -1,
+                -2,
+                6,
+                4,
+                -1,
+                8,
+                8,
+                5,
+                8,
+                3,
+                8,
+                -1
+            ],
+            [
+                9,
+                1,
+                7,
+                9,
+                1,
+                -2,
+                5,
+                9,
+                0,
+                -1,
+                -2,
+                -2
+            ]
+        ],
+        "start_node": [
+            0,
+            8
+        ],
+        "end_node": [
+            11,
+            9
+        ],
+        "optimal_score": 19,
+        "optimal_path": [
+            [
+                0,
+                8
+            ],
+            [
+                0,
+                9
+            ],
+            [
+                1,
+                9
+            ],
+            [
+                2,
+                9
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ],
+            [
+                10,
+                9
+            ],
+            [
+                11,
+                9
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_067_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_067_result.jpg",
+        "source_image": "Part4/max_bonus/flex_067_input.jpg",
+        "save_id": 2431,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2431.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_068",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 7,
+        "grid_values": [
+            [
+                4,
+                -4,
+                -3,
+                2,
+                6,
+                0,
+                5
+            ],
+            [
+                2,
+                3,
+                9,
+                3,
+                -1,
+                -2,
+                7
+            ],
+            [
+                -2,
+                4,
+                3,
+                9,
+                -2,
+                3,
+                8
+            ],
+            [
+                0,
+                -3,
+                2,
+                7,
+                6,
+                0,
+                1
+            ],
+            [
+                1,
+                1,
+                1,
+                -4,
+                0,
+                1,
+                -3
+            ],
+            [
+                4,
+                4,
+                2,
+                -3,
+                4,
+                3,
+                7
+            ],
+            [
+                6,
+                -1,
+                7,
+                -2,
+                8,
+                3,
+                3
+            ]
+        ],
+        "start_node": [
+            2,
+            1
+        ],
+        "end_node": [
+            6,
+            3
+        ],
+        "optimal_score": 17,
+        "optimal_path": [
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_068_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_068_result.jpg",
+        "source_image": "Part4/max_bonus/flex_068_input.jpg",
+        "save_id": 2432,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2432.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_069",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 5,
+        "grid_values": [
+            [
+                8,
+                0,
+                2,
+                -2,
+                4
+            ],
+            [
+                -3,
+                2,
+                5,
+                0,
+                6
+            ],
+            [
+                -1,
+                3,
+                9,
+                8,
+                6
+            ],
+            [
+                6,
+                -3,
+                -2,
+                6,
+                -1
+            ],
+            [
+                0,
+                4,
+                9,
+                2,
+                2
+            ]
+        ],
+        "start_node": [
+            2,
+            0
+        ],
+        "end_node": [
+            2,
+            4
+        ],
+        "optimal_score": 25,
+        "optimal_path": [
+            [
+                2,
+                0
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_069_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_069_result.jpg",
+        "source_image": "Part4/max_bonus/flex_069_input.jpg",
+        "save_id": 2433,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2433.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_070",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 5,
+        "grid_values": [
+            [
+                8,
+                -1,
+                5,
+                1,
+                8
+            ],
+            [
+                9,
+                -4,
+                -1,
+                9,
+                -5
+            ],
+            [
+                1,
+                -1,
+                4,
+                6,
+                5
+            ],
+            [
+                -5,
+                4,
+                7,
+                -4,
+                1
+            ],
+            [
+                3,
+                5,
+                1,
+                -1,
+                -2
+            ]
+        ],
+        "start_node": [
+            1,
+            2
+        ],
+        "end_node": [
+            3,
+            3
+        ],
+        "optimal_score": 10,
+        "optimal_path": [
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_070_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_070_result.jpg",
+        "source_image": "Part4/max_bonus/flex_070_input.jpg",
+        "save_id": 2434,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2434.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_071",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 10,
+        "grid_values": [
+            [
+                -4,
+                2,
+                6,
+                -2,
+                9,
+                3,
+                9,
+                1,
+                2,
+                -3
+            ],
+            [
+                8,
+                7,
+                3,
+                8,
+                1,
+                -3,
+                1,
+                -4,
+                9,
+                7
+            ],
+            [
+                6,
+                2,
+                5,
+                -1,
+                6,
+                8,
+                -2,
+                6,
+                8,
+                2
+            ],
+            [
+                -3,
+                3,
+                6,
+                3,
+                0,
+                -5,
+                -1,
+                3,
+                -2,
+                9
+            ],
+            [
+                7,
+                3,
+                -3,
+                2,
+                8,
+                4,
+                -1,
+                5,
+                2,
+                -2
+            ],
+            [
+                -5,
+                3,
+                5,
+                3,
+                -1,
+                6,
+                -5,
+                1,
+                -5,
+                -2
+            ],
+            [
+                -1,
+                0,
+                0,
+                -4,
+                7,
+                6,
+                -4,
+                3,
+                9,
+                -4
+            ],
+            [
+                9,
+                0,
+                -3,
+                7,
+                3,
+                -1,
+                8,
+                7,
+                3,
+                -1
+            ],
+            [
+                -3,
+                -2,
+                3,
+                -3,
+                0,
+                -4,
+                -5,
+                3,
+                -3,
+                8
+            ],
+            [
+                -4,
+                -1,
+                -1,
+                4,
+                4,
+                -1,
+                -5,
+                -2,
+                5,
+                7
+            ]
+        ],
+        "start_node": [
+            5,
+            8
+        ],
+        "end_node": [
+            8,
+            8
+        ],
+        "optimal_score": 4,
+        "optimal_path": [
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                8,
+                8
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_071_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_071_result.jpg",
+        "source_image": "Part4/max_bonus/flex_071_input.jpg",
+        "save_id": 2435,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2435.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_072",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 7,
+        "grid_values": [
+            [
+                5,
+                7,
+                5,
+                5,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                -2,
+                -1,
+                8,
+                1,
+                9
+            ],
+            [
+                -5,
+                0,
+                1,
+                -5,
+                2,
+                -1,
+                -2
+            ],
+            [
+                -1,
+                4,
+                -5,
+                -5,
+                -2,
+                8,
+                3
+            ],
+            [
+                3,
+                -3,
+                -3,
+                -1,
+                -5,
+                0,
+                4
+            ],
+            [
+                8,
+                6,
+                -4,
+                -3,
+                1,
+                1,
+                2
+            ],
+            [
+                2,
+                -3,
+                3,
+                8,
+                2,
+                -2,
+                3
+            ]
+        ],
+        "start_node": [
+            0,
+            4
+        ],
+        "end_node": [
+            4,
+            6
+        ],
+        "optimal_score": 25,
+        "optimal_path": [
+            [
+                0,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_072_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_072_result.jpg",
+        "source_image": "Part4/max_bonus/flex_072_input.jpg",
+        "save_id": 2436,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2436.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_073",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 6,
+        "grid_values": [
+            [
+                -5,
+                7,
+                0,
+                1,
+                -3,
+                8
+            ],
+            [
+                0,
+                9,
+                -3,
+                9,
+                0,
+                7
+            ],
+            [
+                -4,
+                1,
+                6,
+                7,
+                0,
+                -1
+            ],
+            [
+                7,
+                1,
+                6,
+                1,
+                -1,
+                -5
+            ],
+            [
+                9,
+                -3,
+                2,
+                0,
+                5,
+                9
+            ],
+            [
+                7,
+                -5,
+                -5,
+                2,
+                5,
+                7
+            ]
+        ],
+        "start_node": [
+            2,
+            4
+        ],
+        "end_node": [
+            4,
+            5
+        ],
+        "optimal_score": 13,
+        "optimal_path": [
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_073_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_073_result.jpg",
+        "source_image": "Part4/max_bonus/flex_073_input.jpg",
+        "save_id": 2437,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2437.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_074",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 12,
+        "grid_values": [
+            [
+                7,
+                2,
+                5,
+                0,
+                1,
+                -1,
+                3,
+                1,
+                8,
+                5,
+                2,
+                -3
+            ],
+            [
+                -3,
+                6,
+                5,
+                9,
+                0,
+                -1,
+                2,
+                9,
+                8,
+                6,
+                4,
+                -3
+            ],
+            [
+                4,
+                1,
+                0,
+                -5,
+                1,
+                -5,
+                3,
+                0,
+                2,
+                6,
+                8,
+                -2
+            ],
+            [
+                5,
+                6,
+                0,
+                -3,
+                1,
+                7,
+                -5,
+                6,
+                0,
+                4,
+                0,
+                7
+            ],
+            [
+                4,
+                0,
+                -1,
+                -2,
+                -5,
+                5,
+                2,
+                9,
+                -1,
+                -3,
+                2,
+                -2
+            ],
+            [
+                5,
+                9,
+                -4,
+                6,
+                0,
+                7,
+                8,
+                0,
+                8,
+                -1,
+                -2,
+                -1
+            ],
+            [
+                -3,
+                0,
+                0,
+                2,
+                8,
+                -3,
+                -3,
+                9,
+                4,
+                -3,
+                7,
+                0
+            ],
+            [
+                -1,
+                4,
+                4,
+                5,
+                4,
+                2,
+                -4,
+                -5,
+                -5,
+                4,
+                -3,
+                5
+            ],
+            [
+                -2,
+                0,
+                5,
+                8,
+                -5,
+                -5,
+                2,
+                3,
+                0,
+                7,
+                9,
+                2
+            ],
+            [
+                -5,
+                1,
+                -5,
+                -5,
+                -4,
+                3,
+                6,
+                -5,
+                -3,
+                3,
+                1,
+                0
+            ],
+            [
+                -3,
+                -5,
+                7,
+                5,
+                6,
+                -3,
+                5,
+                1,
+                -1,
+                8,
+                -5,
+                0
+            ],
+            [
+                8,
+                6,
+                1,
+                -3,
+                2,
+                9,
+                -1,
+                -2,
+                -3,
+                8,
+                9,
+                -1
+            ]
+        ],
+        "start_node": [
+            2,
+            1
+        ],
+        "end_node": [
+            11,
+            8
+        ],
+        "optimal_score": 48,
+        "optimal_path": [
+            [
+                2,
+                1
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                7,
+                1
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                9,
+                3
+            ],
+            [
+                10,
+                3
+            ],
+            [
+                10,
+                4
+            ],
+            [
+                11,
+                4
+            ],
+            [
+                11,
+                5
+            ],
+            [
+                11,
+                6
+            ],
+            [
+                11,
+                7
+            ],
+            [
+                11,
+                8
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_074_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_074_result.jpg",
+        "source_image": "Part4/max_bonus/flex_074_input.jpg",
+        "save_id": 2438,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2438.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_075",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 8,
+        "grid_values": [
+            [
+                3,
+                0,
+                6,
+                -2,
+                5,
+                -2,
+                6,
+                -2
+            ],
+            [
+                -2,
+                0,
+                4,
+                8,
+                -5,
+                4,
+                5,
+                9
+            ],
+            [
+                7,
+                1,
+                9,
+                -3,
+                2,
+                -1,
+                -4,
+                9
+            ],
+            [
+                9,
+                4,
+                -4,
+                -1,
+                4,
+                -5,
+                7,
+                -2
+            ],
+            [
+                8,
+                0,
+                -2,
+                -4,
+                7,
+                8,
+                -4,
+                8
+            ],
+            [
+                -4,
+                -3,
+                -4,
+                -1,
+                9,
+                6,
+                -2,
+                9
+            ],
+            [
+                0,
+                8,
+                9,
+                3,
+                1,
+                6,
+                7,
+                9
+            ],
+            [
+                8,
+                0,
+                -1,
+                -3,
+                -4,
+                1,
+                7,
+                0
+            ]
+        ],
+        "start_node": [
+            3,
+            6
+        ],
+        "end_node": [
+            5,
+            7
+        ],
+        "optimal_score": 22,
+        "optimal_path": [
+            [
+                3,
+                6
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_075_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_075_result.jpg",
+        "source_image": "Part4/max_bonus/flex_075_input.jpg",
+        "save_id": 2439,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2439.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_076",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 5,
+        "grid_values": [
+            [
+                7,
+                2,
+                2,
+                3,
+                7
+            ],
+            [
+                -4,
+                -3,
+                1,
+                9,
+                5
+            ],
+            [
+                0,
+                5,
+                2,
+                0,
+                9
+            ],
+            [
+                9,
+                8,
+                -3,
+                0,
+                6
+            ],
+            [
+                5,
+                2,
+                -4,
+                -2,
+                6
+            ]
+        ],
+        "start_node": [
+            1,
+            3
+        ],
+        "end_node": [
+            4,
+            4
+        ],
+        "optimal_score": 35,
+        "optimal_path": [
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_076_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_076_result.jpg",
+        "source_image": "Part4/max_bonus/flex_076_input.jpg",
+        "save_id": 2440,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2440.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_077",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 11,
+        "grid_values": [
+            [
+                -1,
+                9,
+                -4,
+                3,
+                7,
+                3,
+                8,
+                8,
+                9,
+                8,
+                -5
+            ],
+            [
+                3,
+                -3,
+                1,
+                -4,
+                -5,
+                3,
+                1,
+                4,
+                8,
+                -2,
+                -5
+            ],
+            [
+                2,
+                6,
+                9,
+                5,
+                6,
+                8,
+                1,
+                9,
+                8,
+                -3,
+                3
+            ],
+            [
+                9,
+                -1,
+                9,
+                0,
+                8,
+                7,
+                -2,
+                9,
+                9,
+                8,
+                9
+            ],
+            [
+                2,
+                -3,
+                -5,
+                5,
+                8,
+                6,
+                7,
+                1,
+                8,
+                -5,
+                8
+            ],
+            [
+                -2,
+                6,
+                4,
+                9,
+                -1,
+                0,
+                -3,
+                8,
+                2,
+                3,
+                9
+            ],
+            [
+                -1,
+                9,
+                1,
+                7,
+                7,
+                9,
+                6,
+                7,
+                8,
+                -5,
+                2
+            ],
+            [
+                1,
+                -5,
+                -4,
+                8,
+                5,
+                0,
+                0,
+                9,
+                -2,
+                6,
+                8
+            ],
+            [
+                1,
+                1,
+                8,
+                -3,
+                9,
+                -4,
+                2,
+                1,
+                1,
+                1,
+                -1
+            ],
+            [
+                2,
+                -3,
+                3,
+                -3,
+                -4,
+                2,
+                6,
+                7,
+                -1,
+                6,
+                8
+            ],
+            [
+                0,
+                8,
+                2,
+                -5,
+                -4,
+                1,
+                5,
+                1,
+                4,
+                2,
+                -2
+            ]
+        ],
+        "start_node": [
+            2,
+            0
+        ],
+        "end_node": [
+            10,
+            6
+        ],
+        "optimal_score": 82,
+        "optimal_path": [
+            [
+                2,
+                0
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                9,
+                6
+            ],
+            [
+                10,
+                6
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_077_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_077_result.jpg",
+        "source_image": "Part4/max_bonus/flex_077_input.jpg",
+        "save_id": 2441,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2441.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_078",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 9,
+        "grid_values": [
+            [
+                0,
+                9,
+                2,
+                7,
+                5,
+                8,
+                8,
+                6,
+                3
+            ],
+            [
+                -2,
+                -5,
+                1,
+                9,
+                6,
+                6,
+                6,
+                -1,
+                3
+            ],
+            [
+                5,
+                4,
+                -4,
+                1,
+                6,
+                0,
+                2,
+                -2,
+                5
+            ],
+            [
+                0,
+                0,
+                1,
+                4,
+                -2,
+                -1,
+                -3,
+                8,
+                5
+            ],
+            [
+                7,
+                -1,
+                4,
+                0,
+                4,
+                -2,
+                3,
+                2,
+                9
+            ],
+            [
+                -5,
+                -1,
+                -5,
+                8,
+                4,
+                8,
+                3,
+                6,
+                9
+            ],
+            [
+                -1,
+                2,
+                -3,
+                0,
+                -3,
+                8,
+                4,
+                5,
+                2
+            ],
+            [
+                3,
+                4,
+                6,
+                -2,
+                -4,
+                -1,
+                1,
+                -2,
+                1
+            ],
+            [
+                7,
+                9,
+                8,
+                2,
+                -3,
+                -5,
+                -3,
+                -1,
+                8
+            ]
+        ],
+        "start_node": [
+            1,
+            3
+        ],
+        "end_node": [
+            3,
+            5
+        ],
+        "optimal_score": 20,
+        "optimal_path": [
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_078_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_078_result.jpg",
+        "source_image": "Part4/max_bonus/flex_078_input.jpg",
+        "save_id": 2442,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2442.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_079",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 12,
+        "grid_values": [
+            [
+                6,
+                1,
+                -5,
+                7,
+                7,
+                7,
+                9,
+                -2,
+                2,
+                0,
+                2,
+                9
+            ],
+            [
+                7,
+                4,
+                7,
+                2,
+                -4,
+                3,
+                0,
+                4,
+                3,
+                -4,
+                5,
+                1
+            ],
+            [
+                8,
+                8,
+                1,
+                3,
+                -5,
+                2,
+                2,
+                8,
+                9,
+                9,
+                9,
+                -1
+            ],
+            [
+                -3,
+                8,
+                -2,
+                7,
+                0,
+                9,
+                9,
+                -2,
+                2,
+                -3,
+                5,
+                4
+            ],
+            [
+                0,
+                -4,
+                9,
+                1,
+                7,
+                -3,
+                -5,
+                -5,
+                1,
+                -2,
+                8,
+                7
+            ],
+            [
+                7,
+                8,
+                8,
+                1,
+                5,
+                0,
+                -1,
+                6,
+                9,
+                -4,
+                -3,
+                -4
+            ],
+            [
+                -1,
+                9,
+                6,
+                -4,
+                1,
+                8,
+                2,
+                3,
+                -2,
+                -5,
+                5,
+                4
+            ],
+            [
+                6,
+                7,
+                4,
+                -5,
+                6,
+                0,
+                2,
+                -5,
+                5,
+                4,
+                3,
+                -4
+            ],
+            [
+                5,
+                7,
+                0,
+                4,
+                -5,
+                2,
+                8,
+                0,
+                3,
+                -1,
+                9,
+                9
+            ],
+            [
+                4,
+                4,
+                1,
+                -1,
+                8,
+                5,
+                1,
+                0,
+                -2,
+                -3,
+                -1,
+                -4
+            ],
+            [
+                2,
+                -4,
+                5,
+                9,
+                0,
+                5,
+                -5,
+                2,
+                9,
+                8,
+                4,
+                -5
+            ],
+            [
+                6,
+                -3,
+                2,
+                5,
+                -1,
+                -2,
+                6,
+                0,
+                -2,
+                5,
+                7,
+                0
+            ]
+        ],
+        "start_node": [
+            3,
+            0
+        ],
+        "end_node": [
+            9,
+            11
+        ],
+        "optimal_score": 64,
+        "optimal_path": [
+            [
+                3,
+                0
+            ],
+            [
+                4,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                7,
+                10
+            ],
+            [
+                8,
+                10
+            ],
+            [
+                8,
+                11
+            ],
+            [
+                9,
+                11
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_079_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_079_result.jpg",
+        "source_image": "Part4/max_bonus/flex_079_input.jpg",
+        "save_id": 2443,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2443.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_080",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 12,
+        "grid_values": [
+            [
+                6,
+                7,
+                -3,
+                4,
+                -3,
+                8,
+                -3,
+                5,
+                2,
+                0,
+                3,
+                7
+            ],
+            [
+                -3,
+                6,
+                5,
+                7,
+                5,
+                -4,
+                8,
+                8,
+                0,
+                3,
+                -3,
+                7
+            ],
+            [
+                -4,
+                9,
+                9,
+                -5,
+                8,
+                7,
+                4,
+                4,
+                3,
+                2,
+                -3,
+                7
+            ],
+            [
+                0,
+                -3,
+                -5,
+                2,
+                4,
+                8,
+                -3,
+                -4,
+                -1,
+                2,
+                6,
+                1
+            ],
+            [
+                6,
+                -5,
+                2,
+                2,
+                3,
+                0,
+                6,
+                -2,
+                8,
+                2,
+                2,
+                2
+            ],
+            [
+                1,
+                3,
+                -4,
+                4,
+                2,
+                8,
+                -5,
+                2,
+                9,
+                -4,
+                3,
+                1
+            ],
+            [
+                7,
+                -3,
+                -4,
+                1,
+                -5,
+                7,
+                7,
+                -3,
+                8,
+                -4,
+                1,
+                8
+            ],
+            [
+                0,
+                9,
+                -1,
+                8,
+                1,
+                1,
+                -4,
+                8,
+                3,
+                2,
+                2,
+                8
+            ],
+            [
+                5,
+                -4,
+                -4,
+                0,
+                -2,
+                -3,
+                1,
+                -2,
+                3,
+                -5,
+                2,
+                7
+            ],
+            [
+                0,
+                4,
+                3,
+                -5,
+                -5,
+                6,
+                -3,
+                -3,
+                1,
+                5,
+                6,
+                8
+            ],
+            [
+                9,
+                8,
+                7,
+                4,
+                0,
+                2,
+                1,
+                4,
+                1,
+                -4,
+                6,
+                -1
+            ],
+            [
+                -3,
+                -1,
+                4,
+                1,
+                4,
+                -4,
+                -2,
+                5,
+                0,
+                0,
+                1,
+                3
+            ]
+        ],
+        "start_node": [
+            5,
+            7
+        ],
+        "end_node": [
+            10,
+            11
+        ],
+        "optimal_score": 48,
+        "optimal_path": [
+            [
+                5,
+                7
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                7,
+                10
+            ],
+            [
+                7,
+                11
+            ],
+            [
+                8,
+                11
+            ],
+            [
+                9,
+                11
+            ],
+            [
+                10,
+                11
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_080_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_080_result.jpg",
+        "source_image": "Part4/max_bonus/flex_080_input.jpg",
+        "save_id": 2444,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2444.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_082",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 10,
+        "grid_values": [
+            [
+                6,
+                -3,
+                7,
+                7,
+                -1,
+                2,
+                9,
+                7,
+                1,
+                8
+            ],
+            [
+                9,
+                -2,
+                -2,
+                -4,
+                -3,
+                9,
+                -1,
+                -1,
+                9,
+                2
+            ],
+            [
+                6,
+                5,
+                -3,
+                0,
+                5,
+                -5,
+                8,
+                0,
+                -1,
+                5
+            ],
+            [
+                7,
+                -4,
+                5,
+                7,
+                1,
+                4,
+                6,
+                5,
+                5,
+                6
+            ],
+            [
+                7,
+                4,
+                -4,
+                3,
+                1,
+                -1,
+                3,
+                0,
+                8,
+                7
+            ],
+            [
+                2,
+                4,
+                8,
+                -5,
+                6,
+                -3,
+                8,
+                -3,
+                5,
+                -1
+            ],
+            [
+                5,
+                9,
+                4,
+                1,
+                4,
+                6,
+                9,
+                8,
+                4,
+                9
+            ],
+            [
+                1,
+                -4,
+                9,
+                -5,
+                1,
+                5,
+                4,
+                5,
+                -5,
+                7
+            ],
+            [
+                4,
+                2,
+                6,
+                1,
+                -1,
+                1,
+                5,
+                6,
+                2,
+                3
+            ],
+            [
+                -4,
+                7,
+                -1,
+                5,
+                -4,
+                -2,
+                -5,
+                0,
+                3,
+                8
+            ]
+        ],
+        "start_node": [
+            7,
+            7
+        ],
+        "end_node": [
+            9,
+            8
+        ],
+        "optimal_score": 16,
+        "optimal_path": [
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                9,
+                8
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_082_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_082_result.jpg",
+        "source_image": "Part4/max_bonus/flex_082_input.jpg",
+        "save_id": 2446,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2446.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_084",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 12,
+        "grid_values": [
+            [
+                3,
+                3,
+                9,
+                5,
+                -5,
+                -5,
+                -5,
+                0,
+                5,
+                4,
+                -5,
+                2
+            ],
+            [
+                3,
+                8,
+                0,
+                -5,
+                7,
+                -2,
+                5,
+                4,
+                3,
+                6,
+                -3,
+                0
+            ],
+            [
+                0,
+                4,
+                -4,
+                0,
+                7,
+                7,
+                -1,
+                2,
+                6,
+                5,
+                -1,
+                0
+            ],
+            [
+                7,
+                9,
+                8,
+                -2,
+                -3,
+                7,
+                5,
+                1,
+                7,
+                8,
+                2,
+                7
+            ],
+            [
+                -2,
+                -3,
+                -2,
+                -3,
+                -2,
+                6,
+                6,
+                3,
+                4,
+                3,
+                4,
+                1
+            ],
+            [
+                1,
+                7,
+                -3,
+                -3,
+                -5,
+                5,
+                -5,
+                -3,
+                8,
+                5,
+                0,
+                -1
+            ],
+            [
+                8,
+                4,
+                7,
+                4,
+                -3,
+                8,
+                4,
+                1,
+                9,
+                -3,
+                7,
+                1
+            ],
+            [
+                -2,
+                -1,
+                3,
+                1,
+                0,
+                -1,
+                5,
+                -1,
+                7,
+                8,
+                -3,
+                9
+            ],
+            [
+                4,
+                8,
+                5,
+                -1,
+                -2,
+                4,
+                -5,
+                -4,
+                8,
+                1,
+                4,
+                4
+            ],
+            [
+                0,
+                3,
+                3,
+                4,
+                -2,
+                -4,
+                -4,
+                6,
+                -5,
+                9,
+                -5,
+                -4
+            ],
+            [
+                -3,
+                -4,
+                9,
+                -3,
+                2,
+                -1,
+                1,
+                -5,
+                -3,
+                -1,
+                5,
+                -3
+            ],
+            [
+                -5,
+                4,
+                -4,
+                2,
+                9,
+                0,
+                8,
+                4,
+                2,
+                6,
+                2,
+                8
+            ]
+        ],
+        "start_node": [
+            6,
+            6
+        ],
+        "end_node": [
+            11,
+            9
+        ],
+        "optimal_score": 44,
+        "optimal_path": [
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ],
+            [
+                10,
+                9
+            ],
+            [
+                11,
+                9
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_084_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_084_result.jpg",
+        "source_image": "Part4/max_bonus/flex_084_input.jpg",
+        "save_id": 2448,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2448.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_086",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 8,
+        "grid_values": [
+            [
+                8,
+                4,
+                1,
+                2,
+                5,
+                -5,
+                -3,
+                8
+            ],
+            [
+                -3,
+                -2,
+                5,
+                2,
+                6,
+                2,
+                -2,
+                8
+            ],
+            [
+                -5,
+                7,
+                9,
+                7,
+                -1,
+                -5,
+                5,
+                -2
+            ],
+            [
+                -3,
+                0,
+                6,
+                6,
+                -5,
+                3,
+                -2,
+                4
+            ],
+            [
+                8,
+                -2,
+                8,
+                2,
+                -4,
+                4,
+                2,
+                7
+            ],
+            [
+                -1,
+                -2,
+                -3,
+                -4,
+                6,
+                -3,
+                5,
+                -4
+            ],
+            [
+                -4,
+                0,
+                7,
+                -2,
+                2,
+                6,
+                -5,
+                7
+            ],
+            [
+                -1,
+                0,
+                -4,
+                -2,
+                -2,
+                7,
+                1,
+                -4
+            ]
+        ],
+        "start_node": [
+            3,
+            6
+        ],
+        "end_node": [
+            7,
+            6
+        ],
+        "optimal_score": 1,
+        "optimal_path": [
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                7,
+                6
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_086_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_086_result.jpg",
+        "source_image": "Part4/max_bonus/flex_086_input.jpg",
+        "save_id": 2450,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2450.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_088",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 7,
+        "grid_values": [
+            [
+                2,
+                -1,
+                -2,
+                -1,
+                -2,
+                9,
+                -2
+            ],
+            [
+                5,
+                4,
+                -1,
+                3,
+                6,
+                -3,
+                7
+            ],
+            [
+                7,
+                3,
+                0,
+                8,
+                -1,
+                1,
+                5
+            ],
+            [
+                5,
+                -3,
+                -3,
+                -4,
+                -5,
+                -1,
+                -1
+            ],
+            [
+                5,
+                0,
+                9,
+                -3,
+                9,
+                7,
+                9
+            ],
+            [
+                0,
+                6,
+                3,
+                1,
+                -2,
+                9,
+                1
+            ],
+            [
+                -5,
+                7,
+                3,
+                -1,
+                -4,
+                4,
+                2
+            ]
+        ],
+        "start_node": [
+            0,
+            1
+        ],
+        "end_node": [
+            6,
+            2
+        ],
+        "optimal_score": 19,
+        "optimal_path": [
+            [
+                0,
+                1
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_088_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_088_result.jpg",
+        "source_image": "Part4/max_bonus/flex_088_input.jpg",
+        "save_id": 2452,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2452.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_090",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 5,
+        "grid_values": [
+            [
+                8,
+                4,
+                5,
+                -2,
+                -5
+            ],
+            [
+                9,
+                6,
+                -2,
+                8,
+                2
+            ],
+            [
+                -4,
+                -3,
+                -1,
+                -3,
+                3
+            ],
+            [
+                2,
+                7,
+                -5,
+                7,
+                -5
+            ],
+            [
+                -1,
+                2,
+                1,
+                4,
+                5
+            ]
+        ],
+        "start_node": [
+            2,
+            3
+        ],
+        "end_node": [
+            4,
+            4
+        ],
+        "optimal_score": 13,
+        "optimal_path": [
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_090_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_090_result.jpg",
+        "source_image": "Part4/max_bonus/flex_090_input.jpg",
+        "save_id": 2454,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2454.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_092",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 12,
+        "grid_values": [
+            [
+                1,
+                0,
+                5,
+                6,
+                -1,
+                7,
+                5,
+                2,
+                0,
+                2,
+                -2,
+                -3
+            ],
+            [
+                4,
+                0,
+                -4,
+                -4,
+                -4,
+                7,
+                2,
+                -3,
+                -1,
+                -2,
+                -4,
+                2
+            ],
+            [
+                -2,
+                2,
+                7,
+                -5,
+                2,
+                -3,
+                -5,
+                -5,
+                -2,
+                7,
+                -5,
+                4
+            ],
+            [
+                5,
+                -5,
+                8,
+                2,
+                4,
+                9,
+                3,
+                -2,
+                -4,
+                -1,
+                -5,
+                -3
+            ],
+            [
+                -1,
+                6,
+                3,
+                -1,
+                9,
+                -4,
+                -5,
+                0,
+                9,
+                8,
+                6,
+                4
+            ],
+            [
+                0,
+                -5,
+                9,
+                2,
+                -2,
+                2,
+                -5,
+                7,
+                3,
+                1,
+                2,
+                -3
+            ],
+            [
+                1,
+                -3,
+                -1,
+                9,
+                5,
+                9,
+                -4,
+                -4,
+                -3,
+                -5,
+                -5,
+                3
+            ],
+            [
+                2,
+                8,
+                7,
+                -4,
+                -3,
+                2,
+                -4,
+                -5,
+                -3,
+                -2,
+                6,
+                -3
+            ],
+            [
+                1,
+                4,
+                4,
+                9,
+                -4,
+                9,
+                -2,
+                9,
+                9,
+                7,
+                5,
+                5
+            ],
+            [
+                -2,
+                4,
+                -5,
+                -3,
+                3,
+                8,
+                2,
+                6,
+                -4,
+                3,
+                7,
+                -5
+            ],
+            [
+                2,
+                7,
+                -2,
+                -1,
+                4,
+                9,
+                1,
+                4,
+                -1,
+                5,
+                3,
+                9
+            ],
+            [
+                6,
+                -4,
+                2,
+                5,
+                -1,
+                -4,
+                0,
+                -1,
+                2,
+                -1,
+                -3,
+                7
+            ]
+        ],
+        "start_node": [
+            2,
+            8
+        ],
+        "end_node": [
+            8,
+            10
+        ],
+        "optimal_score": 26,
+        "optimal_path": [
+            [
+                2,
+                8
+            ],
+            [
+                2,
+                9
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                4,
+                10
+            ],
+            [
+                5,
+                10
+            ],
+            [
+                6,
+                10
+            ],
+            [
+                7,
+                10
+            ],
+            [
+                8,
+                10
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_092_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_092_result.jpg",
+        "source_image": "Part4/max_bonus/flex_092_input.jpg",
+        "save_id": 2456,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2456.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_094",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 6,
+        "grid_values": [
+            [
+                7,
+                -2,
+                -1,
+                -4,
+                7,
+                -5
+            ],
+            [
+                5,
+                3,
+                2,
+                0,
+                3,
+                0
+            ],
+            [
+                3,
+                -1,
+                7,
+                2,
+                0,
+                5
+            ],
+            [
+                7,
+                6,
+                8,
+                0,
+                -5,
+                -3
+            ],
+            [
+                4,
+                9,
+                5,
+                6,
+                -4,
+                -2
+            ],
+            [
+                6,
+                -3,
+                0,
+                5,
+                -2,
+                9
+            ]
+        ],
+        "start_node": [
+            3,
+            0
+        ],
+        "end_node": [
+            4,
+            5
+        ],
+        "optimal_score": 27,
+        "optimal_path": [
+            [
+                3,
+                0
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_094_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_094_result.jpg",
+        "source_image": "Part4/max_bonus/flex_094_input.jpg",
+        "save_id": 2458,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2458.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_096",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 6,
+        "grid_values": [
+            [
+                0,
+                -2,
+                9,
+                7,
+                3,
+                4
+            ],
+            [
+                9,
+                4,
+                2,
+                9,
+                9,
+                -4
+            ],
+            [
+                -3,
+                2,
+                -4,
+                -4,
+                0,
+                0
+            ],
+            [
+                6,
+                -4,
+                -4,
+                -4,
+                8,
+                6
+            ],
+            [
+                8,
+                -2,
+                5,
+                3,
+                -1,
+                5
+            ],
+            [
+                1,
+                1,
+                3,
+                -5,
+                5,
+                -4
+            ]
+        ],
+        "start_node": [
+            1,
+            1
+        ],
+        "end_node": [
+            4,
+            5
+        ],
+        "optimal_score": 43,
+        "optimal_path": [
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_096_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_096_result.jpg",
+        "source_image": "Part4/max_bonus/flex_096_input.jpg",
+        "save_id": 2460,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2460.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_098",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 5,
+        "grid_values": [
+            [
+                4,
+                -5,
+                2,
+                0,
+                -5
+            ],
+            [
+                -5,
+                -5,
+                -2,
+                6,
+                9
+            ],
+            [
+                5,
+                7,
+                -1,
+                8,
+                -1
+            ],
+            [
+                0,
+                8,
+                -5,
+                -4,
+                5
+            ],
+            [
+                -3,
+                0,
+                7,
+                7,
+                7
+            ]
+        ],
+        "start_node": [
+            3,
+            1
+        ],
+        "end_node": [
+            4,
+            3
+        ],
+        "optimal_score": 22,
+        "optimal_path": [
+            [
+                3,
+                1
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_098_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_098_result.jpg",
+        "source_image": "Part4/max_bonus/flex_098_input.jpg",
+        "save_id": 2462,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2462.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_100",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 10,
+        "grid_values": [
+            [
+                -5,
+                9,
+                -5,
+                2,
+                4,
+                7,
+                -3,
+                8,
+                8,
+                5
+            ],
+            [
+                4,
+                7,
+                -3,
+                -3,
+                -2,
+                4,
+                9,
+                1,
+                -2,
+                -2
+            ],
+            [
+                4,
+                0,
+                -4,
+                -5,
+                1,
+                7,
+                6,
+                7,
+                6,
+                4
+            ],
+            [
+                3,
+                6,
+                -3,
+                4,
+                7,
+                -5,
+                5,
+                7,
+                4,
+                3
+            ],
+            [
+                -5,
+                4,
+                1,
+                0,
+                5,
+                -4,
+                -1,
+                -5,
+                2,
+                9
+            ],
+            [
+                1,
+                5,
+                2,
+                -5,
+                -4,
+                4,
+                -4,
+                -4,
+                8,
+                -1
+            ],
+            [
+                8,
+                7,
+                0,
+                0,
+                -5,
+                -1,
+                -4,
+                -2,
+                9,
+                5
+            ],
+            [
+                0,
+                0,
+                -5,
+                -1,
+                -4,
+                5,
+                9,
+                6,
+                -1,
+                1
+            ],
+            [
+                9,
+                8,
+                -4,
+                2,
+                7,
+                1,
+                4,
+                4,
+                -1,
+                4
+            ],
+            [
+                -1,
+                3,
+                7,
+                -4,
+                -3,
+                4,
+                0,
+                1,
+                -5,
+                0
+            ]
+        ],
+        "start_node": [
+            4,
+            7
+        ],
+        "end_node": [
+            9,
+            7
+        ],
+        "optimal_score": 0,
+        "optimal_path": [
+            [
+                4,
+                7
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                9,
+                7
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_100_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_100_result.jpg",
+        "source_image": "Part4/max_bonus/flex_100_input.jpg",
+        "save_id": 2464,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2464.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_102",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 10,
+        "grid_values": [
+            [
+                -2,
+                -2,
+                8,
+                0,
+                7,
+                -2,
+                8,
+                9,
+                -1,
+                2
+            ],
+            [
+                7,
+                3,
+                0,
+                3,
+                1,
+                6,
+                -1,
+                4,
+                -4,
+                1
+            ],
+            [
+                -4,
+                4,
+                7,
+                3,
+                9,
+                7,
+                -2,
+                9,
+                1,
+                2
+            ],
+            [
+                6,
+                9,
+                2,
+                1,
+                4,
+                3,
+                4,
+                5,
+                6,
+                -2
+            ],
+            [
+                -2,
+                5,
+                4,
+                3,
+                -4,
+                -1,
+                7,
+                -1,
+                -3,
+                -4
+            ],
+            [
+                8,
+                -4,
+                2,
+                -3,
+                -5,
+                6,
+                0,
+                3,
+                1,
+                3
+            ],
+            [
+                1,
+                4,
+                8,
+                -2,
+                3,
+                -1,
+                -2,
+                4,
+                5,
+                -4
+            ],
+            [
+                1,
+                5,
+                2,
+                0,
+                2,
+                7,
+                -3,
+                2,
+                -2,
+                9
+            ],
+            [
+                -3,
+                4,
+                -2,
+                0,
+                5,
+                8,
+                6,
+                3,
+                2,
+                -5
+            ],
+            [
+                3,
+                6,
+                -1,
+                7,
+                -2,
+                2,
+                6,
+                -4,
+                2,
+                6
+            ]
+        ],
+        "start_node": [
+            6,
+            6
+        ],
+        "end_node": [
+            9,
+            9
+        ],
+        "optimal_score": 17,
+        "optimal_path": [
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                9,
+                9
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_102_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_102_result.jpg",
+        "source_image": "Part4/max_bonus/flex_102_input.jpg",
+        "save_id": 2466,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2466.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_104",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 8,
+        "grid_values": [
+            [
+                2,
+                8,
+                -5,
+                -2,
+                -4,
+                9,
+                -2,
+                6
+            ],
+            [
+                9,
+                9,
+                4,
+                2,
+                4,
+                -1,
+                -2,
+                9
+            ],
+            [
+                -1,
+                0,
+                4,
+                5,
+                -1,
+                9,
+                -1,
+                -4
+            ],
+            [
+                -1,
+                8,
+                5,
+                -4,
+                0,
+                0,
+                0,
+                -5
+            ],
+            [
+                4,
+                5,
+                -2,
+                0,
+                3,
+                0,
+                -2,
+                -5
+            ],
+            [
+                1,
+                -4,
+                -3,
+                8,
+                2,
+                -2,
+                -2,
+                1
+            ],
+            [
+                8,
+                -5,
+                7,
+                9,
+                2,
+                5,
+                9,
+                0
+            ],
+            [
+                -4,
+                5,
+                -4,
+                4,
+                -2,
+                -4,
+                -4,
+                -1
+            ]
+        ],
+        "start_node": [
+            1,
+            6
+        ],
+        "end_node": [
+            4,
+            7
+        ],
+        "optimal_score": -7,
+        "optimal_path": [
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                4,
+                7
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_104_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_104_result.jpg",
+        "source_image": "Part4/max_bonus/flex_104_input.jpg",
+        "save_id": 2468,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2468.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_106",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 6,
+        "grid_values": [
+            [
+                -1,
+                7,
+                -5,
+                0,
+                1,
+                2
+            ],
+            [
+                -3,
+                1,
+                0,
+                -4,
+                3,
+                -4
+            ],
+            [
+                8,
+                -2,
+                7,
+                8,
+                7,
+                8
+            ],
+            [
+                9,
+                -4,
+                6,
+                5,
+                8,
+                2
+            ],
+            [
+                -2,
+                1,
+                7,
+                5,
+                -1,
+                -1
+            ],
+            [
+                -3,
+                7,
+                -3,
+                6,
+                2,
+                1
+            ]
+        ],
+        "start_node": [
+            2,
+            0
+        ],
+        "end_node": [
+            4,
+            5
+        ],
+        "optimal_score": 37,
+        "optimal_path": [
+            [
+                2,
+                0
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_106_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_106_result.jpg",
+        "source_image": "Part4/max_bonus/flex_106_input.jpg",
+        "save_id": 2470,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2470.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_108",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 6,
+        "grid_values": [
+            [
+                -3,
+                -5,
+                -4,
+                4,
+                9,
+                3
+            ],
+            [
+                6,
+                -1,
+                9,
+                5,
+                1,
+                -2
+            ],
+            [
+                6,
+                4,
+                -2,
+                8,
+                1,
+                -3
+            ],
+            [
+                -4,
+                7,
+                4,
+                0,
+                8,
+                7
+            ],
+            [
+                1,
+                -1,
+                3,
+                -4,
+                8,
+                2
+            ],
+            [
+                6,
+                8,
+                7,
+                1,
+                4,
+                8
+            ]
+        ],
+        "start_node": [
+            1,
+            2
+        ],
+        "end_node": [
+            4,
+            3
+        ],
+        "optimal_score": 18,
+        "optimal_path": [
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_108_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_108_result.jpg",
+        "source_image": "Part4/max_bonus/flex_108_input.jpg",
+        "save_id": 2472,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2472.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_110",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 11,
+        "grid_values": [
+            [
+                -3,
+                -3,
+                0,
+                -1,
+                -4,
+                5,
+                -1,
+                -2,
+                -1,
+                8,
+                1
+            ],
+            [
+                -3,
+                0,
+                -3,
+                -5,
+                4,
+                6,
+                4,
+                5,
+                -1,
+                7,
+                2
+            ],
+            [
+                -3,
+                4,
+                -3,
+                -2,
+                1,
+                9,
+                2,
+                -1,
+                4,
+                6,
+                3
+            ],
+            [
+                4,
+                -3,
+                -3,
+                -3,
+                -1,
+                -4,
+                -3,
+                3,
+                4,
+                1,
+                -2
+            ],
+            [
+                -3,
+                3,
+                -5,
+                -5,
+                -1,
+                3,
+                6,
+                4,
+                2,
+                9,
+                8
+            ],
+            [
+                6,
+                7,
+                5,
+                7,
+                0,
+                -1,
+                -4,
+                6,
+                2,
+                5,
+                0
+            ],
+            [
+                -2,
+                3,
+                -1,
+                4,
+                8,
+                6,
+                -3,
+                -3,
+                2,
+                1,
+                3
+            ],
+            [
+                9,
+                -3,
+                6,
+                -3,
+                -2,
+                0,
+                2,
+                -1,
+                1,
+                -4,
+                -3
+            ],
+            [
+                -3,
+                -5,
+                5,
+                8,
+                8,
+                3,
+                6,
+                -4,
+                8,
+                -3,
+                -5
+            ],
+            [
+                2,
+                7,
+                9,
+                7,
+                4,
+                6,
+                4,
+                4,
+                4,
+                9,
+                6
+            ],
+            [
+                8,
+                -4,
+                7,
+                3,
+                5,
+                -1,
+                -1,
+                -5,
+                -3,
+                3,
+                -4
+            ]
+        ],
+        "start_node": [
+            7,
+            0
+        ],
+        "end_node": [
+            8,
+            7
+        ],
+        "optimal_score": 38,
+        "optimal_path": [
+            [
+                7,
+                0
+            ],
+            [
+                7,
+                1
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_110_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_110_result.jpg",
+        "source_image": "Part4/max_bonus/flex_110_input.jpg",
+        "save_id": 2474,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2474.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_112",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 5,
+        "grid_values": [
+            [
+                -1,
+                9,
+                5,
+                5,
+                -2
+            ],
+            [
+                0,
+                -1,
+                7,
+                8,
+                2
+            ],
+            [
+                9,
+                3,
+                2,
+                7,
+                8
+            ],
+            [
+                -1,
+                -2,
+                -3,
+                8,
+                0
+            ],
+            [
+                -4,
+                0,
+                2,
+                6,
+                5
+            ]
+        ],
+        "start_node": [
+            1,
+            0
+        ],
+        "end_node": [
+            2,
+            4
+        ],
+        "optimal_score": 29,
+        "optimal_path": [
+            [
+                1,
+                0
+            ],
+            [
+                2,
+                0
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_112_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_112_result.jpg",
+        "source_image": "Part4/max_bonus/flex_112_input.jpg",
+        "save_id": 2476,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2476.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_114",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 12,
+        "grid_values": [
+            [
+                2,
+                2,
+                5,
+                3,
+                5,
+                -3,
+                9,
+                6,
+                4,
+                0,
+                1,
+                8
+            ],
+            [
+                -5,
+                -2,
+                -4,
+                -4,
+                9,
+                7,
+                2,
+                1,
+                6,
+                -4,
+                -1,
+                6
+            ],
+            [
+                5,
+                5,
+                0,
+                4,
+                -5,
+                5,
+                4,
+                0,
+                4,
+                8,
+                7,
+                5
+            ],
+            [
+                2,
+                9,
+                9,
+                -4,
+                2,
+                -2,
+                6,
+                9,
+                -5,
+                7,
+                -4,
+                6
+            ],
+            [
+                5,
+                -2,
+                0,
+                -3,
+                -3,
+                5,
+                8,
+                1,
+                8,
+                9,
+                2,
+                9
+            ],
+            [
+                -2,
+                4,
+                -2,
+                -2,
+                3,
+                -2,
+                6,
+                4,
+                7,
+                1,
+                6,
+                1
+            ],
+            [
+                -5,
+                7,
+                1,
+                1,
+                -4,
+                3,
+                -3,
+                8,
+                9,
+                1,
+                2,
+                -3
+            ],
+            [
+                -2,
+                4,
+                7,
+                1,
+                6,
+                4,
+                9,
+                -3,
+                -3,
+                5,
+                4,
+                6
+            ],
+            [
+                8,
+                6,
+                4,
+                6,
+                5,
+                -5,
+                5,
+                0,
+                0,
+                7,
+                -3,
+                9
+            ],
+            [
+                7,
+                4,
+                6,
+                -2,
+                4,
+                -3,
+                5,
+                -1,
+                -2,
+                9,
+                -4,
+                9
+            ],
+            [
+                3,
+                -4,
+                4,
+                -4,
+                -1,
+                -1,
+                -5,
+                1,
+                7,
+                3,
+                3,
+                -5
+            ],
+            [
+                6,
+                -5,
+                4,
+                3,
+                6,
+                6,
+                4,
+                5,
+                9,
+                5,
+                6,
+                -2
+            ]
+        ],
+        "start_node": [
+            8,
+            9
+        ],
+        "end_node": [
+            10,
+            11
+        ],
+        "optimal_score": 17,
+        "optimal_path": [
+            [
+                8,
+                9
+            ],
+            [
+                9,
+                9
+            ],
+            [
+                10,
+                9
+            ],
+            [
+                10,
+                10
+            ],
+            [
+                10,
+                11
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_114_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_114_result.jpg",
+        "source_image": "Part4/max_bonus/flex_114_input.jpg",
+        "save_id": 2478,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2478.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_116",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 7,
+        "grid_values": [
+            [
+                6,
+                7,
+                -5,
+                3,
+                9,
+                -1,
+                0
+            ],
+            [
+                -4,
+                6,
+                -4,
+                0,
+                2,
+                2,
+                0
+            ],
+            [
+                0,
+                6,
+                9,
+                4,
+                -3,
+                -2,
+                3
+            ],
+            [
+                -5,
+                9,
+                -5,
+                5,
+                9,
+                -5,
+                8
+            ],
+            [
+                8,
+                4,
+                7,
+                -5,
+                -2,
+                8,
+                1
+            ],
+            [
+                -1,
+                -1,
+                4,
+                -1,
+                -1,
+                8,
+                -5
+            ],
+            [
+                -2,
+                2,
+                5,
+                0,
+                7,
+                8,
+                9
+            ]
+        ],
+        "start_node": [
+            4,
+            5
+        ],
+        "end_node": [
+            6,
+            6
+        ],
+        "optimal_score": 33,
+        "optimal_path": [
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                6
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_116_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_116_result.jpg",
+        "source_image": "Part4/max_bonus/flex_116_input.jpg",
+        "save_id": 2480,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2480.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flex_118",
+        "task": "max_reward_path_flexible",
+        "prompt_en": "Color a path from the blue 'S' to the red 'E' in yellow. You can only move down or right. Passing through each square acquires the number inside it. The goal is to maximize the sum of all numbers collected along the path.",
+        "prompt_cn": "用黄色染出一条从蓝色'S'到红色'E'的路径，只能向下或向右移动，经过每个点将会获得方格中的数字，目标是使路径上收集到的所有数字之和最大。",
+        "grid_size": 6,
+        "grid_values": [
+            [
+                9,
+                3,
+                -3,
+                -3,
+                -2,
+                7
+            ],
+            [
+                8,
+                3,
+                7,
+                7,
+                -2,
+                -4
+            ],
+            [
+                2,
+                0,
+                8,
+                4,
+                7,
+                8
+            ],
+            [
+                0,
+                6,
+                -5,
+                2,
+                3,
+                3
+            ],
+            [
+                2,
+                2,
+                1,
+                7,
+                7,
+                7
+            ],
+            [
+                -1,
+                6,
+                -5,
+                4,
+                0,
+                -5
+            ]
+        ],
+        "start_node": [
+            0,
+            3
+        ],
+        "end_node": [
+            5,
+            4
+        ],
+        "optimal_score": 25,
+        "optimal_path": [
+            [
+                0,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ]
+        ],
+        "input_image": "dataset_flexible_reward_no_arrows/flex_118_input.jpg",
+        "result_image": "dataset_flexible_reward_no_arrows/flex_118_result.jpg",
+        "source_image": "Part4/max_bonus/flex_118_input.jpg",
+        "save_id": 2482,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Bonus/2482.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2070.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2070.png
new file mode 100644
index 0000000000000000000000000000000000000000..01204e21c1acec113fb2f1f2220fd5b40223e457
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2070.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:55cdc975921daf4359e3973404bc6cb56995ba00e8be5a4a401de7b7be88476e
+size 126611
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2072.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2072.png
new file mode 100644
index 0000000000000000000000000000000000000000..50b093cb1da9bc3b1926ab0d0fab1931ed7d8e75
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2072.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6b79d4584e6d639edcbfd7fc9857c0fdc7121dfbb3802f1f8dafc575982d955e
+size 88385
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2080.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2080.png
new file mode 100644
index 0000000000000000000000000000000000000000..fc0645632c89c2b0630f9a0dc1227f6ece9e0fe6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2080.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:054362d70e7703eed86c4c7c1dda0ed85f574ba5153695a62212333b33318a74
+size 93274
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2109.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2109.png
new file mode 100644
index 0000000000000000000000000000000000000000..25fe8f8f9156f430c79bd06ea263d92c7dd9f8af
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2109.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9f5c4de40459336b0e689168d419d7bc36005d2a1a8f5f0b4ee8b30ff4853bec
+size 143474
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2112.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2112.png
new file mode 100644
index 0000000000000000000000000000000000000000..5a7b08e58507439a4d91a237bd5f823008facd87
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2112.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f9eb1a1844bddaec2ab0b50b82eaa069c6fe97027f9af2f24150196da3a95b78
+size 115501
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2114.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2114.png
new file mode 100644
index 0000000000000000000000000000000000000000..36e51819a1fbe6e43769fa83a3a61f4b3ac528ee
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2114.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:37fc7de1d802e908283af5c3721b83aa386868a10a297f2d39e54cedce4f9214
+size 133890
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2119.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2119.png
new file mode 100644
index 0000000000000000000000000000000000000000..d809fb3577de9c96825b4979f1f215cb8e5413dd
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2119.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9c7ad0ea51bcd22bdb73cac6db65e562d868e250aafbc35a264b49c9d2c20365
+size 112340
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2126.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2126.png
new file mode 100644
index 0000000000000000000000000000000000000000..f8dc15be7f7a1a4f1ebe5894073a89e0e9549084
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2126.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7a7bb6b92c97352d81bc223e1f563353a024bc2183afbb110230f6939d0ecd1d
+size 114374
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2132.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2132.png
new file mode 100644
index 0000000000000000000000000000000000000000..3140104c928f51fc75774d15b89a2472a46fd27c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2132.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:44d4531d8ed4f70b67956702802428ef972140e2be351391e7f3751b48c7dc07
+size 121292
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2142.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2142.png
new file mode 100644
index 0000000000000000000000000000000000000000..0ad7886195429dff79fb6689b8796de67d905a5c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2142.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bd48cfa7f189ff5151da6bcb638737f0824d6a35aedb178f7699ab7c664cf565
+size 132760
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2154.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2154.png
new file mode 100644
index 0000000000000000000000000000000000000000..49c9a5f044c2eab2b6e3f8f47c8075c285704529
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2154.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e04e254f834ca4fb66e9f80d5ae4ee42c143e65ce829dacf9f8e847643d7bc06
+size 110738
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/Max_Submatrix.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/Max_Submatrix.json
new file mode 100644
index 0000000000000000000000000000000000000000..76bc3faec7bca62f34edf4f801eb7595c62ed1fb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/Max_Submatrix.json
@@ -0,0 +1,6651 @@
+[
+    {
+        "id": "conv_000",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            2,
+            4
+        ],
+        "grid_values": [
+            [
+                -5,
+                5,
+                -3,
+                -7,
+                2,
+                1
+            ],
+            [
+                1,
+                -5,
+                6,
+                0,
+                -1,
+                -7
+            ],
+            [
+                -4,
+                2,
+                -8,
+                6,
+                -8,
+                1
+            ],
+            [
+                8,
+                -1,
+                -9,
+                8,
+                -7,
+                7
+            ],
+            [
+                4,
+                -7,
+                -2,
+                2,
+                -5,
+                2
+            ],
+            [
+                -1,
+                5,
+                -2,
+                -9,
+                9,
+                -1
+            ]
+        ],
+        "target_top_left": [
+            3,
+            0
+        ],
+        "max_sum": 3,
+        "input_image": "dataset_max_submatrix/conv_000_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_000_result.jpg",
+        "prompt_en": "Find the 2x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_000_input.jpg",
+        "save_id": 2064,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2064.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_002",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            4,
+            3
+        ],
+        "grid_values": [
+            [
+                -2,
+                -2,
+                4,
+                -9,
+                5,
+                -8
+            ],
+            [
+                0,
+                -9,
+                0,
+                0,
+                -8,
+                -5
+            ],
+            [
+                -3,
+                8,
+                -7,
+                -5,
+                0,
+                6
+            ],
+            [
+                1,
+                7,
+                -2,
+                3,
+                4,
+                -2
+            ],
+            [
+                -3,
+                -7,
+                1,
+                -1,
+                -7,
+                -7
+            ],
+            [
+                2,
+                2,
+                5,
+                -1,
+                5,
+                -5
+            ]
+        ],
+        "target_top_left": [
+            2,
+            0
+        ],
+        "max_sum": 4,
+        "input_image": "dataset_max_submatrix/conv_002_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_002_result.jpg",
+        "prompt_en": "Find the 4x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_002_input.jpg",
+        "save_id": 2066,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2066.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_004",
+        "task": "max_submatrix_sum",
+        "grid_size": 7,
+        "kernel_size": [
+            4,
+            2
+        ],
+        "grid_values": [
+            [
+                0,
+                -9,
+                0,
+                -6,
+                -4,
+                -1,
+                4
+            ],
+            [
+                1,
+                5,
+                7,
+                -7,
+                -2,
+                8,
+                -7
+            ],
+            [
+                7,
+                2,
+                -7,
+                -6,
+                -4,
+                6,
+                -8
+            ],
+            [
+                1,
+                9,
+                -6,
+                6,
+                3,
+                -2,
+                -5
+            ],
+            [
+                -8,
+                -7,
+                8,
+                1,
+                1,
+                -5,
+                -9
+            ],
+            [
+                8,
+                0,
+                -2,
+                -1,
+                -3,
+                3,
+                -4
+            ],
+            [
+                -9,
+                -9,
+                5,
+                -5,
+                8,
+                1,
+                -1
+            ]
+        ],
+        "target_top_left": [
+            0,
+            0
+        ],
+        "max_sum": 16,
+        "input_image": "dataset_max_submatrix/conv_004_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_004_result.jpg",
+        "prompt_en": "Find the 4x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_004_input.jpg",
+        "save_id": 2068,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2068.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_006",
+        "task": "max_submatrix_sum",
+        "grid_size": 8,
+        "kernel_size": [
+            4,
+            4
+        ],
+        "grid_values": [
+            [
+                8,
+                -3,
+                -5,
+                -9,
+                2,
+                7,
+                5,
+                1
+            ],
+            [
+                4,
+                -4,
+                5,
+                -8,
+                3,
+                8,
+                -6,
+                -2
+            ],
+            [
+                -8,
+                -3,
+                5,
+                2,
+                7,
+                -2,
+                -8,
+                -6
+            ],
+            [
+                9,
+                6,
+                -1,
+                -2,
+                4,
+                9,
+                7,
+                6
+            ],
+            [
+                -3,
+                -7,
+                -8,
+                2,
+                -9,
+                3,
+                -6,
+                -3
+            ],
+            [
+                -7,
+                5,
+                3,
+                -1,
+                1,
+                -3,
+                2,
+                6
+            ],
+            [
+                6,
+                -1,
+                -7,
+                -1,
+                0,
+                7,
+                -5,
+                -8
+            ],
+            [
+                6,
+                -6,
+                -1,
+                -3,
+                -9,
+                4,
+                -3,
+                7
+            ]
+        ],
+        "target_top_left": [
+            0,
+            4
+        ],
+        "max_sum": 35,
+        "input_image": "dataset_max_submatrix/conv_006_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_006_result.jpg",
+        "prompt_en": "Find the 4x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_006_input.jpg",
+        "save_id": 2070,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2070.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_008",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            2,
+            2
+        ],
+        "grid_values": [
+            [
+                -6,
+                -3,
+                0,
+                -5,
+                -5,
+                9
+            ],
+            [
+                -5,
+                -5,
+                -6,
+                7,
+                -8,
+                -8
+            ],
+            [
+                -1,
+                7,
+                8,
+                7,
+                -7,
+                9
+            ],
+            [
+                -3,
+                -1,
+                -9,
+                -5,
+                -9,
+                4
+            ],
+            [
+                7,
+                5,
+                7,
+                3,
+                1,
+                -4
+            ],
+            [
+                7,
+                -5,
+                2,
+                -2,
+                -6,
+                -8
+            ]
+        ],
+        "target_top_left": [
+            1,
+            2
+        ],
+        "max_sum": 16,
+        "input_image": "dataset_max_submatrix/conv_008_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_008_result.jpg",
+        "prompt_en": "Find the 2x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_008_input.jpg",
+        "save_id": 2072,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2072.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_010",
+        "task": "max_submatrix_sum",
+        "grid_size": 8,
+        "kernel_size": [
+            4,
+            3
+        ],
+        "grid_values": [
+            [
+                4,
+                -1,
+                7,
+                8,
+                -2,
+                2,
+                0,
+                0
+            ],
+            [
+                -7,
+                -8,
+                -8,
+                6,
+                -1,
+                -1,
+                7,
+                -2
+            ],
+            [
+                2,
+                -8,
+                -7,
+                -1,
+                -8,
+                -8,
+                -6,
+                5
+            ],
+            [
+                -1,
+                2,
+                2,
+                -9,
+                -6,
+                -1,
+                1,
+                -2
+            ],
+            [
+                -6,
+                7,
+                0,
+                3,
+                -4,
+                2,
+                9,
+                -3
+            ],
+            [
+                -4,
+                -2,
+                -8,
+                -5,
+                1,
+                -1,
+                2,
+                0
+            ],
+            [
+                5,
+                5,
+                0,
+                3,
+                9,
+                -6,
+                -3,
+                -1
+            ],
+            [
+                -8,
+                6,
+                -7,
+                -6,
+                2,
+                -8,
+                5,
+                0
+            ]
+        ],
+        "target_top_left": [
+            4,
+            4
+        ],
+        "max_sum": 8,
+        "input_image": "dataset_max_submatrix/conv_010_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_010_result.jpg",
+        "prompt_en": "Find the 4x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_010_input.jpg",
+        "save_id": 2074,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2074.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_012",
+        "task": "max_submatrix_sum",
+        "grid_size": 9,
+        "kernel_size": [
+            3,
+            2
+        ],
+        "grid_values": [
+            [
+                1,
+                5,
+                2,
+                -1,
+                -4,
+                6,
+                -9,
+                8,
+                -3
+            ],
+            [
+                -6,
+                -2,
+                9,
+                -8,
+                4,
+                1,
+                4,
+                3,
+                -1
+            ],
+            [
+                8,
+                3,
+                2,
+                -4,
+                -1,
+                5,
+                8,
+                9,
+                -9
+            ],
+            [
+                -2,
+                -9,
+                -1,
+                -5,
+                1,
+                0,
+                -6,
+                -7,
+                -4
+            ],
+            [
+                8,
+                5,
+                4,
+                4,
+                -5,
+                3,
+                -9,
+                -3,
+                2
+            ],
+            [
+                -1,
+                -8,
+                1,
+                5,
+                4,
+                7,
+                -6,
+                3,
+                -3
+            ],
+            [
+                -4,
+                2,
+                -7,
+                9,
+                -5,
+                0,
+                8,
+                9,
+                -2
+            ],
+            [
+                -9,
+                -9,
+                8,
+                0,
+                -6,
+                -8,
+                4,
+                -9,
+                7
+            ],
+            [
+                7,
+                -7,
+                3,
+                3,
+                -1,
+                8,
+                3,
+                6,
+                -4
+            ]
+        ],
+        "target_top_left": [
+            0,
+            6
+        ],
+        "max_sum": 23,
+        "input_image": "dataset_max_submatrix/conv_012_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_012_result.jpg",
+        "prompt_en": "Find the 3x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_012_input.jpg",
+        "save_id": 2076,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2076.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_014",
+        "task": "max_submatrix_sum",
+        "grid_size": 7,
+        "kernel_size": [
+            3,
+            4
+        ],
+        "grid_values": [
+            [
+                9,
+                -7,
+                2,
+                7,
+                -9,
+                -1,
+                -6
+            ],
+            [
+                -4,
+                -8,
+                1,
+                -7,
+                8,
+                8,
+                8
+            ],
+            [
+                -4,
+                -7,
+                9,
+                -4,
+                5,
+                4,
+                1
+            ],
+            [
+                4,
+                -1,
+                -3,
+                6,
+                -1,
+                6,
+                3
+            ],
+            [
+                0,
+                8,
+                8,
+                4,
+                6,
+                9,
+                4
+            ],
+            [
+                8,
+                6,
+                -1,
+                4,
+                -6,
+                6,
+                -4
+            ],
+            [
+                -7,
+                -5,
+                -9,
+                9,
+                1,
+                5,
+                9
+            ]
+        ],
+        "target_top_left": [
+            2,
+            2
+        ],
+        "max_sum": 49,
+        "input_image": "dataset_max_submatrix/conv_014_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_014_result.jpg",
+        "prompt_en": "Find the 3x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_014_input.jpg",
+        "save_id": 2078,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2078.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_016",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            2,
+            3
+        ],
+        "grid_values": [
+            [
+                -2,
+                -5,
+                -2,
+                2,
+                -2,
+                -4
+            ],
+            [
+                -8,
+                -3,
+                2,
+                8,
+                -5,
+                -2
+            ],
+            [
+                2,
+                9,
+                -4,
+                -1,
+                -8,
+                -3
+            ],
+            [
+                -4,
+                -6,
+                -5,
+                8,
+                -1,
+                4
+            ],
+            [
+                -1,
+                3,
+                2,
+                -8,
+                -8,
+                8
+            ],
+            [
+                2,
+                8,
+                8,
+                3,
+                8,
+                6
+            ]
+        ],
+        "target_top_left": [
+            4,
+            0
+        ],
+        "max_sum": 22,
+        "input_image": "dataset_max_submatrix/conv_016_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_016_result.jpg",
+        "prompt_en": "Find the 2x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_016_input.jpg",
+        "save_id": 2080,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2080.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_018",
+        "task": "max_submatrix_sum",
+        "grid_size": 8,
+        "kernel_size": [
+            3,
+            4
+        ],
+        "grid_values": [
+            [
+                2,
+                3,
+                5,
+                -7,
+                8,
+                -2,
+                4,
+                -7
+            ],
+            [
+                5,
+                2,
+                -9,
+                4,
+                4,
+                8,
+                -3,
+                9
+            ],
+            [
+                6,
+                -1,
+                -4,
+                -3,
+                2,
+                8,
+                -9,
+                -3
+            ],
+            [
+                3,
+                7,
+                5,
+                8,
+                -9,
+                3,
+                3,
+                -7
+            ],
+            [
+                -6,
+                4,
+                8,
+                -2,
+                -4,
+                3,
+                -1,
+                -6
+            ],
+            [
+                0,
+                -1,
+                -2,
+                9,
+                -2,
+                -8,
+                7,
+                -2
+            ],
+            [
+                6,
+                3,
+                5,
+                -7,
+                6,
+                -4,
+                -1,
+                3
+            ],
+            [
+                -4,
+                -1,
+                1,
+                -8,
+                -5,
+                -8,
+                -9,
+                1
+            ]
+        ],
+        "target_top_left": [
+            3,
+            0
+        ],
+        "max_sum": 33,
+        "input_image": "dataset_max_submatrix/conv_018_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_018_result.jpg",
+        "prompt_en": "Find the 3x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_018_input.jpg",
+        "save_id": 2082,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2082.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_020",
+        "task": "max_submatrix_sum",
+        "grid_size": 7,
+        "kernel_size": [
+            2,
+            3
+        ],
+        "grid_values": [
+            [
+                -6,
+                5,
+                6,
+                -3,
+                -3,
+                3,
+                -6
+            ],
+            [
+                -4,
+                -9,
+                3,
+                -9,
+                -4,
+                6,
+                -7
+            ],
+            [
+                9,
+                1,
+                -7,
+                3,
+                0,
+                8,
+                0
+            ],
+            [
+                2,
+                4,
+                -4,
+                -7,
+                5,
+                -8,
+                3
+            ],
+            [
+                6,
+                -6,
+                8,
+                -8,
+                4,
+                -9,
+                -8
+            ],
+            [
+                2,
+                -9,
+                4,
+                -1,
+                -5,
+                0,
+                8
+            ],
+            [
+                -6,
+                -7,
+                1,
+                4,
+                -5,
+                -9,
+                9
+            ]
+        ],
+        "target_top_left": [
+            3,
+            0
+        ],
+        "max_sum": 10,
+        "input_image": "dataset_max_submatrix/conv_020_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_020_result.jpg",
+        "prompt_en": "Find the 2x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_020_input.jpg",
+        "save_id": 2084,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2084.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_022",
+        "task": "max_submatrix_sum",
+        "grid_size": 7,
+        "kernel_size": [
+            3,
+            3
+        ],
+        "grid_values": [
+            [
+                -1,
+                6,
+                -2,
+                -2,
+                -1,
+                8,
+                6
+            ],
+            [
+                2,
+                -7,
+                4,
+                3,
+                -5,
+                -7,
+                -4
+            ],
+            [
+                5,
+                -9,
+                -6,
+                -8,
+                1,
+                -9,
+                3
+            ],
+            [
+                3,
+                3,
+                -3,
+                8,
+                3,
+                -1,
+                -7
+            ],
+            [
+                -1,
+                1,
+                9,
+                -2,
+                -3,
+                5,
+                7
+            ],
+            [
+                -1,
+                -5,
+                8,
+                0,
+                -6,
+                -6,
+                -2
+            ],
+            [
+                6,
+                -8,
+                -2,
+                8,
+                1,
+                -5,
+                4
+            ]
+        ],
+        "target_top_left": [
+            3,
+            1
+        ],
+        "max_sum": 19,
+        "input_image": "dataset_max_submatrix/conv_022_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_022_result.jpg",
+        "prompt_en": "Find the 3x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_022_input.jpg",
+        "save_id": 2086,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2086.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_024",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            2,
+            2
+        ],
+        "grid_values": [
+            [
+                -6,
+                7,
+                -8,
+                -9,
+                2,
+                -9,
+                -2,
+                -2,
+                -8,
+                7
+            ],
+            [
+                9,
+                -1,
+                -1,
+                5,
+                7,
+                -7,
+                -2,
+                8,
+                0,
+                9
+            ],
+            [
+                8,
+                3,
+                1,
+                9,
+                6,
+                9,
+                -7,
+                -5,
+                4,
+                3
+            ],
+            [
+                -8,
+                0,
+                3,
+                5,
+                2,
+                -7,
+                0,
+                7,
+                8,
+                -4
+            ],
+            [
+                6,
+                3,
+                -2,
+                -5,
+                6,
+                -7,
+                -9,
+                -6,
+                5,
+                -4
+            ],
+            [
+                3,
+                2,
+                -5,
+                6,
+                4,
+                -1,
+                -9,
+                -3,
+                -3,
+                1
+            ],
+            [
+                -5,
+                -4,
+                0,
+                -5,
+                9,
+                -5,
+                -5,
+                -8,
+                8,
+                -3
+            ],
+            [
+                3,
+                -8,
+                -3,
+                3,
+                -6,
+                1,
+                3,
+                -3,
+                -1,
+                -8
+            ],
+            [
+                5,
+                4,
+                0,
+                -7,
+                -2,
+                5,
+                -3,
+                -7,
+                -5,
+                -4
+            ],
+            [
+                3,
+                6,
+                -1,
+                7,
+                8,
+                -5,
+                -8,
+                3,
+                8,
+                3
+            ]
+        ],
+        "target_top_left": [
+            1,
+            3
+        ],
+        "max_sum": 27,
+        "input_image": "dataset_max_submatrix/conv_024_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_024_result.jpg",
+        "prompt_en": "Find the 2x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_024_input.jpg",
+        "save_id": 2088,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2088.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_026",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            2,
+            4
+        ],
+        "grid_values": [
+            [
+                3,
+                5,
+                -3,
+                3,
+                3,
+                9,
+                6,
+                -4,
+                -9,
+                5
+            ],
+            [
+                7,
+                -2,
+                0,
+                -2,
+                8,
+                -8,
+                -1,
+                0,
+                9,
+                -2
+            ],
+            [
+                -9,
+                9,
+                6,
+                8,
+                -7,
+                -5,
+                5,
+                2,
+                7,
+                0
+            ],
+            [
+                -8,
+                5,
+                2,
+                -1,
+                -6,
+                2,
+                -2,
+                0,
+                0,
+                -1
+            ],
+            [
+                -2,
+                -5,
+                3,
+                2,
+                7,
+                7,
+                8,
+                6,
+                1,
+                -3
+            ],
+            [
+                6,
+                -7,
+                -4,
+                6,
+                3,
+                9,
+                -8,
+                -5,
+                -7,
+                8
+            ],
+            [
+                9,
+                -8,
+                -1,
+                0,
+                -1,
+                -6,
+                4,
+                -1,
+                4,
+                -2
+            ],
+            [
+                -2,
+                -1,
+                8,
+                -8,
+                0,
+                -1,
+                3,
+                9,
+                -8,
+                2
+            ],
+            [
+                -7,
+                4,
+                6,
+                6,
+                -2,
+                5,
+                -4,
+                3,
+                8,
+                2
+            ],
+            [
+                0,
+                -4,
+                2,
+                3,
+                -7,
+                -8,
+                0,
+                -7,
+                7,
+                -6
+            ]
+        ],
+        "target_top_left": [
+            4,
+            3
+        ],
+        "max_sum": 34,
+        "input_image": "dataset_max_submatrix/conv_026_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_026_result.jpg",
+        "prompt_en": "Find the 2x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_026_input.jpg",
+        "save_id": 2090,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2090.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_028",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            3,
+            2
+        ],
+        "grid_values": [
+            [
+                0,
+                -7,
+                5,
+                8,
+                -6,
+                2,
+                -3,
+                -5,
+                -3,
+                -9
+            ],
+            [
+                9,
+                -8,
+                6,
+                1,
+                5,
+                -8,
+                4,
+                -6,
+                -6,
+                2
+            ],
+            [
+                -1,
+                4,
+                6,
+                -3,
+                0,
+                4,
+                6,
+                -3,
+                6,
+                5
+            ],
+            [
+                8,
+                2,
+                -5,
+                2,
+                6,
+                6,
+                3,
+                3,
+                -5,
+                5
+            ],
+            [
+                6,
+                -1,
+                8,
+                -8,
+                -2,
+                -3,
+                -8,
+                9,
+                9,
+                0
+            ],
+            [
+                4,
+                7,
+                -1,
+                8,
+                -2,
+                4,
+                -1,
+                5,
+                6,
+                -4
+            ],
+            [
+                -4,
+                1,
+                0,
+                0,
+                -4,
+                6,
+                6,
+                -7,
+                -7,
+                -4
+            ],
+            [
+                2,
+                -7,
+                4,
+                2,
+                7,
+                7,
+                -1,
+                -3,
+                -3,
+                9
+            ],
+            [
+                4,
+                3,
+                -9,
+                -7,
+                -6,
+                -6,
+                6,
+                7,
+                -8,
+                -4
+            ],
+            [
+                -1,
+                -2,
+                -2,
+                -2,
+                5,
+                6,
+                -1,
+                8,
+                -7,
+                4
+            ]
+        ],
+        "target_top_left": [
+            3,
+            7
+        ],
+        "max_sum": 27,
+        "input_image": "dataset_max_submatrix/conv_028_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_028_result.jpg",
+        "prompt_en": "Find the 3x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_028_input.jpg",
+        "save_id": 2092,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2092.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_030",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            4,
+            4
+        ],
+        "grid_values": [
+            [
+                8,
+                3,
+                2,
+                -2,
+                -9,
+                -5,
+                -4,
+                6,
+                5,
+                8
+            ],
+            [
+                -5,
+                4,
+                7,
+                -2,
+                -4,
+                9,
+                7,
+                -1,
+                -7,
+                0
+            ],
+            [
+                5,
+                -9,
+                -6,
+                -7,
+                8,
+                -2,
+                8,
+                0,
+                -9,
+                -7
+            ],
+            [
+                5,
+                9,
+                -7,
+                8,
+                1,
+                -4,
+                -6,
+                -1,
+                2,
+                -1
+            ],
+            [
+                -1,
+                -4,
+                8,
+                4,
+                -2,
+                -3,
+                2,
+                2,
+                2,
+                4
+            ],
+            [
+                4,
+                -8,
+                1,
+                8,
+                -4,
+                -5,
+                -6,
+                -6,
+                3,
+                4
+            ],
+            [
+                7,
+                0,
+                9,
+                6,
+                7,
+                4,
+                -1,
+                5,
+                -2,
+                0
+            ],
+            [
+                0,
+                -7,
+                -4,
+                1,
+                -4,
+                -7,
+                1,
+                -4,
+                -2,
+                -1
+            ],
+            [
+                -6,
+                -8,
+                -2,
+                -4,
+                -3,
+                -3,
+                -1,
+                6,
+                8,
+                3
+            ],
+            [
+                -6,
+                -3,
+                -2,
+                -8,
+                -9,
+                -6,
+                -2,
+                8,
+                8,
+                9
+            ]
+        ],
+        "target_top_left": [
+            3,
+            0
+        ],
+        "max_sum": 49,
+        "input_image": "dataset_max_submatrix/conv_030_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_030_result.jpg",
+        "prompt_en": "Find the 4x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_030_input.jpg",
+        "save_id": 2094,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2094.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_032",
+        "task": "max_submatrix_sum",
+        "grid_size": 7,
+        "kernel_size": [
+            2,
+            3
+        ],
+        "grid_values": [
+            [
+                -7,
+                -8,
+                -3,
+                -3,
+                3,
+                -5,
+                -4
+            ],
+            [
+                2,
+                6,
+                -1,
+                5,
+                5,
+                6,
+                -2
+            ],
+            [
+                8,
+                7,
+                2,
+                5,
+                0,
+                4,
+                0
+            ],
+            [
+                -7,
+                -1,
+                -7,
+                4,
+                -1,
+                4,
+                4
+            ],
+            [
+                -6,
+                -8,
+                3,
+                6,
+                -7,
+                3,
+                -9
+            ],
+            [
+                -8,
+                2,
+                3,
+                0,
+                4,
+                4,
+                -8
+            ],
+            [
+                -7,
+                -4,
+                -8,
+                -5,
+                -3,
+                -9,
+                9
+            ]
+        ],
+        "target_top_left": [
+            1,
+            3
+        ],
+        "max_sum": 25,
+        "input_image": "dataset_max_submatrix/conv_032_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_032_result.jpg",
+        "prompt_en": "Find the 2x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_032_input.jpg",
+        "save_id": 2096,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2096.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_034",
+        "task": "max_submatrix_sum",
+        "grid_size": 9,
+        "kernel_size": [
+            3,
+            3
+        ],
+        "grid_values": [
+            [
+                6,
+                -4,
+                1,
+                5,
+                5,
+                -5,
+                8,
+                7,
+                2
+            ],
+            [
+                3,
+                9,
+                7,
+                7,
+                -5,
+                -3,
+                4,
+                8,
+                6
+            ],
+            [
+                -6,
+                -5,
+                -2,
+                8,
+                0,
+                9,
+                -9,
+                -7,
+                -6
+            ],
+            [
+                -9,
+                5,
+                3,
+                -2,
+                -4,
+                9,
+                3,
+                -7,
+                -8
+            ],
+            [
+                -3,
+                9,
+                -2,
+                4,
+                -2,
+                9,
+                4,
+                0,
+                -7
+            ],
+            [
+                -9,
+                -4,
+                3,
+                -4,
+                4,
+                -6,
+                -1,
+                -5,
+                2
+            ],
+            [
+                4,
+                -8,
+                -5,
+                8,
+                -9,
+                -7,
+                4,
+                9,
+                7
+            ],
+            [
+                0,
+                7,
+                5,
+                -9,
+                7,
+                6,
+                0,
+                7,
+                -5
+            ],
+            [
+                -3,
+                2,
+                3,
+                3,
+                -6,
+                -6,
+                -2,
+                -5,
+                -4
+            ]
+        ],
+        "target_top_left": [
+            2,
+            3
+        ],
+        "max_sum": 31,
+        "input_image": "dataset_max_submatrix/conv_034_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_034_result.jpg",
+        "prompt_en": "Find the 3x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_034_input.jpg",
+        "save_id": 2098,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2098.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_036",
+        "task": "max_submatrix_sum",
+        "grid_size": 9,
+        "kernel_size": [
+            4,
+            4
+        ],
+        "grid_values": [
+            [
+                -1,
+                -7,
+                -5,
+                8,
+                8,
+                3,
+                3,
+                -2,
+                -7
+            ],
+            [
+                9,
+                -2,
+                -7,
+                3,
+                6,
+                9,
+                5,
+                0,
+                0
+            ],
+            [
+                0,
+                -9,
+                4,
+                -4,
+                3,
+                7,
+                4,
+                9,
+                4
+            ],
+            [
+                1,
+                -4,
+                -8,
+                -1,
+                -9,
+                8,
+                -9,
+                2,
+                -6
+            ],
+            [
+                7,
+                1,
+                6,
+                8,
+                3,
+                -1,
+                5,
+                9,
+                -8
+            ],
+            [
+                5,
+                -2,
+                2,
+                -9,
+                3,
+                1,
+                -4,
+                -6,
+                4
+            ],
+            [
+                4,
+                3,
+                -2,
+                3,
+                -9,
+                -8,
+                -6,
+                2,
+                -8
+            ],
+            [
+                6,
+                -4,
+                5,
+                6,
+                4,
+                -6,
+                -1,
+                -1,
+                -5
+            ],
+            [
+                -3,
+                7,
+                -5,
+                -6,
+                -4,
+                -8,
+                -5,
+                0,
+                -3
+            ]
+        ],
+        "target_top_left": [
+            1,
+            4
+        ],
+        "max_sum": 51,
+        "input_image": "dataset_max_submatrix/conv_036_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_036_result.jpg",
+        "prompt_en": "Find the 4x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_036_input.jpg",
+        "save_id": 2100,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2100.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_038",
+        "task": "max_submatrix_sum",
+        "grid_size": 9,
+        "kernel_size": [
+            3,
+            3
+        ],
+        "grid_values": [
+            [
+                0,
+                -1,
+                -6,
+                9,
+                -5,
+                -7,
+                7,
+                -7,
+                -5
+            ],
+            [
+                6,
+                5,
+                5,
+                6,
+                -3,
+                -9,
+                -1,
+                5,
+                8
+            ],
+            [
+                -2,
+                5,
+                3,
+                0,
+                -3,
+                -7,
+                -3,
+                -6,
+                2
+            ],
+            [
+                0,
+                7,
+                0,
+                0,
+                1,
+                -7,
+                9,
+                0,
+                5
+            ],
+            [
+                8,
+                3,
+                2,
+                7,
+                -9,
+                -5,
+                4,
+                -6,
+                -2
+            ],
+            [
+                -6,
+                3,
+                9,
+                -8,
+                -8,
+                -9,
+                -5,
+                -9,
+                -3
+            ],
+            [
+                -3,
+                -4,
+                4,
+                -4,
+                -6,
+                2,
+                3,
+                -2,
+                8
+            ],
+            [
+                -1,
+                8,
+                -9,
+                0,
+                -7,
+                -9,
+                -1,
+                -2,
+                -1
+            ],
+            [
+                -8,
+                -5,
+                5,
+                2,
+                8,
+                -2,
+                7,
+                -5,
+                -3
+            ]
+        ],
+        "target_top_left": [
+            1,
+            1
+        ],
+        "max_sum": 31,
+        "input_image": "dataset_max_submatrix/conv_038_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_038_result.jpg",
+        "prompt_en": "Find the 3x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_038_input.jpg",
+        "save_id": 2102,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2102.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_040",
+        "task": "max_submatrix_sum",
+        "grid_size": 8,
+        "kernel_size": [
+            2,
+            4
+        ],
+        "grid_values": [
+            [
+                -7,
+                -1,
+                6,
+                2,
+                -5,
+                8,
+                -2,
+                6
+            ],
+            [
+                4,
+                -9,
+                3,
+                -2,
+                4,
+                9,
+                -7,
+                -8
+            ],
+            [
+                -5,
+                -5,
+                2,
+                -5,
+                1,
+                -5,
+                9,
+                4
+            ],
+            [
+                -8,
+                2,
+                5,
+                -2,
+                -8,
+                -4,
+                0,
+                7
+            ],
+            [
+                3,
+                6,
+                6,
+                8,
+                7,
+                3,
+                -1,
+                7
+            ],
+            [
+                -5,
+                -4,
+                4,
+                4,
+                6,
+                1,
+                -6,
+                -5
+            ],
+            [
+                -5,
+                3,
+                4,
+                -3,
+                3,
+                2,
+                0,
+                8
+            ],
+            [
+                -6,
+                -4,
+                -5,
+                2,
+                -6,
+                -6,
+                -6,
+                6
+            ]
+        ],
+        "target_top_left": [
+            4,
+            2
+        ],
+        "max_sum": 39,
+        "input_image": "dataset_max_submatrix/conv_040_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_040_result.jpg",
+        "prompt_en": "Find the 2x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_040_input.jpg",
+        "save_id": 2104,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2104.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_041",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            2,
+            4
+        ],
+        "grid_values": [
+            [
+                5,
+                -1,
+                -9,
+                5,
+                -4,
+                -2,
+                3,
+                -4,
+                9,
+                -9
+            ],
+            [
+                5,
+                -7,
+                -1,
+                7,
+                3,
+                -5,
+                2,
+                9,
+                0,
+                5
+            ],
+            [
+                1,
+                -1,
+                -3,
+                8,
+                7,
+                -9,
+                0,
+                1,
+                -3,
+                1
+            ],
+            [
+                5,
+                8,
+                -8,
+                2,
+                -6,
+                -8,
+                2,
+                -1,
+                0,
+                2
+            ],
+            [
+                -8,
+                -2,
+                -9,
+                9,
+                -5,
+                0,
+                2,
+                8,
+                5,
+                -8
+            ],
+            [
+                -9,
+                4,
+                1,
+                -7,
+                -1,
+                -9,
+                8,
+                2,
+                -3,
+                -6
+            ],
+            [
+                4,
+                5,
+                8,
+                5,
+                2,
+                5,
+                -5,
+                8,
+                -2,
+                0
+            ],
+            [
+                4,
+                -9,
+                1,
+                4,
+                1,
+                -1,
+                1,
+                -8,
+                8,
+                -8
+            ],
+            [
+                8,
+                6,
+                0,
+                9,
+                -3,
+                -7,
+                -1,
+                2,
+                1,
+                8
+            ],
+            [
+                -6,
+                -4,
+                -7,
+                -9,
+                -4,
+                -2,
+                2,
+                9,
+                4,
+                4
+            ]
+        ],
+        "target_top_left": [
+            8,
+            6
+        ],
+        "max_sum": 29,
+        "input_image": "dataset_max_submatrix/conv_041_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_041_result.jpg",
+        "prompt_en": "Find the 2x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_041_input.jpg",
+        "save_id": 2105,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2105.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_042",
+        "task": "max_submatrix_sum",
+        "grid_size": 8,
+        "kernel_size": [
+            2,
+            4
+        ],
+        "grid_values": [
+            [
+                6,
+                -3,
+                2,
+                7,
+                8,
+                -7,
+                1,
+                -3
+            ],
+            [
+                6,
+                8,
+                -4,
+                -9,
+                -1,
+                8,
+                -9,
+                -6
+            ],
+            [
+                -6,
+                -5,
+                4,
+                -3,
+                -2,
+                4,
+                -8,
+                0
+            ],
+            [
+                6,
+                -1,
+                -5,
+                5,
+                -2,
+                -4,
+                1,
+                3
+            ],
+            [
+                -8,
+                -4,
+                -8,
+                7,
+                4,
+                -1,
+                2,
+                -7
+            ],
+            [
+                2,
+                7,
+                6,
+                8,
+                0,
+                -3,
+                -8,
+                1
+            ],
+            [
+                5,
+                -7,
+                -7,
+                6,
+                4,
+                1,
+                -1,
+                -1
+            ],
+            [
+                -1,
+                8,
+                8,
+                0,
+                -9,
+                -7,
+                -4,
+                3
+            ]
+        ],
+        "target_top_left": [
+            4,
+            1
+        ],
+        "max_sum": 20,
+        "input_image": "dataset_max_submatrix/conv_042_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_042_result.jpg",
+        "prompt_en": "Find the 2x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_042_input.jpg",
+        "save_id": 2106,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2106.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_043",
+        "task": "max_submatrix_sum",
+        "grid_size": 9,
+        "kernel_size": [
+            4,
+            4
+        ],
+        "grid_values": [
+            [
+                5,
+                1,
+                3,
+                9,
+                0,
+                3,
+                4,
+                -4,
+                3
+            ],
+            [
+                0,
+                3,
+                9,
+                6,
+                7,
+                -6,
+                9,
+                5,
+                -1
+            ],
+            [
+                -4,
+                4,
+                4,
+                1,
+                9,
+                -4,
+                0,
+                -1,
+                -4
+            ],
+            [
+                6,
+                -2,
+                5,
+                -9,
+                2,
+                8,
+                7,
+                -4,
+                1
+            ],
+            [
+                3,
+                8,
+                -9,
+                6,
+                8,
+                2,
+                -6,
+                -6,
+                6
+            ],
+            [
+                -8,
+                -3,
+                0,
+                -2,
+                8,
+                3,
+                -6,
+                4,
+                -6
+            ],
+            [
+                7,
+                2,
+                4,
+                2,
+                -5,
+                1,
+                2,
+                0,
+                -3
+            ],
+            [
+                3,
+                -1,
+                -9,
+                -2,
+                8,
+                -8,
+                1,
+                -9,
+                6
+            ],
+            [
+                -7,
+                -4,
+                -2,
+                0,
+                8,
+                -5,
+                -6,
+                -5,
+                5
+            ]
+        ],
+        "target_top_left": [
+            0,
+            1
+        ],
+        "max_sum": 52,
+        "input_image": "dataset_max_submatrix/conv_043_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_043_result.jpg",
+        "prompt_en": "Find the 4x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_043_input.jpg",
+        "save_id": 2107,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2107.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_044",
+        "task": "max_submatrix_sum",
+        "grid_size": 7,
+        "kernel_size": [
+            3,
+            3
+        ],
+        "grid_values": [
+            [
+                -3,
+                7,
+                -9,
+                6,
+                9,
+                -5,
+                -5
+            ],
+            [
+                5,
+                -6,
+                -5,
+                4,
+                4,
+                -4,
+                -6
+            ],
+            [
+                -6,
+                -7,
+                7,
+                -4,
+                -7,
+                -5,
+                -9
+            ],
+            [
+                -5,
+                -9,
+                5,
+                -4,
+                7,
+                -3,
+                7
+            ],
+            [
+                -5,
+                -3,
+                -8,
+                -4,
+                -6,
+                2,
+                -4
+            ],
+            [
+                7,
+                0,
+                -3,
+                3,
+                -6,
+                2,
+                2
+            ],
+            [
+                -9,
+                3,
+                -2,
+                -8,
+                -7,
+                -1,
+                -2
+            ]
+        ],
+        "target_top_left": [
+            1,
+            2
+        ],
+        "max_sum": 7,
+        "input_image": "dataset_max_submatrix/conv_044_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_044_result.jpg",
+        "prompt_en": "Find the 3x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_044_input.jpg",
+        "save_id": 2108,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2108.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_045",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            4,
+            2
+        ],
+        "grid_values": [
+            [
+                -2,
+                -9,
+                -5,
+                4,
+                8,
+                -1,
+                4,
+                9,
+                7,
+                -9
+            ],
+            [
+                7,
+                1,
+                5,
+                4,
+                7,
+                -8,
+                4,
+                -2,
+                -8,
+                8
+            ],
+            [
+                2,
+                1,
+                4,
+                9,
+                8,
+                5,
+                8,
+                5,
+                -2,
+                3
+            ],
+            [
+                -9,
+                8,
+                7,
+                -8,
+                -2,
+                4,
+                7,
+                4,
+                -8,
+                -3
+            ],
+            [
+                8,
+                5,
+                3,
+                -5,
+                8,
+                -8,
+                7,
+                0,
+                2,
+                3
+            ],
+            [
+                6,
+                8,
+                3,
+                -2,
+                -2,
+                0,
+                5,
+                -2,
+                4,
+                -8
+            ],
+            [
+                6,
+                -2,
+                -8,
+                0,
+                7,
+                -6,
+                9,
+                1,
+                1,
+                -4
+            ],
+            [
+                4,
+                -6,
+                9,
+                5,
+                4,
+                -8,
+                8,
+                5,
+                -5,
+                -1
+            ],
+            [
+                8,
+                1,
+                -3,
+                -4,
+                -1,
+                -3,
+                7,
+                1,
+                1,
+                -9
+            ],
+            [
+                0,
+                -9,
+                -2,
+                4,
+                -2,
+                -9,
+                6,
+                -7,
+                -4,
+                6
+            ]
+        ],
+        "target_top_left": [
+            0,
+            6
+        ],
+        "max_sum": 39,
+        "input_image": "dataset_max_submatrix/conv_045_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_045_result.jpg",
+        "prompt_en": "Find the 4x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_045_input.jpg",
+        "save_id": 2109,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2109.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_046",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            4,
+            2
+        ],
+        "grid_values": [
+            [
+                -2,
+                9,
+                1,
+                -2,
+                -4,
+                3,
+                9,
+                4,
+                1,
+                4
+            ],
+            [
+                8,
+                9,
+                4,
+                9,
+                2,
+                -7,
+                8,
+                -1,
+                -8,
+                2
+            ],
+            [
+                -4,
+                -9,
+                -6,
+                -6,
+                -2,
+                -6,
+                5,
+                8,
+                0,
+                8
+            ],
+            [
+                -6,
+                -3,
+                5,
+                -4,
+                -4,
+                1,
+                6,
+                -4,
+                7,
+                -2
+            ],
+            [
+                8,
+                1,
+                -4,
+                -7,
+                4,
+                -6,
+                5,
+                -4,
+                -4,
+                3
+            ],
+            [
+                -7,
+                8,
+                1,
+                8,
+                9,
+                3,
+                6,
+                6,
+                6,
+                0
+            ],
+            [
+                -6,
+                -2,
+                -6,
+                8,
+                6,
+                5,
+                -5,
+                -8,
+                -8,
+                -7
+            ],
+            [
+                5,
+                6,
+                -7,
+                4,
+                3,
+                2,
+                7,
+                6,
+                -2,
+                -1
+            ],
+            [
+                8,
+                9,
+                0,
+                -7,
+                -9,
+                0,
+                4,
+                -8,
+                5,
+                4
+            ],
+            [
+                7,
+                -6,
+                -9,
+                8,
+                -4,
+                7,
+                -8,
+                -2,
+                5,
+                7
+            ]
+        ],
+        "target_top_left": [
+            0,
+            6
+        ],
+        "max_sum": 35,
+        "input_image": "dataset_max_submatrix/conv_046_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_046_result.jpg",
+        "prompt_en": "Find the 4x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_046_input.jpg",
+        "save_id": 2110,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2110.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_047",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            3,
+            4
+        ],
+        "grid_values": [
+            [
+                -5,
+                -3,
+                6,
+                -6,
+                -6,
+                1,
+                -4,
+                1,
+                4,
+                -9
+            ],
+            [
+                -5,
+                0,
+                -9,
+                2,
+                1,
+                3,
+                -8,
+                4,
+                4,
+                -9
+            ],
+            [
+                6,
+                0,
+                6,
+                9,
+                -4,
+                9,
+                -1,
+                9,
+                4,
+                4
+            ],
+            [
+                2,
+                -2,
+                0,
+                -9,
+                6,
+                3,
+                1,
+                -1,
+                0,
+                9
+            ],
+            [
+                4,
+                -7,
+                2,
+                -2,
+                6,
+                9,
+                -1,
+                2,
+                -2,
+                1
+            ],
+            [
+                8,
+                7,
+                -3,
+                -7,
+                -3,
+                1,
+                -7,
+                9,
+                8,
+                7
+            ],
+            [
+                3,
+                -3,
+                1,
+                6,
+                1,
+                -1,
+                -5,
+                -9,
+                -8,
+                1
+            ],
+            [
+                1,
+                3,
+                1,
+                8,
+                3,
+                8,
+                -3,
+                0,
+                9,
+                1
+            ],
+            [
+                6,
+                0,
+                6,
+                -8,
+                4,
+                0,
+                5,
+                7,
+                8,
+                6
+            ],
+            [
+                5,
+                1,
+                -9,
+                -4,
+                0,
+                -8,
+                -2,
+                -9,
+                -4,
+                3
+            ]
+        ],
+        "target_top_left": [
+            2,
+            4
+        ],
+        "max_sum": 38,
+        "input_image": "dataset_max_submatrix/conv_047_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_047_result.jpg",
+        "prompt_en": "Find the 3x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_047_input.jpg",
+        "save_id": 2111,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2111.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_048",
+        "task": "max_submatrix_sum",
+        "grid_size": 8,
+        "kernel_size": [
+            3,
+            3
+        ],
+        "grid_values": [
+            [
+                8,
+                1,
+                -5,
+                6,
+                -6,
+                3,
+                -5,
+                4
+            ],
+            [
+                -3,
+                6,
+                1,
+                -4,
+                3,
+                6,
+                1,
+                7
+            ],
+            [
+                0,
+                1,
+                -4,
+                -4,
+                7,
+                7,
+                6,
+                9
+            ],
+            [
+                -4,
+                -9,
+                7,
+                -8,
+                -4,
+                3,
+                9,
+                -1
+            ],
+            [
+                -8,
+                -9,
+                2,
+                -6,
+                4,
+                0,
+                2,
+                -4
+            ],
+            [
+                4,
+                -7,
+                0,
+                1,
+                -4,
+                -2,
+                -6,
+                -1
+            ],
+            [
+                9,
+                -7,
+                9,
+                -3,
+                9,
+                -2,
+                -5,
+                -9
+            ],
+            [
+                4,
+                8,
+                -3,
+                0,
+                7,
+                3,
+                -3,
+                -5
+            ]
+        ],
+        "target_top_left": [
+            1,
+            5
+        ],
+        "max_sum": 47,
+        "input_image": "dataset_max_submatrix/conv_048_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_048_result.jpg",
+        "prompt_en": "Find the 3x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_048_input.jpg",
+        "save_id": 2112,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2112.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_049",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            3,
+            3
+        ],
+        "grid_values": [
+            [
+                4,
+                -8,
+                4,
+                -9,
+                -3,
+                9,
+                -6,
+                1,
+                -8,
+                6
+            ],
+            [
+                8,
+                -7,
+                -8,
+                3,
+                0,
+                -6,
+                -3,
+                -1,
+                -4,
+                0
+            ],
+            [
+                4,
+                6,
+                2,
+                -1,
+                -6,
+                -7,
+                -5,
+                -5,
+                -1,
+                -7
+            ],
+            [
+                -4,
+                6,
+                -3,
+                -8,
+                -7,
+                5,
+                7,
+                8,
+                8,
+                -1
+            ],
+            [
+                4,
+                7,
+                2,
+                2,
+                -9,
+                -1,
+                1,
+                1,
+                -8,
+                7
+            ],
+            [
+                8,
+                3,
+                5,
+                7,
+                -5,
+                -3,
+                6,
+                7,
+                4,
+                6
+            ],
+            [
+                -1,
+                0,
+                -6,
+                -2,
+                4,
+                -2,
+                6,
+                3,
+                -8,
+                -6
+            ],
+            [
+                0,
+                -8,
+                -4,
+                4,
+                -1,
+                6,
+                8,
+                -5,
+                -1,
+                -9
+            ],
+            [
+                2,
+                2,
+                0,
+                -4,
+                -1,
+                8,
+                1,
+                -4,
+                8,
+                1
+            ],
+            [
+                0,
+                -6,
+                1,
+                2,
+                -9,
+                -4,
+                6,
+                5,
+                -2,
+                9
+            ]
+        ],
+        "target_top_left": [
+            3,
+            6
+        ],
+        "max_sum": 34,
+        "input_image": "dataset_max_submatrix/conv_049_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_049_result.jpg",
+        "prompt_en": "Find the 3x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_049_input.jpg",
+        "save_id": 2113,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2113.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_050",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            2,
+            2
+        ],
+        "grid_values": [
+            [
+                3,
+                -1,
+                3,
+                6,
+                -8,
+                2,
+                8,
+                6,
+                0,
+                4
+            ],
+            [
+                -9,
+                5,
+                -1,
+                8,
+                6,
+                9,
+                2,
+                5,
+                -6,
+                4
+            ],
+            [
+                -7,
+                2,
+                -5,
+                -6,
+                9,
+                -5,
+                1,
+                -1,
+                4,
+                8
+            ],
+            [
+                -3,
+                5,
+                -3,
+                -8,
+                1,
+                -4,
+                6,
+                3,
+                2,
+                -2
+            ],
+            [
+                1,
+                -2,
+                -1,
+                -3,
+                9,
+                7,
+                6,
+                -2,
+                8,
+                -1
+            ],
+            [
+                -7,
+                -6,
+                -3,
+                -5,
+                2,
+                8,
+                3,
+                1,
+                -7,
+                5
+            ],
+            [
+                5,
+                -7,
+                -2,
+                5,
+                -9,
+                9,
+                2,
+                8,
+                0,
+                -4
+            ],
+            [
+                9,
+                5,
+                8,
+                -3,
+                0,
+                -6,
+                5,
+                2,
+                2,
+                -9
+            ],
+            [
+                7,
+                5,
+                1,
+                -4,
+                -6,
+                -7,
+                7,
+                -3,
+                -3,
+                -5
+            ],
+            [
+                2,
+                0,
+                -1,
+                -8,
+                0,
+                5,
+                4,
+                7,
+                -1,
+                -9
+            ]
+        ],
+        "target_top_left": [
+            4,
+            4
+        ],
+        "max_sum": 26,
+        "input_image": "dataset_max_submatrix/conv_050_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_050_result.jpg",
+        "prompt_en": "Find the 2x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_050_input.jpg",
+        "save_id": 2114,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2114.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_051",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            4,
+            3
+        ],
+        "grid_values": [
+            [
+                -9,
+                4,
+                -1,
+                -4,
+                -8,
+                6
+            ],
+            [
+                4,
+                -8,
+                -8,
+                -2,
+                -5,
+                -6
+            ],
+            [
+                -5,
+                -2,
+                -9,
+                7,
+                5,
+                -7
+            ],
+            [
+                4,
+                1,
+                1,
+                2,
+                -5,
+                9
+            ],
+            [
+                3,
+                -3,
+                -8,
+                2,
+                6,
+                -3
+            ],
+            [
+                -1,
+                8,
+                -3,
+                5,
+                3,
+                7
+            ]
+        ],
+        "target_top_left": [
+            2,
+            3
+        ],
+        "max_sum": 31,
+        "input_image": "dataset_max_submatrix/conv_051_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_051_result.jpg",
+        "prompt_en": "Find the 4x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_051_input.jpg",
+        "save_id": 2115,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2115.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_052",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            4,
+            4
+        ],
+        "grid_values": [
+            [
+                5,
+                2,
+                -3,
+                8,
+                8,
+                9
+            ],
+            [
+                2,
+                4,
+                -8,
+                6,
+                -4,
+                6
+            ],
+            [
+                5,
+                7,
+                -9,
+                0,
+                -5,
+                5
+            ],
+            [
+                -3,
+                -3,
+                6,
+                3,
+                -3,
+                6
+            ],
+            [
+                0,
+                -2,
+                -4,
+                -8,
+                -4,
+                -7
+            ],
+            [
+                0,
+                -7,
+                4,
+                -2,
+                3,
+                -4
+            ]
+        ],
+        "target_top_left": [
+            0,
+            2
+        ],
+        "max_sum": 25,
+        "input_image": "dataset_max_submatrix/conv_052_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_052_result.jpg",
+        "prompt_en": "Find the 4x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_052_input.jpg",
+        "save_id": 2116,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2116.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_053",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            2,
+            2
+        ],
+        "grid_values": [
+            [
+                4,
+                7,
+                -7,
+                -1,
+                -7,
+                -9
+            ],
+            [
+                -2,
+                7,
+                -7,
+                1,
+                0,
+                -6
+            ],
+            [
+                9,
+                -3,
+                -9,
+                -2,
+                -3,
+                -6
+            ],
+            [
+                6,
+                5,
+                -5,
+                4,
+                -4,
+                5
+            ],
+            [
+                -3,
+                -7,
+                5,
+                -1,
+                8,
+                -7
+            ],
+            [
+                4,
+                -9,
+                4,
+                7,
+                -1,
+                4
+            ]
+        ],
+        "target_top_left": [
+            2,
+            0
+        ],
+        "max_sum": 17,
+        "input_image": "dataset_max_submatrix/conv_053_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_053_result.jpg",
+        "prompt_en": "Find the 2x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_053_input.jpg",
+        "save_id": 2117,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2117.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_054",
+        "task": "max_submatrix_sum",
+        "grid_size": 9,
+        "kernel_size": [
+            4,
+            3
+        ],
+        "grid_values": [
+            [
+                2,
+                3,
+                -4,
+                7,
+                0,
+                -6,
+                -8,
+                -1,
+                0
+            ],
+            [
+                8,
+                1,
+                9,
+                9,
+                6,
+                -6,
+                5,
+                7,
+                5
+            ],
+            [
+                -6,
+                -7,
+                -5,
+                1,
+                -4,
+                8,
+                2,
+                1,
+                5
+            ],
+            [
+                -8,
+                -3,
+                -4,
+                -5,
+                3,
+                9,
+                -8,
+                9,
+                4
+            ],
+            [
+                -2,
+                -4,
+                -6,
+                -1,
+                1,
+                -2,
+                -6,
+                0,
+                0
+            ],
+            [
+                1,
+                7,
+                6,
+                -7,
+                6,
+                9,
+                -8,
+                -3,
+                5
+            ],
+            [
+                7,
+                8,
+                3,
+                9,
+                8,
+                9,
+                9,
+                6,
+                9
+            ],
+            [
+                5,
+                -6,
+                -4,
+                -1,
+                5,
+                -6,
+                -3,
+                7,
+                -3
+            ],
+            [
+                -3,
+                -2,
+                6,
+                4,
+                8,
+                -2,
+                -3,
+                -1,
+                6
+            ]
+        ],
+        "target_top_left": [
+            5,
+            2
+        ],
+        "max_sum": 43,
+        "input_image": "dataset_max_submatrix/conv_054_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_054_result.jpg",
+        "prompt_en": "Find the 4x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_054_input.jpg",
+        "save_id": 2118,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2118.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_055",
+        "task": "max_submatrix_sum",
+        "grid_size": 7,
+        "kernel_size": [
+            2,
+            4
+        ],
+        "grid_values": [
+            [
+                -1,
+                5,
+                3,
+                5,
+                5,
+                5,
+                2
+            ],
+            [
+                9,
+                -2,
+                -3,
+                2,
+                3,
+                2,
+                0
+            ],
+            [
+                9,
+                9,
+                2,
+                4,
+                -4,
+                -4,
+                4
+            ],
+            [
+                0,
+                -8,
+                -7,
+                -6,
+                5,
+                1,
+                -5
+            ],
+            [
+                7,
+                -9,
+                2,
+                -8,
+                -2,
+                -2,
+                6
+            ],
+            [
+                -3,
+                -1,
+                8,
+                7,
+                -7,
+                9,
+                -9
+            ],
+            [
+                5,
+                8,
+                -7,
+                -3,
+                8,
+                -1,
+                0
+            ]
+        ],
+        "target_top_left": [
+            1,
+            0
+        ],
+        "max_sum": 30,
+        "input_image": "dataset_max_submatrix/conv_055_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_055_result.jpg",
+        "prompt_en": "Find the 2x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_055_input.jpg",
+        "save_id": 2119,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2119.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_056",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            3,
+            2
+        ],
+        "grid_values": [
+            [
+                8,
+                -2,
+                -9,
+                2,
+                -2,
+                4
+            ],
+            [
+                -1,
+                -1,
+                8,
+                -6,
+                4,
+                -1
+            ],
+            [
+                1,
+                -1,
+                1,
+                2,
+                -2,
+                -8
+            ],
+            [
+                -2,
+                1,
+                -6,
+                4,
+                0,
+                -2
+            ],
+            [
+                -9,
+                2,
+                -4,
+                5,
+                3,
+                1
+            ],
+            [
+                -6,
+                6,
+                -5,
+                0,
+                -5,
+                1
+            ]
+        ],
+        "target_top_left": [
+            2,
+            3
+        ],
+        "max_sum": 12,
+        "input_image": "dataset_max_submatrix/conv_056_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_056_result.jpg",
+        "prompt_en": "Find the 3x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_056_input.jpg",
+        "save_id": 2120,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2120.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_057",
+        "task": "max_submatrix_sum",
+        "grid_size": 7,
+        "kernel_size": [
+            2,
+            4
+        ],
+        "grid_values": [
+            [
+                -5,
+                -8,
+                -6,
+                -1,
+                -9,
+                5,
+                9
+            ],
+            [
+                9,
+                -9,
+                -5,
+                7,
+                -1,
+                -9,
+                4
+            ],
+            [
+                -4,
+                -6,
+                8,
+                0,
+                7,
+                -1,
+                3
+            ],
+            [
+                3,
+                0,
+                5,
+                6,
+                -4,
+                9,
+                8
+            ],
+            [
+                -2,
+                3,
+                -7,
+                1,
+                -4,
+                9,
+                2
+            ],
+            [
+                -9,
+                -9,
+                6,
+                -2,
+                -9,
+                -1,
+                2
+            ],
+            [
+                6,
+                -9,
+                -1,
+                8,
+                2,
+                -7,
+                7
+            ]
+        ],
+        "target_top_left": [
+            2,
+            2
+        ],
+        "max_sum": 30,
+        "input_image": "dataset_max_submatrix/conv_057_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_057_result.jpg",
+        "prompt_en": "Find the 2x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_057_input.jpg",
+        "save_id": 2121,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2121.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_058",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            3,
+            4
+        ],
+        "grid_values": [
+            [
+                3,
+                -3,
+                8,
+                -7,
+                0,
+                0
+            ],
+            [
+                7,
+                -1,
+                -1,
+                2,
+                5,
+                3
+            ],
+            [
+                -6,
+                6,
+                -4,
+                4,
+                -8,
+                -6
+            ],
+            [
+                8,
+                -8,
+                6,
+                3,
+                -4,
+                5
+            ],
+            [
+                5,
+                -4,
+                -6,
+                9,
+                -5,
+                -5
+            ],
+            [
+                9,
+                -6,
+                -1,
+                0,
+                1,
+                -7
+            ]
+        ],
+        "target_top_left": [
+            1,
+            0
+        ],
+        "max_sum": 16,
+        "input_image": "dataset_max_submatrix/conv_058_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_058_result.jpg",
+        "prompt_en": "Find the 3x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_058_input.jpg",
+        "save_id": 2122,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2122.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_059",
+        "task": "max_submatrix_sum",
+        "grid_size": 9,
+        "kernel_size": [
+            3,
+            2
+        ],
+        "grid_values": [
+            [
+                0,
+                -9,
+                -1,
+                1,
+                4,
+                -2,
+                -1,
+                3,
+                1
+            ],
+            [
+                -4,
+                -1,
+                -1,
+                -4,
+                9,
+                7,
+                -9,
+                -8,
+                6
+            ],
+            [
+                -4,
+                -1,
+                1,
+                8,
+                0,
+                1,
+                0,
+                -4,
+                6
+            ],
+            [
+                3,
+                4,
+                8,
+                2,
+                -6,
+                5,
+                9,
+                3,
+                7
+            ],
+            [
+                8,
+                -7,
+                -1,
+                7,
+                0,
+                6,
+                -1,
+                -2,
+                -9
+            ],
+            [
+                -3,
+                6,
+                1,
+                -2,
+                2,
+                -7,
+                -1,
+                -6,
+                -6
+            ],
+            [
+                6,
+                -2,
+                8,
+                -2,
+                -6,
+                -5,
+                -8,
+                -9,
+                -5
+            ],
+            [
+                4,
+                -8,
+                4,
+                -7,
+                -2,
+                5,
+                4,
+                7,
+                3
+            ],
+            [
+                -7,
+                5,
+                2,
+                -5,
+                -6,
+                6,
+                -3,
+                -4,
+                1
+            ]
+        ],
+        "target_top_left": [
+            2,
+            2
+        ],
+        "max_sum": 25,
+        "input_image": "dataset_max_submatrix/conv_059_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_059_result.jpg",
+        "prompt_en": "Find the 3x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_059_input.jpg",
+        "save_id": 2123,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2123.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_060",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            4,
+            2
+        ],
+        "grid_values": [
+            [
+                8,
+                -3,
+                4,
+                -2,
+                4,
+                3
+            ],
+            [
+                -4,
+                5,
+                6,
+                -7,
+                -4,
+                3
+            ],
+            [
+                -6,
+                5,
+                -8,
+                -5,
+                -6,
+                -4
+            ],
+            [
+                4,
+                -4,
+                9,
+                7,
+                -7,
+                -1
+            ],
+            [
+                0,
+                -5,
+                -9,
+                8,
+                -5,
+                7
+            ],
+            [
+                4,
+                6,
+                -4,
+                6,
+                9,
+                -5
+            ]
+        ],
+        "target_top_left": [
+            0,
+            1
+        ],
+        "max_sum": 14,
+        "input_image": "dataset_max_submatrix/conv_060_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_060_result.jpg",
+        "prompt_en": "Find the 4x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_060_input.jpg",
+        "save_id": 2124,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2124.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_062",
+        "task": "max_submatrix_sum",
+        "grid_size": 7,
+        "kernel_size": [
+            3,
+            3
+        ],
+        "grid_values": [
+            [
+                -3,
+                -8,
+                -9,
+                -3,
+                8,
+                -3,
+                -7
+            ],
+            [
+                3,
+                8,
+                1,
+                2,
+                4,
+                2,
+                6
+            ],
+            [
+                9,
+                4,
+                2,
+                3,
+                -5,
+                9,
+                4
+            ],
+            [
+                -6,
+                -7,
+                -6,
+                -4,
+                -9,
+                -9,
+                8
+            ],
+            [
+                2,
+                1,
+                8,
+                -7,
+                -5,
+                -6,
+                -9
+            ],
+            [
+                -9,
+                1,
+                -4,
+                -1,
+                -2,
+                -5,
+                2
+            ],
+            [
+                3,
+                -5,
+                -9,
+                -5,
+                4,
+                8,
+                4
+            ]
+        ],
+        "target_top_left": [
+            0,
+            4
+        ],
+        "max_sum": 18,
+        "input_image": "dataset_max_submatrix/conv_062_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_062_result.jpg",
+        "prompt_en": "Find the 3x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_062_input.jpg",
+        "save_id": 2126,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2126.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_064",
+        "task": "max_submatrix_sum",
+        "grid_size": 7,
+        "kernel_size": [
+            2,
+            2
+        ],
+        "grid_values": [
+            [
+                2,
+                4,
+                0,
+                -5,
+                7,
+                -6,
+                5
+            ],
+            [
+                -2,
+                -2,
+                -4,
+                5,
+                1,
+                -6,
+                4
+            ],
+            [
+                -3,
+                0,
+                -2,
+                -9,
+                -3,
+                -5,
+                8
+            ],
+            [
+                7,
+                1,
+                3,
+                -7,
+                9,
+                -7,
+                9
+            ],
+            [
+                5,
+                -5,
+                -5,
+                7,
+                -3,
+                8,
+                8
+            ],
+            [
+                -8,
+                7,
+                -3,
+                4,
+                -6,
+                -1,
+                8
+            ],
+            [
+                -7,
+                2,
+                5,
+                -6,
+                -7,
+                9,
+                -7
+            ]
+        ],
+        "target_top_left": [
+            4,
+            5
+        ],
+        "max_sum": 23,
+        "input_image": "dataset_max_submatrix/conv_064_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_064_result.jpg",
+        "prompt_en": "Find the 2x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_064_input.jpg",
+        "save_id": 2128,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2128.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_066",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            4,
+            3
+        ],
+        "grid_values": [
+            [
+                5,
+                -6,
+                0,
+                9,
+                -6,
+                9,
+                -7,
+                8,
+                -9,
+                6
+            ],
+            [
+                -5,
+                -9,
+                -9,
+                6,
+                4,
+                -6,
+                4,
+                8,
+                8,
+                5
+            ],
+            [
+                -4,
+                5,
+                -8,
+                -9,
+                -1,
+                4,
+                9,
+                -1,
+                -7,
+                2
+            ],
+            [
+                -5,
+                7,
+                6,
+                0,
+                2,
+                5,
+                -3,
+                -4,
+                0,
+                2
+            ],
+            [
+                9,
+                -3,
+                5,
+                -6,
+                -5,
+                1,
+                9,
+                -8,
+                -3,
+                -7
+            ],
+            [
+                -9,
+                -4,
+                9,
+                -7,
+                -8,
+                8,
+                -1,
+                0,
+                4,
+                9
+            ],
+            [
+                -5,
+                8,
+                1,
+                0,
+                6,
+                -9,
+                -3,
+                -8,
+                6,
+                -5
+            ],
+            [
+                5,
+                1,
+                -6,
+                -6,
+                9,
+                2,
+                3,
+                -5,
+                -7,
+                0
+            ],
+            [
+                5,
+                -7,
+                -6,
+                6,
+                8,
+                0,
+                4,
+                9,
+                1,
+                -4
+            ],
+            [
+                -5,
+                -2,
+                2,
+                -2,
+                8,
+                1,
+                7,
+                2,
+                9,
+                4
+            ]
+        ],
+        "target_top_left": [
+            6,
+            4
+        ],
+        "max_sum": 36,
+        "input_image": "dataset_max_submatrix/conv_066_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_066_result.jpg",
+        "prompt_en": "Find the 4x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_066_input.jpg",
+        "save_id": 2130,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2130.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_068",
+        "task": "max_submatrix_sum",
+        "grid_size": 8,
+        "kernel_size": [
+            4,
+            3
+        ],
+        "grid_values": [
+            [
+                -4,
+                9,
+                -6,
+                7,
+                -9,
+                -3,
+                5,
+                6
+            ],
+            [
+                5,
+                -1,
+                4,
+                -3,
+                -4,
+                4,
+                -5,
+                -8
+            ],
+            [
+                8,
+                1,
+                1,
+                5,
+                -1,
+                -3,
+                9,
+                -4
+            ],
+            [
+                4,
+                -5,
+                3,
+                4,
+                3,
+                -6,
+                -1,
+                7
+            ],
+            [
+                4,
+                -1,
+                -6,
+                -8,
+                6,
+                -8,
+                7,
+                -6
+            ],
+            [
+                7,
+                -5,
+                -2,
+                -6,
+                -2,
+                0,
+                3,
+                4
+            ],
+            [
+                -6,
+                -2,
+                -9,
+                9,
+                2,
+                -4,
+                3,
+                2
+            ],
+            [
+                -3,
+                6,
+                -6,
+                8,
+                1,
+                -5,
+                -8,
+                6
+            ]
+        ],
+        "target_top_left": [
+            0,
+            0
+        ],
+        "max_sum": 19,
+        "input_image": "dataset_max_submatrix/conv_068_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_068_result.jpg",
+        "prompt_en": "Find the 4x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_068_input.jpg",
+        "save_id": 2132,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2132.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_070",
+        "task": "max_submatrix_sum",
+        "grid_size": 9,
+        "kernel_size": [
+            2,
+            3
+        ],
+        "grid_values": [
+            [
+                -4,
+                3,
+                4,
+                5,
+                -3,
+                7,
+                -6,
+                6,
+                1
+            ],
+            [
+                8,
+                -3,
+                -1,
+                7,
+                0,
+                -6,
+                5,
+                -9,
+                6
+            ],
+            [
+                2,
+                -9,
+                1,
+                -2,
+                3,
+                -4,
+                -2,
+                -8,
+                -8
+            ],
+            [
+                8,
+                8,
+                3,
+                1,
+                6,
+                -9,
+                -4,
+                -7,
+                -5
+            ],
+            [
+                9,
+                0,
+                -4,
+                4,
+                0,
+                1,
+                4,
+                -1,
+                -6
+            ],
+            [
+                0,
+                4,
+                6,
+                -7,
+                -4,
+                -2,
+                7,
+                4,
+                7
+            ],
+            [
+                -5,
+                0,
+                -9,
+                -8,
+                1,
+                0,
+                -8,
+                -6,
+                -5
+            ],
+            [
+                7,
+                -8,
+                6,
+                9,
+                -3,
+                -1,
+                -6,
+                -8,
+                -7
+            ],
+            [
+                -8,
+                3,
+                -9,
+                -3,
+                -2,
+                -7,
+                6,
+                6,
+                -9
+            ]
+        ],
+        "target_top_left": [
+            3,
+            0
+        ],
+        "max_sum": 24,
+        "input_image": "dataset_max_submatrix/conv_070_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_070_result.jpg",
+        "prompt_en": "Find the 2x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_070_input.jpg",
+        "save_id": 2134,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2134.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_072",
+        "task": "max_submatrix_sum",
+        "grid_size": 8,
+        "kernel_size": [
+            2,
+            2
+        ],
+        "grid_values": [
+            [
+                -2,
+                -3,
+                3,
+                2,
+                -5,
+                -3,
+                -5,
+                3
+            ],
+            [
+                -5,
+                -7,
+                2,
+                3,
+                6,
+                1,
+                -7,
+                -9
+            ],
+            [
+                0,
+                2,
+                -1,
+                1,
+                3,
+                -4,
+                1,
+                2
+            ],
+            [
+                -8,
+                -9,
+                -5,
+                9,
+                -1,
+                -8,
+                -8,
+                -2
+            ],
+            [
+                8,
+                6,
+                4,
+                -7,
+                5,
+                -1,
+                2,
+                -9
+            ],
+            [
+                -1,
+                -2,
+                -5,
+                -5,
+                -6,
+                8,
+                -8,
+                -8
+            ],
+            [
+                7,
+                -1,
+                4,
+                1,
+                -7,
+                -2,
+                9,
+                2
+            ],
+            [
+                8,
+                1,
+                5,
+                -5,
+                -7,
+                -3,
+                -4,
+                5
+            ]
+        ],
+        "target_top_left": [
+            6,
+            0
+        ],
+        "max_sum": 15,
+        "input_image": "dataset_max_submatrix/conv_072_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_072_result.jpg",
+        "prompt_en": "Find the 2x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_072_input.jpg",
+        "save_id": 2136,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2136.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_074",
+        "task": "max_submatrix_sum",
+        "grid_size": 8,
+        "kernel_size": [
+            4,
+            2
+        ],
+        "grid_values": [
+            [
+                -6,
+                -4,
+                1,
+                8,
+                9,
+                5,
+                -7,
+                -6
+            ],
+            [
+                7,
+                -6,
+                -7,
+                3,
+                4,
+                -6,
+                -8,
+                -9
+            ],
+            [
+                0,
+                1,
+                6,
+                6,
+                -3,
+                -1,
+                5,
+                3
+            ],
+            [
+                4,
+                -3,
+                -2,
+                -1,
+                -8,
+                5,
+                -3,
+                -5
+            ],
+            [
+                0,
+                -2,
+                9,
+                6,
+                -2,
+                -2,
+                -8,
+                -9
+            ],
+            [
+                5,
+                -9,
+                7,
+                4,
+                5,
+                -5,
+                8,
+                -9
+            ],
+            [
+                -7,
+                -3,
+                -3,
+                2,
+                -2,
+                9,
+                -2,
+                0
+            ],
+            [
+                -6,
+                -4,
+                5,
+                -8,
+                7,
+                -2,
+                8,
+                2
+            ]
+        ],
+        "target_top_left": [
+            2,
+            2
+        ],
+        "max_sum": 35,
+        "input_image": "dataset_max_submatrix/conv_074_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_074_result.jpg",
+        "prompt_en": "Find the 4x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_074_input.jpg",
+        "save_id": 2138,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2138.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_076",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            4,
+            2
+        ],
+        "grid_values": [
+            [
+                -9,
+                0,
+                -9,
+                9,
+                4,
+                9,
+                8,
+                -4,
+                -8,
+                4
+            ],
+            [
+                -4,
+                8,
+                -5,
+                7,
+                0,
+                1,
+                0,
+                -3,
+                9,
+                -2
+            ],
+            [
+                -9,
+                -5,
+                -1,
+                -2,
+                -3,
+                5,
+                -2,
+                8,
+                9,
+                -2
+            ],
+            [
+                0,
+                -8,
+                -2,
+                0,
+                5,
+                7,
+                6,
+                -8,
+                -1,
+                9
+            ],
+            [
+                7,
+                6,
+                9,
+                -1,
+                2,
+                -2,
+                -8,
+                0,
+                4,
+                -9
+            ],
+            [
+                7,
+                8,
+                -3,
+                4,
+                -3,
+                6,
+                -9,
+                -9,
+                -6,
+                -2
+            ],
+            [
+                -4,
+                9,
+                1,
+                -2,
+                2,
+                7,
+                -4,
+                -5,
+                -3,
+                0
+            ],
+            [
+                6,
+                -3,
+                -1,
+                3,
+                -2,
+                0,
+                -7,
+                4,
+                -4,
+                -7
+            ],
+            [
+                -7,
+                7,
+                2,
+                7,
+                -5,
+                2,
+                2,
+                -1,
+                8,
+                3
+            ],
+            [
+                -6,
+                8,
+                -6,
+                0,
+                -2,
+                -9,
+                5,
+                3,
+                -4,
+                3
+            ]
+        ],
+        "target_top_left": [
+            4,
+            0
+        ],
+        "max_sum": 36,
+        "input_image": "dataset_max_submatrix/conv_076_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_076_result.jpg",
+        "prompt_en": "Find the 4x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_076_input.jpg",
+        "save_id": 2140,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2140.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_078",
+        "task": "max_submatrix_sum",
+        "grid_size": 9,
+        "kernel_size": [
+            3,
+            2
+        ],
+        "grid_values": [
+            [
+                -8,
+                -3,
+                4,
+                0,
+                -9,
+                -7,
+                -4,
+                3,
+                -4
+            ],
+            [
+                7,
+                -9,
+                -8,
+                -7,
+                3,
+                -4,
+                -9,
+                2,
+                -6
+            ],
+            [
+                6,
+                -8,
+                -4,
+                -2,
+                -8,
+                -1,
+                9,
+                -6,
+                4
+            ],
+            [
+                -6,
+                4,
+                7,
+                1,
+                4,
+                9,
+                -9,
+                -3,
+                -4
+            ],
+            [
+                -4,
+                8,
+                -3,
+                3,
+                6,
+                -1,
+                -2,
+                -3,
+                2
+            ],
+            [
+                7,
+                3,
+                0,
+                4,
+                7,
+                8,
+                -1,
+                -2,
+                -6
+            ],
+            [
+                3,
+                -3,
+                -3,
+                -1,
+                3,
+                9,
+                4,
+                7,
+                -3
+            ],
+            [
+                -5,
+                8,
+                -8,
+                5,
+                6,
+                0,
+                1,
+                -8,
+                -9
+            ],
+            [
+                7,
+                1,
+                0,
+                -4,
+                5,
+                -7,
+                -1,
+                -5,
+                -8
+            ]
+        ],
+        "target_top_left": [
+            3,
+            4
+        ],
+        "max_sum": 33,
+        "input_image": "dataset_max_submatrix/conv_078_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_078_result.jpg",
+        "prompt_en": "Find the 3x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_078_input.jpg",
+        "save_id": 2142,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2142.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_080",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            2,
+            2
+        ],
+        "grid_values": [
+            [
+                0,
+                6,
+                5,
+                8,
+                -2,
+                6
+            ],
+            [
+                5,
+                -2,
+                -6,
+                -6,
+                -6,
+                4
+            ],
+            [
+                9,
+                6,
+                3,
+                5,
+                -2,
+                3
+            ],
+            [
+                8,
+                -1,
+                1,
+                -7,
+                -3,
+                7
+            ],
+            [
+                5,
+                5,
+                3,
+                8,
+                8,
+                7
+            ],
+            [
+                2,
+                -4,
+                7,
+                7,
+                6,
+                2
+            ]
+        ],
+        "target_top_left": [
+            4,
+            3
+        ],
+        "max_sum": 29,
+        "input_image": "dataset_max_submatrix/conv_080_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_080_result.jpg",
+        "prompt_en": "Find the 2x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_080_input.jpg",
+        "save_id": 2144,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2144.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_082",
+        "task": "max_submatrix_sum",
+        "grid_size": 8,
+        "kernel_size": [
+            2,
+            2
+        ],
+        "grid_values": [
+            [
+                -3,
+                0,
+                -1,
+                5,
+                -4,
+                -4,
+                2,
+                -2
+            ],
+            [
+                -2,
+                -2,
+                -6,
+                7,
+                8,
+                -7,
+                -2,
+                -3
+            ],
+            [
+                4,
+                0,
+                -8,
+                -2,
+                5,
+                -1,
+                0,
+                5
+            ],
+            [
+                2,
+                -2,
+                1,
+                3,
+                2,
+                2,
+                -4,
+                -9
+            ],
+            [
+                2,
+                -9,
+                -5,
+                6,
+                -8,
+                1,
+                0,
+                -3
+            ],
+            [
+                -3,
+                4,
+                9,
+                -2,
+                6,
+                -4,
+                -1,
+                0
+            ],
+            [
+                -7,
+                -2,
+                -4,
+                0,
+                5,
+                -6,
+                9,
+                1
+            ],
+            [
+                4,
+                0,
+                0,
+                5,
+                6,
+                -8,
+                7,
+                3
+            ]
+        ],
+        "target_top_left": [
+            6,
+            6
+        ],
+        "max_sum": 20,
+        "input_image": "dataset_max_submatrix/conv_082_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_082_result.jpg",
+        "prompt_en": "Find the 2x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_082_input.jpg",
+        "save_id": 2146,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2146.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_084",
+        "task": "max_submatrix_sum",
+        "grid_size": 9,
+        "kernel_size": [
+            2,
+            2
+        ],
+        "grid_values": [
+            [
+                0,
+                -1,
+                5,
+                3,
+                -1,
+                -6,
+                0,
+                3,
+                7
+            ],
+            [
+                -5,
+                -7,
+                4,
+                -9,
+                -6,
+                9,
+                3,
+                0,
+                -7
+            ],
+            [
+                -5,
+                4,
+                -4,
+                -5,
+                9,
+                -5,
+                1,
+                2,
+                9
+            ],
+            [
+                7,
+                -8,
+                -9,
+                2,
+                7,
+                2,
+                -5,
+                0,
+                -9
+            ],
+            [
+                2,
+                8,
+                3,
+                1,
+                8,
+                -6,
+                -1,
+                2,
+                -4
+            ],
+            [
+                -2,
+                8,
+                7,
+                -7,
+                -3,
+                2,
+                -9,
+                -4,
+                4
+            ],
+            [
+                5,
+                6,
+                5,
+                -7,
+                5,
+                -3,
+                -3,
+                3,
+                -5
+            ],
+            [
+                -2,
+                2,
+                -9,
+                -6,
+                -2,
+                -4,
+                -6,
+                1,
+                -4
+            ],
+            [
+                9,
+                2,
+                6,
+                7,
+                1,
+                -6,
+                -4,
+                0,
+                7
+            ]
+        ],
+        "target_top_left": [
+            4,
+            1
+        ],
+        "max_sum": 26,
+        "input_image": "dataset_max_submatrix/conv_084_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_084_result.jpg",
+        "prompt_en": "Find the 2x2 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x2 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_084_input.jpg",
+        "save_id": 2148,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2148.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_086",
+        "task": "max_submatrix_sum",
+        "grid_size": 7,
+        "kernel_size": [
+            4,
+            3
+        ],
+        "grid_values": [
+            [
+                9,
+                -3,
+                6,
+                5,
+                -9,
+                4,
+                2
+            ],
+            [
+                -8,
+                -7,
+                7,
+                -6,
+                -6,
+                4,
+                -4
+            ],
+            [
+                -9,
+                -1,
+                -9,
+                3,
+                -4,
+                -7,
+                -6
+            ],
+            [
+                -9,
+                7,
+                0,
+                -1,
+                8,
+                -1,
+                3
+            ],
+            [
+                -1,
+                6,
+                -1,
+                -9,
+                6,
+                -2,
+                -5
+            ],
+            [
+                8,
+                -7,
+                -8,
+                7,
+                -3,
+                -1,
+                1
+            ],
+            [
+                5,
+                7,
+                8,
+                -2,
+                -2,
+                -9,
+                4
+            ]
+        ],
+        "target_top_left": [
+            3,
+            0
+        ],
+        "max_sum": 15,
+        "input_image": "dataset_max_submatrix/conv_086_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_086_result.jpg",
+        "prompt_en": "Find the 4x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 4x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_086_input.jpg",
+        "save_id": 2150,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2150.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_088",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            2,
+            4
+        ],
+        "grid_values": [
+            [
+                0,
+                9,
+                0,
+                -4,
+                -8,
+                -1
+            ],
+            [
+                1,
+                8,
+                5,
+                1,
+                1,
+                -8
+            ],
+            [
+                7,
+                7,
+                6,
+                4,
+                -4,
+                -3
+            ],
+            [
+                9,
+                -7,
+                2,
+                -8,
+                -6,
+                -6
+            ],
+            [
+                -8,
+                -2,
+                3,
+                3,
+                3,
+                3
+            ],
+            [
+                7,
+                6,
+                4,
+                -4,
+                5,
+                -9
+            ]
+        ],
+        "target_top_left": [
+            1,
+            0
+        ],
+        "max_sum": 39,
+        "input_image": "dataset_max_submatrix/conv_088_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_088_result.jpg",
+        "prompt_en": "Find the 2x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 2x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_088_input.jpg",
+        "save_id": 2152,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2152.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_090",
+        "task": "max_submatrix_sum",
+        "grid_size": 7,
+        "kernel_size": [
+            3,
+            4
+        ],
+        "grid_values": [
+            [
+                5,
+                5,
+                7,
+                3,
+                4,
+                4,
+                -8
+            ],
+            [
+                -3,
+                2,
+                -9,
+                0,
+                -6,
+                0,
+                -5
+            ],
+            [
+                7,
+                -4,
+                -1,
+                -8,
+                0,
+                -9,
+                3
+            ],
+            [
+                -7,
+                -9,
+                8,
+                -5,
+                1,
+                3,
+                3
+            ],
+            [
+                7,
+                6,
+                1,
+                9,
+                3,
+                -6,
+                -9
+            ],
+            [
+                4,
+                -7,
+                -1,
+                -2,
+                4,
+                3,
+                1
+            ],
+            [
+                -8,
+                4,
+                -7,
+                9,
+                4,
+                7,
+                7
+            ]
+        ],
+        "target_top_left": [
+            4,
+            3
+        ],
+        "max_sum": 30,
+        "input_image": "dataset_max_submatrix/conv_090_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_090_result.jpg",
+        "prompt_en": "Find the 3x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_090_input.jpg",
+        "save_id": 2154,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2154.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_092",
+        "task": "max_submatrix_sum",
+        "grid_size": 8,
+        "kernel_size": [
+            3,
+            3
+        ],
+        "grid_values": [
+            [
+                1,
+                5,
+                4,
+                -7,
+                -8,
+                -6,
+                -9,
+                7
+            ],
+            [
+                4,
+                -2,
+                2,
+                5,
+                -4,
+                1,
+                7,
+                -7
+            ],
+            [
+                -7,
+                -6,
+                0,
+                4,
+                -5,
+                2,
+                -5,
+                0
+            ],
+            [
+                -6,
+                2,
+                -1,
+                -1,
+                3,
+                1,
+                9,
+                -7
+            ],
+            [
+                -9,
+                1,
+                3,
+                -4,
+                6,
+                -2,
+                -1,
+                -1
+            ],
+            [
+                -7,
+                -9,
+                -7,
+                -4,
+                7,
+                3,
+                -1,
+                -8
+            ],
+            [
+                3,
+                -6,
+                2,
+                3,
+                5,
+                -2,
+                -2,
+                9
+            ],
+            [
+                6,
+                5,
+                -7,
+                9,
+                -4,
+                3,
+                4,
+                7
+            ]
+        ],
+        "target_top_left": [
+            3,
+            4
+        ],
+        "max_sum": 25,
+        "input_image": "dataset_max_submatrix/conv_092_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_092_result.jpg",
+        "prompt_en": "Find the 3x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_092_input.jpg",
+        "save_id": 2156,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2156.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_094",
+        "task": "max_submatrix_sum",
+        "grid_size": 9,
+        "kernel_size": [
+            3,
+            3
+        ],
+        "grid_values": [
+            [
+                4,
+                -5,
+                -7,
+                -6,
+                -3,
+                -2,
+                -1,
+                9,
+                -3
+            ],
+            [
+                1,
+                1,
+                0,
+                -1,
+                8,
+                1,
+                8,
+                1,
+                9
+            ],
+            [
+                6,
+                4,
+                -3,
+                6,
+                -9,
+                -6,
+                -1,
+                3,
+                -9
+            ],
+            [
+                5,
+                -7,
+                -1,
+                2,
+                -8,
+                9,
+                5,
+                8,
+                -7
+            ],
+            [
+                1,
+                -8,
+                -6,
+                -2,
+                -2,
+                -9,
+                -4,
+                -5,
+                -7
+            ],
+            [
+                9,
+                -1,
+                1,
+                1,
+                -3,
+                -6,
+                -6,
+                4,
+                -6
+            ],
+            [
+                -8,
+                4,
+                1,
+                4,
+                6,
+                -9,
+                9,
+                -7,
+                -5
+            ],
+            [
+                2,
+                -2,
+                4,
+                -6,
+                1,
+                -9,
+                2,
+                6,
+                2
+            ],
+            [
+                7,
+                -7,
+                -2,
+                2,
+                8,
+                3,
+                -1,
+                -2,
+                -2
+            ]
+        ],
+        "target_top_left": [
+            1,
+            5
+        ],
+        "max_sum": 28,
+        "input_image": "dataset_max_submatrix/conv_094_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_094_result.jpg",
+        "prompt_en": "Find the 3x3 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x3 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_094_input.jpg",
+        "save_id": 2158,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2158.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_096",
+        "task": "max_submatrix_sum",
+        "grid_size": 6,
+        "kernel_size": [
+            3,
+            4
+        ],
+        "grid_values": [
+            [
+                -1,
+                -2,
+                0,
+                5,
+                -9,
+                8
+            ],
+            [
+                1,
+                8,
+                -9,
+                4,
+                -8,
+                4
+            ],
+            [
+                -2,
+                0,
+                -9,
+                2,
+                9,
+                4
+            ],
+            [
+                -6,
+                5,
+                3,
+                5,
+                3,
+                -7
+            ],
+            [
+                -6,
+                1,
+                2,
+                2,
+                4,
+                2
+            ],
+            [
+                2,
+                6,
+                0,
+                9,
+                -8,
+                9
+            ]
+        ],
+        "target_top_left": [
+            3,
+            1
+        ],
+        "max_sum": 32,
+        "input_image": "dataset_max_submatrix/conv_096_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_096_result.jpg",
+        "prompt_en": "Find the 3x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_096_input.jpg",
+        "save_id": 2160,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2160.png",
+        "status": "skipped"
+    },
+    {
+        "id": "conv_098",
+        "task": "max_submatrix_sum",
+        "grid_size": 10,
+        "kernel_size": [
+            3,
+            4
+        ],
+        "grid_values": [
+            [
+                -2,
+                -5,
+                -3,
+                9,
+                -1,
+                3,
+                3,
+                5,
+                -8,
+                3
+            ],
+            [
+                -3,
+                -5,
+                -2,
+                -8,
+                1,
+                -5,
+                -9,
+                -3,
+                -5,
+                -3
+            ],
+            [
+                -8,
+                1,
+                1,
+                -2,
+                -2,
+                -9,
+                1,
+                5,
+                -4,
+                1
+            ],
+            [
+                -7,
+                -6,
+                -4,
+                -3,
+                -3,
+                0,
+                6,
+                6,
+                -6,
+                5
+            ],
+            [
+                4,
+                0,
+                0,
+                -5,
+                -1,
+                9,
+                -6,
+                -7,
+                9,
+                -5
+            ],
+            [
+                -3,
+                -2,
+                3,
+                -2,
+                -6,
+                3,
+                3,
+                1,
+                -7,
+                3
+            ],
+            [
+                -8,
+                -2,
+                -6,
+                8,
+                5,
+                5,
+                -9,
+                8,
+                5,
+                -6
+            ],
+            [
+                -3,
+                2,
+                6,
+                4,
+                7,
+                -6,
+                -8,
+                -3,
+                0,
+                -7
+            ],
+            [
+                -4,
+                -3,
+                0,
+                -7,
+                6,
+                -5,
+                -6,
+                -2,
+                -1,
+                4
+            ],
+            [
+                9,
+                5,
+                4,
+                1,
+                -4,
+                -3,
+                -9,
+                8,
+                -1,
+                6
+            ]
+        ],
+        "target_top_left": [
+            5,
+            2
+        ],
+        "max_sum": 21,
+        "input_image": "dataset_max_submatrix/conv_098_input.jpg",
+        "result_image": "dataset_max_submatrix/conv_098_result.jpg",
+        "prompt_en": "Find the 3x4 rectangular region in the image with the highest sum of values and highlight this region in yellow.",
+        "prompt_cn": "找到图中 3x4 的矩形区域，使其中的数值总和最大，并将该区域用黄色高亮显示。",
+        "source_image": "Part4/dataset_max_submatrix/conv_098_input.jpg",
+        "save_id": 2162,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Max_Submatrix/2162.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2484.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2484.png
new file mode 100644
index 0000000000000000000000000000000000000000..2e7bd314526d4768d32dcf80e249b3587bc9b5b4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2484.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:96d5e2dc9439411f1378962c34898769a5aa1a77620a35d5ff350b7277afbd84
+size 57464
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2486.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2486.png
new file mode 100644
index 0000000000000000000000000000000000000000..582916cd62a4d6c9de68b8967db7ea00d22e743c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2486.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c593dab4be9b179b8997a9050f125c42f70ae9723433fe15ddc1f8e0db4ec77c
+size 52184
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2488.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2488.png
new file mode 100644
index 0000000000000000000000000000000000000000..cf5da1cd9a6d0ddbc9d79eac4183b669bc77b024
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2488.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a3561c7b91da315c634cda16cd19dad6849935c1211f325740b392eec650c28c
+size 59124
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2490.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2490.png
new file mode 100644
index 0000000000000000000000000000000000000000..e934aba5cbc81aca20d80280eea4ced7fa8e0ebe
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2490.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:406df1a04e057c1a798ed8d26fa6a6b9e379d8520f5b70a7830d8a77b72c8abd
+size 57946
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2492.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2492.png
new file mode 100644
index 0000000000000000000000000000000000000000..3e5133ad6e97a72b803fa47d8f9997ba1305a36a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2492.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:74b6b2bc113a619a5e6c1ad0234a000861d538e48574073691e3313e7ee6fab5
+size 50721
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2494.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2494.png
new file mode 100644
index 0000000000000000000000000000000000000000..35cc66871d18886a8cf64d2167a120ff8fcdc09b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2494.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c4c7d506733c52e9e2ead36051509e8cf6f7bd2be52142ed0c58441e83b093f2
+size 55069
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2496.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2496.png
new file mode 100644
index 0000000000000000000000000000000000000000..094a5da1d6c946b0239047fe3007c7ced14fcafb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2496.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5812a9cd0bc29eeea5c3a718d43d7199eb058fd6c67e445b28676f568eba19d5
+size 57751
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2498.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2498.png
new file mode 100644
index 0000000000000000000000000000000000000000..fe3fb1183e386ccfd717b150343239a04f43934e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2498.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c63eb43c9b098875100e72b96fcfee15808ada8dff689fb0b31705a343b76ce1
+size 56632
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2500.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2500.png
new file mode 100644
index 0000000000000000000000000000000000000000..b7877d5dd935c9d02a0717f51f14a880c46e189b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2500.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a0fe442dc925659edc086560adc4ac27fa0ca0a9985d41baf841aa575486ee57
+size 50511
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2502.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2502.png
new file mode 100644
index 0000000000000000000000000000000000000000..f171d5af9cc2daadf31bc527aa7ff2ce70317139
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2502.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3aaddae2a3d87e2b8c6fe99c284f26af893d8e9aefa7465d85bd5a48aafdf494
+size 60730
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2504.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2504.png
new file mode 100644
index 0000000000000000000000000000000000000000..106be07d00dbc3e0973faebfccbb5c78f49f60a7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2504.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:58cda2cded19be6c36e724ac244fbc8643b8faedae8cefac22916a5401584617
+size 49030
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2506.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2506.png
new file mode 100644
index 0000000000000000000000000000000000000000..6f9a604726311d319c5cd2863122d9b03d452c31
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2506.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:94affeddbbe47908b26a3c3b4fb87020fcf24963b428229820b02889f75b3828
+size 55742
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2508.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2508.png
new file mode 100644
index 0000000000000000000000000000000000000000..dd468d357e1eec61591c2e61245c85210aebb804
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2508.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d1d01112c58feaeb5e028b6432486e5732c8de070d069fc035625a527da1e82c
+size 58070
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2510.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2510.png
new file mode 100644
index 0000000000000000000000000000000000000000..98faaf78713d837aa1f63b36008daee028978c99
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2510.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ac98a06a54a78c59e7933de91c38af68c72046522a722d17aee401f77579209b
+size 52384
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2512.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2512.png
new file mode 100644
index 0000000000000000000000000000000000000000..5e1dee2bcbe00a8f5fb174332cd565b87b3b35cd
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2512.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a10bf31539f3aa3e3f0f27081dbd8ff032803c6e291ddf43c75ec621b52ffd39
+size 54148
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2514.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2514.png
new file mode 100644
index 0000000000000000000000000000000000000000..3433ac079b41ec78b427ca1c318c3514829a3bd6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2514.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:57242b53e91a7b9b78357578da18a2ee5cd85d46aae448a2d71b73e139c85a61
+size 54827
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2516.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2516.png
new file mode 100644
index 0000000000000000000000000000000000000000..4af95c2f91ca7fdbe97aa17ee1aab51ac47e5eaf
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2516.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:583173f977906e224fb5b90ec4a157f17c314f3daf7f52e3d56dab594a3e5531
+size 64549
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2518.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2518.png
new file mode 100644
index 0000000000000000000000000000000000000000..79a048c5a56f04e1c54782645a5459f3084544a7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2518.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:00b61cb9612eee199184eb04a2c3829e7b8a7efafe6551008372aab945167482
+size 70010
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2520.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2520.png
new file mode 100644
index 0000000000000000000000000000000000000000..dc5629dcc084a4f017f56d2351c39c20dae029e6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2520.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:387b09dc40293362c786f14238f79f62c1879d51c5dfbc1797ea996c6354af32
+size 59180
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2522.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2522.png
new file mode 100644
index 0000000000000000000000000000000000000000..49df3bd9deabd004cd4a6de1985a1e8f26a4cc89
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2522.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0877541c01a8048ba31e27667059bd47170c4164e859f4d00263311cf4de1957
+size 57804
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2524.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2524.png
new file mode 100644
index 0000000000000000000000000000000000000000..1211c415dbeae12779a26eb58f1d156aaa9453f1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2524.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8fe2d2b191618cc2049304f043bfdd82ceaec146bf0138d3adf5317fb8e41a10
+size 69254
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2525.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2525.png
new file mode 100644
index 0000000000000000000000000000000000000000..c1e112813d6e145052ede9d724d236b2c45fc7a5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2525.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6cfb3458e002a8750acf3e401d752f87e7f9862c7416954976b730a11cf5ab37
+size 76977
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2526.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2526.png
new file mode 100644
index 0000000000000000000000000000000000000000..fee9c66f1b57223500d0659cf70396f6536366d7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2526.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ecad324d7aabd6a1b25567c375c6d4643e8c12f904cf45744946c8c27c2357fe
+size 52314
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2527.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2527.png
new file mode 100644
index 0000000000000000000000000000000000000000..a3421149791145ec9a4b51956b00bbd1b01c8cc2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2527.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:705d6fd14a23eb25d71ae2d44bd23659d1453498837b27fb9063cec2c4fbf00a
+size 56151
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2528.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2528.png
new file mode 100644
index 0000000000000000000000000000000000000000..37c7413ef0728deef7349a886785df8d443cee70
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2528.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ab28a32fe6007d7822897f1684ca6346f3ec16cbdd419cf24e88ed538f1650e2
+size 61221
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2529.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2529.png
new file mode 100644
index 0000000000000000000000000000000000000000..09b838455b87c630b06b484a9ddad4be299e6747
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2529.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3124a5097678c7e33c2f844b6343184f0f1725a8366759793f873d41ea87fd86
+size 56738
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2530.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2530.png
new file mode 100644
index 0000000000000000000000000000000000000000..5ab7fd884fc0b6e7cf8103f855c06cced7df41fd
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2530.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b2038fd9ecc12271cb5d5b1a2b7ba37ce4a34d83c39f81ed30999285dd95d06d
+size 58890
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2531.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2531.png
new file mode 100644
index 0000000000000000000000000000000000000000..cd00f1627be3a17c7f9e725bd79560b7f83215d8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2531.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:72a4d6809ee52d050af3f900f6132d5cf6438ab6cf8bde779bbdf9787194b582
+size 64942
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2532.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2532.png
new file mode 100644
index 0000000000000000000000000000000000000000..27580928bf09e90f97641d7f21760c29c76c5e76
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2532.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b00468cc7da196d0251e02e97545e6a9d319da32981815776258509323ec4ccf
+size 51751
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2533.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2533.png
new file mode 100644
index 0000000000000000000000000000000000000000..f196cb437ef08550636c958b56b6ce750cd4b6cb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2533.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7d7f977a4523ca3dd0fc31e8d974b9ec3ed4cba2b900d72c5d714760f630974a
+size 54993
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2534.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2534.png
new file mode 100644
index 0000000000000000000000000000000000000000..3edaa19a62c80cd0ec8030fa9a03b9c6d6b1b74b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2534.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e5830ebbcddc68a762dcbfa6d72b9cb4bafca223a6101c8c10d8e656c05bef53
+size 66232
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2535.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2535.png
new file mode 100644
index 0000000000000000000000000000000000000000..11fcee40b16fb7ebd6a64abe7cc1555a925b36d7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2535.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d92e9306fee4a7eef08e7d395af24bcad8ff44da5b14579a05066fad824351fa
+size 57864
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2536.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2536.png
new file mode 100644
index 0000000000000000000000000000000000000000..415ba120dec083b7788a07ee7eaaaa84659b75a3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2536.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:19d3e6ca0ab0c6d1d2acfe55c32b3c3ddf33f77b38a7ddf8ef66a81de5c8d34d
+size 58784
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2537.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2537.png
new file mode 100644
index 0000000000000000000000000000000000000000..07a2504df06197bcd751796e2f3494c83e677620
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2537.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6da9a7f40c13431474e2de9b3b21c2939185887d8647db429028ff833535e40c
+size 56434
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2538.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2538.png
new file mode 100644
index 0000000000000000000000000000000000000000..e06213f8a719fbcb8430593825db8b8e925c1712
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2538.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8b8caa6086354cb8f95595b4a973edc537adf6a9f31a861fb82d43026ea532a4
+size 55947
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2539.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2539.png
new file mode 100644
index 0000000000000000000000000000000000000000..72e30d3c5f3c5a6f901649e4198868fb5c706705
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2539.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e28ad268e09deeb2f3ba6e8b1f828fd8e70c5f9490b1a65df5af80d89d55854d
+size 63053
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2540.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2540.png
new file mode 100644
index 0000000000000000000000000000000000000000..13b4e4de2d56d4dcae924351d121763ea3fec15e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2540.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8f760a8a7f19972bc621e08e64e4c2541904fe06ffeca3c668b4b122751d3da5
+size 50122
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2541.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2541.png
new file mode 100644
index 0000000000000000000000000000000000000000..9c607dfe4c8a51b18d63f76be957e32db004ead9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2541.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f5c67cf5dc88790bdaf99df539365ab2584d5f03a4fdb8880231ef9a06b5a7df
+size 54231
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2542.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2542.png
new file mode 100644
index 0000000000000000000000000000000000000000..7b08a9f60f99065bd875dbd833e66861bc088168
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2542.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:61504d394403fd908d6c453ff13b5699cf63000f569d41651363b39ad1fe94f9
+size 51076
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2543.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2543.png
new file mode 100644
index 0000000000000000000000000000000000000000..d1fbbe8b0a14702b4e8098cbd53fb680c4b441c4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2543.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:846ab59eb7ff8d4865e070a60dc6289d5ab9ae5b11a7d0b0d2df59cde8dffbd6
+size 61592
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2544.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2544.png
new file mode 100644
index 0000000000000000000000000000000000000000..b2db3310be92c4a54a5cb8fe0b57fc4b48a5aa9d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2544.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:45c4669d45da61c4eef1591bf9f98020ea60a9ed9055160f9175563efce8efb0
+size 49912
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2546.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2546.png
new file mode 100644
index 0000000000000000000000000000000000000000..71aa44c07780fffdcb7df2e6f5fdbe2c396ffde7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2546.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5d6a0c18e1ceb112b09390fcfcea4dbbd202196cb0b9e26e88f04c4ceef3e193
+size 54031
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2548.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2548.png
new file mode 100644
index 0000000000000000000000000000000000000000..d9fba4c4ebaa9e4f9e17d4d2b6e11af84b2a7361
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2548.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:310584c7d341fd4e01d9c2db2097759a368d6b8432cc87867e57a96ef197069b
+size 54768
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2550.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2550.png
new file mode 100644
index 0000000000000000000000000000000000000000..1221d757562c427f97facb7c46bf215c8ad79819
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2550.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1edf6e89394b9dfe22e751c19c2516c9ffa71d188e6f1ac6a590e57c42151a51
+size 66753
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2552.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2552.png
new file mode 100644
index 0000000000000000000000000000000000000000..41a7caaf34e561e8452226a46c35ee8a6ba4c685
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2552.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bef244cdc9e6f6696cd357bc8a54ecbfcab2a8e0ad130f5d57c944f294b205f9
+size 56057
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2554.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2554.png
new file mode 100644
index 0000000000000000000000000000000000000000..c28ba78b3237644bdb0d0741e7760ff6b1636ea3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2554.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5411efcbcfcf9f2df76f77fa3845532b39d191ce78f99e48824edb25b8c69f51
+size 50971
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2556.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2556.png
new file mode 100644
index 0000000000000000000000000000000000000000..17afc6d51ba0f85bc3ec276df7b042f84b584426
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2556.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6036469bcd5a6be62a81bcfe5710843645691bdcf698ed961dfe8b78211b721c
+size 60641
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2558.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2558.png
new file mode 100644
index 0000000000000000000000000000000000000000..b521a644f216dfcd4a0d405ad28f357bbdc466e1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2558.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d5049c0e9d3c5b61794620252a72df212972669e1e701fa943356a7cfe266f03
+size 54425
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2560.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2560.png
new file mode 100644
index 0000000000000000000000000000000000000000..04b29c137d8e02abff8419c7050f6affd43027fd
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2560.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8fcbc3fc898ab7fd8d60fa7d5139cd5159e7e95518c31df005f8abaf82e5a17f
+size 57804
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2562.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2562.png
new file mode 100644
index 0000000000000000000000000000000000000000..f1fb81aa4ff7ed4e609e61ad9b261203609fe32b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2562.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3e37238a22ca7326b596b704fe1ce339f173c14f3a60740b3b7cdcbe754f628b
+size 64114
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2564.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2564.png
new file mode 100644
index 0000000000000000000000000000000000000000..2a524268655cace6673cfcfccc8774212018c8d4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2564.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bc4da53650b11de9e3724a4f03d25020dff8d6fd755aabc095e46700e046cd3a
+size 49323
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2566.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2566.png
new file mode 100644
index 0000000000000000000000000000000000000000..874021264f45726f212cd63d4cfa1d9b64af05e1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2566.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ca99a9e71271dc8aacdbf90ee9abe9d910582b4418572541d2e68e56102a41c6
+size 58865
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2568.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2568.png
new file mode 100644
index 0000000000000000000000000000000000000000..ee9bc9941538edfe605dcb4750623dc288e7730e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2568.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:21ebb013adff29bd9c4bbdbad54bd3c0dabaddb7fb0045a7967317b1b24a2509
+size 54107
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2570.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2570.png
new file mode 100644
index 0000000000000000000000000000000000000000..8d83495558cf64eb3cb27b2a79e161eb5b53b7f8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2570.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dddde30c3ba3a0df510f1e59166fa284da3c8d1be3ce62937bc948091bea499f
+size 55724
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2572.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2572.png
new file mode 100644
index 0000000000000000000000000000000000000000..5c22da10fa2add936bf7855fa2d55e349fcfb73d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2572.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:853a6d4f52ad29960dc16ddc6de503b4c3f524bb4408760e36615a327bae9e0d
+size 50526
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2574.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2574.png
new file mode 100644
index 0000000000000000000000000000000000000000..177308f9f632bb98598fcf05c877a9896130d5eb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2574.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4eb96f78f83b04c5d42fa1967221651298d708363fb15be9f3cdd489af332179
+size 66675
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2576.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2576.png
new file mode 100644
index 0000000000000000000000000000000000000000..735be41ac2d30ca92de8771c385cbd7798a3d056
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2576.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5d38f3298234baefb80671c1da870287f02f114fedfcc5c9bccc6aa207b5ac09
+size 78801
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2578.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2578.png
new file mode 100644
index 0000000000000000000000000000000000000000..295614bab6273d5ef2d45fefbe7257829ceba68f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2578.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f88261579eb288b1eb0ac76e1b56e0df38fb4dee5f80ebdce08cb68deebe75a5
+size 66174
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2580.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2580.png
new file mode 100644
index 0000000000000000000000000000000000000000..5db7e159159abeb3abf89f88f8cea7e3fbbdaff3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2580.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ee788b1853d98907f758b83b31dee0a9ac2d37a31699f26f2c4cad482bb6842b
+size 67662
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2582.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2582.png
new file mode 100644
index 0000000000000000000000000000000000000000..0bf88bed6ee535ef90b7f2569a257fea9c273b3f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2582.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:603f4549a1a118a99057921331eabae682d6f2bada3ca6b7b33c7683f8e6baaa
+size 61320
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/Number_Link.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/Number_Link.json
new file mode 100644
index 0000000000000000000000000000000000000000..1bca0195a035ee4e6f327323ba3ed289856d761c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/Number_Link.json
@@ -0,0 +1,12900 @@
+[
+    {
+        "id": "flow_visual_000",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 6,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    0
+                ]
+            ],
+            "2": [
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    3
+                ]
+            ],
+            "3": [
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_000_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_000_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_000_input.jpg",
+        "save_id": 2484,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2484.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_002",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    0,
+                    8
+                ],
+                [
+                    1,
+                    8
+                ],
+                [
+                    2,
+                    8
+                ]
+            ],
+            "2": [
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    8,
+                    2
+                ],
+                [
+                    8,
+                    3
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    8,
+                    4
+                ],
+                [
+                    8,
+                    5
+                ],
+                [
+                    8,
+                    6
+                ],
+                [
+                    8,
+                    7
+                ],
+                [
+                    8,
+                    8
+                ],
+                [
+                    7,
+                    8
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    6,
+                    8
+                ],
+                [
+                    5,
+                    8
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    3,
+                    8
+                ]
+            ],
+            "3": [
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    2
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_002_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_002_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_002_input.jpg",
+        "save_id": 2486,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2486.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_004",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ]
+            ],
+            "2": [
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ]
+            ],
+            "3": [
+                [
+                    6,
+                    8
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ]
+            ],
+            "4": [
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    8,
+                    0
+                ],
+                [
+                    8,
+                    1
+                ],
+                [
+                    8,
+                    2
+                ],
+                [
+                    8,
+                    3
+                ],
+                [
+                    8,
+                    4
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ]
+            ],
+            "5": [
+                [
+                    8,
+                    6
+                ],
+                [
+                    8,
+                    7
+                ],
+                [
+                    8,
+                    8
+                ],
+                [
+                    7,
+                    8
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_004_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_004_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_004_input.jpg",
+        "save_id": 2488,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2488.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_006",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    3,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ]
+            ],
+            "2": [
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    4
+                ]
+            ],
+            "3": [
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ]
+            ],
+            "4": [
+                [
+                    1,
+                    4
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_006_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_006_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_006_input.jpg",
+        "save_id": 2490,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2490.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_008",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    7,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    7
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ]
+            ],
+            "3": [
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_008_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_008_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_008_input.jpg",
+        "save_id": 2492,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2492.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_010",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ]
+            ],
+            "2": [
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    2
+                ]
+            ],
+            "3": [
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    7,
+                    7
+                ]
+            ],
+            "4": [
+                [
+                    7,
+                    0
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_010_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_010_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_010_input.jpg",
+        "save_id": 2494,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2494.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_012",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ]
+            ],
+            "2": [
+                [
+                    7,
+                    2
+                ],
+                [
+                    8,
+                    2
+                ],
+                [
+                    8,
+                    3
+                ],
+                [
+                    8,
+                    4
+                ],
+                [
+                    8,
+                    5
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    0
+                ]
+            ],
+            "3": [
+                [
+                    2,
+                    6
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    0,
+                    8
+                ],
+                [
+                    1,
+                    8
+                ],
+                [
+                    2,
+                    8
+                ],
+                [
+                    3,
+                    8
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    1,
+                    6
+                ]
+            ],
+            "4": [
+                [
+                    6,
+                    7
+                ],
+                [
+                    6,
+                    8
+                ],
+                [
+                    7,
+                    8
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    8,
+                    7
+                ],
+                [
+                    8,
+                    6
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    4
+                ]
+            ],
+            "5": [
+                [
+                    4,
+                    7
+                ],
+                [
+                    4,
+                    8
+                ],
+                [
+                    5,
+                    8
+                ],
+                [
+                    5,
+                    7
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_012_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_012_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_012_input.jpg",
+        "save_id": 2496,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2496.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_014",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    7
+                ]
+            ],
+            "3": [
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    7,
+                    0
+                ]
+            ],
+            "4": [
+                [
+                    4,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_014_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_014_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_014_input.jpg",
+        "save_id": 2498,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2498.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_016",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    2
+                ]
+            ],
+            "2": [
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ]
+            ],
+            "3": [
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_016_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_016_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_016_input.jpg",
+        "save_id": 2500,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2500.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_018",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    8,
+                    4
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    8,
+                    3
+                ],
+                [
+                    8,
+                    2
+                ],
+                [
+                    8,
+                    1
+                ],
+                [
+                    8,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ]
+            ],
+            "2": [
+                [
+                    7,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    8,
+                    6
+                ],
+                [
+                    8,
+                    5
+                ]
+            ],
+            "3": [
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    1,
+                    8
+                ],
+                [
+                    2,
+                    8
+                ],
+                [
+                    3,
+                    8
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ]
+            ],
+            "4": [
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    2
+                ]
+            ],
+            "5": [
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    7,
+                    2
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_018_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_018_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_018_input.jpg",
+        "save_id": 2502,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2502.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_020",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ]
+            ],
+            "2": [
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    3,
+                    8
+                ],
+                [
+                    4,
+                    8
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    6,
+                    8
+                ],
+                [
+                    7,
+                    8
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ]
+            ],
+            "3": [
+                [
+                    8,
+                    2
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    8,
+                    3
+                ],
+                [
+                    8,
+                    4
+                ],
+                [
+                    8,
+                    5
+                ],
+                [
+                    8,
+                    6
+                ],
+                [
+                    8,
+                    7
+                ],
+                [
+                    8,
+                    8
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_020_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_020_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_020_input.jpg",
+        "save_id": 2504,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2504.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_022",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    3
+                ]
+            ],
+            "3": [
+                [
+                    1,
+                    4
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_022_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_022_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_022_input.jpg",
+        "save_id": 2506,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2506.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_024",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ]
+            ],
+            "2": [
+                [
+                    4,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ]
+            ],
+            "3": [
+                [
+                    4,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ]
+            ],
+            "4": [
+                [
+                    4,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    5
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_024_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_024_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_024_input.jpg",
+        "save_id": 2508,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2508.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_026",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    0,
+                    8
+                ],
+                [
+                    1,
+                    8
+                ],
+                [
+                    2,
+                    8
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    0
+                ]
+            ],
+            "2": [
+                [
+                    4,
+                    8
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    3,
+                    8
+                ]
+            ],
+            "3": [
+                [
+                    6,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    8,
+                    0
+                ],
+                [
+                    8,
+                    1
+                ],
+                [
+                    8,
+                    2
+                ],
+                [
+                    8,
+                    3
+                ],
+                [
+                    8,
+                    4
+                ],
+                [
+                    8,
+                    5
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    5
+                ]
+            ],
+            "4": [
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_026_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_026_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_026_input.jpg",
+        "save_id": 2510,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2510.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_028",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ]
+            ],
+            "2": [
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ]
+            ],
+            "3": [
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    4
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_028_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_028_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_028_input.jpg",
+        "save_id": 2512,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2512.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_030",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ]
+            ],
+            "3": [
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_030_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_030_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_030_input.jpg",
+        "save_id": 2514,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2514.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_032",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    5,
+                    7
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    7
+                ]
+            ],
+            "2": [
+                [
+                    7,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    7,
+                    2
+                ]
+            ],
+            "3": [
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ]
+            ],
+            "4": [
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ]
+            ],
+            "5": [
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_032_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_032_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_032_input.jpg",
+        "save_id": 2516,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2516.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_034",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    1
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    0,
+                    6
+                ]
+            ],
+            "3": [
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    6
+                ]
+            ],
+            "4": [
+                [
+                    6,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    4,
+                    1
+                ]
+            ],
+            "5": [
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_034_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_034_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_034_input.jpg",
+        "save_id": 2518,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2518.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_036",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ]
+            ],
+            "2": [
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    1,
+                    8
+                ],
+                [
+                    0,
+                    8
+                ]
+            ],
+            "3": [
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    8,
+                    1
+                ],
+                [
+                    8,
+                    0
+                ]
+            ],
+            "4": [
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ]
+            ],
+            "5": [
+                [
+                    6,
+                    8
+                ],
+                [
+                    7,
+                    8
+                ],
+                [
+                    8,
+                    8
+                ],
+                [
+                    8,
+                    7
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    8,
+                    2
+                ],
+                [
+                    8,
+                    3
+                ],
+                [
+                    8,
+                    4
+                ],
+                [
+                    8,
+                    5
+                ],
+                [
+                    8,
+                    6
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_036_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_036_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_036_input.jpg",
+        "save_id": 2520,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2520.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_038",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 6,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ]
+            ],
+            "3": [
+                [
+                    4,
+                    0
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_038_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_038_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_038_input.jpg",
+        "save_id": 2522,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2522.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_040",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ]
+            ],
+            "2": [
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ]
+            ],
+            "3": [
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ]
+            ],
+            "4": [
+                [
+                    5,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    3
+                ]
+            ],
+            "5": [
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_040_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_040_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_040_input.jpg",
+        "save_id": 2524,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2524.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_041",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 6,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ]
+            ],
+            "2": [
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ]
+            ],
+            "3": [
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ]
+            ],
+            "4": [
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ]
+            ],
+            "5": [
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_041_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_041_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_041_input.jpg",
+        "save_id": 2525,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2525.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_042",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    8
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    1,
+                    8
+                ],
+                [
+                    2,
+                    8
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    3,
+                    8
+                ],
+                [
+                    4,
+                    8
+                ],
+                [
+                    5,
+                    8
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    6,
+                    8
+                ],
+                [
+                    7,
+                    8
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    4
+                ]
+            ],
+            "2": [
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    8,
+                    1
+                ],
+                [
+                    8,
+                    2
+                ],
+                [
+                    8,
+                    3
+                ],
+                [
+                    8,
+                    4
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ]
+            ],
+            "3": [
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ]
+            ],
+            "4": [
+                [
+                    7,
+                    5
+                ],
+                [
+                    8,
+                    5
+                ],
+                [
+                    8,
+                    6
+                ],
+                [
+                    8,
+                    7
+                ],
+                [
+                    8,
+                    8
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_042_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_042_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_042_input.jpg",
+        "save_id": 2526,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2526.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_043",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 6,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    1
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ]
+            ],
+            "3": [
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_043_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_043_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_043_input.jpg",
+        "save_id": 2527,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2527.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_044",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    4
+                ]
+            ],
+            "2": [
+                [
+                    7,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    6
+                ]
+            ],
+            "3": [
+                [
+                    6,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    4
+                ]
+            ],
+            "4": [
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ]
+            ],
+            "5": [
+                [
+                    5,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_044_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_044_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_044_input.jpg",
+        "save_id": 2528,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2528.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_045",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ]
+            ],
+            "2": [
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ]
+            ],
+            "3": [
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ]
+            ],
+            "4": [
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_045_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_045_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_045_input.jpg",
+        "save_id": 2529,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2529.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_046",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    5,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ]
+            ],
+            "2": [
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ]
+            ],
+            "3": [
+                [
+                    0,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ]
+            ],
+            "4": [
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_046_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_046_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_046_input.jpg",
+        "save_id": 2530,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2530.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_047",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 6,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    1
+                ]
+            ],
+            "2": [
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ]
+            ],
+            "3": [
+                [
+                    4,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ]
+            ],
+            "4": [
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_047_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_047_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_047_input.jpg",
+        "save_id": 2531,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2531.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_048",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    6,
+                    7
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    1
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    7
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    7,
+                    1
+                ]
+            ],
+            "3": [
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    1,
+                    6
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_048_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_048_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_048_input.jpg",
+        "save_id": 2532,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2532.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_049",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 6,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ]
+            ],
+            "2": [
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    3
+                ]
+            ],
+            "3": [
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_049_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_049_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_049_input.jpg",
+        "save_id": 2533,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2533.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_050",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    5
+                ]
+            ],
+            "2": [
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    4,
+                    1
+                ]
+            ],
+            "3": [
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    4,
+                    7
+                ]
+            ],
+            "4": [
+                [
+                    0,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ]
+            ],
+            "5": [
+                [
+                    6,
+                    4
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    7
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_050_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_050_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_050_input.jpg",
+        "save_id": 2534,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2534.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_051",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 6,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    5,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ]
+            ],
+            "2": [
+                [
+                    2,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ]
+            ],
+            "3": [
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_051_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_051_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_051_input.jpg",
+        "save_id": 2535,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2535.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_052",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ]
+            ],
+            "2": [
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ]
+            ],
+            "3": [
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ]
+            ],
+            "4": [
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    5
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_052_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_052_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_052_input.jpg",
+        "save_id": 2536,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2536.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_053",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ]
+            ],
+            "2": [
+                [
+                    6,
+                    4
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    4
+                ]
+            ],
+            "3": [
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ]
+            ],
+            "4": [
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_053_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_053_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_053_input.jpg",
+        "save_id": 2537,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2537.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_054",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ]
+            ],
+            "2": [
+                [
+                    4,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ]
+            ],
+            "3": [
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_054_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_054_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_054_input.jpg",
+        "save_id": 2538,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2538.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_055",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ]
+            ],
+            "3": [
+                [
+                    1,
+                    6
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ]
+            ],
+            "4": [
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_055_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_055_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_055_input.jpg",
+        "save_id": 2539,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2539.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_056",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ]
+            ],
+            "3": [
+                [
+                    3,
+                    8
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_056_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_056_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_056_input.jpg",
+        "save_id": 2540,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2540.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_057",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    1,
+                    8
+                ],
+                [
+                    0,
+                    8
+                ]
+            ],
+            "2": [
+                [
+                    7,
+                    6
+                ],
+                [
+                    8,
+                    6
+                ],
+                [
+                    8,
+                    5
+                ],
+                [
+                    8,
+                    4
+                ],
+                [
+                    8,
+                    3
+                ],
+                [
+                    8,
+                    2
+                ],
+                [
+                    8,
+                    1
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    4
+                ]
+            ],
+            "3": [
+                [
+                    3,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    4,
+                    8
+                ],
+                [
+                    5,
+                    8
+                ],
+                [
+                    6,
+                    8
+                ],
+                [
+                    7,
+                    8
+                ],
+                [
+                    8,
+                    8
+                ],
+                [
+                    8,
+                    7
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    6,
+                    6
+                ]
+            ],
+            "4": [
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    0,
+                    4
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_057_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_057_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_057_input.jpg",
+        "save_id": 2541,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2541.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_058",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    6,
+                    5
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    0,
+                    3
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ]
+            ],
+            "3": [
+                [
+                    3,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    0,
+                    7
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_058_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_058_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_058_input.jpg",
+        "save_id": 2542,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2542.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_059",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ]
+            ],
+            "2": [
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    5
+                ]
+            ],
+            "3": [
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ]
+            ],
+            "4": [
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_059_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_059_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_059_input.jpg",
+        "save_id": 2543,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2543.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_060",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    8,
+                    4
+                ],
+                [
+                    8,
+                    3
+                ],
+                [
+                    8,
+                    2
+                ],
+                [
+                    8,
+                    1
+                ],
+                [
+                    8,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    7,
+                    1
+                ]
+            ],
+            "2": [
+                [
+                    2,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ]
+            ],
+            "3": [
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_060_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_060_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_060_input.jpg",
+        "save_id": 2544,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2544.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_062",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    1,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    6
+                ]
+            ],
+            "2": [
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ]
+            ],
+            "3": [
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_062_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_062_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_062_input.jpg",
+        "save_id": 2546,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2546.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_064",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    2,
+                    8
+                ],
+                [
+                    1,
+                    8
+                ],
+                [
+                    0,
+                    8
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    8,
+                    7
+                ]
+            ],
+            "2": [
+                [
+                    5,
+                    8
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    4,
+                    8
+                ],
+                [
+                    3,
+                    8
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ]
+            ],
+            "3": [
+                [
+                    6,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    8,
+                    0
+                ],
+                [
+                    8,
+                    1
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    8,
+                    2
+                ],
+                [
+                    8,
+                    3
+                ],
+                [
+                    8,
+                    4
+                ],
+                [
+                    8,
+                    5
+                ],
+                [
+                    8,
+                    6
+                ]
+            ],
+            "4": [
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_064_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_064_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_064_input.jpg",
+        "save_id": 2548,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2548.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_066",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 6,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ]
+            ],
+            "2": [
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    4
+                ]
+            ],
+            "3": [
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ]
+            ],
+            "4": [
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_066_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_066_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_066_input.jpg",
+        "save_id": 2550,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2550.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_068",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    4,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ]
+            ],
+            "2": [
+                [
+                    6,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ]
+            ],
+            "3": [
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_068_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_068_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_068_input.jpg",
+        "save_id": 2552,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2552.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_070",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    1
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ]
+            ],
+            "3": [
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    5
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_070_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_070_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_070_input.jpg",
+        "save_id": 2554,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2554.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_072",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    5,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    3
+                ]
+            ],
+            "2": [
+                [
+                    6,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ]
+            ],
+            "3": [
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ]
+            ],
+            "4": [
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    4
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_072_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_072_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_072_input.jpg",
+        "save_id": 2556,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2556.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_074",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ]
+            ],
+            "2": [
+                [
+                    6,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ]
+            ],
+            "3": [
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    1
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_074_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_074_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_074_input.jpg",
+        "save_id": 2558,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2558.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_076",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    6
+                ]
+            ],
+            "2": [
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    7
+                ]
+            ],
+            "3": [
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ]
+            ],
+            "4": [
+                [
+                    4,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    7,
+                    1
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_076_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_076_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_076_input.jpg",
+        "save_id": 2560,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2560.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_078",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    7,
+                    0
+                ]
+            ],
+            "2": [
+                [
+                    4,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    7
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    4
+                ]
+            ],
+            "3": [
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    5
+                ]
+            ],
+            "4": [
+                [
+                    2,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ]
+            ],
+            "5": [
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_078_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_078_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_078_input.jpg",
+        "save_id": 2562,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2562.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_080",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 9,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    8
+                ],
+                [
+                    1,
+                    8
+                ],
+                [
+                    2,
+                    8
+                ],
+                [
+                    3,
+                    8
+                ],
+                [
+                    4,
+                    8
+                ],
+                [
+                    5,
+                    8
+                ],
+                [
+                    6,
+                    8
+                ],
+                [
+                    7,
+                    8
+                ],
+                [
+                    8,
+                    8
+                ],
+                [
+                    8,
+                    7
+                ],
+                [
+                    8,
+                    6
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    7,
+                    7
+                ]
+            ],
+            "2": [
+                [
+                    8,
+                    5
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ]
+            ],
+            "3": [
+                [
+                    1,
+                    7
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    7
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_080_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_080_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_080_input.jpg",
+        "save_id": 2564,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2564.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_082",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 6,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    5,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ]
+            ],
+            "2": [
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    0
+                ]
+            ],
+            "3": [
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_082_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_082_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_082_input.jpg",
+        "save_id": 2566,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2566.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_084",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    5,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ]
+            ],
+            "2": [
+                [
+                    5,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ]
+            ],
+            "3": [
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_084_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_084_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_084_input.jpg",
+        "save_id": 2568,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2568.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_086",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 6,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ]
+            ],
+            "2": [
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    2
+                ]
+            ],
+            "3": [
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_086_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_086_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_086_input.jpg",
+        "save_id": 2570,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2570.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_088",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 3,
+        "paths": {
+            "1": [
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    0,
+                    6
+                ]
+            ],
+            "2": [
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    4,
+                    1
+                ]
+            ],
+            "3": [
+                [
+                    2,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_088_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_088_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_088_input.jpg",
+        "save_id": 2572,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2572.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_090",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    5,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ]
+            ],
+            "2": [
+                [
+                    2,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    4
+                ]
+            ],
+            "3": [
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ]
+            ],
+            "4": [
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ]
+            ],
+            "5": [
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    4,
+                    1
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_090_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_090_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_090_input.jpg",
+        "save_id": 2574,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2574.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_092",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 6,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ]
+            ],
+            "2": [
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ]
+            ],
+            "3": [
+                [
+                    2,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ]
+            ],
+            "4": [
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ]
+            ],
+            "5": [
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_092_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_092_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_092_input.jpg",
+        "save_id": 2576,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2576.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_094",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    0,
+                    4
+                ]
+            ],
+            "2": [
+                [
+                    7,
+                    6
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    3
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    6,
+                    1
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    4,
+                    7
+                ]
+            ],
+            "3": [
+                [
+                    3,
+                    5
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    0,
+                    7
+                ]
+            ],
+            "4": [
+                [
+                    5,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    7,
+                    7
+                ]
+            ],
+            "5": [
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    4
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_094_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_094_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_094_input.jpg",
+        "save_id": 2578,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2578.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_096",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 8,
+        "num_pairs": 5,
+        "paths": {
+            "1": [
+                [
+                    6,
+                    1
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    4,
+                    2
+                ],
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    1,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ],
+                [
+                    7,
+                    0
+                ],
+                [
+                    7,
+                    1
+                ],
+                [
+                    7,
+                    2
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    3,
+                    3
+                ],
+                [
+                    2,
+                    3
+                ]
+            ],
+            "2": [
+                [
+                    5,
+                    5
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    7
+                ],
+                [
+                    2,
+                    7
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    1,
+                    6
+                ],
+                [
+                    1,
+                    7
+                ],
+                [
+                    0,
+                    7
+                ],
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    1,
+                    3
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    2,
+                    2
+                ]
+            ],
+            "3": [
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    3,
+                    4
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    4
+                ]
+            ],
+            "4": [
+                [
+                    0,
+                    2
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ]
+            ],
+            "5": [
+                [
+                    4,
+                    7
+                ],
+                [
+                    5,
+                    7
+                ],
+                [
+                    6,
+                    7
+                ],
+                [
+                    7,
+                    7
+                ],
+                [
+                    7,
+                    6
+                ],
+                [
+                    6,
+                    6
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    7,
+                    5
+                ],
+                [
+                    7,
+                    4
+                ],
+                [
+                    7,
+                    3
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_096_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_096_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_096_input.jpg",
+        "save_id": 2580,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2580.png",
+        "status": "skipped"
+    },
+    {
+        "id": "flow_visual_098",
+        "task": "numberlink_visual_matching",
+        "prompt_en": "Connect circles of the same color. Paths may move only horizontally or vertically, and each line must match the color of its circles. Paths of different colors must not intersect.",
+        "prompt_cn": "连接颜色相同的圆点，路径只能进行水平或垂直移动，线条颜色需与圆点一致。不同颜色的线条路径不得交叉。",
+        "grid_size": 7,
+        "num_pairs": 4,
+        "paths": {
+            "1": [
+                [
+                    2,
+                    3
+                ],
+                [
+                    2,
+                    4
+                ],
+                [
+                    2,
+                    5
+                ],
+                [
+                    2,
+                    6
+                ],
+                [
+                    3,
+                    6
+                ],
+                [
+                    3,
+                    5
+                ],
+                [
+                    4,
+                    5
+                ],
+                [
+                    4,
+                    6
+                ],
+                [
+                    5,
+                    6
+                ],
+                [
+                    5,
+                    5
+                ],
+                [
+                    6,
+                    5
+                ],
+                [
+                    6,
+                    4
+                ],
+                [
+                    5,
+                    4
+                ],
+                [
+                    4,
+                    4
+                ],
+                [
+                    4,
+                    3
+                ],
+                [
+                    5,
+                    3
+                ],
+                [
+                    5,
+                    2
+                ],
+                [
+                    5,
+                    1
+                ],
+                [
+                    4,
+                    1
+                ],
+                [
+                    4,
+                    0
+                ],
+                [
+                    5,
+                    0
+                ],
+                [
+                    6,
+                    0
+                ]
+            ],
+            "2": [
+                [
+                    3,
+                    2
+                ],
+                [
+                    3,
+                    1
+                ],
+                [
+                    3,
+                    0
+                ],
+                [
+                    2,
+                    0
+                ],
+                [
+                    2,
+                    1
+                ],
+                [
+                    2,
+                    2
+                ],
+                [
+                    1,
+                    2
+                ],
+                [
+                    1,
+                    1
+                ],
+                [
+                    0,
+                    1
+                ],
+                [
+                    0,
+                    0
+                ],
+                [
+                    1,
+                    0
+                ]
+            ],
+            "3": [
+                [
+                    0,
+                    6
+                ],
+                [
+                    0,
+                    5
+                ],
+                [
+                    1,
+                    5
+                ],
+                [
+                    1,
+                    4
+                ],
+                [
+                    0,
+                    4
+                ],
+                [
+                    0,
+                    3
+                ],
+                [
+                    0,
+                    2
+                ]
+            ],
+            "4": [
+                [
+                    6,
+                    3
+                ],
+                [
+                    6,
+                    2
+                ],
+                [
+                    6,
+                    1
+                ]
+            ]
+        },
+        "input_image": "dataset_numberlink_visual_match/flow_visual_098_input.jpg",
+        "result_image": "dataset_numberlink_visual_match/flow_visual_098_result.jpg",
+        "source_image": "Part4/numberlink/flow_visual_098_input.jpg",
+        "save_id": 2582,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Number_Link/2582.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/Shortest_Path.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/Shortest_Path.json
new file mode 100644
index 0000000000000000000000000000000000000000..efc75f3766e4dfa2399aeb1ea398a510c1a4820b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/Shortest_Path.json
@@ -0,0 +1,8911 @@
+[
+    {
+        "id": "rpg_000",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 10,
+        "optimal_path": [
+            [
+                0,
+                0
+            ],
+            [
+                1,
+                0
+            ],
+            [
+                2,
+                0
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                1,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                2,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                2,
+                3,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                2,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                2,
+                2,
+                0,
+                3
+            ],
+            [
+                1,
+                0,
+                0,
+                2,
+                1,
+                2
+            ]
+        ],
+        "start_point": [
+            0,
+            0
+        ],
+        "end_point": [
+            1,
+            5
+        ],
+        "input_image": "dataset_weighted_path/rpg_000_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_000_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_000_input.jpg",
+        "save_id": 2584,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 10.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2584.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_002",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 27,
+        "optimal_path": [
+            [
+                0,
+                6
+            ],
+            [
+                0,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                6,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                1,
+                1,
+                2,
+                2,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                2,
+                0,
+                2,
+                1,
+                2,
+                2
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                1,
+                1,
+                3,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                2,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                3,
+                0,
+                3,
+                0,
+                0,
+                2,
+                2
+            ],
+            [
+                0,
+                0,
+                1,
+                2,
+                2,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                3,
+                1,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                0,
+                0,
+                0,
+                3
+            ]
+        ],
+        "start_point": [
+            0,
+            6
+        ],
+        "end_point": [
+            6,
+            2
+        ],
+        "input_image": "dataset_weighted_path/rpg_002_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_002_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_002_input.jpg",
+        "save_id": 2586,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 27.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2586.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_004",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 19,
+        "optimal_path": [
+            [
+                3,
+                1
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                7,
+                1
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                6,
+                7
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                3,
+                0,
+                1,
+                3,
+                0,
+                2,
+                2,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                3,
+                2,
+                0,
+                0,
+                1,
+                0,
+                2,
+                3
+            ],
+            [
+                1,
+                1,
+                2,
+                1,
+                3,
+                0,
+                1,
+                1,
+                1,
+                1
+            ],
+            [
+                2,
+                0,
+                3,
+                3,
+                0,
+                1,
+                2,
+                1,
+                0,
+                3
+            ],
+            [
+                3,
+                1,
+                1,
+                0,
+                0,
+                2,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                3,
+                2,
+                3,
+                1,
+                0,
+                0,
+                3,
+                0
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                3,
+                3,
+                1,
+                1,
+                2,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                1,
+                3
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                3,
+                1,
+                1,
+                0,
+                3,
+                1
+            ],
+            [
+                1,
+                0,
+                1,
+                1,
+                0,
+                0,
+                2,
+                1,
+                2,
+                1
+            ]
+        ],
+        "start_point": [
+            3,
+            1
+        ],
+        "end_point": [
+            6,
+            7
+        ],
+        "input_image": "dataset_weighted_path/rpg_004_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_004_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_004_input.jpg",
+        "save_id": 2588,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 19.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2588.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_006",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 20,
+        "optimal_path": [
+            [
+                7,
+                3
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                0,
+                3
+            ],
+            [
+                0,
+                2
+            ],
+            [
+                0,
+                1
+            ],
+            [
+                0,
+                0
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                0,
+                0,
+                0,
+                2,
+                2,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                1,
+                1,
+                0,
+                2,
+                1,
+                1,
+                1
+            ],
+            [
+                2,
+                0,
+                3,
+                0,
+                1,
+                1,
+                2,
+                1,
+                1
+            ],
+            [
+                2,
+                0,
+                1,
+                0,
+                1,
+                2,
+                1,
+                3,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                2,
+                1,
+                0,
+                3,
+                2
+            ],
+            [
+                0,
+                0,
+                3,
+                1,
+                1,
+                0,
+                1,
+                1,
+                1
+            ],
+            [
+                2,
+                0,
+                3,
+                1,
+                1,
+                1,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                2,
+                0,
+                0,
+                0,
+                0,
+                2,
+                1
+            ],
+            [
+                3,
+                3,
+                2,
+                0,
+                2,
+                1,
+                1,
+                0,
+                3
+            ]
+        ],
+        "start_point": [
+            7,
+            3
+        ],
+        "end_point": [
+            0,
+            0
+        ],
+        "input_image": "dataset_weighted_path/rpg_006_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_006_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_006_input.jpg",
+        "save_id": 2590,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 20.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2590.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_008",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 5,
+        "optimal_path": [
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                3,
+                1,
+                3,
+                2,
+                2,
+                0,
+                1
+            ],
+            [
+                3,
+                0,
+                3,
+                0,
+                2,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                2,
+                1,
+                0,
+                3,
+                0,
+                2,
+                3
+            ],
+            [
+                3,
+                0,
+                2,
+                1,
+                1,
+                2,
+                2,
+                0
+            ],
+            [
+                1,
+                2,
+                1,
+                0,
+                2,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                1,
+                0,
+                1,
+                2
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                0,
+                2,
+                3,
+                1
+            ],
+            [
+                0,
+                1,
+                2,
+                0,
+                0,
+                2,
+                2,
+                0
+            ]
+        ],
+        "start_point": [
+            4,
+            6
+        ],
+        "end_point": [
+            5,
+            4
+        ],
+        "input_image": "dataset_weighted_path/rpg_008_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_008_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_008_input.jpg",
+        "save_id": 2592,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 5.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2592.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_010",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 15,
+        "optimal_path": [
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                1
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                0,
+                3,
+                2,
+                0,
+                0,
+                0
+            ],
+            [
+                3,
+                3,
+                1,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                3,
+                2,
+                1,
+                3
+            ],
+            [
+                0,
+                3,
+                1,
+                1,
+                2,
+                2,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                3,
+                1,
+                0,
+                3
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                3,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                2,
+                0,
+                0,
+                1
+            ]
+        ],
+        "start_point": [
+            6,
+            5
+        ],
+        "end_point": [
+            4,
+            1
+        ],
+        "input_image": "dataset_weighted_path/rpg_010_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_010_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_010_input.jpg",
+        "save_id": 2594,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2594.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_012",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 10,
+        "optimal_path": [
+            [
+                1,
+                8
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                3,
+                7
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                3,
+                0,
+                3,
+                0,
+                2,
+                3,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                3,
+                0
+            ],
+            [
+                0,
+                1,
+                2,
+                0,
+                2,
+                1,
+                1,
+                3,
+                2
+            ],
+            [
+                2,
+                3,
+                0,
+                2,
+                0,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                1,
+                1,
+                3,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                3,
+                0,
+                1,
+                1,
+                1,
+                0,
+                2,
+                3,
+                0
+            ],
+            [
+                1,
+                1,
+                2,
+                1,
+                3,
+                2,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                3,
+                2,
+                0,
+                0,
+                1,
+                1,
+                0,
+                2
+            ],
+            [
+                1,
+                2,
+                1,
+                2,
+                2,
+                0,
+                0,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            1,
+            8
+        ],
+        "end_point": [
+            3,
+            7
+        ],
+        "input_image": "dataset_weighted_path/rpg_012_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_012_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_012_input.jpg",
+        "save_id": 2596,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 10.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2596.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_014",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 9,
+        "optimal_path": [
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                2,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                0,
+                3,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                0,
+                3,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                2,
+                1,
+                1,
+                2,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                2,
+                3,
+                1,
+                0,
+                1,
+                1
+            ],
+            [
+                3,
+                2,
+                0,
+                1,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                1,
+                3,
+                0,
+                0,
+                0,
+                3
+            ]
+        ],
+        "start_point": [
+            6,
+            5
+        ],
+        "end_point": [
+            2,
+            4
+        ],
+        "input_image": "dataset_weighted_path/rpg_014_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_014_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_014_input.jpg",
+        "save_id": 2598,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 9.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2598.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_016",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 4,
+        "optimal_path": [
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                1,
+                2,
+                0,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                3,
+                1,
+                1,
+                1,
+                3,
+                0
+            ],
+            [
+                3,
+                3,
+                0,
+                3,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                1,
+                3,
+                1,
+                0
+            ],
+            [
+                1,
+                1,
+                3,
+                0,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                0,
+                1,
+                0,
+                2
+            ],
+            [
+                1,
+                1,
+                3,
+                1,
+                1,
+                1,
+                1,
+                3
+            ],
+            [
+                0,
+                3,
+                1,
+                0,
+                3,
+                2,
+                3,
+                3
+            ]
+        ],
+        "start_point": [
+            4,
+            7
+        ],
+        "end_point": [
+            5,
+            4
+        ],
+        "input_image": "dataset_weighted_path/rpg_016_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_016_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_016_input.jpg",
+        "save_id": 2600,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 4.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2600.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_018",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 14,
+        "optimal_path": [
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                0,
+                2,
+                1,
+                3,
+                0,
+                2
+            ],
+            [
+                3,
+                1,
+                1,
+                2,
+                1,
+                3,
+                3
+            ],
+            [
+                1,
+                3,
+                2,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                3,
+                1,
+                1,
+                0,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                3,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                2,
+                1,
+                0,
+                0,
+                0,
+                3
+            ],
+            [
+                1,
+                3,
+                2,
+                0,
+                1,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            1,
+            2
+        ],
+        "end_point": [
+            3,
+            5
+        ],
+        "input_image": "dataset_weighted_path/rpg_018_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_018_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_018_input.jpg",
+        "save_id": 2602,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 14.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2602.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_020",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 7,
+        "optimal_path": [
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                1
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                1,
+                1,
+                0,
+                2,
+                3
+            ],
+            [
+                2,
+                0,
+                2,
+                0,
+                0,
+                2
+            ],
+            [
+                3,
+                1,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                2,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                3,
+                1
+            ]
+        ],
+        "start_point": [
+            1,
+            5
+        ],
+        "end_point": [
+            2,
+            1
+        ],
+        "input_image": "dataset_weighted_path/rpg_020_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_020_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_020_input.jpg",
+        "save_id": 2604,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 7.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2604.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_022",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 7,
+        "optimal_path": [
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                1,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                1,
+                0,
+                1,
+                0,
+                0,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                3,
+                1
+            ],
+            [
+                0,
+                2,
+                0,
+                1,
+                0,
+                1,
+                3,
+                0,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                2,
+                0,
+                3,
+                1,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                2,
+                0,
+                2,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                3,
+                0,
+                3,
+                1,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                0,
+                3,
+                0,
+                2,
+                0
+            ],
+            [
+                0,
+                2,
+                1,
+                1,
+                1,
+                3,
+                0,
+                0,
+                1
+            ],
+            [
+                3,
+                1,
+                2,
+                0,
+                2,
+                0,
+                0,
+                0,
+                3
+            ]
+        ],
+        "start_point": [
+            6,
+            4
+        ],
+        "end_point": [
+            1,
+            2
+        ],
+        "input_image": "dataset_weighted_path/rpg_022_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_022_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_022_input.jpg",
+        "save_id": 2606,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 7.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2606.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_024",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 20,
+        "optimal_path": [
+            [
+                2,
+                8
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                3,
+                2,
+                3,
+                0,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                2,
+                2,
+                0,
+                2,
+                0,
+                2,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                1,
+                3,
+                0,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                3,
+                3,
+                0,
+                0,
+                0,
+                3
+            ],
+            [
+                0,
+                1,
+                2,
+                0,
+                0,
+                3,
+                0,
+                1,
+                2
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                2,
+                0,
+                1,
+                2,
+                1
+            ],
+            [
+                1,
+                0,
+                2,
+                1,
+                2,
+                0,
+                0,
+                1,
+                2
+            ],
+            [
+                0,
+                2,
+                0,
+                1,
+                2,
+                0,
+                3,
+                0,
+                3
+            ],
+            [
+                0,
+                0,
+                3,
+                2,
+                0,
+                3,
+                1,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            2,
+            8
+        ],
+        "end_point": [
+            3,
+            2
+        ],
+        "input_image": "dataset_weighted_path/rpg_024_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_024_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_024_input.jpg",
+        "save_id": 2608,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 20.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2608.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_026",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 25,
+        "optimal_path": [
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                4,
+                9
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                3,
+                1,
+                1,
+                2,
+                3,
+                2,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                3,
+                2,
+                3,
+                1,
+                1,
+                1,
+                3,
+                0,
+                3
+            ],
+            [
+                1,
+                1,
+                3,
+                1,
+                2,
+                0,
+                2,
+                0,
+                0,
+                2
+            ],
+            [
+                0,
+                2,
+                3,
+                0,
+                1,
+                0,
+                2,
+                0,
+                2,
+                0
+            ],
+            [
+                3,
+                1,
+                0,
+                1,
+                3,
+                1,
+                1,
+                1,
+                2,
+                2
+            ],
+            [
+                2,
+                3,
+                1,
+                1,
+                0,
+                0,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                3,
+                0,
+                3,
+                3,
+                1,
+                2,
+                3,
+                2,
+                0,
+                3
+            ],
+            [
+                0,
+                2,
+                1,
+                0,
+                0,
+                0,
+                0,
+                2,
+                0,
+                1
+            ],
+            [
+                0,
+                3,
+                0,
+                3,
+                1,
+                2,
+                1,
+                0,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                3,
+                0,
+                1,
+                0,
+                1,
+                2
+            ]
+        ],
+        "start_point": [
+            2,
+            3
+        ],
+        "end_point": [
+            4,
+            9
+        ],
+        "input_image": "dataset_weighted_path/rpg_026_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_026_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_026_input.jpg",
+        "save_id": 2610,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 25.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2610.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_028",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 23,
+        "optimal_path": [
+            [
+                2,
+                0
+            ],
+            [
+                3,
+                0
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                0
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                3,
+                3,
+                3,
+                3,
+                3,
+                3
+            ],
+            [
+                1,
+                0,
+                1,
+                1,
+                2,
+                2,
+                3
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                0,
+                1,
+                2
+            ],
+            [
+                2,
+                3,
+                3,
+                0,
+                0,
+                2,
+                0
+            ],
+            [
+                3,
+                1,
+                1,
+                3,
+                0,
+                1,
+                0
+            ],
+            [
+                2,
+                1,
+                0,
+                0,
+                0,
+                0,
+                3
+            ]
+        ],
+        "start_point": [
+            2,
+            0
+        ],
+        "end_point": [
+            6,
+            0
+        ],
+        "input_image": "dataset_weighted_path/rpg_028_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_028_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_028_input.jpg",
+        "save_id": 2612,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 23.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2612.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_030",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 21,
+        "optimal_path": [
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                3,
+                2,
+                0,
+                1,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                3,
+                0,
+                0,
+                3,
+                1
+            ],
+            [
+                1,
+                2,
+                0,
+                2,
+                3,
+                1,
+                1,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                2,
+                0,
+                0,
+                2,
+                1
+            ],
+            [
+                0,
+                3,
+                0,
+                0,
+                2,
+                1,
+                3,
+                3,
+                0
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                1,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                1,
+                2,
+                0,
+                1,
+                1
+            ],
+            [
+                2,
+                1,
+                0,
+                1,
+                2,
+                1,
+                1,
+                1,
+                1
+            ],
+            [
+                2,
+                1,
+                1,
+                2,
+                2,
+                1,
+                0,
+                0,
+                1
+            ]
+        ],
+        "start_point": [
+            6,
+            1
+        ],
+        "end_point": [
+            8,
+            8
+        ],
+        "input_image": "dataset_weighted_path/rpg_030_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_030_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_030_input.jpg",
+        "save_id": 2614,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 21.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2614.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_032",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 22,
+        "optimal_path": [
+            [
+                0,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                1
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                3,
+                0,
+                1,
+                3,
+                1,
+                0,
+                2,
+                1
+            ],
+            [
+                1,
+                1,
+                3,
+                2,
+                3,
+                3,
+                0,
+                3,
+                0
+            ],
+            [
+                0,
+                1,
+                3,
+                1,
+                0,
+                0,
+                0,
+                1,
+                3
+            ],
+            [
+                2,
+                3,
+                0,
+                2,
+                2,
+                1,
+                1,
+                3,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                3,
+                1,
+                3,
+                3,
+                2
+            ],
+            [
+                1,
+                0,
+                1,
+                2,
+                2,
+                0,
+                0,
+                3,
+                2
+            ],
+            [
+                0,
+                0,
+                2,
+                2,
+                2,
+                1,
+                3,
+                3,
+                1
+            ],
+            [
+                0,
+                0,
+                3,
+                1,
+                0,
+                0,
+                3,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                0,
+                0,
+                3,
+                0,
+                1
+            ]
+        ],
+        "start_point": [
+            0,
+            3
+        ],
+        "end_point": [
+            4,
+            1
+        ],
+        "input_image": "dataset_weighted_path/rpg_032_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_032_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_032_input.jpg",
+        "save_id": 2616,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 22.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2616.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_034",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 11,
+        "optimal_path": [
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                2,
+                9
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                0,
+                1,
+                3,
+                0,
+                0,
+                1,
+                1,
+                1,
+                0
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                0,
+                0,
+                3,
+                0,
+                3,
+                2
+            ],
+            [
+                1,
+                0,
+                1,
+                3,
+                0,
+                0,
+                0,
+                3,
+                2,
+                1
+            ],
+            [
+                0,
+                3,
+                3,
+                1,
+                1,
+                3,
+                2,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                0,
+                1,
+                0,
+                0,
+                1,
+                0
+            ],
+            [
+                2,
+                0,
+                3,
+                0,
+                0,
+                1,
+                2,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                0,
+                1,
+                0,
+                0,
+                0,
+                3
+            ],
+            [
+                3,
+                2,
+                1,
+                0,
+                1,
+                3,
+                1,
+                0,
+                2,
+                2
+            ],
+            [
+                0,
+                0,
+                2,
+                3,
+                3,
+                1,
+                3,
+                0,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            4,
+            6
+        ],
+        "end_point": [
+            2,
+            9
+        ],
+        "input_image": "dataset_weighted_path/rpg_034_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_034_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_034_input.jpg",
+        "save_id": 2618,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 11.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2618.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_036",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 24,
+        "optimal_path": [
+            [
+                0,
+                8
+            ],
+            [
+                1,
+                8
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                3
+            ],
+            [
+                0,
+                2
+            ],
+            [
+                1,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                0,
+                0,
+                1,
+                3,
+                1,
+                3,
+                1,
+                1
+            ],
+            [
+                1,
+                0,
+                1,
+                3,
+                2,
+                1,
+                0,
+                1,
+                0,
+                3
+            ],
+            [
+                1,
+                0,
+                1,
+                3,
+                0,
+                0,
+                2,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                3,
+                3,
+                0,
+                0,
+                3,
+                2,
+                2
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                1,
+                0,
+                0,
+                2,
+                0,
+                3
+            ],
+            [
+                1,
+                0,
+                1,
+                1,
+                1,
+                2,
+                3,
+                3,
+                2,
+                1
+            ],
+            [
+                2,
+                2,
+                0,
+                0,
+                0,
+                2,
+                0,
+                3,
+                1,
+                3
+            ],
+            [
+                2,
+                0,
+                1,
+                1,
+                0,
+                1,
+                0,
+                0,
+                3,
+                2
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                3,
+                3,
+                3,
+                1,
+                2,
+                1
+            ],
+            [
+                3,
+                2,
+                1,
+                3,
+                1,
+                1,
+                2,
+                0,
+                2,
+                3
+            ]
+        ],
+        "start_point": [
+            0,
+            8
+        ],
+        "end_point": [
+            1,
+            2
+        ],
+        "input_image": "dataset_weighted_path/rpg_036_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_036_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_036_input.jpg",
+        "save_id": 2620,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 24.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2620.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_038",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 6,
+        "optimal_path": [
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                0,
+                1,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                3,
+                0,
+                2,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                3,
+                1,
+                0,
+                0,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                3,
+                0,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                3,
+                0,
+                1,
+                0
+            ],
+            [
+                3,
+                1,
+                0,
+                0,
+                3,
+                0,
+                3
+            ],
+            [
+                3,
+                1,
+                0,
+                1,
+                0,
+                2,
+                1
+            ]
+        ],
+        "start_point": [
+            1,
+            5
+        ],
+        "end_point": [
+            5,
+            5
+        ],
+        "input_image": "dataset_weighted_path/rpg_038_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_038_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_038_input.jpg",
+        "save_id": 2622,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 6.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2622.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_040",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 19,
+        "optimal_path": [
+            [
+                4,
+                1
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                6
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                2,
+                1,
+                2,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                2,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                0,
+                2,
+                0,
+                2,
+                3
+            ],
+            [
+                1,
+                1,
+                3,
+                1,
+                0,
+                0,
+                3
+            ],
+            [
+                1,
+                2,
+                3,
+                2,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                3,
+                2,
+                0,
+                2,
+                3
+            ],
+            [
+                2,
+                3,
+                3,
+                0,
+                0,
+                0,
+                2
+            ]
+        ],
+        "start_point": [
+            4,
+            1
+        ],
+        "end_point": [
+            1,
+            6
+        ],
+        "input_image": "dataset_weighted_path/rpg_040_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_040_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_040_input.jpg",
+        "save_id": 2624,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 19.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2624.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_041",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 15,
+        "optimal_path": [
+            [
+                0,
+                2
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                2,
+                0,
+                1,
+                1,
+                1,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                3,
+                0,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                3,
+                2,
+                3,
+                0,
+                1
+            ],
+            [
+                3,
+                0,
+                2,
+                3,
+                1,
+                1,
+                1
+            ],
+            [
+                0,
+                2,
+                1,
+                1,
+                0,
+                2,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                3,
+                1,
+                2,
+                0
+            ]
+        ],
+        "start_point": [
+            0,
+            2
+        ],
+        "end_point": [
+            4,
+            2
+        ],
+        "input_image": "dataset_weighted_path/rpg_041_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_041_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_041_input.jpg",
+        "save_id": 2625,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2625.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_042",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 5,
+        "optimal_path": [
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                0
+            ],
+            [
+                1,
+                0
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                3,
+                1,
+                1,
+                3,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                3,
+                1,
+                2,
+                0,
+                3,
+                2,
+                1
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                0,
+                3,
+                3,
+                1
+            ],
+            [
+                1,
+                0,
+                3,
+                3,
+                1,
+                1,
+                0,
+                3
+            ],
+            [
+                2,
+                0,
+                0,
+                1,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                2,
+                0,
+                1,
+                0,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                2,
+                3,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            2,
+            2
+        ],
+        "end_point": [
+            1,
+            0
+        ],
+        "input_image": "dataset_weighted_path/rpg_042_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_042_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_042_input.jpg",
+        "save_id": 2626,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 5.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2626.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_043",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 15,
+        "optimal_path": [
+            [
+                0,
+                0
+            ],
+            [
+                0,
+                1
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                0,
+                3,
+                1,
+                2,
+                2,
+                1
+            ],
+            [
+                3,
+                1,
+                1,
+                1,
+                1,
+                1,
+                1
+            ],
+            [
+                2,
+                1,
+                3,
+                0,
+                0,
+                0,
+                2
+            ],
+            [
+                1,
+                1,
+                2,
+                0,
+                0,
+                2,
+                1
+            ],
+            [
+                1,
+                3,
+                0,
+                1,
+                0,
+                1,
+                2
+            ],
+            [
+                0,
+                2,
+                0,
+                2,
+                1,
+                0,
+                1
+            ],
+            [
+                1,
+                3,
+                1,
+                0,
+                0,
+                2,
+                0
+            ]
+        ],
+        "start_point": [
+            0,
+            0
+        ],
+        "end_point": [
+            4,
+            3
+        ],
+        "input_image": "dataset_weighted_path/rpg_043_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_043_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_043_input.jpg",
+        "save_id": 2627,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2627.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_044",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 24,
+        "optimal_path": [
+            [
+                4,
+                0
+            ],
+            [
+                3,
+                0
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                0,
+                1
+            ],
+            [
+                0,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                1,
+                2,
+                1,
+                1,
+                0,
+                1,
+                0,
+                1
+            ],
+            [
+                2,
+                2,
+                2,
+                2,
+                2,
+                0,
+                0,
+                0,
+                2
+            ],
+            [
+                3,
+                0,
+                1,
+                1,
+                1,
+                1,
+                2,
+                1,
+                1
+            ],
+            [
+                0,
+                1,
+                1,
+                1,
+                2,
+                0,
+                3,
+                1,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                2,
+                3,
+                2,
+                0,
+                0
+            ],
+            [
+                2,
+                0,
+                2,
+                3,
+                0,
+                0,
+                2,
+                0,
+                0
+            ],
+            [
+                3,
+                1,
+                1,
+                3,
+                0,
+                0,
+                0,
+                1,
+                3
+            ],
+            [
+                1,
+                0,
+                1,
+                1,
+                1,
+                0,
+                3,
+                3,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                2,
+                1,
+                1,
+                3,
+                3,
+                2
+            ]
+        ],
+        "start_point": [
+            4,
+            0
+        ],
+        "end_point": [
+            0,
+            2
+        ],
+        "input_image": "dataset_weighted_path/rpg_044_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_044_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_044_input.jpg",
+        "save_id": 2628,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 24.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2628.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_045",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 16,
+        "optimal_path": [
+            [
+                5,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                0,
+                2
+            ],
+            [
+                0,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                1,
+                1,
+                0,
+                2,
+                0,
+                2,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                3,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                3,
+                1,
+                0,
+                3,
+                3,
+                0,
+                3,
+                3
+            ],
+            [
+                2,
+                1,
+                0,
+                0,
+                1,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                3,
+                1,
+                1,
+                1
+            ],
+            [
+                3,
+                1,
+                3,
+                0,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                1,
+                3,
+                0,
+                0,
+                2,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                2,
+                1,
+                0,
+                1,
+                3
+            ]
+        ],
+        "start_point": [
+            5,
+            6
+        ],
+        "end_point": [
+            0,
+            3
+        ],
+        "input_image": "dataset_weighted_path/rpg_045_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_045_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_045_input.jpg",
+        "save_id": 2629,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 16.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2629.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_046",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 6,
+        "optimal_path": [
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                3,
+                0,
+                2,
+                3
+            ],
+            [
+                1,
+                3,
+                0,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                2,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                3,
+                2,
+                1,
+                1,
+                3
+            ],
+            [
+                1,
+                0,
+                2,
+                0,
+                0,
+                2
+            ],
+            [
+                1,
+                0,
+                2,
+                0,
+                2,
+                1
+            ]
+        ],
+        "start_point": [
+            2,
+            1
+        ],
+        "end_point": [
+            4,
+            3
+        ],
+        "input_image": "dataset_weighted_path/rpg_046_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_046_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_046_input.jpg",
+        "save_id": 2630,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 6.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2630.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_047",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 25,
+        "optimal_path": [
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                3,
+                9
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                3,
+                2,
+                0,
+                2,
+                1,
+                2,
+                3,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                0,
+                2,
+                3,
+                1,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                2,
+                3,
+                1,
+                1,
+                2,
+                1,
+                0,
+                1,
+                1
+            ],
+            [
+                3,
+                3,
+                1,
+                0,
+                3,
+                0,
+                0,
+                3,
+                1,
+                1
+            ],
+            [
+                0,
+                2,
+                0,
+                0,
+                0,
+                0,
+                0,
+                0,
+                0,
+                3
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                1,
+                0,
+                3,
+                1
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                0,
+                0,
+                1,
+                1,
+                2,
+                2
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                2,
+                3,
+                3,
+                3,
+                3,
+                0
+            ],
+            [
+                0,
+                2,
+                1,
+                1,
+                1,
+                2,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                3,
+                0,
+                3,
+                3,
+                0,
+                0,
+                0,
+                0,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            1,
+            1
+        ],
+        "end_point": [
+            3,
+            9
+        ],
+        "input_image": "dataset_weighted_path/rpg_047_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_047_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_047_input.jpg",
+        "save_id": 2631,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 25.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2631.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_048",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 20,
+        "optimal_path": [
+            [
+                9,
+                5
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                5,
+                0
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                0,
+                0,
+                1,
+                0,
+                0,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                1,
+                3,
+                0,
+                0,
+                2,
+                1,
+                3,
+                2,
+                0
+            ],
+            [
+                2,
+                1,
+                1,
+                1,
+                0,
+                3,
+                0,
+                0,
+                1,
+                2
+            ],
+            [
+                1,
+                0,
+                1,
+                1,
+                0,
+                0,
+                2,
+                1,
+                1,
+                2
+            ],
+            [
+                0,
+                0,
+                1,
+                2,
+                0,
+                3,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                2,
+                1,
+                3,
+                1,
+                0,
+                0,
+                2,
+                1,
+                0,
+                1
+            ],
+            [
+                2,
+                1,
+                0,
+                0,
+                2,
+                3,
+                0,
+                0,
+                1,
+                0
+            ],
+            [
+                2,
+                2,
+                0,
+                0,
+                1,
+                1,
+                3,
+                3,
+                0,
+                3
+            ],
+            [
+                0,
+                3,
+                0,
+                0,
+                0,
+                0,
+                0,
+                0,
+                2,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                0,
+                0,
+                1,
+                0,
+                2,
+                0
+            ]
+        ],
+        "start_point": [
+            9,
+            5
+        ],
+        "end_point": [
+            5,
+            0
+        ],
+        "input_image": "dataset_weighted_path/rpg_048_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_048_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_048_input.jpg",
+        "save_id": 2632,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 20.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2632.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_049",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 12,
+        "optimal_path": [
+            [
+                5,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                0,
+                6
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                3,
+                0,
+                3,
+                0,
+                3,
+                1,
+                3,
+                0
+            ],
+            [
+                1,
+                0,
+                3,
+                2,
+                0,
+                0,
+                1,
+                3,
+                1
+            ],
+            [
+                3,
+                3,
+                0,
+                0,
+                0,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                3,
+                0,
+                0
+            ],
+            [
+                0,
+                3,
+                2,
+                3,
+                0,
+                1,
+                1,
+                1,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                1,
+                1,
+                0,
+                3,
+                0
+            ],
+            [
+                0,
+                1,
+                2,
+                2,
+                2,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                1,
+                1,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                1,
+                0,
+                3,
+                2,
+                2,
+                3,
+                0,
+                1
+            ]
+        ],
+        "start_point": [
+            5,
+            5
+        ],
+        "end_point": [
+            0,
+            6
+        ],
+        "input_image": "dataset_weighted_path/rpg_049_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_049_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_049_input.jpg",
+        "save_id": 2633,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 12.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2633.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_050",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 13,
+        "optimal_path": [
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                1,
+                1,
+                0,
+                1,
+                2,
+                0,
+                3
+            ],
+            [
+                3,
+                0,
+                1,
+                1,
+                0,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                1,
+                3,
+                2,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                0,
+                1,
+                2,
+                2,
+                0,
+                0,
+                3,
+                2
+            ],
+            [
+                0,
+                3,
+                1,
+                3,
+                1,
+                0,
+                1,
+                0
+            ],
+            [
+                1,
+                1,
+                2,
+                2,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                3,
+                1,
+                1,
+                2
+            ],
+            [
+                2,
+                2,
+                0,
+                3,
+                0,
+                1,
+                0,
+                2
+            ]
+        ],
+        "start_point": [
+            5,
+            2
+        ],
+        "end_point": [
+            5,
+            6
+        ],
+        "input_image": "dataset_weighted_path/rpg_050_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_050_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_050_input.jpg",
+        "save_id": 2634,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 13.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2634.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_051",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 29,
+        "optimal_path": [
+            [
+                8,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                3,
+                3,
+                3,
+                0,
+                0,
+                1,
+                0,
+                1
+            ],
+            [
+                2,
+                1,
+                0,
+                1,
+                1,
+                1,
+                0,
+                0,
+                1
+            ],
+            [
+                2,
+                3,
+                2,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                0,
+                1,
+                1,
+                0,
+                1,
+                3
+            ],
+            [
+                0,
+                2,
+                3,
+                0,
+                1,
+                3,
+                1,
+                2,
+                2
+            ],
+            [
+                3,
+                0,
+                2,
+                1,
+                0,
+                1,
+                1,
+                3,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                2,
+                1,
+                0,
+                1,
+                3,
+                1
+            ],
+            [
+                0,
+                2,
+                0,
+                0,
+                3,
+                1,
+                2,
+                1,
+                2
+            ],
+            [
+                0,
+                2,
+                1,
+                1,
+                0,
+                0,
+                3,
+                2,
+                1
+            ]
+        ],
+        "start_point": [
+            8,
+            7
+        ],
+        "end_point": [
+            1,
+            2
+        ],
+        "input_image": "dataset_weighted_path/rpg_051_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_051_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_051_input.jpg",
+        "save_id": 2635,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 29.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2635.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_052",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 9,
+        "optimal_path": [
+            [
+                2,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                2,
+                0,
+                1,
+                1,
+                1,
+                0,
+                0,
+                3
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                1,
+                0,
+                1,
+                2,
+                2
+            ],
+            [
+                3,
+                1,
+                1,
+                3,
+                0,
+                1,
+                2,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                1,
+                0,
+                0,
+                1,
+                3
+            ],
+            [
+                3,
+                0,
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                2,
+                3,
+                0,
+                2,
+                0,
+                1,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                3,
+                0,
+                3,
+                1,
+                0,
+                0,
+                2,
+                1
+            ],
+            [
+                2,
+                1,
+                0,
+                0,
+                0,
+                0,
+                0,
+                2,
+                0
+            ],
+            [
+                2,
+                2,
+                0,
+                3,
+                0,
+                2,
+                1,
+                0,
+                0
+            ]
+        ],
+        "start_point": [
+            2,
+            4
+        ],
+        "end_point": [
+            0,
+            3
+        ],
+        "input_image": "dataset_weighted_path/rpg_052_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_052_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_052_input.jpg",
+        "save_id": 2636,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 9.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2636.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_053",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 17,
+        "optimal_path": [
+            [
+                6,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                3,
+                0
+            ],
+            [
+                2,
+                0
+            ],
+            [
+                1,
+                0
+            ],
+            [
+                1,
+                1
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                0,
+                1,
+                3,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                3,
+                2,
+                1,
+                0,
+                3
+            ],
+            [
+                1,
+                2,
+                0,
+                1,
+                1,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                1,
+                3,
+                0,
+                1,
+                1
+            ],
+            [
+                2,
+                2,
+                1,
+                0,
+                2,
+                1,
+                2
+            ],
+            [
+                0,
+                0,
+                3,
+                1,
+                1,
+                1,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                0,
+                2,
+                0
+            ]
+        ],
+        "start_point": [
+            6,
+            3
+        ],
+        "end_point": [
+            1,
+            1
+        ],
+        "input_image": "dataset_weighted_path/rpg_053_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_053_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_053_input.jpg",
+        "save_id": 2637,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 17.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2637.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_054",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 3,
+        "optimal_path": [
+            [
+                4,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                1,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                0,
+                3,
+                3,
+                0,
+                1,
+                1,
+                1
+            ],
+            [
+                1,
+                0,
+                1,
+                3,
+                1,
+                0,
+                1,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                2,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                3,
+                0,
+                3,
+                2,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                1,
+                2,
+                0,
+                1
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                1,
+                0,
+                2,
+                3
+            ],
+            [
+                3,
+                1,
+                2,
+                3,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                3,
+                1,
+                0,
+                2,
+                2,
+                2,
+                2,
+                3
+            ]
+        ],
+        "start_point": [
+            4,
+            5
+        ],
+        "end_point": [
+            1,
+            5
+        ],
+        "input_image": "dataset_weighted_path/rpg_054_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_054_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_054_input.jpg",
+        "save_id": 2638,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 3.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2638.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_055",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 16,
+        "optimal_path": [
+            [
+                8,
+                8
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                3,
+                1,
+                1,
+                1,
+                3,
+                0,
+                3
+            ],
+            [
+                1,
+                1,
+                1,
+                2,
+                2,
+                0,
+                1,
+                1,
+                1
+            ],
+            [
+                2,
+                0,
+                0,
+                0,
+                3,
+                0,
+                1,
+                0,
+                1
+            ],
+            [
+                2,
+                0,
+                0,
+                0,
+                1,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                3,
+                1,
+                0,
+                0,
+                1,
+                2,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                2,
+                2,
+                1,
+                0,
+                0,
+                2,
+                2,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                3,
+                0,
+                3,
+                0,
+                1
+            ],
+            [
+                3,
+                1,
+                0,
+                0,
+                0,
+                1,
+                0,
+                3,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                0,
+                1,
+                0,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            8,
+            8
+        ],
+        "end_point": [
+            4,
+            2
+        ],
+        "input_image": "dataset_weighted_path/rpg_055_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_055_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_055_input.jpg",
+        "save_id": 2639,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 16.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2639.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_056",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 10,
+        "optimal_path": [
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                2,
+                1,
+                2,
+                3,
+                2
+            ],
+            [
+                3,
+                0,
+                1,
+                2,
+                0,
+                2
+            ],
+            [
+                2,
+                1,
+                2,
+                0,
+                3,
+                0
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                0,
+                2
+            ],
+            [
+                3,
+                0,
+                1,
+                3,
+                1,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                2,
+                0
+            ]
+        ],
+        "start_point": [
+            2,
+            2
+        ],
+        "end_point": [
+            1,
+            4
+        ],
+        "input_image": "dataset_weighted_path/rpg_056_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_056_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_056_input.jpg",
+        "save_id": 2640,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 10.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2640.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_057",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 33,
+        "optimal_path": [
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                0,
+                1
+            ],
+            [
+                0,
+                0
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                1,
+                3,
+                3,
+                0,
+                3,
+                2,
+                0
+            ],
+            [
+                2,
+                1,
+                0,
+                3,
+                2,
+                1,
+                1,
+                0
+            ],
+            [
+                2,
+                0,
+                3,
+                0,
+                1,
+                0,
+                3,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                3,
+                0,
+                2,
+                2,
+                1
+            ],
+            [
+                0,
+                0,
+                3,
+                1,
+                2,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                2,
+                0,
+                0,
+                0,
+                2
+            ],
+            [
+                1,
+                1,
+                1,
+                2,
+                0,
+                3,
+                0,
+                1
+            ],
+            [
+                1,
+                1,
+                1,
+                0,
+                3,
+                0,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            3,
+            4
+        ],
+        "end_point": [
+            0,
+            0
+        ],
+        "input_image": "dataset_weighted_path/rpg_057_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_057_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_057_input.jpg",
+        "save_id": 2641,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 33.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2641.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_058",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 24,
+        "optimal_path": [
+            [
+                2,
+                8
+            ],
+            [
+                1,
+                8
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                6,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                3,
+                0,
+                2,
+                0,
+                1,
+                0,
+                0,
+                3,
+                3
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                0,
+                0,
+                2,
+                3
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                1,
+                1,
+                2,
+                2,
+                1,
+                0
+            ],
+            [
+                1,
+                2,
+                1,
+                1,
+                0,
+                0,
+                2,
+                0,
+                2,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                2,
+                2,
+                1,
+                2
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                0,
+                1,
+                3,
+                2,
+                1,
+                2
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                3,
+                0,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                3,
+                2,
+                0,
+                1,
+                1,
+                1,
+                0,
+                2,
+                2
+            ],
+            [
+                1,
+                1,
+                1,
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                1
+            ],
+            [
+                3,
+                1,
+                2,
+                3,
+                1,
+                1,
+                0,
+                0,
+                0,
+                0
+            ]
+        ],
+        "start_point": [
+            2,
+            8
+        ],
+        "end_point": [
+            6,
+            3
+        ],
+        "input_image": "dataset_weighted_path/rpg_058_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_058_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_058_input.jpg",
+        "save_id": 2642,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 24.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2642.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_059",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 8,
+        "optimal_path": [
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                6,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                3,
+                0,
+                0,
+                3,
+                2,
+                0
+            ],
+            [
+                2,
+                3,
+                1,
+                3,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                3,
+                1,
+                3,
+                2
+            ],
+            [
+                2,
+                0,
+                0,
+                3,
+                0,
+                1,
+                2
+            ],
+            [
+                1,
+                3,
+                0,
+                2,
+                1,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                1,
+                1,
+                1
+            ],
+            [
+                1,
+                1,
+                0,
+                0,
+                1,
+                0,
+                0
+            ]
+        ],
+        "start_point": [
+            2,
+            1
+        ],
+        "end_point": [
+            6,
+            3
+        ],
+        "input_image": "dataset_weighted_path/rpg_059_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_059_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_059_input.jpg",
+        "save_id": 2643,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 8.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2643.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_060",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 8,
+        "optimal_path": [
+            [
+                4,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                0,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                1,
+                1,
+                2,
+                0
+            ],
+            [
+                2,
+                0,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                3,
+                0,
+                0
+            ],
+            [
+                3,
+                1,
+                2,
+                0,
+                0,
+                3
+            ],
+            [
+                2,
+                1,
+                1,
+                0,
+                1,
+                1
+            ],
+            [
+                3,
+                1,
+                0,
+                2,
+                0,
+                0
+            ]
+        ],
+        "start_point": [
+            4,
+            3
+        ],
+        "end_point": [
+            0,
+            3
+        ],
+        "input_image": "dataset_weighted_path/rpg_060_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_060_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_060_input.jpg",
+        "save_id": 2644,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 8.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2644.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_062",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 23,
+        "optimal_path": [
+            [
+                6,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                1,
+                8
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                2,
+                3,
+                1,
+                0,
+                0,
+                1,
+                1,
+                3
+            ],
+            [
+                1,
+                1,
+                1,
+                3,
+                0,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                1,
+                1,
+                2,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                1,
+                3,
+                2,
+                0,
+                1
+            ],
+            [
+                1,
+                1,
+                2,
+                1,
+                1,
+                2,
+                2,
+                2,
+                3
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                1,
+                3,
+                2,
+                0,
+                0
+            ],
+            [
+                3,
+                3,
+                0,
+                2,
+                0,
+                1,
+                0,
+                2,
+                0
+            ],
+            [
+                2,
+                0,
+                2,
+                1,
+                1,
+                0,
+                3,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                0,
+                1,
+                0,
+                1,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            6,
+            2
+        ],
+        "end_point": [
+            1,
+            8
+        ],
+        "input_image": "dataset_weighted_path/rpg_062_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_062_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_062_input.jpg",
+        "save_id": 2646,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 23.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2646.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_064",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 19,
+        "optimal_path": [
+            [
+                3,
+                0
+            ],
+            [
+                4,
+                0
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                0,
+                0,
+                0,
+                3,
+                1,
+                0,
+                3,
+                1
+            ],
+            [
+                0,
+                2,
+                0,
+                0,
+                0,
+                0,
+                3,
+                1,
+                0,
+                3
+            ],
+            [
+                0,
+                0,
+                2,
+                0,
+                1,
+                3,
+                2,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                0,
+                3,
+                3,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                2,
+                0,
+                2,
+                2,
+                0,
+                0
+            ],
+            [
+                2,
+                0,
+                1,
+                3,
+                0,
+                0,
+                1,
+                3,
+                1,
+                2
+            ],
+            [
+                3,
+                3,
+                1,
+                1,
+                1,
+                2,
+                1,
+                2,
+                1,
+                1
+            ],
+            [
+                2,
+                0,
+                2,
+                2,
+                1,
+                0,
+                0,
+                0,
+                1,
+                2
+            ],
+            [
+                1,
+                2,
+                0,
+                1,
+                0,
+                3,
+                1,
+                0,
+                0,
+                2
+            ],
+            [
+                1,
+                1,
+                2,
+                2,
+                1,
+                1,
+                0,
+                1,
+                0,
+                2
+            ]
+        ],
+        "start_point": [
+            3,
+            0
+        ],
+        "end_point": [
+            7,
+            5
+        ],
+        "input_image": "dataset_weighted_path/rpg_064_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_064_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_064_input.jpg",
+        "save_id": 2648,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 19.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2648.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_066",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 7,
+        "optimal_path": [
+            [
+                0,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                1
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                1,
+                3,
+                0,
+                1,
+                3
+            ],
+            [
+                3,
+                1,
+                1,
+                0,
+                3,
+                1
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                3,
+                0,
+                3
+            ],
+            [
+                3,
+                0,
+                0,
+                0,
+                3,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                0,
+                0,
+                3
+            ]
+        ],
+        "start_point": [
+            0,
+            3
+        ],
+        "end_point": [
+            1,
+            1
+        ],
+        "input_image": "dataset_weighted_path/rpg_066_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_066_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_066_input.jpg",
+        "save_id": 2650,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 7.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2650.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_068",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 8,
+        "optimal_path": [
+            [
+                5,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                2,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                1,
+                0,
+                0,
+                0,
+                2
+            ],
+            [
+                2,
+                1,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                1,
+                1,
+                3,
+                1
+            ],
+            [
+                3,
+                0,
+                0,
+                0,
+                2,
+                3
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                1,
+                2
+            ],
+            [
+                2,
+                0,
+                1,
+                0,
+                3,
+                0
+            ]
+        ],
+        "start_point": [
+            5,
+            3
+        ],
+        "end_point": [
+            2,
+            2
+        ],
+        "input_image": "dataset_weighted_path/rpg_068_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_068_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_068_input.jpg",
+        "save_id": 2652,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 8.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2652.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_070",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 22,
+        "optimal_path": [
+            [
+                1,
+                7
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                4,
+                1
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                3,
+                0,
+                1,
+                2,
+                0,
+                1,
+                3
+            ],
+            [
+                1,
+                3,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                1,
+                1,
+                2,
+                0,
+                1,
+                1
+            ],
+            [
+                2,
+                0,
+                1,
+                1,
+                1,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                2,
+                3,
+                0,
+                0,
+                0,
+                0,
+                2
+            ],
+            [
+                3,
+                0,
+                2,
+                0,
+                3,
+                2,
+                3,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                2,
+                1,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                3,
+                3,
+                2,
+                1,
+                2,
+                3
+            ]
+        ],
+        "start_point": [
+            1,
+            7
+        ],
+        "end_point": [
+            4,
+            1
+        ],
+        "input_image": "dataset_weighted_path/rpg_070_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_070_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_070_input.jpg",
+        "save_id": 2654,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 22.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2654.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_072",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 9,
+        "optimal_path": [
+            [
+                0,
+                1
+            ],
+            [
+                0,
+                2
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                1,
+                1,
+                0,
+                3,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                0,
+                1,
+                3,
+                3,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                1,
+                2,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                3,
+                0,
+                0,
+                0,
+                3
+            ],
+            [
+                2,
+                2,
+                1,
+                0,
+                1,
+                3,
+                0
+            ],
+            [
+                0,
+                3,
+                0,
+                2,
+                0,
+                0,
+                3
+            ]
+        ],
+        "start_point": [
+            0,
+            1
+        ],
+        "end_point": [
+            4,
+            4
+        ],
+        "input_image": "dataset_weighted_path/rpg_072_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_072_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_072_input.jpg",
+        "save_id": 2656,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 9.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2656.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_074",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 31,
+        "optimal_path": [
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                0,
+                1,
+                0,
+                2,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                3,
+                3,
+                3,
+                3,
+                3,
+                0
+            ],
+            [
+                0,
+                1,
+                3,
+                2,
+                2,
+                2,
+                0,
+                0,
+                3,
+                3
+            ],
+            [
+                1,
+                3,
+                3,
+                1,
+                0,
+                0,
+                3,
+                1,
+                1,
+                1
+            ],
+            [
+                3,
+                1,
+                0,
+                0,
+                1,
+                3,
+                0,
+                1,
+                0,
+                3
+            ],
+            [
+                0,
+                0,
+                2,
+                0,
+                1,
+                0,
+                2,
+                3,
+                1,
+                0
+            ],
+            [
+                2,
+                0,
+                1,
+                0,
+                1,
+                2,
+                2,
+                0,
+                0,
+                3
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                1,
+                1,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                3,
+                1,
+                0,
+                0,
+                0,
+                1,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                3,
+                1,
+                1,
+                0,
+                0,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            5,
+            8
+        ],
+        "end_point": [
+            1,
+            2
+        ],
+        "input_image": "dataset_weighted_path/rpg_074_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_074_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_074_input.jpg",
+        "save_id": 2658,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 31.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2658.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_076",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 25,
+        "optimal_path": [
+            [
+                0,
+                0
+            ],
+            [
+                0,
+                1
+            ],
+            [
+                0,
+                2
+            ],
+            [
+                0,
+                3
+            ],
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                5
+            ],
+            [
+                0,
+                6
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                1,
+                1,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                3,
+                2,
+                1,
+                1,
+                0
+            ],
+            [
+                0,
+                3,
+                2,
+                1,
+                0,
+                2,
+                0
+            ],
+            [
+                1,
+                2,
+                3,
+                1,
+                1,
+                2,
+                2
+            ],
+            [
+                1,
+                2,
+                0,
+                1,
+                2,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                3,
+                1,
+                1,
+                2
+            ],
+            [
+                2,
+                0,
+                2,
+                0,
+                1,
+                2,
+                2
+            ]
+        ],
+        "start_point": [
+            0,
+            0
+        ],
+        "end_point": [
+            4,
+            6
+        ],
+        "input_image": "dataset_weighted_path/rpg_076_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_076_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_076_input.jpg",
+        "save_id": 2660,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 25.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2660.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_078",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 5,
+        "optimal_path": [
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                6,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                1,
+                0,
+                3,
+                2,
+                3,
+                1
+            ],
+            [
+                2,
+                1,
+                0,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                3,
+                2,
+                1,
+                2,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                2,
+                3,
+                0,
+                3
+            ],
+            [
+                1,
+                0,
+                3,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                0,
+                1,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                1
+            ]
+        ],
+        "start_point": [
+            6,
+            5
+        ],
+        "end_point": [
+            6,
+            2
+        ],
+        "input_image": "dataset_weighted_path/rpg_078_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_078_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_078_input.jpg",
+        "save_id": 2662,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 5.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2662.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_080",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 7,
+        "optimal_path": [
+            [
+                5,
+                0
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                6,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                0,
+                1,
+                3,
+                0,
+                1,
+                1
+            ],
+            [
+                3,
+                0,
+                0,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                1,
+                0,
+                3
+            ],
+            [
+                0,
+                0,
+                0,
+                3,
+                1,
+                0,
+                3
+            ],
+            [
+                2,
+                1,
+                3,
+                3,
+                3,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                0,
+                3,
+                0,
+                2,
+                1
+            ],
+            [
+                3,
+                1,
+                1,
+                0,
+                0,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            5,
+            0
+        ],
+        "end_point": [
+            6,
+            4
+        ],
+        "input_image": "dataset_weighted_path/rpg_080_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_080_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_080_input.jpg",
+        "save_id": 2664,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 7.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2664.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_082",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 16,
+        "optimal_path": [
+            [
+                4,
+                0
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                1
+            ],
+            [
+                8,
+                0
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                2,
+                2,
+                3,
+                2,
+                2,
+                1,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                0,
+                3,
+                1,
+                0,
+                2,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                3,
+                0,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                0,
+                0,
+                0,
+                3,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                3,
+                2,
+                1,
+                3,
+                1,
+                0,
+                3,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                3,
+                0,
+                2,
+                3,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                0,
+                3,
+                0,
+                2,
+                1,
+                3
+            ],
+            [
+                3,
+                3,
+                0,
+                1,
+                1,
+                1,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                1,
+                3,
+                0,
+                1,
+                1,
+                3,
+                0,
+                0
+            ],
+            [
+                3,
+                0,
+                1,
+                3,
+                0,
+                0,
+                1,
+                0,
+                3,
+                0
+            ]
+        ],
+        "start_point": [
+            4,
+            0
+        ],
+        "end_point": [
+            8,
+            0
+        ],
+        "input_image": "dataset_weighted_path/rpg_082_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_082_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_082_input.jpg",
+        "save_id": 2666,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 16.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2666.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_084",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 17,
+        "optimal_path": [
+            [
+                0,
+                6
+            ],
+            [
+                0,
+                5
+            ],
+            [
+                0,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                0,
+                3,
+                0,
+                1,
+                1,
+                1
+            ],
+            [
+                0,
+                2,
+                2,
+                2,
+                0,
+                2,
+                2
+            ],
+            [
+                3,
+                1,
+                1,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                1,
+                2,
+                0
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                1,
+                2,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                3,
+                0,
+                0,
+                1,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            0,
+            6
+        ],
+        "end_point": [
+            5,
+            4
+        ],
+        "input_image": "dataset_weighted_path/rpg_084_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_084_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_084_input.jpg",
+        "save_id": 2668,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 17.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2668.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_086",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 16,
+        "optimal_path": [
+            [
+                0,
+                8
+            ],
+            [
+                1,
+                8
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                6
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                0,
+                0,
+                2,
+                3,
+                1,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                3,
+                2,
+                1,
+                2,
+                0,
+                1,
+                1,
+                3,
+                0,
+                3
+            ],
+            [
+                1,
+                2,
+                0,
+                1,
+                1,
+                1,
+                3,
+                0,
+                1,
+                2
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                1,
+                1,
+                3,
+                1,
+                0,
+                1
+            ],
+            [
+                2,
+                1,
+                1,
+                0,
+                2,
+                2,
+                3,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                2,
+                1,
+                2,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                3,
+                0,
+                0,
+                1,
+                1,
+                1,
+                1
+            ],
+            [
+                1,
+                2,
+                0,
+                2,
+                3,
+                0,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                3,
+                0,
+                0,
+                0,
+                0,
+                3,
+                0,
+                0,
+                2,
+                1
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                1,
+                1,
+                1,
+                2,
+                0,
+                0
+            ]
+        ],
+        "start_point": [
+            0,
+            8
+        ],
+        "end_point": [
+            8,
+            6
+        ],
+        "input_image": "dataset_weighted_path/rpg_086_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_086_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_086_input.jpg",
+        "save_id": 2670,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 16.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2670.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_088",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 3,
+        "optimal_path": [
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                1,
+                1,
+                0,
+                3,
+                1,
+                3,
+                0,
+                3
+            ],
+            [
+                0,
+                0,
+                0,
+                3,
+                0,
+                2,
+                0,
+                1,
+                3
+            ],
+            [
+                0,
+                0,
+                2,
+                1,
+                2,
+                3,
+                0,
+                2,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                1,
+                0,
+                0,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                3,
+                0,
+                1,
+                1,
+                0,
+                0,
+                0,
+                2
+            ],
+            [
+                3,
+                2,
+                0,
+                2,
+                3,
+                2,
+                3,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                0,
+                0,
+                2,
+                2,
+                0
+            ],
+            [
+                0,
+                0,
+                3,
+                0,
+                3,
+                0,
+                1,
+                2,
+                0
+            ],
+            [
+                1,
+                2,
+                0,
+                1,
+                0,
+                0,
+                2,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            4,
+            2
+        ],
+        "end_point": [
+            6,
+            3
+        ],
+        "input_image": "dataset_weighted_path/rpg_088_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_088_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_088_input.jpg",
+        "save_id": 2672,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 3.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2672.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_090",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 15,
+        "optimal_path": [
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                0
+            ],
+            [
+                3,
+                0
+            ],
+            [
+                2,
+                0
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                2,
+                2,
+                1,
+                0
+            ],
+            [
+                2,
+                0,
+                3,
+                3,
+                1,
+                0
+            ],
+            [
+                0,
+                1,
+                3,
+                0,
+                1,
+                3
+            ],
+            [
+                1,
+                3,
+                1,
+                1,
+                1,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                2,
+                0,
+                1,
+                2
+            ]
+        ],
+        "start_point": [
+            4,
+            5
+        ],
+        "end_point": [
+            2,
+            0
+        ],
+        "input_image": "dataset_weighted_path/rpg_090_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_090_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_090_input.jpg",
+        "save_id": 2674,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 15.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2674.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_092",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 3,
+        "optimal_path": [
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                0
+            ],
+            [
+                5,
+                0
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                2,
+                2,
+                1,
+                3,
+                2,
+                0
+            ],
+            [
+                3,
+                1,
+                1,
+                0,
+                1,
+                0,
+                3
+            ],
+            [
+                0,
+                0,
+                0,
+                2,
+                1,
+                1,
+                0
+            ],
+            [
+                3,
+                3,
+                0,
+                1,
+                1,
+                2,
+                3
+            ],
+            [
+                0,
+                3,
+                1,
+                0,
+                0,
+                3,
+                0
+            ],
+            [
+                0,
+                2,
+                0,
+                2,
+                1,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                0,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            6,
+            2
+        ],
+        "end_point": [
+            5,
+            0
+        ],
+        "input_image": "dataset_weighted_path/rpg_092_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_092_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_092_input.jpg",
+        "save_id": 2676,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 3.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2676.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_094",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 19,
+        "optimal_path": [
+            [
+                0,
+                2
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                3,
+                0,
+                3,
+                0,
+                1,
+                3,
+                0
+            ],
+            [
+                0,
+                3,
+                1,
+                0,
+                2,
+                0,
+                1,
+                1
+            ],
+            [
+                3,
+                3,
+                0,
+                3,
+                0,
+                1,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                3,
+                2,
+                1,
+                1,
+                3,
+                1
+            ],
+            [
+                0,
+                1,
+                1,
+                2,
+                2,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                2,
+                3,
+                3,
+                3,
+                0
+            ],
+            [
+                2,
+                0,
+                2,
+                1,
+                1,
+                2,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                1,
+                1,
+                1,
+                2,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            0,
+            2
+        ],
+        "end_point": [
+            3,
+            5
+        ],
+        "input_image": "dataset_weighted_path/rpg_094_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_094_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_094_input.jpg",
+        "save_id": 2678,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 19.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2678.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_096",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 5,
+        "optimal_path": [
+            [
+                5,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                2,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                0,
+                3,
+                0,
+                2,
+                2,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                0,
+                1,
+                3
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                3
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                0,
+                2,
+                1
+            ],
+            [
+                3,
+                0,
+                1,
+                3,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                1,
+                2,
+                3,
+                0,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                2,
+                3,
+                3,
+                0
+            ]
+        ],
+        "start_point": [
+            5,
+            2
+        ],
+        "end_point": [
+            2,
+            2
+        ],
+        "input_image": "dataset_weighted_path/rpg_096_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_096_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_096_input.jpg",
+        "save_id": 2680,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 5.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2680.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_098",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 32,
+        "optimal_path": [
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                2,
+                0,
+                0,
+                3,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                2,
+                1,
+                2,
+                1,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                3,
+                0,
+                2,
+                1,
+                1,
+                2
+            ],
+            [
+                0,
+                3,
+                0,
+                3,
+                2,
+                3,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                3,
+                0,
+                3,
+                1,
+                0,
+                2
+            ],
+            [
+                0,
+                3,
+                0,
+                2,
+                0,
+                2,
+                3,
+                3,
+                1
+            ],
+            [
+                3,
+                0,
+                0,
+                3,
+                1,
+                3,
+                0,
+                1,
+                0
+            ],
+            [
+                3,
+                3,
+                2,
+                3,
+                3,
+                0,
+                0,
+                3,
+                0
+            ],
+            [
+                1,
+                3,
+                1,
+                0,
+                1,
+                0,
+                3,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            1,
+            4
+        ],
+        "end_point": [
+            7,
+            6
+        ],
+        "input_image": "dataset_weighted_path/rpg_098_input.jpg",
+        "result_image": "dataset_weighted_path/rpg_098_result.jpg",
+        "source_image": "Part4/Shortest_path/rpg_098_input.jpg",
+        "save_id": 2682,
+        "IC": false,
+        "IF": true,
+        "WA": true,
+        "VC": true,
+        "VQ": true,
+        "need_hint": true,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 32.",
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path/2682.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4222.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4222.png
new file mode 100644
index 0000000000000000000000000000000000000000..e0406c29e06c684ec276c4addef9e5d43995a3b1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4222.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4b898db4721789b81a25245b59453751bf7b47cba9d06660f774061cef19c1a7
+size 134735
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4223.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4223.png
new file mode 100644
index 0000000000000000000000000000000000000000..34062afb18df1c26154ec3ccf997931be6339d4b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4223.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:971187febb7fd0f0c82dc3d09a9ed20f656982b4a6ce2af4cab1b0f78f6a2df5
+size 165150
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4224.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4224.png
new file mode 100644
index 0000000000000000000000000000000000000000..dfcb8d5cc3c3071567a867584673c07e4446df6a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4224.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ed7fe87e67984aef019a344fea108e55b54c20c53179424092f99750371268a3
+size 162475
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4225.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4225.png
new file mode 100644
index 0000000000000000000000000000000000000000..7bac15cc423504689dfba214d72b78499788659f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4225.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e8e4cf0ade7c3177f8a2be4226fafaa93032a3042359c06869161468d2400b85
+size 142357
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4226.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4226.png
new file mode 100644
index 0000000000000000000000000000000000000000..6fc1785d02afb14f63c8bbb329c3ca26d12ec89e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4226.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bc406ebfb758defd64da88aec178f436ff5ca17741c120af7f009e4951fd753e
+size 160162
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4227.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4227.png
new file mode 100644
index 0000000000000000000000000000000000000000..c85c55f28754829d093197eede7cd8ccc0030177
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4227.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a41bbea6fa642d13a45258bdc2c3a2b6b486a2dad4d1ca27282f186473054e64
+size 144431
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4228.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4228.png
new file mode 100644
index 0000000000000000000000000000000000000000..dca9dba157dd1186abd30459fe123a8e2ccec3b1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4228.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9248697dcade330eb699cbc8550ffcd8c645dde55300e68a42aca1a77a27442d
+size 135071
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4229.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4229.png
new file mode 100644
index 0000000000000000000000000000000000000000..4492f974c0865308a3243158157d3387c405bee5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4229.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e2ddc6df8955ceadd6ba2fcd2fca06715b986fc825fabae70299b5f2db1bc677
+size 143001
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4230.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4230.png
new file mode 100644
index 0000000000000000000000000000000000000000..b8554f709b45e41f253962177c77ef58790d9e03
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4230.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a8a9272a67a40dbf049f0084260b22738e969d72e2e9399f0a1b7c2bcf08b656
+size 129218
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4231.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4231.png
new file mode 100644
index 0000000000000000000000000000000000000000..d038fa47af8dd9ba80d223cdb9bc6eab3c9ca330
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4231.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3a8902f6a7384951375c4362ae65d4c530c34f2efb7a25a2e2194c458f931bc0
+size 159849
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4232.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4232.png
new file mode 100644
index 0000000000000000000000000000000000000000..ba7da6fa8484a90fd8f9535217099238085d8879
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4232.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:db891350197443e8c8c308b02d521331dd6f6e6440113da617f9c112dbf92542
+size 132283
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4233.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4233.png
new file mode 100644
index 0000000000000000000000000000000000000000..5231a16657b61e6aa4e845857ac9120090d6c0e7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4233.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:04949a0839cc91ab0d3e73b6cccfb9bc983fffdf4189f9b4efb195122cd04e74
+size 162995
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4234.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4234.png
new file mode 100644
index 0000000000000000000000000000000000000000..292cf40d3a3556bd44600110fb45851cad1e9679
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4234.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:86283fa71c36cfd451d8f0bc4ecb2de5d14824dc6caea98aaf1c669abc0ec93b
+size 155750
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4235.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4235.png
new file mode 100644
index 0000000000000000000000000000000000000000..4ae03e18f08958042f03087c19a83c0809864761
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4235.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4427c30be5b7351052572019426eb2039f20f2ca5d61b64de63f528d03ba2d7b
+size 157042
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4236.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4236.png
new file mode 100644
index 0000000000000000000000000000000000000000..fbd1a42c4ddca4b67854aef4f55361a73e227be9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4236.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:14a93372f682f62f22459bd714e180eb3bd1b10c2e3dda4451d063f0c3f98061
+size 163338
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4237.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4237.png
new file mode 100644
index 0000000000000000000000000000000000000000..5672867dd5c99840ede35321e8f7d786cab10754
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4237.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:eeef1bb1cc9b2a1a4a624d697f156ae4ceba7030f285d836d77995a347c97f4f
+size 153466
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4238.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4238.png
new file mode 100644
index 0000000000000000000000000000000000000000..cb13d867f796759fbb93b425ef92079eb18384b4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4238.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a26550bd9e1e95813eefcca181cc642d1a2c478fc8d9317a23e6f7a2e60401f9
+size 163549
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4239.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4239.png
new file mode 100644
index 0000000000000000000000000000000000000000..e5cfbebb22f4756bea24f4b7aafe5b0d15dba924
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4239.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6e1a11a604f04ffa857476762915167921d95fb726162a22c5b40d174c06dd2d
+size 158279
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4240.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4240.png
new file mode 100644
index 0000000000000000000000000000000000000000..941bb3d1af03ef8a9cf44d5e39d8fc7d945e63b5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4240.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:169d0212d265454619033b3bd277fa05dfdfebb8690dfa0f0497f7ab5c2e624c
+size 158650
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4241.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4241.png
new file mode 100644
index 0000000000000000000000000000000000000000..c153935d70f68d03e3db9b3282313bda078d25b1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4241.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dfdf0683afea62d704f3ea22191dcd671deba99f874bdfef8c98f9967bf01d18
+size 163344
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4242.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4242.png
new file mode 100644
index 0000000000000000000000000000000000000000..ccb2d043c5dad685c77e385b8358c2143e928e91
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4242.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:db3c312077199d81702804df5be5c78b8944d71b36267a68aa96c6932a314ed4
+size 163262
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4243.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4243.png
new file mode 100644
index 0000000000000000000000000000000000000000..a8afd552a71c99eed728093522a7aad173401379
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4243.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ac9c94990770360dfbb7f4339a024cba8176e364bc99947f6867db81702ffb0a
+size 144813
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4244.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4244.png
new file mode 100644
index 0000000000000000000000000000000000000000..2deedcc1d7357f956a51f0c0e80a40d160fbc875
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4244.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6fa4083ba5e24013eeeaa209e1e761dc25268913fc9c68b0c5680d4305fb4adc
+size 138496
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4245.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4245.png
new file mode 100644
index 0000000000000000000000000000000000000000..3d0b64f5c82979d34682fae8116eec9adbd2a691
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4245.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cd8d9cb56a0fa2aedd1f619213ee6d06809023e2631fd17de9c50f1c6d7e4a82
+size 162201
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4246.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4246.png
new file mode 100644
index 0000000000000000000000000000000000000000..f81d1fa7b35efcd1b7f9b7f8760e23d405a93e35
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4246.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8e52fb3ad7faa75db6200098ff64c26a871aaccbbf4ef7dd268f5171147dee55
+size 141058
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4247.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4247.png
new file mode 100644
index 0000000000000000000000000000000000000000..824974d0d53825dec5b6f40e902df24862b258d7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4247.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e2b9defa06f062b151becee86e3c80abde085e39a5c321650d49f45a7c718935
+size 136830
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4248.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4248.png
new file mode 100644
index 0000000000000000000000000000000000000000..25c4852b4dda3f7b5e7bdbaa33da4345d0d7fb8e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4248.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:059904786cef8ef04219cfd1c66a3c2f480a2eb11f362d22253c31db2f137b3c
+size 138649
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4249.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4249.png
new file mode 100644
index 0000000000000000000000000000000000000000..e42f8aa43ab26d4c00f936e5ce226113f9b0330c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4249.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4ea4ad78da7294a3e4d55d049ba1d8d189e3d60cc03264bef90811f05cc11693
+size 160202
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4250.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4250.png
new file mode 100644
index 0000000000000000000000000000000000000000..40ec11a425088a48b08b4c429d4c99dce28bde5e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4250.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:24764c42cd3124e041294f48145a3e941955c00ccee5bd8f7f908c8016d1cd43
+size 133753
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4251.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4251.png
new file mode 100644
index 0000000000000000000000000000000000000000..c5205722c87ad6e37b5670029ecfff2f0bfd66ea
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4251.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b795ad4947168fe152334f02cb5186a41aef92d85819aed916ebdeb6decd2c3e
+size 161899
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4252.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4252.png
new file mode 100644
index 0000000000000000000000000000000000000000..2d3fd4cd1bfada8a6a4853f31ccff1fe7222a619
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4252.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3bc49bb26f8cc07de712a4304c5054b6ac30ea54635c4455e124dfcfe69313a3
+size 158339
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4253.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4253.png
new file mode 100644
index 0000000000000000000000000000000000000000..5e067a31ce90471d0e0de792d11f6701cfb46aa6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4253.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:13afef0f5fab15232c2d248765b0b1019508ccd9e77d31d880fd641e9991e6e7
+size 137305
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4254.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4254.png
new file mode 100644
index 0000000000000000000000000000000000000000..358aed094eb93a59e86fd1fb9d6dc5efd90d503d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4254.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a5590e9b4d236ea37f9ed766d09baf110260fe8cfc677854aac5446d3de93bdd
+size 134038
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4255.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4255.png
new file mode 100644
index 0000000000000000000000000000000000000000..cd0b4528b6cf17d119f2dc5c9173b0c0ee8ecf47
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4255.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d8e1ee84d1e644d516510ae3b660a77e31fc8b3e22ca898ba5c1bd01d0064b09
+size 160127
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4256.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4256.png
new file mode 100644
index 0000000000000000000000000000000000000000..231deffbe24a1f2926ed8e40b534c39caea9aeb3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4256.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4739a35334362ffabdc348f62df519353867e4e1d7417172143c8814aa615907
+size 157745
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4257.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4257.png
new file mode 100644
index 0000000000000000000000000000000000000000..7df738c091fcde3704e51c81fb623bf41ed5cb20
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4257.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:43759b78cc6543b4c43d659509ce29e844155e6c61238d05557031d702b85ac3
+size 159221
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4258.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4258.png
new file mode 100644
index 0000000000000000000000000000000000000000..1dc8194b7d0b144e9970ee873032be3836f8c852
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4258.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f5e0b794bc070e5a07d6c97bb96cad53c9b1d540150dcfb0f86ac15f4a215d75
+size 159830
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4259.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4259.png
new file mode 100644
index 0000000000000000000000000000000000000000..8c28421ce8b421fef004119a8fd71ae06b11fb68
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4259.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:393bd4b27a11a19287fc27d04174dd45edee31ffcca91e20e494134d95698827
+size 143595
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4260.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4260.png
new file mode 100644
index 0000000000000000000000000000000000000000..d61ffe90e4eb03a975f35db390083235e14928e6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4260.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0da093193c3244600b005c8ac3c8113bfeeaea38a27d478f5a2feb2b24046034
+size 162050
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4261.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4261.png
new file mode 100644
index 0000000000000000000000000000000000000000..4801a8619fd674cecedfb3efcb49f0887a105f53
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4261.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9f80c4d9ba46235181ad76db581400cbd3e8b27cb2a10edc19b98d82286524da
+size 161836
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4262.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4262.png
new file mode 100644
index 0000000000000000000000000000000000000000..9887897d8256afb99da01013ac778335398b95f7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4262.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1f95d7feaa097fdedf2d75bc116aa5f1998231718f26f9cbfb370387f2792b9a
+size 156609
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4263.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4263.png
new file mode 100644
index 0000000000000000000000000000000000000000..309290f07bd86bf2eb4663540198164f86bfb37c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4263.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:31e943b2a55198e76a11149ad8ecd38ba008d5d526da45589bfe7a2114bd3150
+size 155654
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4264.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4264.png
new file mode 100644
index 0000000000000000000000000000000000000000..0def819390ec7d1ed40a573b47e9fd9275d73e66
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4264.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1a0e5a49354d42185a8c69085a83b4c636b58dcc037047eb3d0e894a6538379b
+size 156414
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4265.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4265.png
new file mode 100644
index 0000000000000000000000000000000000000000..d3d9cbe483ee72c929fe3a45afbcf063f6169e86
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4265.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dd4b5c36fcfe0476b939585451f8e0707029efe7f683627ee45d9d822daaa0a2
+size 164738
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4266.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4266.png
new file mode 100644
index 0000000000000000000000000000000000000000..9a60f84ee7c323aae38ccd7cfb6cf26818eb8fa1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4266.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fe636497859a265d2f553eec0174abe3835f186cc1689716dc6bb95322f07ed3
+size 163698
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4267.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4267.png
new file mode 100644
index 0000000000000000000000000000000000000000..a59704c983d08c6610122ede4c1398979419a370
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4267.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bce22eecefce94cfa91338e79e069de148722bc00fd9838322f578c9308e8926
+size 161487
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4268.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4268.png
new file mode 100644
index 0000000000000000000000000000000000000000..2c9083deed84050373048f831b954cb6779ee82e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4268.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3a2287f62658ed5c8f63dff9fb19f6943b508ea5ed862221a7f767be84de538d
+size 167200
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4269.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4269.png
new file mode 100644
index 0000000000000000000000000000000000000000..289abefe3a30dd30c3642c8801fdc2b9fa2f52ea
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4269.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0f1276567cccfd288474efe54d9d7daf0fe8c4a392afb0bfb80e437baa654376
+size 162162
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4270.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4270.png
new file mode 100644
index 0000000000000000000000000000000000000000..2d360b169fc8399d2c511eb047b41b13c95b5e71
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4270.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:875071434573a75b2629c7b927de792d66e5051fad77e9905313caed2d0f8c08
+size 167365
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4271.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4271.png
new file mode 100644
index 0000000000000000000000000000000000000000..c1b0a30a806bf6bd12a324d5bf517bdb25d8aa8f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4271.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:de957f35ccaccd9bace82e430dbaee642849471f26a05303e0bab18577098b46
+size 156127
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4272.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4272.png
new file mode 100644
index 0000000000000000000000000000000000000000..c8ea66af6f519aeb89f356a389716d949a3441b4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4272.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ea15a30238412f063295350f20a26c0b968a6cb82dd3bad9a86bc420bec568a4
+size 154301
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4273.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4273.png
new file mode 100644
index 0000000000000000000000000000000000000000..cf7d995e886f1679070adc7c1ff882de4e5c49c6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4273.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:730d20241cb876f2bd09d166ace3b334b70be6b9235b7e883e6649c103895440
+size 135485
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4274.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4274.png
new file mode 100644
index 0000000000000000000000000000000000000000..a30a73e57476d80216cf6972801350b88208a9ae
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4274.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:84496e824baca4f1a3d1524fee34d19795ff746ab1f5dfeffe7f5dec82c101d3
+size 142374
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4275.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4275.png
new file mode 100644
index 0000000000000000000000000000000000000000..1240843571ac8e03ce90952cadf995654fba6786
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4275.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8f37c7252a8d6d01b080136f1be57afc092fd65c0134f210c02d17d71ccf0cb3
+size 159838
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4276.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4276.png
new file mode 100644
index 0000000000000000000000000000000000000000..d704dde74275f0165e0068700120fe788c92c769
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4276.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fb6410ad063c233f2107614ecd9af8c75d01f7e2bfdadee0dd6b29b2020fecf7
+size 131969
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4277.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4277.png
new file mode 100644
index 0000000000000000000000000000000000000000..3a5cb91f99292a211dfa835910f48e0503f3d173
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4277.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f5a96e601d47d3ec3304ea2d7b2469a4d7b9e03ecd6050d3163967429ea78550
+size 157259
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4278.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4278.png
new file mode 100644
index 0000000000000000000000000000000000000000..05b949b27d78a3e299a4909c979c8b284c45fac0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4278.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b6d25c18cc6c55246dc5e1ce3888553258385bc80e49321eae74d85abf5241c1
+size 169313
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4279.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4279.png
new file mode 100644
index 0000000000000000000000000000000000000000..fe281d859cec68dc5da3da50c905325fc11bed63
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4279.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e37bf1193296cf301f9bbaa0c40c3be6f7ab8fb5c93159491d337d575d7fa42a
+size 166506
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4280.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4280.png
new file mode 100644
index 0000000000000000000000000000000000000000..b37bfc82ab15b68aeb7657d09948a9c531384819
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4280.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:08bd60740312d82d48248fb48d7cb53be85d6fd4bbe90f637daa6e94d8e05865
+size 162015
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4281.png b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4281.png
new file mode 100644
index 0000000000000000000000000000000000000000..2c834a886c0ed5f8516c4d001466a7990de37e58
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4281.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:54535fdd58858e2748da3c86d755953e1d91039ac2f18deba16d42dbe960850b
+size 159826
diff --git a/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/Shortest_Path2.json b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/Shortest_Path2.json
new file mode 100644
index 0000000000000000000000000000000000000000..a98a07fbdaa7feec59197f2c27d62119908def47
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/Shortest_Path2.json
@@ -0,0 +1,9206 @@
+[
+    {
+        "id": "rpg_000",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 8,
+        "optimal_path": [
+            [
+                0,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                3,
+                0,
+                3,
+                0,
+                2
+            ],
+            [
+                2,
+                1,
+                2,
+                2,
+                1,
+                0
+            ],
+            [
+                1,
+                2,
+                2,
+                3,
+                0,
+                3
+            ],
+            [
+                3,
+                3,
+                2,
+                0,
+                1,
+                0
+            ],
+            [
+                1,
+                2,
+                0,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                2,
+                0,
+                0,
+                3,
+                1
+            ]
+        ],
+        "start_point": [
+            0,
+            4
+        ],
+        "end_point": [
+            4,
+            4
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_000_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_000_result.jpg",
+        "save_id": 4222,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 8.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4222.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_001",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 17,
+        "optimal_path": [
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                7,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                1,
+                1,
+                0,
+                0,
+                2,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                0,
+                1,
+                0,
+                3
+            ],
+            [
+                2,
+                0,
+                1,
+                0,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                1,
+                0,
+                3,
+                2
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                0,
+                1,
+                1,
+                3
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                1,
+                1,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                2,
+                1,
+                2,
+                0,
+                3,
+                1
+            ]
+        ],
+        "start_point": [
+            1,
+            4
+        ],
+        "end_point": [
+            7,
+            2
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_001_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_001_result.jpg",
+        "save_id": 4223,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 17.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4223.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_002",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 12,
+        "optimal_path": [
+            [
+                8,
+                1
+            ],
+            [
+                7,
+                1
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                1,
+                0,
+                0,
+                2,
+                0,
+                0,
+                2,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                3,
+                2,
+                2,
+                3,
+                1
+            ],
+            [
+                0,
+                1,
+                2,
+                0,
+                1,
+                3,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                1,
+                0,
+                0,
+                3,
+                1
+            ],
+            [
+                1,
+                2,
+                1,
+                3,
+                1,
+                2,
+                1,
+                3,
+                1
+            ],
+            [
+                2,
+                0,
+                0,
+                0,
+                0,
+                1,
+                1,
+                3,
+                0
+            ],
+            [
+                0,
+                2,
+                0,
+                1,
+                0,
+                3,
+                1,
+                2,
+                2
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                0,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                2,
+                3,
+                0,
+                1,
+                0,
+                3,
+                0
+            ]
+        ],
+        "start_point": [
+            8,
+            1
+        ],
+        "end_point": [
+            7,
+            6
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_002_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_002_result.jpg",
+        "save_id": 4224,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 12.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4224.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_003",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 11,
+        "optimal_path": [
+            [
+                2,
+                1
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                0,
+                2
+            ],
+            [
+                0,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                3,
+                2,
+                0,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                3,
+                0,
+                0,
+                1
+            ],
+            [
+                3,
+                2,
+                0,
+                1,
+                3,
+                0,
+                1
+            ],
+            [
+                1,
+                0,
+                1,
+                2,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                3,
+                1,
+                0
+            ],
+            [
+                0,
+                2,
+                1,
+                0,
+                2,
+                0,
+                3
+            ],
+            [
+                0,
+                0,
+                2,
+                1,
+                0,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            2,
+            1
+        ],
+        "end_point": [
+            0,
+            3
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_003_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_003_result.jpg",
+        "save_id": 4225,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 11.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4225.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_004",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 7,
+        "optimal_path": [
+            [
+                5,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                0,
+                3,
+                0,
+                3,
+                1,
+                0,
+                1,
+                1,
+                2
+            ],
+            [
+                1,
+                1,
+                1,
+                2,
+                1,
+                0,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                0,
+                1,
+                1,
+                1,
+                3,
+                2,
+                0
+            ],
+            [
+                1,
+                0,
+                3,
+                0,
+                1,
+                0,
+                0,
+                1,
+                3,
+                3
+            ],
+            [
+                1,
+                1,
+                1,
+                0,
+                0,
+                0,
+                0,
+                2,
+                0,
+                0
+            ],
+            [
+                2,
+                0,
+                0,
+                2,
+                1,
+                0,
+                0,
+                1,
+                1,
+                1
+            ],
+            [
+                1,
+                0,
+                1,
+                3,
+                1,
+                1,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                3,
+                3,
+                1,
+                3,
+                3
+            ],
+            [
+                0,
+                3,
+                3,
+                1,
+                1,
+                3,
+                1,
+                0,
+                1,
+                1
+            ],
+            [
+                1,
+                3,
+                1,
+                1,
+                3,
+                1,
+                1,
+                2,
+                2,
+                2
+            ]
+        ],
+        "start_point": [
+            5,
+            6
+        ],
+        "end_point": [
+            1,
+            5
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_004_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_004_result.jpg",
+        "save_id": 4226,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 7.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4226.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_005",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 8,
+        "optimal_path": [
+            [
+                5,
+                0
+            ],
+            [
+                6,
+                0
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                2,
+                1,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                3,
+                1,
+                0
+            ],
+            [
+                3,
+                0,
+                3,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                3,
+                0,
+                0,
+                0,
+                3
+            ],
+            [
+                2,
+                0,
+                1,
+                0,
+                1,
+                2,
+                0
+            ],
+            [
+                2,
+                2,
+                0,
+                1,
+                2,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                0,
+                3,
+                1
+            ]
+        ],
+        "start_point": [
+            5,
+            0
+        ],
+        "end_point": [
+            6,
+            3
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_005_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_005_result.jpg",
+        "save_id": 4227,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 8.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4227.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_006",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 8,
+        "optimal_path": [
+            [
+                1,
+                1
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                6,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                3,
+                0,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                3,
+                1,
+                0
+            ],
+            [
+                3,
+                0,
+                3,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                3,
+                0,
+                0,
+                1,
+                3,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                0,
+                0,
+                2
+            ],
+            [
+                2,
+                0,
+                0,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                3,
+                3,
+                1,
+                0,
+                0,
+                3,
+                0
+            ]
+        ],
+        "start_point": [
+            1,
+            1
+        ],
+        "end_point": [
+            6,
+            4
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_006_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_006_result.jpg",
+        "save_id": 4228,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 8.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4228.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_007",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 4,
+        "optimal_path": [
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                1,
+                3,
+                0,
+                0,
+                3,
+                3
+            ],
+            [
+                2,
+                1,
+                0,
+                0,
+                2,
+                0,
+                1
+            ],
+            [
+                1,
+                0,
+                2,
+                0,
+                0,
+                0,
+                2
+            ],
+            [
+                0,
+                3,
+                2,
+                1,
+                2,
+                0,
+                3
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                0,
+                0,
+                2
+            ],
+            [
+                1,
+                0,
+                2,
+                0,
+                3,
+                3,
+                1
+            ],
+            [
+                0,
+                3,
+                0,
+                2,
+                2,
+                0,
+                2
+            ]
+        ],
+        "start_point": [
+            1,
+            4
+        ],
+        "end_point": [
+            4,
+            5
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_007_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_007_result.jpg",
+        "save_id": 4229,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 4.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4229.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_008",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 20,
+        "optimal_path": [
+            [
+                0,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                2,
+                1
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                0,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                2,
+                3,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                1,
+                3,
+                2,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                3,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                3,
+                3
+            ]
+        ],
+        "start_point": [
+            0,
+            5
+        ],
+        "end_point": [
+            2,
+            1
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_008_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_008_result.jpg",
+        "save_id": 4230,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 20.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4230.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_009",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 11,
+        "optimal_path": [
+            [
+                6,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                4,
+                0
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                3,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                3,
+                3,
+                0,
+                0,
+                3,
+                0,
+                1,
+                2,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                3,
+                3,
+                1,
+                1,
+                3,
+                2,
+                0
+            ],
+            [
+                3,
+                1,
+                0,
+                2,
+                0,
+                1,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                3,
+                1,
+                0,
+                1,
+                0,
+                0,
+                1,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                1,
+                2,
+                0,
+                0,
+                3,
+                1,
+                0,
+                1
+            ],
+            [
+                1,
+                3,
+                3,
+                0,
+                2,
+                3,
+                2,
+                3,
+                2,
+                1
+            ],
+            [
+                2,
+                1,
+                1,
+                0,
+                0,
+                3,
+                0,
+                3,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                3,
+                1,
+                3,
+                0,
+                0,
+                2,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                2,
+                1,
+                0,
+                0,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                1,
+                3,
+                3,
+                0,
+                1,
+                2
+            ]
+        ],
+        "start_point": [
+            6,
+            0
+        ],
+        "end_point": [
+            3,
+            2
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_009_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_009_result.jpg",
+        "save_id": 4231,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 11.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4231.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_010",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 9,
+        "optimal_path": [
+            [
+                0,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                1
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                2,
+                2,
+                2,
+                0,
+                3
+            ],
+            [
+                3,
+                3,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                2,
+                0,
+                1
+            ],
+            [
+                1,
+                0,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                1,
+                2
+            ],
+            [
+                1,
+                3,
+                2,
+                1,
+                2,
+                0
+            ]
+        ],
+        "start_point": [
+            0,
+            4
+        ],
+        "end_point": [
+            4,
+            1
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_010_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_010_result.jpg",
+        "save_id": 4232,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 9.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4232.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_011",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 30,
+        "optimal_path": [
+            [
+                9,
+                7
+            ],
+            [
+                9,
+                8
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                0,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                2,
+                2,
+                3,
+                1,
+                1,
+                0,
+                0,
+                1,
+                2
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                1,
+                1,
+                0,
+                3,
+                3,
+                3
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                0,
+                0,
+                2,
+                0,
+                2,
+                1
+            ],
+            [
+                1,
+                0,
+                3,
+                2,
+                1,
+                3,
+                0,
+                2,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                1,
+                3,
+                2,
+                1,
+                3,
+                0
+            ],
+            [
+                0,
+                3,
+                1,
+                1,
+                1,
+                1,
+                1,
+                3,
+                0,
+                2
+            ],
+            [
+                0,
+                3,
+                1,
+                1,
+                2,
+                2,
+                0,
+                0,
+                2,
+                1
+            ],
+            [
+                1,
+                2,
+                3,
+                0,
+                3,
+                0,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                2,
+                1,
+                2,
+                0,
+                2,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                2,
+                1,
+                3,
+                1,
+                0,
+                1
+            ]
+        ],
+        "start_point": [
+            9,
+            7
+        ],
+        "end_point": [
+            0,
+            4
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_011_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_011_result.jpg",
+        "save_id": 4233,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 30.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4233.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_012",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 14,
+        "optimal_path": [
+            [
+                9,
+                5
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                6,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                1,
+                3,
+                0,
+                2,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                0,
+                2,
+                2
+            ],
+            [
+                3,
+                3,
+                3,
+                0,
+                0,
+                3,
+                2,
+                0,
+                1,
+                0
+            ],
+            [
+                3,
+                1,
+                3,
+                3,
+                1,
+                0,
+                1,
+                0,
+                1,
+                1
+            ],
+            [
+                2,
+                1,
+                0,
+                3,
+                1,
+                3,
+                1,
+                1,
+                1,
+                2
+            ],
+            [
+                1,
+                0,
+                1,
+                3,
+                1,
+                0,
+                1,
+                2,
+                3,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                0,
+                3,
+                0,
+                0,
+                2,
+                1,
+                3
+            ],
+            [
+                0,
+                3,
+                0,
+                0,
+                0,
+                3,
+                1,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                3,
+                1,
+                0,
+                2,
+                3,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                3,
+                3,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            9,
+            5
+        ],
+        "end_point": [
+            6,
+            5
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_012_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_012_result.jpg",
+        "save_id": 4234,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 14.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4234.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_013",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 6,
+        "optimal_path": [
+            [
+                0,
+                3
+            ],
+            [
+                0,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                2,
+                3,
+                1,
+                0,
+                1,
+                2,
+                0,
+                1
+            ],
+            [
+                2,
+                2,
+                1,
+                0,
+                0,
+                0,
+                2,
+                0,
+                0
+            ],
+            [
+                0,
+                3,
+                1,
+                1,
+                0,
+                3,
+                2,
+                0,
+                0
+            ],
+            [
+                0,
+                2,
+                2,
+                0,
+                1,
+                1,
+                3,
+                2,
+                1
+            ],
+            [
+                2,
+                1,
+                0,
+                0,
+                2,
+                0,
+                3,
+                0,
+                0
+            ],
+            [
+                3,
+                1,
+                2,
+                0,
+                1,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                3,
+                1,
+                0,
+                0,
+                2,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                0,
+                2
+            ],
+            [
+                3,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                1,
+                2
+            ]
+        ],
+        "start_point": [
+            0,
+            3
+        ],
+        "end_point": [
+            3,
+            4
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_013_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_013_result.jpg",
+        "save_id": 4235,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 6.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4235.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_014",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 21,
+        "optimal_path": [
+            [
+                8,
+                5
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                6
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                1,
+                0,
+                2,
+                1,
+                1,
+                2,
+                2,
+                2
+            ],
+            [
+                1,
+                3,
+                3,
+                1,
+                3,
+                1,
+                2,
+                2,
+                2
+            ],
+            [
+                1,
+                1,
+                3,
+                0,
+                1,
+                0,
+                3,
+                2,
+                3
+            ],
+            [
+                0,
+                2,
+                1,
+                0,
+                3,
+                1,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                3,
+                0,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                3,
+                2,
+                1,
+                0,
+                1,
+                0,
+                2,
+                2,
+                0
+            ],
+            [
+                2,
+                1,
+                0,
+                1,
+                1,
+                1,
+                2,
+                2,
+                0
+            ],
+            [
+                0,
+                0,
+                3,
+                0,
+                0,
+                0,
+                0,
+                2,
+                0
+            ],
+            [
+                0,
+                3,
+                1,
+                2,
+                0,
+                2,
+                0,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            8,
+            5
+        ],
+        "end_point": [
+            1,
+            6
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_014_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_014_result.jpg",
+        "save_id": 4236,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 21.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4236.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_015",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 7,
+        "optimal_path": [
+            [
+                3,
+                9
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                1,
+                6
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                0,
+                0,
+                0,
+                0,
+                0,
+                3,
+                3,
+                0
+            ],
+            [
+                1,
+                3,
+                3,
+                2,
+                2,
+                0,
+                0,
+                0,
+                1,
+                2
+            ],
+            [
+                0,
+                3,
+                1,
+                3,
+                1,
+                0,
+                3,
+                0,
+                3,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                0,
+                3,
+                3,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                0,
+                0,
+                0,
+                0,
+                0,
+                3
+            ],
+            [
+                3,
+                0,
+                0,
+                0,
+                2,
+                0,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                1,
+                2,
+                2,
+                0
+            ],
+            [
+                1,
+                3,
+                3,
+                0,
+                1,
+                0,
+                0,
+                1,
+                3,
+                0
+            ],
+            [
+                1,
+                1,
+                2,
+                0,
+                0,
+                3,
+                2,
+                0,
+                0,
+                0
+            ],
+            [
+                3,
+                0,
+                1,
+                1,
+                0,
+                1,
+                0,
+                1,
+                2,
+                1
+            ]
+        ],
+        "start_point": [
+            3,
+            9
+        ],
+        "end_point": [
+            1,
+            6
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_015_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_015_result.jpg",
+        "save_id": 4237,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 7.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4237.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_016",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 14,
+        "optimal_path": [
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                1,
+                3,
+                1,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                3,
+                0,
+                2,
+                3,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                2,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                2,
+                2,
+                0,
+                1
+            ],
+            [
+                2,
+                3,
+                0,
+                0,
+                3,
+                0,
+                0,
+                2
+            ],
+            [
+                2,
+                2,
+                1,
+                3,
+                1,
+                0,
+                2,
+                0
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                0,
+                1,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            4,
+            3
+        ],
+        "end_point": [
+            6,
+            5
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_016_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_016_result.jpg",
+        "save_id": 4238,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 14.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4238.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_017",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 19,
+        "optimal_path": [
+            [
+                3,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                6,
+                5
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                6,
+                1
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                0,
+                0,
+                1,
+                1,
+                0,
+                2,
+                3
+            ],
+            [
+                1,
+                1,
+                0,
+                2,
+                2,
+                2,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                1,
+                2,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                3,
+                1,
+                0,
+                1,
+                1,
+                2,
+                0
+            ],
+            [
+                0,
+                3,
+                2,
+                3,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                0,
+                0,
+                3,
+                0,
+                3,
+                0
+            ],
+            [
+                1,
+                1,
+                3,
+                0,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                2,
+                3,
+                1,
+                3,
+                2,
+                0,
+                0,
+                0
+            ]
+        ],
+        "start_point": [
+            3,
+            6
+        ],
+        "end_point": [
+            6,
+            1
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_017_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_017_result.jpg",
+        "save_id": 4239,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 19.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4239.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_018",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 11,
+        "optimal_path": [
+            [
+                6,
+                2
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                0,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                3,
+                0,
+                0,
+                1,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                1,
+                3,
+                0,
+                1,
+                1,
+                3,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                3,
+                0,
+                3,
+                3,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                2
+            ],
+            [
+                1,
+                2,
+                1,
+                3,
+                2,
+                1,
+                2,
+                1,
+                1
+            ],
+            [
+                2,
+                2,
+                1,
+                1,
+                1,
+                2,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                2,
+                0,
+                1,
+                0,
+                0,
+                3,
+                2
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                3,
+                2,
+                1
+            ],
+            [
+                3,
+                1,
+                3,
+                1,
+                0,
+                1,
+                2,
+                3,
+                1
+            ]
+        ],
+        "start_point": [
+            6,
+            2
+        ],
+        "end_point": [
+            0,
+            3
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_018_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_018_result.jpg",
+        "save_id": 4240,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 11.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4240.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_019",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 34,
+        "optimal_path": [
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                1,
+                8
+            ],
+            [
+                2,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                3,
+                9
+            ],
+            [
+                4,
+                9
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                2,
+                1,
+                2,
+                0,
+                1,
+                3,
+                0,
+                1,
+                2
+            ],
+            [
+                2,
+                1,
+                0,
+                3,
+                2,
+                1,
+                1,
+                0,
+                1,
+                3
+            ],
+            [
+                2,
+                0,
+                1,
+                3,
+                0,
+                0,
+                2,
+                1,
+                1,
+                2
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                3,
+                0,
+                2,
+                2,
+                1,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                0,
+                0,
+                0,
+                3,
+                2,
+                1
+            ],
+            [
+                1,
+                2,
+                0,
+                1,
+                0,
+                1,
+                1,
+                1,
+                3,
+                3
+            ],
+            [
+                0,
+                0,
+                3,
+                2,
+                0,
+                2,
+                0,
+                1,
+                3,
+                3
+            ],
+            [
+                2,
+                0,
+                0,
+                2,
+                2,
+                1,
+                0,
+                3,
+                0,
+                1
+            ],
+            [
+                1,
+                2,
+                1,
+                2,
+                1,
+                0,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                2,
+                0,
+                1,
+                0,
+                0,
+                0,
+                3,
+                2,
+                3,
+                1
+            ]
+        ],
+        "start_point": [
+            1,
+            2
+        ],
+        "end_point": [
+            4,
+            9
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_019_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_019_result.jpg",
+        "save_id": 4241,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 34.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4241.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_020",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 12,
+        "optimal_path": [
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                1,
+                0,
+                1,
+                0,
+                3,
+                1,
+                2,
+                3,
+                1
+            ],
+            [
+                2,
+                0,
+                0,
+                0,
+                3,
+                0,
+                1,
+                3,
+                1,
+                3
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                3,
+                1,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                2,
+                0,
+                0,
+                0,
+                1,
+                0,
+                3
+            ],
+            [
+                3,
+                2,
+                0,
+                1,
+                2,
+                2,
+                1,
+                0,
+                3,
+                2
+            ],
+            [
+                1,
+                1,
+                3,
+                0,
+                0,
+                2,
+                1,
+                1,
+                3,
+                1
+            ],
+            [
+                1,
+                1,
+                0,
+                0,
+                1,
+                2,
+                1,
+                0,
+                1,
+                1
+            ],
+            [
+                2,
+                0,
+                2,
+                3,
+                1,
+                1,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                2,
+                0,
+                3,
+                0,
+                0,
+                0,
+                0,
+                3,
+                3,
+                2
+            ],
+            [
+                1,
+                3,
+                0,
+                1,
+                0,
+                1,
+                0,
+                1,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            5,
+            3
+        ],
+        "end_point": [
+            5,
+            6
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_020_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_020_result.jpg",
+        "save_id": 4242,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 12.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4242.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_021",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 16,
+        "optimal_path": [
+            [
+                0,
+                2
+            ],
+            [
+                0,
+                3
+            ],
+            [
+                0,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                2,
+                2,
+                1,
+                2,
+                1,
+                3
+            ],
+            [
+                1,
+                2,
+                1,
+                3,
+                0,
+                1,
+                2
+            ],
+            [
+                1,
+                1,
+                2,
+                2,
+                0,
+                2,
+                1
+            ],
+            [
+                0,
+                1,
+                3,
+                3,
+                0,
+                3,
+                3
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                3,
+                0,
+                1,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                2,
+                0
+            ]
+        ],
+        "start_point": [
+            0,
+            2
+        ],
+        "end_point": [
+            4,
+            5
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_021_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_021_result.jpg",
+        "save_id": 4243,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 16.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4243.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_022",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 12,
+        "optimal_path": [
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                1,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                2,
+                0,
+                0,
+                2,
+                1
+            ],
+            [
+                2,
+                0,
+                1,
+                3,
+                1,
+                1
+            ],
+            [
+                1,
+                1,
+                3,
+                1,
+                2,
+                0
+            ],
+            [
+                3,
+                0,
+                2,
+                0,
+                2,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                2,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                3,
+                1,
+                0,
+                1
+            ]
+        ],
+        "start_point": [
+            2,
+            3
+        ],
+        "end_point": [
+            1,
+            5
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_022_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_022_result.jpg",
+        "save_id": 4244,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 12.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4244.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_023",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 25,
+        "optimal_path": [
+            [
+                6,
+                0
+            ],
+            [
+                7,
+                0
+            ],
+            [
+                8,
+                0
+            ],
+            [
+                9,
+                0
+            ],
+            [
+                9,
+                1
+            ],
+            [
+                9,
+                2
+            ],
+            [
+                9,
+                3
+            ],
+            [
+                9,
+                4
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                0,
+                3,
+                3,
+                1,
+                2,
+                1,
+                0,
+                3,
+                1
+            ],
+            [
+                2,
+                1,
+                0,
+                2,
+                1,
+                0,
+                3,
+                1,
+                2,
+                1
+            ],
+            [
+                1,
+                0,
+                2,
+                2,
+                0,
+                1,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                3,
+                3,
+                1,
+                1,
+                1,
+                2,
+                0,
+                3
+            ],
+            [
+                0,
+                3,
+                3,
+                1,
+                3,
+                0,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                3,
+                1,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                2,
+                0,
+                3,
+                1,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                1,
+                1,
+                3,
+                1,
+                2,
+                3,
+                2,
+                2
+            ],
+            [
+                0,
+                3,
+                1,
+                2,
+                1,
+                0,
+                1,
+                0,
+                1,
+                3
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                2,
+                0,
+                0,
+                2,
+                1,
+                2
+            ]
+        ],
+        "start_point": [
+            6,
+            0
+        ],
+        "end_point": [
+            8,
+            8
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_023_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_023_result.jpg",
+        "save_id": 4245,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 25.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4245.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_024",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 31,
+        "optimal_path": [
+            [
+                5,
+                5
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                0,
+                3
+            ],
+            [
+                0,
+                2
+            ],
+            [
+                0,
+                1
+            ],
+            [
+                0,
+                0
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                1,
+                2,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                3,
+                1,
+                1,
+                0,
+                3,
+                2
+            ],
+            [
+                2,
+                1,
+                1,
+                1,
+                2,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                3,
+                3,
+                2,
+                2,
+                0
+            ],
+            [
+                1,
+                3,
+                1,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                2,
+                0,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            5,
+            5
+        ],
+        "end_point": [
+            0,
+            0
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_024_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_024_result.jpg",
+        "save_id": 4246,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 31.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4246.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_025",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 10,
+        "optimal_path": [
+            [
+                3,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                1,
+                1
+            ],
+            [
+                2,
+                0,
+                3,
+                3,
+                3,
+                3,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                0,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                3,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                3,
+                1,
+                2,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                1,
+                3,
+                1
+            ]
+        ],
+        "start_point": [
+            3,
+            4
+        ],
+        "end_point": [
+            2,
+            2
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_025_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_025_result.jpg",
+        "save_id": 4247,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 10.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4247.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_026",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 7,
+        "optimal_path": [
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                0
+            ],
+            [
+                1,
+                0
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                3,
+                1,
+                1,
+                0
+            ],
+            [
+                0,
+                2,
+                1,
+                3,
+                2,
+                2
+            ],
+            [
+                1,
+                1,
+                1,
+                3,
+                1,
+                1
+            ],
+            [
+                2,
+                2,
+                2,
+                0,
+                1,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                0,
+                1,
+                2
+            ],
+            [
+                0,
+                0,
+                2,
+                0,
+                2,
+                3
+            ]
+        ],
+        "start_point": [
+            2,
+            2
+        ],
+        "end_point": [
+            1,
+            0
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_026_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_026_result.jpg",
+        "save_id": 4248,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 7.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4248.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_027",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 11,
+        "optimal_path": [
+            [
+                0,
+                1
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                7,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                2,
+                3,
+                3,
+                1,
+                3,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                2,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                3,
+                0,
+                1,
+                0,
+                3,
+                1
+            ],
+            [
+                3,
+                1,
+                1,
+                0,
+                0,
+                2,
+                0,
+                0
+            ],
+            [
+                2,
+                0,
+                1,
+                0,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                2,
+                0,
+                1,
+                0,
+                0,
+                1,
+                2,
+                0
+            ],
+            [
+                3,
+                3,
+                2,
+                0,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                0,
+                1,
+                2,
+                2
+            ]
+        ],
+        "start_point": [
+            0,
+            1
+        ],
+        "end_point": [
+            7,
+            3
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_027_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_027_result.jpg",
+        "save_id": 4249,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 11.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4249.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_028",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 13,
+        "optimal_path": [
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                3,
+                0,
+                1,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                3,
+                2,
+                0,
+                2,
+                1,
+                2
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                2,
+                0
+            ],
+            [
+                3,
+                0,
+                0,
+                0,
+                0,
+                3
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                0,
+                0
+            ]
+        ],
+        "start_point": [
+            1,
+            4
+        ],
+        "end_point": [
+            5,
+            3
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_028_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_028_result.jpg",
+        "save_id": 4250,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 13.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4250.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_029",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 11,
+        "optimal_path": [
+            [
+                7,
+                0
+            ],
+            [
+                6,
+                0
+            ],
+            [
+                5,
+                0
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                2,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                2,
+                2,
+                2,
+                0,
+                1,
+                2,
+                1
+            ],
+            [
+                0,
+                0,
+                3,
+                0,
+                1,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                0,
+                3,
+                0,
+                1
+            ],
+            [
+                3,
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                3,
+                0,
+                3,
+                3
+            ],
+            [
+                0,
+                0,
+                1,
+                2,
+                0,
+                3,
+                1,
+                2
+            ],
+            [
+                1,
+                1,
+                1,
+                0,
+                0,
+                3,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            7,
+            0
+        ],
+        "end_point": [
+            2,
+            2
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_029_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_029_result.jpg",
+        "save_id": 4251,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 11.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4251.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_030",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 16,
+        "optimal_path": [
+            [
+                9,
+                9
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                7,
+                8
+            ],
+            [
+                6,
+                8
+            ],
+            [
+                6,
+                9
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                4,
+                9
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                1,
+                7
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                0,
+                0,
+                3,
+                0,
+                2,
+                1,
+                0,
+                1,
+                2
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                2,
+                0,
+                0,
+                0,
+                3,
+                0
+            ],
+            [
+                0,
+                1,
+                0,
+                2,
+                0,
+                1,
+                2,
+                0,
+                3,
+                0
+            ],
+            [
+                1,
+                3,
+                3,
+                1,
+                0,
+                0,
+                2,
+                0,
+                3,
+                0
+            ],
+            [
+                2,
+                0,
+                1,
+                0,
+                0,
+                0,
+                3,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                3,
+                0,
+                2,
+                0
+            ],
+            [
+                1,
+                3,
+                1,
+                0,
+                2,
+                3,
+                0,
+                3,
+                0,
+                1
+            ],
+            [
+                2,
+                0,
+                2,
+                0,
+                0,
+                2,
+                2,
+                0,
+                0,
+                2
+            ],
+            [
+                0,
+                3,
+                1,
+                0,
+                2,
+                3,
+                1,
+                2,
+                0,
+                0
+            ],
+            [
+                2,
+                0,
+                1,
+                3,
+                1,
+                3,
+                0,
+                1,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            9,
+            9
+        ],
+        "end_point": [
+            1,
+            7
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_030_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_030_result.jpg",
+        "save_id": 4252,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 16.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4252.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_031",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 14,
+        "optimal_path": [
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                1
+            ],
+            [
+                2,
+                0
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                1,
+                0,
+                1,
+                0,
+                1,
+                1
+            ],
+            [
+                2,
+                2,
+                0,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                0,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                3,
+                0,
+                0,
+                3,
+                0,
+                3,
+                0
+            ],
+            [
+                0,
+                0,
+                3,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                2,
+                0,
+                0,
+                2
+            ],
+            [
+                3,
+                0,
+                1,
+                0,
+                1,
+                0,
+                2
+            ]
+        ],
+        "start_point": [
+            1,
+            4
+        ],
+        "end_point": [
+            2,
+            0
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_031_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_031_result.jpg",
+        "save_id": 4253,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 14.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4253.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_032",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 12,
+        "optimal_path": [
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                1
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                2,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                0,
+                2,
+                1,
+                2
+            ],
+            [
+                2,
+                1,
+                0,
+                1,
+                3,
+                0
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                3,
+                0
+            ],
+            [
+                3,
+                0,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                3,
+                2,
+                0,
+                1,
+                0,
+                3
+            ]
+        ],
+        "start_point": [
+            5,
+            4
+        ],
+        "end_point": [
+            5,
+            1
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_032_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_032_result.jpg",
+        "save_id": 4254,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 12.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4254.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_033",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 17,
+        "optimal_path": [
+            [
+                8,
+                6
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                2,
+                1,
+                1,
+                0,
+                1,
+                2,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                3,
+                1,
+                1,
+                0,
+                2,
+                1,
+                2,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                0,
+                1,
+                3,
+                3,
+                2,
+                0
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                2,
+                2,
+                2,
+                1,
+                0,
+                3
+            ],
+            [
+                0,
+                1,
+                3,
+                0,
+                0,
+                1,
+                0,
+                3,
+                1,
+                0
+            ],
+            [
+                3,
+                0,
+                0,
+                0,
+                3,
+                0,
+                3,
+                1,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                1,
+                3,
+                3
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                2,
+                2,
+                2,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                0,
+                2,
+                1,
+                1,
+                1,
+                3
+            ]
+        ],
+        "start_point": [
+            8,
+            6
+        ],
+        "end_point": [
+            4,
+            4
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_033_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_033_result.jpg",
+        "save_id": 4255,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 17.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4255.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_034",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 17,
+        "optimal_path": [
+            [
+                7,
+                2
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                7,
+                5
+            ],
+            [
+                7,
+                6
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                4,
+                8
+            ],
+            [
+                3,
+                8
+            ],
+            [
+                2,
+                8
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                1,
+                0,
+                0,
+                2,
+                0,
+                0,
+                2,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                1,
+                0,
+                3,
+                0,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                2,
+                0,
+                0,
+                3,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                2,
+                0,
+                1,
+                1,
+                0,
+                2,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                1,
+                3,
+                3,
+                0,
+                3,
+                1,
+                2
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                1,
+                1,
+                2,
+                0,
+                0,
+                2
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                2,
+                1,
+                3,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                0,
+                2,
+                1,
+                0,
+                0,
+                0,
+                0,
+                1,
+                0
+            ],
+            [
+                1,
+                2,
+                0,
+                1,
+                0,
+                3,
+                1,
+                0,
+                0,
+                3
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                0,
+                0,
+                2,
+                0,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            7,
+            2
+        ],
+        "end_point": [
+            2,
+            8
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_034_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_034_result.jpg",
+        "save_id": 4256,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 17.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4256.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_035",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 11,
+        "optimal_path": [
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                8,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                0,
+                0,
+                3,
+                1,
+                0,
+                0,
+                2,
+                1
+            ],
+            [
+                3,
+                0,
+                2,
+                0,
+                2,
+                1,
+                2,
+                3,
+                1
+            ],
+            [
+                1,
+                3,
+                3,
+                3,
+                1,
+                0,
+                0,
+                3,
+                1
+            ],
+            [
+                0,
+                3,
+                1,
+                0,
+                0,
+                1,
+                1,
+                2,
+                3
+            ],
+            [
+                2,
+                0,
+                3,
+                0,
+                3,
+                2,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                3,
+                0,
+                0,
+                3,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                3,
+                1,
+                0,
+                2,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                2,
+                3,
+                3,
+                1,
+                1,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                1,
+                1,
+                2,
+                1,
+                3,
+                0,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            5,
+            2
+        ],
+        "end_point": [
+            8,
+            4
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_035_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_035_result.jpg",
+        "save_id": 4257,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 11.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4257.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_036",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 18,
+        "optimal_path": [
+            [
+                9,
+                6
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                1,
+                8
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                0,
+                1,
+                1,
+                1,
+                0,
+                3,
+                3,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                3,
+                3,
+                3,
+                1,
+                1,
+                0,
+                2
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                1,
+                0,
+                0,
+                2,
+                0,
+                1
+            ],
+            [
+                1,
+                3,
+                3,
+                2,
+                3,
+                0,
+                1,
+                0,
+                2,
+                2
+            ],
+            [
+                2,
+                1,
+                0,
+                1,
+                0,
+                0,
+                0,
+                3,
+                3,
+                0
+            ],
+            [
+                1,
+                0,
+                3,
+                0,
+                0,
+                1,
+                0,
+                1,
+                0,
+                3
+            ],
+            [
+                1,
+                2,
+                0,
+                0,
+                1,
+                0,
+                0,
+                0,
+                3,
+                3
+            ],
+            [
+                2,
+                2,
+                1,
+                1,
+                0,
+                0,
+                1,
+                0,
+                2,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                0,
+                2,
+                0,
+                0,
+                3,
+                2
+            ],
+            [
+                1,
+                2,
+                0,
+                0,
+                3,
+                1,
+                2,
+                1,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            9,
+            6
+        ],
+        "end_point": [
+            1,
+            8
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_036_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_036_result.jpg",
+        "save_id": 4258,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 18.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4258.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_037",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 18,
+        "optimal_path": [
+            [
+                1,
+                0
+            ],
+            [
+                2,
+                0
+            ],
+            [
+                3,
+                0
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                3,
+                3,
+                3,
+                1,
+                3,
+                1
+            ],
+            [
+                1,
+                1,
+                3,
+                1,
+                0,
+                2,
+                0
+            ],
+            [
+                0,
+                2,
+                2,
+                0,
+                1,
+                1,
+                3
+            ],
+            [
+                0,
+                0,
+                3,
+                1,
+                3,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                2,
+                3,
+                1,
+                0,
+                3,
+                0
+            ],
+            [
+                0,
+                3,
+                0,
+                1,
+                1,
+                3,
+                1
+            ]
+        ],
+        "start_point": [
+            1,
+            0
+        ],
+        "end_point": [
+            1,
+            4
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_037_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_037_result.jpg",
+        "save_id": 4259,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 18.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4259.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_038",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 8,
+        "optimal_path": [
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                6,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                3,
+                1,
+                0,
+                0,
+                0,
+                1,
+                0,
+                2,
+                3
+            ],
+            [
+                1,
+                1,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                2,
+                2
+            ],
+            [
+                3,
+                0,
+                0,
+                1,
+                3,
+                1,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                3,
+                2,
+                1,
+                2,
+                3,
+                3,
+                2,
+                0,
+                0
+            ],
+            [
+                3,
+                2,
+                3,
+                3,
+                1,
+                1,
+                1,
+                0,
+                0,
+                3
+            ],
+            [
+                0,
+                3,
+                1,
+                0,
+                2,
+                0,
+                0,
+                3,
+                1,
+                2
+            ],
+            [
+                1,
+                3,
+                1,
+                1,
+                1,
+                1,
+                0,
+                1,
+                2,
+                2
+            ],
+            [
+                3,
+                0,
+                0,
+                1,
+                2,
+                3,
+                0,
+                0,
+                2,
+                0
+            ],
+            [
+                1,
+                3,
+                1,
+                0,
+                0,
+                1,
+                0,
+                2,
+                1,
+                0
+            ],
+            [
+                3,
+                1,
+                2,
+                1,
+                1,
+                0,
+                0,
+                0,
+                3,
+                1
+            ]
+        ],
+        "start_point": [
+            8,
+            5
+        ],
+        "end_point": [
+            6,
+            3
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_038_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_038_result.jpg",
+        "save_id": 4260,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 8.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4260.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_039",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 10,
+        "optimal_path": [
+            [
+                7,
+                6
+            ],
+            [
+                6,
+                6
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                3,
+                7
+            ],
+            [
+                2,
+                7
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                2,
+                0,
+                0,
+                1,
+                3,
+                0,
+                1
+            ],
+            [
+                0,
+                2,
+                0,
+                0,
+                2,
+                1,
+                1,
+                1
+            ],
+            [
+                1,
+                1,
+                1,
+                3,
+                0,
+                1,
+                2,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                1,
+                2,
+                0,
+                0,
+                0,
+                2
+            ],
+            [
+                3,
+                0,
+                0,
+                3,
+                0,
+                2,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                3,
+                0,
+                1,
+                2,
+                1,
+                3
+            ],
+            [
+                3,
+                0,
+                3,
+                2,
+                2,
+                1,
+                0,
+                0
+            ]
+        ],
+        "start_point": [
+            7,
+            6
+        ],
+        "end_point": [
+            2,
+            7
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_039_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_039_result.jpg",
+        "save_id": 4261,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 10.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4261.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_040",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 22,
+        "optimal_path": [
+            [
+                6,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                0,
+                3
+            ],
+            [
+                0,
+                4
+            ],
+            [
+                0,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                2,
+                1,
+                0,
+                2,
+                2,
+                0,
+                3
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                0,
+                2,
+                0,
+                1
+            ],
+            [
+                2,
+                0,
+                0,
+                0,
+                0,
+                0,
+                2,
+                1
+            ],
+            [
+                0,
+                3,
+                0,
+                0,
+                0,
+                3,
+                3,
+                1
+            ],
+            [
+                0,
+                1,
+                3,
+                0,
+                0,
+                3,
+                0,
+                1
+            ],
+            [
+                2,
+                0,
+                3,
+                0,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                3,
+                1,
+                0,
+                2
+            ],
+            [
+                1,
+                0,
+                3,
+                2,
+                1,
+                2,
+                2,
+                0
+            ]
+        ],
+        "start_point": [
+            6,
+            3
+        ],
+        "end_point": [
+            0,
+            5
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_040_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_040_result.jpg",
+        "save_id": 4262,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 22.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4262.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_041",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 5,
+        "optimal_path": [
+            [
+                1,
+                6
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                5,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                0,
+                0,
+                0,
+                0,
+                3,
+                3,
+                1,
+                1,
+                3
+            ],
+            [
+                2,
+                2,
+                0,
+                1,
+                0,
+                1,
+                0,
+                2,
+                2,
+                1
+            ],
+            [
+                1,
+                3,
+                0,
+                1,
+                3,
+                3,
+                0,
+                3,
+                2,
+                1
+            ],
+            [
+                0,
+                3,
+                0,
+                1,
+                0,
+                0,
+                0,
+                1,
+                1,
+                1
+            ],
+            [
+                1,
+                3,
+                1,
+                1,
+                0,
+                0,
+                1,
+                0,
+                2,
+                1
+            ],
+            [
+                1,
+                3,
+                1,
+                0,
+                0,
+                0,
+                1,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                2,
+                0,
+                3,
+                0,
+                2,
+                3,
+                2
+            ],
+            [
+                3,
+                1,
+                1,
+                2,
+                1,
+                0,
+                1,
+                3,
+                0,
+                3
+            ],
+            [
+                2,
+                0,
+                0,
+                3,
+                2,
+                3,
+                0,
+                1,
+                3,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0,
+                3,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            1,
+            6
+        ],
+        "end_point": [
+            5,
+            5
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_041_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_041_result.jpg",
+        "save_id": 4263,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 5.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4263.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_042",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 3,
+        "optimal_path": [
+            [
+                1,
+                6
+            ],
+            [
+                1,
+                7
+            ],
+            [
+                1,
+                8
+            ],
+            [
+                0,
+                8
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                1,
+                3,
+                3,
+                0,
+                0,
+                0,
+                2,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                3,
+                1,
+                2,
+                0,
+                0,
+                2,
+                1,
+                3,
+                2
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                0,
+                0,
+                3,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                0,
+                3,
+                0,
+                1,
+                1
+            ],
+            [
+                0,
+                0,
+                2,
+                3,
+                0,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                2,
+                1,
+                3,
+                0,
+                0,
+                2,
+                2,
+                2,
+                1
+            ],
+            [
+                1,
+                2,
+                0,
+                3,
+                1,
+                3,
+                2,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                2,
+                0,
+                0,
+                0,
+                0,
+                1
+            ]
+        ],
+        "start_point": [
+            1,
+            6
+        ],
+        "end_point": [
+            0,
+            8
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_042_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_042_result.jpg",
+        "save_id": 4264,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 3.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4264.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_043",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 15,
+        "optimal_path": [
+            [
+                5,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                1,
+                5
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                1,
+                0
+            ],
+            [
+                2,
+                0
+            ],
+            [
+                3,
+                0
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                2,
+                2,
+                1,
+                1,
+                2,
+                0,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                0,
+                0,
+                2,
+                0,
+                1,
+                3
+            ],
+            [
+                1,
+                0,
+                2,
+                1,
+                1,
+                0,
+                0,
+                1,
+                3,
+                2
+            ],
+            [
+                0,
+                1,
+                2,
+                1,
+                1,
+                0,
+                0,
+                0,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                2,
+                0,
+                2,
+                0,
+                1,
+                3,
+                1,
+                0
+            ],
+            [
+                0,
+                2,
+                3,
+                2,
+                0,
+                1,
+                0,
+                0,
+                1,
+                1
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                0,
+                1,
+                2,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                3,
+                1,
+                1,
+                0,
+                1,
+                3,
+                2,
+                2,
+                1
+            ],
+            [
+                1,
+                1,
+                0,
+                0,
+                2,
+                2,
+                0,
+                1,
+                0,
+                3
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                3,
+                0,
+                2,
+                0,
+                0,
+                0
+            ]
+        ],
+        "start_point": [
+            5,
+            5
+        ],
+        "end_point": [
+            3,
+            0
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_043_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_043_result.jpg",
+        "save_id": 4265,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 15.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4265.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_044",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 30,
+        "optimal_path": [
+            [
+                7,
+                0
+            ],
+            [
+                8,
+                0
+            ],
+            [
+                8,
+                1
+            ],
+            [
+                8,
+                2
+            ],
+            [
+                7,
+                2
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                7,
+                4
+            ],
+            [
+                6,
+                4
+            ],
+            [
+                6,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                1,
+                0,
+                1,
+                1,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                0,
+                2,
+                0,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                1,
+                2,
+                2,
+                1,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                2,
+                1,
+                2,
+                1,
+                3,
+                0,
+                0
+            ],
+            [
+                2,
+                1,
+                3,
+                3,
+                3,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                2,
+                0,
+                0,
+                0,
+                1,
+                2
+            ],
+            [
+                3,
+                3,
+                2,
+                1,
+                1,
+                1,
+                1,
+                1,
+                2
+            ],
+            [
+                0,
+                3,
+                2,
+                2,
+                0,
+                1,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                1,
+                2,
+                2,
+                2,
+                0,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            7,
+            0
+        ],
+        "end_point": [
+            6,
+            5
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_044_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_044_result.jpg",
+        "save_id": 4266,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 30.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4266.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_045",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 8,
+        "optimal_path": [
+            [
+                2,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                1
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                3,
+                0,
+                0,
+                1,
+                1,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                1,
+                2,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                2,
+                1,
+                0,
+                1,
+                1,
+                2,
+                0,
+                2
+            ],
+            [
+                0,
+                3,
+                2,
+                1,
+                0,
+                0,
+                1,
+                3,
+                3,
+                1
+            ],
+            [
+                2,
+                3,
+                2,
+                1,
+                0,
+                0,
+                0,
+                1,
+                2,
+                0
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                0,
+                1,
+                0,
+                1,
+                2,
+                2
+            ],
+            [
+                1,
+                2,
+                0,
+                1,
+                1,
+                2,
+                0,
+                0,
+                1,
+                0
+            ],
+            [
+                0,
+                3,
+                1,
+                2,
+                1,
+                2,
+                2,
+                0,
+                2,
+                0
+            ],
+            [
+                0,
+                1,
+                1,
+                1,
+                0,
+                0,
+                3,
+                1,
+                3,
+                1
+            ],
+            [
+                1,
+                1,
+                1,
+                0,
+                3,
+                0,
+                0,
+                1,
+                0,
+                1
+            ]
+        ],
+        "start_point": [
+            2,
+            4
+        ],
+        "end_point": [
+            5,
+            1
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_045_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_045_result.jpg",
+        "save_id": 4267,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 8.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4267.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_046",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 7,
+        "optimal_path": [
+            [
+                7,
+                1
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                6,
+                2
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                0,
+                2,
+                1,
+                1,
+                1,
+                1,
+                1
+            ],
+            [
+                0,
+                1,
+                3,
+                0,
+                1,
+                3,
+                0,
+                1
+            ],
+            [
+                1,
+                1,
+                2,
+                2,
+                0,
+                0,
+                2,
+                0
+            ],
+            [
+                2,
+                0,
+                2,
+                3,
+                0,
+                2,
+                3,
+                2
+            ],
+            [
+                3,
+                2,
+                1,
+                2,
+                1,
+                3,
+                1,
+                2
+            ],
+            [
+                0,
+                0,
+                2,
+                1,
+                0,
+                3,
+                3,
+                0
+            ],
+            [
+                2,
+                0,
+                0,
+                0,
+                1,
+                0,
+                3,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                1,
+                2,
+                0,
+                0
+            ]
+        ],
+        "start_point": [
+            7,
+            1
+        ],
+        "end_point": [
+            5,
+            4
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_046_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_046_result.jpg",
+        "save_id": 4268,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 7.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4268.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_047",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 16,
+        "optimal_path": [
+            [
+                4,
+                9
+            ],
+            [
+                5,
+                9
+            ],
+            [
+                5,
+                8
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                6,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                3,
+                0,
+                0,
+                2,
+                0,
+                2,
+                0,
+                0
+            ],
+            [
+                1,
+                3,
+                0,
+                1,
+                3,
+                0,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                1,
+                1,
+                1,
+                2,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                3,
+                3,
+                2,
+                0,
+                1,
+                0,
+                1,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                3,
+                0,
+                0,
+                0,
+                0,
+                0,
+                1,
+                3,
+                0
+            ],
+            [
+                1,
+                1,
+                1,
+                0,
+                2,
+                0,
+                1,
+                0,
+                0,
+                1
+            ],
+            [
+                2,
+                1,
+                2,
+                1,
+                0,
+                1,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                1,
+                3,
+                2,
+                2,
+                0,
+                0
+            ],
+            [
+                2,
+                0,
+                3,
+                1,
+                1,
+                0,
+                3,
+                2,
+                1,
+                3
+            ],
+            [
+                0,
+                2,
+                1,
+                3,
+                1,
+                2,
+                0,
+                2,
+                0,
+                0
+            ]
+        ],
+        "start_point": [
+            4,
+            9
+        ],
+        "end_point": [
+            6,
+            3
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_047_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_047_result.jpg",
+        "save_id": 4269,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 16.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4269.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_048",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 33,
+        "optimal_path": [
+            [
+                7,
+                0
+            ],
+            [
+                6,
+                0
+            ],
+            [
+                6,
+                1
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                0,
+                3
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                2,
+                3,
+                2,
+                2,
+                3,
+                2,
+                1
+            ],
+            [
+                1,
+                1,
+                0,
+                2,
+                3,
+                3,
+                1,
+                1
+            ],
+            [
+                0,
+                3,
+                1,
+                0,
+                2,
+                1,
+                3,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                3,
+                3,
+                3,
+                1
+            ],
+            [
+                1,
+                1,
+                0,
+                0,
+                1,
+                0,
+                0,
+                2
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                2,
+                1,
+                0,
+                1
+            ],
+            [
+                2,
+                0,
+                0,
+                3,
+                0,
+                0,
+                2,
+                3
+            ],
+            [
+                1,
+                3,
+                0,
+                1,
+                0,
+                0,
+                3,
+                2
+            ]
+        ],
+        "start_point": [
+            7,
+            0
+        ],
+        "end_point": [
+            0,
+            3
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_048_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_048_result.jpg",
+        "save_id": 4270,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 33.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4270.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_049",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 9,
+        "optimal_path": [
+            [
+                8,
+                7
+            ],
+            [
+                7,
+                7
+            ],
+            [
+                6,
+                7
+            ],
+            [
+                5,
+                7
+            ],
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                3,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                2,
+                3,
+                3,
+                2,
+                1,
+                0,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                2,
+                2,
+                0,
+                2,
+                2,
+                1,
+                0
+            ],
+            [
+                1,
+                3,
+                0,
+                0,
+                3,
+                2,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                1,
+                1,
+                3,
+                0,
+                3
+            ],
+            [
+                2,
+                2,
+                1,
+                0,
+                0,
+                0,
+                0,
+                0,
+                2
+            ],
+            [
+                0,
+                1,
+                1,
+                2,
+                3,
+                1,
+                0,
+                0,
+                2
+            ],
+            [
+                1,
+                3,
+                0,
+                0,
+                0,
+                2,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                2,
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                2,
+                0,
+                0,
+                1,
+                0,
+                1,
+                0,
+                2
+            ]
+        ],
+        "start_point": [
+            8,
+            7
+        ],
+        "end_point": [
+            3,
+            5
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_049_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_049_result.jpg",
+        "save_id": 4271,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 9.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4271.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_050",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 16,
+        "optimal_path": [
+            [
+                2,
+                8
+            ],
+            [
+                2,
+                7
+            ],
+            [
+                2,
+                6
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                0,
+                0,
+                1,
+                1,
+                0,
+                1,
+                2,
+                0
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                1,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                0,
+                1,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                1,
+                0,
+                3,
+                1,
+                0
+            ],
+            [
+                0,
+                1,
+                1,
+                0,
+                1,
+                3,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                3,
+                1,
+                1,
+                1,
+                3,
+                3
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                1,
+                0,
+                2,
+                2,
+                1
+            ],
+            [
+                1,
+                0,
+                3,
+                1,
+                1,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                0,
+                1,
+                0,
+                0,
+                0,
+                1,
+                0,
+                1
+            ]
+        ],
+        "start_point": [
+            2,
+            8
+        ],
+        "end_point": [
+            4,
+            2
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_050_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_050_result.jpg",
+        "save_id": 4272,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 16.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4272.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_051",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 10,
+        "optimal_path": [
+            [
+                3,
+                1
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                2,
+                3
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                2,
+                5
+            ],
+            [
+                1,
+                5
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                1,
+                0,
+                2,
+                2,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                2,
+                2,
+                0
+            ],
+            [
+                1,
+                3,
+                1,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                1,
+                0,
+                2,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                1,
+                0
+            ],
+            [
+                1,
+                0,
+                2,
+                0,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            3,
+            1
+        ],
+        "end_point": [
+            1,
+            5
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_051_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_051_result.jpg",
+        "save_id": 4273,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 10.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4273.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_052",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 7,
+        "min_cost": 14,
+        "optimal_path": [
+            [
+                4,
+                6
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                3,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                0,
+                2,
+                1,
+                0,
+                0,
+                1
+            ],
+            [
+                2,
+                3,
+                0,
+                3,
+                0,
+                1,
+                0
+            ],
+            [
+                1,
+                1,
+                3,
+                0,
+                0,
+                2,
+                3
+            ],
+            [
+                0,
+                0,
+                2,
+                2,
+                0,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                2,
+                0,
+                0,
+                1,
+                0
+            ],
+            [
+                3,
+                2,
+                0,
+                0,
+                3,
+                0,
+                1
+            ]
+        ],
+        "start_point": [
+            4,
+            6
+        ],
+        "end_point": [
+            3,
+            2
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_052_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_052_result.jpg",
+        "save_id": 4274,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 14.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4274.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_053",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 24,
+        "optimal_path": [
+            [
+                9,
+                4
+            ],
+            [
+                9,
+                5
+            ],
+            [
+                9,
+                6
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                8
+            ],
+            [
+                8,
+                9
+            ],
+            [
+                7,
+                9
+            ],
+            [
+                6,
+                9
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                1,
+                2,
+                0,
+                2,
+                1,
+                0,
+                0,
+                0,
+                1
+            ],
+            [
+                1,
+                3,
+                3,
+                0,
+                0,
+                3,
+                1,
+                1,
+                3,
+                0
+            ],
+            [
+                2,
+                2,
+                1,
+                0,
+                1,
+                0,
+                0,
+                0,
+                3,
+                3
+            ],
+            [
+                0,
+                3,
+                0,
+                0,
+                0,
+                3,
+                3,
+                0,
+                0,
+                0
+            ],
+            [
+                2,
+                1,
+                1,
+                0,
+                3,
+                3,
+                1,
+                0,
+                0,
+                0
+            ],
+            [
+                2,
+                3,
+                2,
+                1,
+                0,
+                0,
+                0,
+                1,
+                3,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                0,
+                1,
+                1,
+                0,
+                2,
+                1,
+                2
+            ],
+            [
+                0,
+                0,
+                2,
+                3,
+                3,
+                1,
+                0,
+                1,
+                3,
+                0
+            ],
+            [
+                1,
+                1,
+                1,
+                1,
+                0,
+                1,
+                2,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                1,
+                0,
+                1,
+                0,
+                0,
+                0,
+                3,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            9,
+            4
+        ],
+        "end_point": [
+            6,
+            9
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_053_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_053_result.jpg",
+        "save_id": 4275,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 24.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4275.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_054",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 6,
+        "min_cost": 32,
+        "optimal_path": [
+            [
+                0,
+                2
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                2,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                4,
+                3
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                5,
+                4
+            ]
+        ],
+        "terrain_map": [
+            [
+                1,
+                1,
+                1,
+                2,
+                3,
+                0
+            ],
+            [
+                3,
+                2,
+                2,
+                3,
+                0,
+                0
+            ],
+            [
+                2,
+                0,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                3,
+                3
+            ],
+            [
+                0,
+                3,
+                0,
+                2,
+                2,
+                0
+            ],
+            [
+                0,
+                2,
+                0,
+                3,
+                1,
+                0
+            ]
+        ],
+        "start_point": [
+            0,
+            2
+        ],
+        "end_point": [
+            5,
+            4
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_054_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_054_result.jpg",
+        "save_id": 4276,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 32.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4276.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_055",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 10,
+        "min_cost": 30,
+        "optimal_path": [
+            [
+                8,
+                8
+            ],
+            [
+                8,
+                7
+            ],
+            [
+                8,
+                6
+            ],
+            [
+                8,
+                5
+            ],
+            [
+                8,
+                4
+            ],
+            [
+                8,
+                3
+            ],
+            [
+                7,
+                3
+            ],
+            [
+                6,
+                3
+            ],
+            [
+                5,
+                3
+            ],
+            [
+                5,
+                2
+            ],
+            [
+                5,
+                1
+            ],
+            [
+                4,
+                1
+            ],
+            [
+                3,
+                1
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                3,
+                6
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                2,
+                1,
+                1,
+                3,
+                0,
+                1,
+                0,
+                1,
+                0
+            ],
+            [
+                2,
+                3,
+                0,
+                3,
+                0,
+                0,
+                0,
+                0,
+                3,
+                2
+            ],
+            [
+                0,
+                0,
+                3,
+                3,
+                0,
+                0,
+                1,
+                2,
+                2,
+                0
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                0,
+                1,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                2,
+                3,
+                3,
+                2,
+                1,
+                3,
+                2
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                3,
+                3,
+                1,
+                3,
+                3,
+                0
+            ],
+            [
+                3,
+                3,
+                0,
+                1,
+                1,
+                3,
+                0,
+                3,
+                0,
+                3
+            ],
+            [
+                1,
+                1,
+                3,
+                0,
+                2,
+                0,
+                2,
+                2,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                2,
+                0,
+                0,
+                0,
+                2,
+                1,
+                0,
+                0
+            ],
+            [
+                3,
+                0,
+                0,
+                1,
+                0,
+                1,
+                3,
+                1,
+                0,
+                0
+            ]
+        ],
+        "start_point": [
+            8,
+            8
+        ],
+        "end_point": [
+            3,
+            6
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_055_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_055_result.jpg",
+        "save_id": 4277,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 30.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4277.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_056",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 27,
+        "optimal_path": [
+            [
+                4,
+                7
+            ],
+            [
+                4,
+                6
+            ],
+            [
+                3,
+                6
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                2,
+                4
+            ],
+            [
+                1,
+                4
+            ],
+            [
+                1,
+                3
+            ],
+            [
+                1,
+                2
+            ],
+            [
+                1,
+                1
+            ],
+            [
+                0,
+                1
+            ]
+        ],
+        "terrain_map": [
+            [
+                0,
+                2,
+                2,
+                2,
+                0,
+                1,
+                0,
+                0
+            ],
+            [
+                3,
+                1,
+                1,
+                1,
+                1,
+                2,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                3,
+                1,
+                0,
+                3,
+                1,
+                1
+            ],
+            [
+                2,
+                0,
+                2,
+                0,
+                1,
+                0,
+                0,
+                1
+            ],
+            [
+                2,
+                1,
+                1,
+                0,
+                3,
+                1,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                3,
+                1,
+                2,
+                1,
+                0,
+                2
+            ],
+            [
+                0,
+                0,
+                1,
+                1,
+                0,
+                1,
+                2,
+                0
+            ],
+            [
+                0,
+                3,
+                0,
+                1,
+                1,
+                1,
+                1,
+                1
+            ]
+        ],
+        "start_point": [
+            4,
+            7
+        ],
+        "end_point": [
+            0,
+            1
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_056_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_056_result.jpg",
+        "save_id": 4278,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 27.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4278.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_057",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 15,
+        "optimal_path": [
+            [
+                2,
+                3
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                5,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                3,
+                1,
+                3,
+                1,
+                3,
+                0,
+                2,
+                1
+            ],
+            [
+                0,
+                1,
+                0,
+                3,
+                2,
+                2,
+                0,
+                1
+            ],
+            [
+                3,
+                2,
+                3,
+                0,
+                0,
+                1,
+                0,
+                1
+            ],
+            [
+                1,
+                2,
+                1,
+                1,
+                1,
+                1,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                2,
+                3,
+                3,
+                0,
+                0,
+                2
+            ],
+            [
+                1,
+                0,
+                0,
+                0,
+                2,
+                2,
+                1,
+                0
+            ],
+            [
+                0,
+                0,
+                1,
+                2,
+                2,
+                0,
+                0,
+                3
+            ],
+            [
+                0,
+                3,
+                0,
+                2,
+                1,
+                0,
+                0,
+                2
+            ]
+        ],
+        "start_point": [
+            2,
+            3
+        ],
+        "end_point": [
+            5,
+            2
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_057_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_057_result.jpg",
+        "save_id": 4279,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 15.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4279.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_058",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 8,
+        "min_cost": 7,
+        "optimal_path": [
+            [
+                5,
+                7
+            ],
+            [
+                5,
+                6
+            ],
+            [
+                5,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                4
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                2
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                0,
+                1,
+                0,
+                1,
+                1,
+                0,
+                0
+            ],
+            [
+                1,
+                1,
+                3,
+                0,
+                3,
+                3,
+                0,
+                3
+            ],
+            [
+                1,
+                3,
+                2,
+                1,
+                0,
+                3,
+                1,
+                1
+            ],
+            [
+                3,
+                2,
+                0,
+                0,
+                0,
+                1,
+                1,
+                2
+            ],
+            [
+                0,
+                0,
+                0,
+                0,
+                0,
+                0,
+                1,
+                3
+            ],
+            [
+                3,
+                2,
+                2,
+                0,
+                1,
+                0,
+                0,
+                1
+            ],
+            [
+                0,
+                1,
+                3,
+                1,
+                0,
+                3,
+                1,
+                1
+            ],
+            [
+                2,
+                0,
+                0,
+                3,
+                0,
+                1,
+                3,
+                3
+            ]
+        ],
+        "start_point": [
+            5,
+            7
+        ],
+        "end_point": [
+            3,
+            2
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_058_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_058_result.jpg",
+        "save_id": 4280,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 7.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4280.png",
+        "status": "skipped"
+    },
+    {
+        "id": "rpg_059",
+        "task": "weighted_shortest_path",
+        "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.",
+        "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。",
+        "grid_size": 9,
+        "min_cost": 13,
+        "optimal_path": [
+            [
+                5,
+                2
+            ],
+            [
+                4,
+                2
+            ],
+            [
+                3,
+                2
+            ],
+            [
+                3,
+                3
+            ],
+            [
+                3,
+                4
+            ],
+            [
+                3,
+                5
+            ],
+            [
+                4,
+                5
+            ],
+            [
+                4,
+                6
+            ]
+        ],
+        "terrain_map": [
+            [
+                2,
+                1,
+                2,
+                0,
+                0,
+                0,
+                0,
+                3,
+                0
+            ],
+            [
+                3,
+                0,
+                1,
+                1,
+                1,
+                1,
+                3,
+                2,
+                0
+            ],
+            [
+                2,
+                2,
+                0,
+                2,
+                3,
+                0,
+                1,
+                1,
+                1
+            ],
+            [
+                0,
+                1,
+                1,
+                1,
+                0,
+                0,
+                2,
+                0,
+                0
+            ],
+            [
+                1,
+                3,
+                0,
+                1,
+                2,
+                1,
+                0,
+                1,
+                3
+            ],
+            [
+                3,
+                1,
+                0,
+                3,
+                1,
+                2,
+                0,
+                0,
+                0
+            ],
+            [
+                1,
+                0,
+                0,
+                1,
+                0,
+                2,
+                0,
+                1,
+                1
+            ],
+            [
+                1,
+                0,
+                1,
+                0,
+                0,
+                2,
+                1,
+                1,
+                1
+            ],
+            [
+                1,
+                1,
+                0,
+                1,
+                1,
+                0,
+                0,
+                0,
+                3
+            ]
+        ],
+        "start_point": [
+            5,
+            2
+        ],
+        "end_point": [
+            4,
+            6
+        ],
+        "source_image": "Part4/Shortest_path2/rpg_059_input.jpg",
+        "result_image": "Part4/Shortest_path2/rpg_059_result.jpg",
+        "save_id": 4281,
+        "hints": "If the cost of the starting point is included, the cost of the optimal path is 13.",
+        "need_hint": true,
+        "IC": false,
+        "IF": true,
+        "VC": true,
+        "WA": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/cn/Part4/Shortest_Path2/4281.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/1.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/1.png
new file mode 100644
index 0000000000000000000000000000000000000000..3755fa78c0258ca7d213f992dca1852dd4c49fcc
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/1.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:788a7a86394265124d06858cac162b250fa1860dc0aaca71cc7bafb0c4766701
+size 374148
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/10.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/10.png
new file mode 100644
index 0000000000000000000000000000000000000000..6a6ec3bc12f8a48b96010274c3a6ec3c054c685c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/10.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:06e13d5d8c358a403794755faab45b05260cf3865ac5f4fded68eca635e2ddd6
+size 415161
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/101.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/101.png
new file mode 100644
index 0000000000000000000000000000000000000000..1763e51a50920f10a90aebe0eb9f6f4e2ac05c14
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/101.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:608fd703d69771aab8687bad660d967137eb189433d833ac9445a0cec8791ebf
+size 360672
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/103.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/103.png
new file mode 100644
index 0000000000000000000000000000000000000000..52f33116608a77da7852360ceb0b63ffb86bcfd5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/103.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e15c6d2fb1159e6693069f815ee25dae5814776f104ca8e35b3a136e81c2425d
+size 331202
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/104.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/104.png
new file mode 100644
index 0000000000000000000000000000000000000000..0a89500981389f58c76c52d3f204ec7235e81694
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/104.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8e7d1b948b83c919b89708819fbaad8f1eadf9640a9a70ea4ea1696a062c8859
+size 286715
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/105.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/105.png
new file mode 100644
index 0000000000000000000000000000000000000000..f541ac655ef8d2402c6036395138083c6c1732a5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/105.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2742a32ed1e153ef345bfc9f61abb65ba4fd91c4bcb168f28a70ce516c2da857
+size 249172
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/108.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/108.png
new file mode 100644
index 0000000000000000000000000000000000000000..f3eacefcd6bced37cd9c868afb7bd4fd3c2fcb46
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/108.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:77aaa52b77fa2e22b755e6e665441f1aea8506e951067178c3be497c93d00383
+size 500108
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/109.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/109.png
new file mode 100644
index 0000000000000000000000000000000000000000..c45e17ad042265e20802efb8f470fab73dcbf001
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/109.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:11d2258dc2b73e79e2c6494bab836e353e463c929c7025ad15105fa78a974605
+size 433016
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/110.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/110.png
new file mode 100644
index 0000000000000000000000000000000000000000..1e3b407f318a457d91c48aadf336756b74f5d90c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/110.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e03225e335254299ea2d520ca1eb8235d9510206e9798e877e29a33cdb705925
+size 335028
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/111.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/111.png
new file mode 100644
index 0000000000000000000000000000000000000000..4518f2924024f341213f32b4cbe6cb8e1be69ca6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/111.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fa097c86f5c38d90088a0196380f1001b7751c9bb6c955dbe6bc3af98a6d3f68
+size 383349
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/112.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/112.png
new file mode 100644
index 0000000000000000000000000000000000000000..64b82b03ba86f5cf3eb8709fc989cc6c0d683256
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/112.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:218a4b82c0e7bf7624cfa3b68efc0c818591dd162baaf17a13cfb39357571eae
+size 334317
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/113.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/113.png
new file mode 100644
index 0000000000000000000000000000000000000000..4a7376324d9b0dce3409d8379cb95258f70ea172
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/113.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f80ed727b14228a2292abe78244713679513103be449a3d2d0876263f40bdcca
+size 313627
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/114.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/114.png
new file mode 100644
index 0000000000000000000000000000000000000000..f9d15e6cddcc7df8af6009acf2f489abe9ce85de
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/114.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9258ee640fd64de2468edb49d8401845dd149f0513f0a1d99ee71239e57a34b4
+size 335046
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/115.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/115.png
new file mode 100644
index 0000000000000000000000000000000000000000..4dd63035a741d65a30ddac86312a8748d8a1ed81
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/115.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:60b468c14d70d09a497c692a7b88ccbdaac4bea0d2732bfdc21a3159f31a4ae6
+size 335349
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/117.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/117.png
new file mode 100644
index 0000000000000000000000000000000000000000..61d7fbd4bdc9ba21b1c9f8a8faddfc8445cd1da8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/117.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7d90d61500700ac8de313cb011c03422253ba000bc545d7ae276ab1e8113a460
+size 547708
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/118.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/118.png
new file mode 100644
index 0000000000000000000000000000000000000000..3618962eab9c2a9c2b415b0c5d753f74471a8713
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/118.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bea9cfb574d9ee76fee208abe2b3b40c91f06ae4e121aa0afdc4f03ba098c18e
+size 379403
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/119.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/119.png
new file mode 100644
index 0000000000000000000000000000000000000000..7813f03ca6d9c9914d12b0b6063ae156bdbc268f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/119.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c6dda853881f5b0a382ac30692e7ba6714919a5a5d554797d176f0453a02e691
+size 402310
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/120.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/120.png
new file mode 100644
index 0000000000000000000000000000000000000000..5d29172c53592ad774e488bc48eed9e1b9358712
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/120.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:50e4730427d3338c8558ae3104a82d521ca668a36ced7de1fa0e547b191a97a5
+size 565958
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/121.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/121.png
new file mode 100644
index 0000000000000000000000000000000000000000..d1c32e80a2d6488aaf911388ace367ba9323efb6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/121.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:feb3a9a50a1962cfb3588fb2084f92a51db706b6b4ab7036ecfa04e33577ef41
+size 435459
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/122.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/122.png
new file mode 100644
index 0000000000000000000000000000000000000000..5fbe2d2030000d814dd2ac449a7060e03e633cb1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/122.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:df201902b31269b462d6cc97929c34b04a9166aa92faea39f7b3a7439045ae7f
+size 378994
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/123.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/123.png
new file mode 100644
index 0000000000000000000000000000000000000000..fc11f29a35c954adfa80db119cb1a3831d743217
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/123.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8faa0fc35ff9b51718d3c62e27b98463a5261ffb77834233ea6d3f43701cc0f5
+size 428114
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/124.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/124.png
new file mode 100644
index 0000000000000000000000000000000000000000..8139cb57950156ff2251873b456d874ef4bebd28
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/124.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:084d70b6149a24d8233137c7a71bc69766e611670c77845e56a62a34d01eaede
+size 449250
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/125.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/125.png
new file mode 100644
index 0000000000000000000000000000000000000000..830bd5e7443e98dfb9a8368c748f0dba5ba26cc3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/125.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:26df160795f3b204f3cba667795ff2329ec5b6cc883884a7c0460ce2add37ae5
+size 477918
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/126.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/126.png
new file mode 100644
index 0000000000000000000000000000000000000000..1632b1eb6d569d6b8db77fd1e4911d86409ea7ec
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/126.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a9ff84cde161e57d7c44a18cd7d1e962aedafbc1966e45872783dc7f52fe6361
+size 279774
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/127.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/127.png
new file mode 100644
index 0000000000000000000000000000000000000000..053ed306d57e97b569af83baa24a5eebba4acf02
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/127.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:607efc2a6d7d5b7dec10daf4607b2c684f614a770c33044b2299a6e159f946a1
+size 455355
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/128.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/128.png
new file mode 100644
index 0000000000000000000000000000000000000000..f29f5a69fabe1fa769867303b81fe425b3f9d8d6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/128.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f6fbba5d465476197889be37921a3039b5e8dcc4d280360f8b154816bcdba37d
+size 380125
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/129.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/129.png
new file mode 100644
index 0000000000000000000000000000000000000000..7c8210ecaf44e24d15a923fda78bcdce6afedd86
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/129.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:05b959a8aacfcf83c2da66fcf63b64ee1281110183a3967b21e1b58d548000c4
+size 331773
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/130.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/130.png
new file mode 100644
index 0000000000000000000000000000000000000000..78571361101d33c48e61e2a5281f93bceb5071b2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/130.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f29ec9cec47ccd635b4d967dfe4c0f6f8ac377b5c8dfbdec63160a1eb1b7453f
+size 466792
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/131.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/131.png
new file mode 100644
index 0000000000000000000000000000000000000000..841ce3ee5c7abbe44e6051bcf03c201dac7b7162
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/131.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2a99184afefce74385de92d640cfaca9366bd9463dafac66d0160a38e259f0ea
+size 430193
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/18.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/18.png
new file mode 100644
index 0000000000000000000000000000000000000000..7e108f5622de066137cf7194462333a9fa663a89
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/18.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a57ef7bef2f4284e7eae475b71d24f7f40cf13c886193388a6e973c48fa64af1
+size 421216
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/19.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/19.png
new file mode 100644
index 0000000000000000000000000000000000000000..5f389c5af2ba505934823591c7f1b0f7881790e7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/19.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6e55a938d92263565542a35411038e4cc3fa65cb451caf3225e32b51ef0af45f
+size 430630
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/20.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/20.png
new file mode 100644
index 0000000000000000000000000000000000000000..71e51bfecd18a911921bc648aaf3db503a17f841
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/20.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:05bd0e2971f5f5f7e3485e6ebec54e5eca3ec0a3d54b96ce9c4d10e0b08178f9
+size 440311
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/21.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/21.png
new file mode 100644
index 0000000000000000000000000000000000000000..bb3857cd6e0dae39c9a2f58e7a0716bf72fd0528
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/21.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ceedec11d128cf7689a6a1dbf2e2cd5e9c1afed5a54f09ae2c69670d43677cea
+size 385010
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/23.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/23.png
new file mode 100644
index 0000000000000000000000000000000000000000..2af728b9a3d380d56894b4dd2b7330b21c90e3ce
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/23.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4c5b68d36eaeaa51c29af0d5579edeb08b9b5294142e350258d13845007c2d64
+size 355175
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/24.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/24.png
new file mode 100644
index 0000000000000000000000000000000000000000..6172741a6c1a099d023d0b341c43e16dea4308a1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/24.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3f52713fdd7928de82142924186560e73bf8438b7a47f6248eaa5803f94569fa
+size 367504
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/25.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/25.png
new file mode 100644
index 0000000000000000000000000000000000000000..632f8306051ff7de1effee930938aa66ffe5ecca
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/25.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:afcb31c082bc29ae5e58686e9c4d8abd2635b9d8ed8b093fb65a3d10e2094890
+size 357384
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/26.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/26.png
new file mode 100644
index 0000000000000000000000000000000000000000..714ffe9622f61a70f15276d624aebf21836161b2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/26.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bfb16c3d49d2c7871d700bba9efcef304e3ea9651876c7ee7c13840cbd24668b
+size 454942
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/27.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/27.png
new file mode 100644
index 0000000000000000000000000000000000000000..d679489986656442ae2192a17c96994c8e266cfa
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/27.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:69040058a6063bad056d908c1c8a1e5b6048294f6c2d6742797c9d0844c17c59
+size 322668
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/28.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/28.png
new file mode 100644
index 0000000000000000000000000000000000000000..43a848fbf66d346c2e39b7217bbf342f8ef7e224
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/28.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cb47ae51c2bcd50b5e245113279bbc62a12fcd2f00e4a00a491cdc6dde7edea8
+size 316811
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/29.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/29.png
new file mode 100644
index 0000000000000000000000000000000000000000..8a7f0d7eed7424f59790ce4e76eb6ffb0c7af206
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/29.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6f87617a5fac62cf7fbf0e9b194bca21f9c377f2689fa3f7845eab6c0af90683
+size 423254
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/3.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/3.png
new file mode 100644
index 0000000000000000000000000000000000000000..31caad84ccbd5927f6fa586456d3e57f5073d6f8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/3.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9e95046917ebccf6883ef7879143397c122feb5d5c29c8396ca1d5949dd577c0
+size 279637
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/34.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/34.png
new file mode 100644
index 0000000000000000000000000000000000000000..f433f6cb0474f26c6d885a5a6f97e51aeade5f47
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/34.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:93795a8ff1d13f621bca3b9bd31c3884c73f69f0fc623b61bb46e32f2428e0fd
+size 335075
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/35.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/35.png
new file mode 100644
index 0000000000000000000000000000000000000000..7f77e2dbae582f4cbaa8110e04ad4d6ffaf2b117
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/35.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:198397d369d8a9c5bd76b55f8c8b7fa37081fa660b21d1d04bdc72425712f554
+size 360834
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/37.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/37.png
new file mode 100644
index 0000000000000000000000000000000000000000..d538f9ae8debf5e77f9c89c68107aebde4458471
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/37.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:18fef7aefcb2f058f648556097a252e1e00b712626b85732da156e321bb9a6af
+size 318334
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/38.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/38.png
new file mode 100644
index 0000000000000000000000000000000000000000..ef8e433474e76debc2d296f61440a11c192ac7b5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/38.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1e168bbbbf279bf440e32369692a31c33836e8f9246aaa966a36641a585da882
+size 343804
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/39.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/39.png
new file mode 100644
index 0000000000000000000000000000000000000000..7e2a1056a10a4be5f222585a7f388af723171412
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/39.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fc84d4ed6e4a677245b9064f9cbcdf373fb122ce4f26244cedd5dd255b925c05
+size 574439
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/4.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/4.png
new file mode 100644
index 0000000000000000000000000000000000000000..572f290dfda12f7be25933b45c58c5a7991ab547
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/4.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:06b7fdacaddf49aa566b7fea6b219221b4ea8fcca16cf5d70ed68ed3c81baab3
+size 309471
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/41.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/41.png
new file mode 100644
index 0000000000000000000000000000000000000000..3ea134a1f46d6faf14a48b640c8ad24d4b56b3d9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/41.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d3f75a0d8d7aa6c95651fd5e1eae275429191b637d09946569a59bd733db5822
+size 524026
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/42.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/42.png
new file mode 100644
index 0000000000000000000000000000000000000000..f6fbbcc6b2b7eb46c589dbfec6ef84627c1d4ab1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/42.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:da959577de4cda2faf642c88e46f52493bdde8e9c9c9e44003b962d36ec928e4
+size 518937
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/43.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/43.png
new file mode 100644
index 0000000000000000000000000000000000000000..1aa0c0da7756f96b96395975952ddd5867daf7ae
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/43.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1156a22e0fe715d35f88a01d701437e0c684178d7eb6372dfa5ee419ad03a224
+size 577532
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/44.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/44.png
new file mode 100644
index 0000000000000000000000000000000000000000..776e311688bb1ab0fc42fdf9031b8cbef50f015b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/44.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1ce35207abe9097a8742e0bc740ac463dc52595d59e2dfcd616933e7f61d0783
+size 366192
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/45.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/45.png
new file mode 100644
index 0000000000000000000000000000000000000000..9694f268ff33baa0185680ddc3577c2dc9550063
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/45.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d1e4670dc3fc3a9efde88b02364ab0a95aaa0901e5dec6fcdd2397663e57db31
+size 355367
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/46.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/46.png
new file mode 100644
index 0000000000000000000000000000000000000000..c29eba4a1a6c2e8d8ebbf2c6d92fdb4725e7842d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/46.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:db729618836eadf27fe74efc5680424b584a4117058aadfb25de55d33688ddf9
+size 383015
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/47.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/47.png
new file mode 100644
index 0000000000000000000000000000000000000000..6e1f24f20cfe6e078fbb638b498fcd1d3e0ad389
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/47.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6d0711a3f8863c70bc660a7412a918ebfc25464243da5f17b0c2f44a91b5ef54
+size 373692
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/48.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/48.png
new file mode 100644
index 0000000000000000000000000000000000000000..8c6d717cda692dcbc651ad89c1aed76f62088577
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/48.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5a1e8dd48bb6cd548b103887f358a21eb1e6d50d50dcae4d90a2db8717f2c232
+size 305802
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/49.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/49.png
new file mode 100644
index 0000000000000000000000000000000000000000..32100942eb263b00ef2a07154d29e34c9a3d9546
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/49.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f61b48e8da99c49daf8d14fbd11af6124cef39e91a75e1a096d8877417013757
+size 428816
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/50.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/50.png
new file mode 100644
index 0000000000000000000000000000000000000000..ac76868a67d3080d871578b12f4c2dfccbc74033
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/50.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:aca92e324c8ff57b33fd6b4513ef33df199557e865478c51267c55bde0a8eafe
+size 509753
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/51.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/51.png
new file mode 100644
index 0000000000000000000000000000000000000000..c1929ab345a563cd204e568119ef3ef77fe47cd6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/51.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f1ee65b16eb58a86382cc7adbe4bb782516344ae4a398db6f70536f0aef6b771
+size 108253
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/52.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/52.png
new file mode 100644
index 0000000000000000000000000000000000000000..de747770d0614b8d677af92f7aa3c1e721e74058
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/52.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:96fce2198b794fecf5571c21ceed2926e321bac797766ea891417149ef8a4afc
+size 548200
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/53.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/53.png
new file mode 100644
index 0000000000000000000000000000000000000000..4233f4a064dc91e707ec41a2e4320c7a2ff024a8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/53.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0d3549cd1d629b4010eef1c378f5c949205789d780998ea16059e199fe957d40
+size 375114
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/55.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/55.png
new file mode 100644
index 0000000000000000000000000000000000000000..1703e3f385d1df9a70ea6c083312f1d1f77e41f0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/55.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0615e331dd7b1a931cadb0006ee6a98eedcad43487dfd1346bd4480189be693f
+size 346568
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/56.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/56.png
new file mode 100644
index 0000000000000000000000000000000000000000..729e1579305f87f98ef1ef9491de3b528832d171
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/56.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c88d57c690a70edc48ea25184a8f2b33617ae23d415e9263cdd6a593b7e60c71
+size 373371
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/58.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/58.png
new file mode 100644
index 0000000000000000000000000000000000000000..be51d104537fad8cae7cb25ee215f43344a2af73
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/58.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6df87731e68ff6b721b802a3a6d82043592293036b152af572131d6798322477
+size 366086
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/59.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/59.png
new file mode 100644
index 0000000000000000000000000000000000000000..f88f786df1ea8c6339ed40f54fc3e653d94e4a65
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/59.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e797d196a985f8230591d5a718e15cddf3826cdc6f3df5ce7dbad5a278cadaa9
+size 459470
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/60.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/60.png
new file mode 100644
index 0000000000000000000000000000000000000000..ebd3b9b7136cf3dad3571f1ca57ebe3dfa65d2b2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/60.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:74cc05582f5ac5078054c18f7e5f1a6717f6ecd0402bd76371140ff04929935d
+size 326856
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/61.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/61.png
new file mode 100644
index 0000000000000000000000000000000000000000..fad009509a6d8f2db61828e2e6aa580ad7b573f9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/61.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:24a2ff0815b4ba9684d65e321cedc86f1fd57a1a49e37ad398ca5991401d67ae
+size 338689
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/64.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/64.png
new file mode 100644
index 0000000000000000000000000000000000000000..ffc060d8499d5cfdf3ded7acfb69de8087a93b0f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/64.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:62588211f9581c98a808809468b199c2330b981e9e43634dccc70fb7744900a3
+size 385704
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/66.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/66.png
new file mode 100644
index 0000000000000000000000000000000000000000..fe045f1941c23f6ca97c680f06fe29f94636f548
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/66.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:699411db7b7d4d97b21523119fafa248b1dcd77711bb1366a7513abcdd3df836
+size 345167
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/67.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/67.png
new file mode 100644
index 0000000000000000000000000000000000000000..71b17133cdb467388d5313047b137f1873e05b06
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/67.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0ec13a33276c0a8e8b29e999f4554c51dd04aa581ee4a832f5611b19abfd4dd9
+size 297068
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/68.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/68.png
new file mode 100644
index 0000000000000000000000000000000000000000..5cd8883e0540dc077ac173845637377730931fbf
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/68.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:74fa9c4d3d2193ea969613007378abffeb03bfd5950d54e1ddec14e4314a6a2c
+size 303450
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/70.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/70.png
new file mode 100644
index 0000000000000000000000000000000000000000..95fc1756020c2a0ac8cce5aea01f28051624a82c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/70.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0e10707bfea6729fdefd595a153dc7ff3e8d75802edb90a9dc24e395951775a1
+size 428804
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/71.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/71.png
new file mode 100644
index 0000000000000000000000000000000000000000..1e5f75c048569d162bc259497ad46a28cfdf7031
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/71.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:de6758e0fa2186e2259091025f93157984db50ca31c4f54e02eaeb7fda35e666
+size 512693
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/72.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/72.png
new file mode 100644
index 0000000000000000000000000000000000000000..0bb033f62573f1d25047946257908b68d3f190d5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/72.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:77a5e348b47e904f31956ee63498037ecd2059c6ef0a04adb4a11c827941ea48
+size 500883
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/73.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/73.png
new file mode 100644
index 0000000000000000000000000000000000000000..3e9a8c572b0ff717b8e7e3917ff74f186b1de01f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/73.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e3cd2f5e0ae679a692ee3fe7799a5eb78ab25e8a996d59a33e5dc583b4705719
+size 367893
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/74.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/74.png
new file mode 100644
index 0000000000000000000000000000000000000000..3e2f6beb4700258d292bfc00335bb9cdc7be9c9f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/74.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a56c4f16da4492b18e8d49b7d8d15ded677e570110987c3ec08b80173d855b91
+size 501964
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/75.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/75.png
new file mode 100644
index 0000000000000000000000000000000000000000..a59338a77342dfe156968cb55325dde586fd5355
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/75.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8b2edfa09361d5c3ec1d298063788086d73b42610a25863dab05bcf9dbac22ac
+size 304086
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/76.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/76.png
new file mode 100644
index 0000000000000000000000000000000000000000..e8cedbdd0db498824169c05405b6dac1e10731f8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/76.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d5e92cea58c9439b04aa38c23e672c55868f015bf2a25fc2ca328eedb0e225e5
+size 454388
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/77.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/77.png
new file mode 100644
index 0000000000000000000000000000000000000000..ff7294a17fdc3985004635fb44d1d12e7474756b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/77.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e2e4998f3a9cfe835b3c94c2a01c08a7a68544e88d145a9c557230c093880df0
+size 341227
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/78.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/78.png
new file mode 100644
index 0000000000000000000000000000000000000000..6fd88f6ccf6ef66ada9c7cebaeedaa134860960e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/78.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:361a90534cef84722fe0fc2f285df521283768ea4038731e90ec239c96d234b1
+size 284575
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/79.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/79.png
new file mode 100644
index 0000000000000000000000000000000000000000..fbe4a78070ddb2fca128b09985deb9fc9bb726aa
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/79.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c746ffb08c906c69b454af453948b5502a0968f85a83847db24451fa6aa3e9f0
+size 252193
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/80.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/80.png
new file mode 100644
index 0000000000000000000000000000000000000000..f623dfddeeeef5d11bfd3a2ec1eee2b4c91eb737
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/80.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f39ce17c17a6662cc813451ceac53fb9283a18c64d4dc51944df8304a0f4d27c
+size 481480
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/81.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/81.png
new file mode 100644
index 0000000000000000000000000000000000000000..f69f0cbc3e5ce50d0985c7432eed863b58718621
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/81.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:024a2b47da2c8a763b5fa46447f83aa7a9f9015f570c06556d2f85b97cf0a738
+size 321197
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/82.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/82.png
new file mode 100644
index 0000000000000000000000000000000000000000..3cff68ec2ab3f5318a15fb191b241dfe62d062db
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/82.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1491ea34ffdd7b11243d8e2ce080f5a10924f650ef718764f4d90996590190d5
+size 561083
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/83.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/83.png
new file mode 100644
index 0000000000000000000000000000000000000000..519dcb37f70561aee598bbd6c0c08746dbf7256b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/83.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d43b4209618b5b41a1477cdf65e3e2208a87dc0fdd973535314ebd6a55bd31ed
+size 556004
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/84.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/84.png
new file mode 100644
index 0000000000000000000000000000000000000000..dbaa3491877a64dbde722b23930dea9a455193fa
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/84.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:293156a6455cd3b170e5251b7c42d1160230a8c269719d95b415ea8b0a6fc48d
+size 430988
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/85.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/85.png
new file mode 100644
index 0000000000000000000000000000000000000000..d9bf9d73c911f7adcc7d554caf326adf68e41c0d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/85.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f06161332a06b6b9635e1fe6aea06d3b7da8b83e5700bb3a4bb0e0dfdc906d20
+size 401569
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/86.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/86.png
new file mode 100644
index 0000000000000000000000000000000000000000..a22a85c196c11b77f3d70bc0a799d06beeb1e9a1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/86.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c1745c9322e1eab3b2f0dd886559c0c0b13e251c185d01f91a4ee318621791ba
+size 363183
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/88.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/88.png
new file mode 100644
index 0000000000000000000000000000000000000000..e3bb0a176750da5b95b7064fbcb1fbad8a521294
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/88.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f0ce1d33a7e14c442f4dbd21118c74894c2e00f4c91cdd48ec025c4f4ca3c8f7
+size 383015
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/89.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/89.png
new file mode 100644
index 0000000000000000000000000000000000000000..90cd3f0b7abebd6212879dee06c15ea95220b338
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/89.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c6ed2cb9a5df69b72ffcc1673a9f542cf691a95ada6ceed5f0ab654777fd11ef
+size 409250
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/90.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/90.png
new file mode 100644
index 0000000000000000000000000000000000000000..8282aba08c1ac35de1fb2e87600c003b5d04f3e4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/90.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:83a9ec4bf83028ea8089dc721fbe552c64c9b795a8d0d88e34af0265aacfaff9
+size 344317
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/91.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/91.png
new file mode 100644
index 0000000000000000000000000000000000000000..1d0cefebbfebb7b37fd563b13749aa60cfb6b0bb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/91.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a4d0e7fb296dca75ea255b8d96db0f80264a995e9e45983f05c308cc5dd44618
+size 345213
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/93.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/93.png
new file mode 100644
index 0000000000000000000000000000000000000000..b43902d6257e678a3a21985d2015a8887e765502
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/93.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a6025b839a7eb1de14fc21a18c83a7c4a239edc47049bdd9f8955eb0abcda8e1
+size 453209
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/94.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/94.png
new file mode 100644
index 0000000000000000000000000000000000000000..a117d8862460d1c4b0826cf699f11818ed369c42
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/94.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a133edd69b1c4b4f9a493167c8a3b08a5d865742c8653438307b9b1fa124d53b
+size 425529
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/95.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/95.png
new file mode 100644
index 0000000000000000000000000000000000000000..088ad1c96a1f348f77c44daa6066544571d8247d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/95.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:44d323b02b80ab1ee23bdd691742d40a0cc49fcad01ec9fa56481ebd6c4cbc47
+size 315218
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/96.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/96.png
new file mode 100644
index 0000000000000000000000000000000000000000..f4aa321b18dbba405ef0806dec09b425e9791e0a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/96.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5ad7e794b0f89d16ddc39ee9622a6b6ed0894acaadc6648db78962ba18ac20e8
+size 298578
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/97.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/97.png
new file mode 100644
index 0000000000000000000000000000000000000000..c0ab963a9374f05e8fa54d8f61e87fd40206c020
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/ADD/97.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:da9cc857d0bd80f34be0eac62e85837a5912798ffdfc8fb488c21e08efe73b2a
+size 443633
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/827.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/827.png
new file mode 100644
index 0000000000000000000000000000000000000000..adef95cad00d420ea2d548ce1ec26e655269e0b7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/827.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:655d417cf807a2429bda632ae6ac8e38abacbfab9bc3dee9e30958e62273d2eb
+size 315363
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/829.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/829.png
new file mode 100644
index 0000000000000000000000000000000000000000..438a3b7e4bf0cdc7d437e009013f59eba61bb56a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/829.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9a630e3991c624e39f97ad90f4c2cb5723294cea24ccd5179a818066a23c8c07
+size 324521
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/831.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/831.png
new file mode 100644
index 0000000000000000000000000000000000000000..9fdc015d4d9024b7b68bad8abf7be5a52cea8810
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/831.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e10f8b15101c41ee72a89dd5ae7c43c98d88b99bba4281b07239f0031c085336
+size 309996
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/832.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/832.png
new file mode 100644
index 0000000000000000000000000000000000000000..ac060c8777cea1c6c8096057b712d9aa206ecd5d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/832.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d13f2130b1141dae5af6cd34263c1c854d594b1add950e6cc37abae784e1738d
+size 450819
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/835.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/835.png
new file mode 100644
index 0000000000000000000000000000000000000000..40ab3e65d21f9be006a56e2a4e39d00e3f360852
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/835.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6d880289c699f0c0f8870cc608fb2098d85f0a70130db6ab9bf0c880d1b15921
+size 424890
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/847.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/847.png
new file mode 100644
index 0000000000000000000000000000000000000000..3340f8c234e2177c70eb047cfdaef65291c053bb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/847.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5da669e59f03a25ece6b09f6e93ea1496c37b699a2de01467e29cd2df63dae39
+size 388403
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/850.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/850.png
new file mode 100644
index 0000000000000000000000000000000000000000..b79f038bf7a8441fff1dc01997f74b7dc7da424b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/850.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7f1c665e485534f979c8d8e8f06a6cf0b88d75405a5ee30b42adcc84526347b7
+size 244676
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/851.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/851.png
new file mode 100644
index 0000000000000000000000000000000000000000..7aecb82aca8c11a0b2b1511805c9a37915bea866
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/851.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3b56dbc2865ab9eb3867ebd9a42026e0d6c18c06eed95e5f9f398deed0fe601d
+size 337985
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/864.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/864.png
new file mode 100644
index 0000000000000000000000000000000000000000..a31f520eb1e7936423ec72edc4831f8955b85574
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/864.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7d7987e54a05c8b3482971c75589f7d27139c85af6ca4f4687c2db0d025da0d0
+size 362627
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/867.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/867.png
new file mode 100644
index 0000000000000000000000000000000000000000..00ecf731d6f5ba24e68080f4758eeefea2c535db
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/867.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6fa3ba79508a3ebe21d52e45176a717833bc1265a01f5adff1104eae896538c2
+size 325316
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/868.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/868.png
new file mode 100644
index 0000000000000000000000000000000000000000..b1bf6e8cb429f4a4c29da427663dadf96912c6cb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/868.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3eb5149389f7733b6651cf12ee65fca9a1ae1ee3d6eca1af1b09fdbe09c83d52
+size 423171
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/874.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/874.png
new file mode 100644
index 0000000000000000000000000000000000000000..3771cbc73e811c7ed1d019815b1a120721b6d87a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/874.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1ae2ccfa3da372ccbc301ac9cf2c31db6396072da07b4dd66a548db9e78ae7be
+size 368566
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/879.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/879.png
new file mode 100644
index 0000000000000000000000000000000000000000..996d8ed82f5cc3325e2fcb3bdfb8a8b2acca25dd
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/879.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:38776b44a974983ce7276304ef6cef0c9a7cb4974e9614f4653b7f0aa9ea5bd4
+size 505229
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/883.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/883.png
new file mode 100644
index 0000000000000000000000000000000000000000..82e5c825914aaf7c5168b829e943472798efbcb6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/883.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f3bb59199c2d6de2df82eecf82e9dec76f1525e39b40a351bdf0a369d50b4ead
+size 337020
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/886.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/886.png
new file mode 100644
index 0000000000000000000000000000000000000000..350d4fc0314cb9359a3b6314142c1db22c8c698e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/886.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bd97001ab4d8846376acd4a4a04928184b63d9df95b682a0319e1f0c0e72f922
+size 459571
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/888.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/888.png
new file mode 100644
index 0000000000000000000000000000000000000000..6714cc1b5ffae584325710789247d1b8cfe022ad
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/888.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b1b1259b3841238943d33bd8a11ad8c7f77cd287f67e18158e520432d82832c1
+size 365433
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/889.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/889.png
new file mode 100644
index 0000000000000000000000000000000000000000..923693e29d5e23c5524784ddf87833b820dc8064
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/889.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:202e0155f05d432e7364dd0abb4bd2427915ae9e9ee4e1f2725805fd64fa7289
+size 349954
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/892.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/892.png
new file mode 100644
index 0000000000000000000000000000000000000000..c02ed6f30f207f8e3b27e32de775c093be1c0bf6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/892.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f1c5d36ff502fab008ea761a4b3a8d85b29fae3433740a048712e4fd6d8e7f43
+size 339565
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/896.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/896.png
new file mode 100644
index 0000000000000000000000000000000000000000..e830e9c3c54c66678d47ebd6639c717d846ab81b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Background/896.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8d5cfcbebb55093dd8a7743f273f63aee8083d6ad776110068fc8387274c521e
+size 501043
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/773.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/773.png
new file mode 100644
index 0000000000000000000000000000000000000000..e20da0c65d66b648978487f12b25b498f24e482e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/773.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f381c4b00c1e390ec4c2ba19779782abe242101b9f91e1ed37a0d7c9ccccda0d
+size 438805
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/774.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/774.png
new file mode 100644
index 0000000000000000000000000000000000000000..392458bcee5d57f37bae656ef467a68e4e92dc0a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/774.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4e0310cdaea287bd542752df75cc4a9a05a02831ebd41270324dbfa9764b7ecc
+size 451273
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/775.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/775.png
new file mode 100644
index 0000000000000000000000000000000000000000..c37384a30686b334ec2b3d92084595f1a3c0a867
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/775.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:65475e3558d6d0941743bf966c4414fe12243329c6aed22ab3207e99e3a49992
+size 416532
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/776.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/776.png
new file mode 100644
index 0000000000000000000000000000000000000000..afd7a89a1aad97e2cbb58baf607789b6ed75973f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/776.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a4f362380e584212fdd865cd7d4de5e02b9161da7e725ce263a668efe66cd2f0
+size 378144
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/777.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/777.png
new file mode 100644
index 0000000000000000000000000000000000000000..befff3a9670c9c62c4b9076895b12dc2ec093171
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/777.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fe7dc831f863207843911f7d726643520830f5bf900d29446ac120064f8cb2b1
+size 362386
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/779.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/779.png
new file mode 100644
index 0000000000000000000000000000000000000000..41ad6c0ad6f98279aaee0ee6c7a350df29ef4d68
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/779.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3f7d082d966caea2243f57529888f25b94dbfbb2270b4e8da11312632759c401
+size 383136
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/780.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/780.png
new file mode 100644
index 0000000000000000000000000000000000000000..a89159e16e1b0daf2d811e135026fd7b37b5318b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/780.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:19e78ca3ff6cfa891f592e1760858e69c51652cc2710de0b5d050ae667aea9f4
+size 451334
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/781.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/781.png
new file mode 100644
index 0000000000000000000000000000000000000000..e09eaf5073e48decc99e6aa95b9cb8a2a7c1f1ed
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/781.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b47b87e86ed33d161f15a4ba5d6c8b24cfb798027804fd903d4470bd7a3605a0
+size 420956
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/782.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/782.png
new file mode 100644
index 0000000000000000000000000000000000000000..a446379cf91909a22fa17f220717bdd9a0252c70
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/782.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:56fdbf4012df7e804e0e1532d8ec114abc928349e83f112022245ac468e4b34b
+size 455846
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/783.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/783.png
new file mode 100644
index 0000000000000000000000000000000000000000..4c9a32b9941ec937bca9e4667c2dd37e65aafeb4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/783.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:07bb4a5b91ac53ec439c8c1804305665ca8e4273a90d358bdd270fce53cd19e8
+size 465301
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/784.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/784.png
new file mode 100644
index 0000000000000000000000000000000000000000..0ce6ca78bef78b30d5e2e8ae49f58b6b6f2ddd09
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/784.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2421c338a496563102f987c3de9fe4f779e6461e2c41eff9732374b020f3288b
+size 409503
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/785.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/785.png
new file mode 100644
index 0000000000000000000000000000000000000000..0fac8bcea9ab1c77da710af9caf3f8c3fb171227
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/785.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1b20986ce007c2aa4bd1a8c8aeb4a64523ef4c4f4f6a559231ea3d91f6da5afa
+size 449128
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/786.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/786.png
new file mode 100644
index 0000000000000000000000000000000000000000..263257dfd4d62349c7f6a872e13e44361d779c63
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/786.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:67e67911249e9120a5e6516f6c08a74380b4296a5bf6183a205ba8f1325b3284
+size 401436
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/788.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/788.png
new file mode 100644
index 0000000000000000000000000000000000000000..95acb37e2e5f76f998b4c983d48813d6f9d9718e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/788.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b531a24a9f456a36d45ebef6aa709ab0539add7e1cf106fe7586362adbe51a86
+size 440657
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/789.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/789.png
new file mode 100644
index 0000000000000000000000000000000000000000..dfc62dfa4952dadf71d72ded2d202400b8c1af32
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/789.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3aa9f4dc373aa61610fc58fbbb3a7c33426c4b375efb958d7d7e9e1734763a82
+size 456536
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/790.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/790.png
new file mode 100644
index 0000000000000000000000000000000000000000..e6284cbb1c7311c2e8ff30435bf4c2a5a107c355
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/790.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b7810bd8d7773eac406e5cf901c7fe2df68f9c56257d363a1228484a33f36b74
+size 455166
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/791.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/791.png
new file mode 100644
index 0000000000000000000000000000000000000000..771d6379798d39fc42c70b792f74eff7aaf9d92d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/791.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6298969e3068a47188584b358d313839241092c688b48743a2d42ae99723f2e1
+size 299794
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/792.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/792.png
new file mode 100644
index 0000000000000000000000000000000000000000..9bc7ffe4b5ba011860840b6db2c1202ea383842a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/792.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:788e2e3304bd5a7d898511b36affe574c087f7f1a34661dfe95bfd124fbf9c02
+size 457550
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/793.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/793.png
new file mode 100644
index 0000000000000000000000000000000000000000..f0f9d0e634d59b3cf6d19b10120498f42fc63dbc
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/793.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1aec25a18845692140a2d4feefce1590bcba3ca3dbc184674319966914de4e7c
+size 479889
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/794.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/794.png
new file mode 100644
index 0000000000000000000000000000000000000000..47686a5f3d9049fe5e1cc6e6723090a02f8cb77b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/794.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a4963d88479df3c47f7d2807d535ff9235a6c31bff5fecfd070069cc37306404
+size 457754
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/795.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/795.png
new file mode 100644
index 0000000000000000000000000000000000000000..04a04d10abb06635178a210fa040fbedb9eb50d0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/795.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:29bcc7b7c73fd1ea49978422043c929a37d58fb6560ec5b7ff0c94acd5ff23db
+size 324396
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/796.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/796.png
new file mode 100644
index 0000000000000000000000000000000000000000..7582efebd5ba106a87647c28b01cd0ee306845c4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/796.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ce9856e295e256794cc7d52e3ac5d0c6fad602da6e4745ff4567be5a5cbcb45e
+size 523818
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/797.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/797.png
new file mode 100644
index 0000000000000000000000000000000000000000..5a94d15984403f37523d4cfa1587775f9b1c0568
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/797.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f800483b3565906a77f1482cfc873f9aa5114407d6d956f08937f09acb20451f
+size 479101
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/799.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/799.png
new file mode 100644
index 0000000000000000000000000000000000000000..8431c9b2c2e3643627d12a62bb677831e7908234
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/799.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bfcfbd4a3023c512d9bdb9573445b80e09597446dbcc9a0756d061ab69003b14
+size 399755
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/800.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/800.png
new file mode 100644
index 0000000000000000000000000000000000000000..290915ff269a54b06bfec544a0cd9478d6da4435
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/800.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2bd117779807281b0af1b0f7ae2f61e6ca927dec8ec68dff9e70ab594f7afe01
+size 414905
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/801.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/801.png
new file mode 100644
index 0000000000000000000000000000000000000000..ee52dc9f6e20b9ef880cdcf0f98779f84539674b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/801.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:838be19d56cb8698a6e85901a796f8f4beaa1ef91b91359a1d9bfc310c666f43
+size 401273
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/802.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/802.png
new file mode 100644
index 0000000000000000000000000000000000000000..a788751e6fe4dad095ab3e0bada99ef298cf7bb5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/802.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c6c86fcd239db642b9f9fb5444ac2aa0472685d833cae372a2bda85cd0d55a74
+size 418533
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/803.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/803.png
new file mode 100644
index 0000000000000000000000000000000000000000..87f9491a5a524d6fa150675dbb69f2faa0e0c0d4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/803.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cd885ac079a65b76e16d7fdf935d692d4aff3a8e5797fc688cfbc2a49f2a62c6
+size 443575
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/804.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/804.png
new file mode 100644
index 0000000000000000000000000000000000000000..17371addfb1198cd5a961ee1ebdf729efca75d31
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/804.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:820ab6f5f88ae53feac3c78745c67eb26c6f46decd198e830ea692cb2f7a3b77
+size 334930
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/805.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/805.png
new file mode 100644
index 0000000000000000000000000000000000000000..28403fc93b38c792dd996df121e5ca41b4b18f9d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/805.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c926072ee2d79255f0c1b238ff3cf8c35009a033f82faf03ca98daa4d5dfe22e
+size 466763
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/806.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/806.png
new file mode 100644
index 0000000000000000000000000000000000000000..6f6c708357b26eede8829841357f8d3e0a644c9b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/806.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7411cf416076009c1b4ad9f1d8138d25bd1c6508f4ea0df65ee706df3723d908
+size 396230
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/807.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/807.png
new file mode 100644
index 0000000000000000000000000000000000000000..67306c72a5ee031f4e7c95932b253383fce34926
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/807.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:874ab767087050767e13e8f003fb05cb4f16773b11f9c1974782bd08f9e552c7
+size 418609
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/808.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/808.png
new file mode 100644
index 0000000000000000000000000000000000000000..64238a094ebdcd307823489376b47205cc24478c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/808.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:11258dfd0f44d1c5861db82544e9a05cf3eed941c9a9c5afb204de7b6b5c0c99
+size 445114
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/809.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/809.png
new file mode 100644
index 0000000000000000000000000000000000000000..b1922c8c734ef48b3f8cec9e113a4bf41fd80c49
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/809.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c2f9df03498d1dd29f50d8bc2777a07681293b2f1920a08ad40c3b740e5b6e6b
+size 375782
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/810.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/810.png
new file mode 100644
index 0000000000000000000000000000000000000000..a8c6a5d0c297aff1d260a0819d20342ae9047d80
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/810.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3a18a1a54b7b0764d80dccc2bb0d9e7adf26e339ed1ea215409e8bd44b3ec830
+size 333728
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/811.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/811.png
new file mode 100644
index 0000000000000000000000000000000000000000..31835e1326f269d469010d14ee0859454d662969
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/811.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1e0de97247297dfaaabf18187555f32d021f7243ac5b9dc1ccccf1400aaebf57
+size 474632
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/812.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/812.png
new file mode 100644
index 0000000000000000000000000000000000000000..806fef200645488ae2c8fc9be3282c7edef23e4f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/812.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fe9f4122262a9dbe3fe233440a55e45596dcc3f454d0d6b46f9e26d78c0a626f
+size 423336
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/813.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/813.png
new file mode 100644
index 0000000000000000000000000000000000000000..3229724b262d19b9453fb3aba347af81c9849e0f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/813.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9ee8980b2287a95e172b8f9094235e58d21312eca5e38aa3fd372a5967bbef5f
+size 447857
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/814.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/814.png
new file mode 100644
index 0000000000000000000000000000000000000000..e1284a92a4f1ed65e3e770a1c63e8b2717a29f51
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/814.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:73f79fd5f55b3eb62dd62f9907794efe01bb92de88194990226579a0e933b4f7
+size 393716
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/816.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/816.png
new file mode 100644
index 0000000000000000000000000000000000000000..2040bd441b0c97072a2c897992ecf36286bc2631
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/816.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8481ab327a01da30abaa066e3a84631fe16586d3d7c9e6724244de890d81b772
+size 644128
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/818.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/818.png
new file mode 100644
index 0000000000000000000000000000000000000000..6b4ce31de1217668246acd11f09fe2ad38d20dfd
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/818.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2c1edff06a65019cc144fb67dd6ee3e4444f1a417674910bc487bca95daf12cc
+size 357259
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/821.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/821.png
new file mode 100644
index 0000000000000000000000000000000000000000..9eafb443e39d9f92d50431d4c1d873edb245eae9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/821.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c0bc7991a301cb58fb970fb80c877a88c187e37f4f46095be17866c5e7273ab8
+size 366265
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/822.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/822.png
new file mode 100644
index 0000000000000000000000000000000000000000..57f8f34131cedfd6f2663318a8371c930e4b47f2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/822.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:80e36ddb85b3616efb760904dd1169b6820d7579c7e225df4e8899903d16e26f
+size 404898
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/823.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/823.png
new file mode 100644
index 0000000000000000000000000000000000000000..5751a58e43e2288f60d898d46c4ef24825d368c4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/823.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a711b3f797fd11940d0573fe7dfcf73dad4e5b1db7fa42f8317bb00991650b7d
+size 414245
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/826.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/826.png
new file mode 100644
index 0000000000000000000000000000000000000000..0c402969321444a870535d8d2624bfcc5b8d105f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Change_Material/826.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f693839124383e913439050972217bab247305e7e99e828ebca1962b64be76fa
+size 382623
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/132.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/132.png
new file mode 100644
index 0000000000000000000000000000000000000000..0e90e02e2c763efe1a02d4cc47e503cea32437cd
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/132.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8c1830cb42acdc6a2b30d4bfe11db2d5df8a2bae8072ad88b987d01e607f5b01
+size 384077
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/136.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/136.png
new file mode 100644
index 0000000000000000000000000000000000000000..2d138ac28aae73ca86c50561972b0e196c1a77ab
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/136.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fb314258e65f6068bb1561575d9b4af3e06d6accceec51a358c673af3a816439
+size 487833
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/139.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/139.png
new file mode 100644
index 0000000000000000000000000000000000000000..4d1bc42651b739995989d26c7aac999f23b3529d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/139.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2af3b39a1ea58a2c05c30abd2fbf7a64706f515e91c06f60fd137f5833aea3df
+size 440096
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/141.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/141.png
new file mode 100644
index 0000000000000000000000000000000000000000..9f83b619de82bb6cffd496343b8f24193571ca0f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/141.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:62d771640c9b13c0e7f43f9780485b7b81af4202ee69e0e600db9c23281cf8d5
+size 374332
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/142.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/142.png
new file mode 100644
index 0000000000000000000000000000000000000000..524172eeda8efae7f381dd395855348a93b3b451
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/142.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9836681ad02ee86039b429e5b59fd542660570af16fd3c4d95530c6530ba2b52
+size 523339
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/143.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/143.png
new file mode 100644
index 0000000000000000000000000000000000000000..0b095cb91c585ae7bdd290e64f1d44d96aca499d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/143.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9daed774bf4d1af73388ab14fe85f8d1e018a5cf027e2ef2d814e9b4cc6e967c
+size 346386
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/145.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/145.png
new file mode 100644
index 0000000000000000000000000000000000000000..f42ab8fa2bc6e70292d79c523c955cfc8a496dd3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/145.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6bd9c3fb5b34c1e7b4b65cfab9ac297cde05fd00faf8077a5d9c9b856754a68f
+size 379563
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/149.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/149.png
new file mode 100644
index 0000000000000000000000000000000000000000..f5438d537cc19bedde6e9fc76ba4d88fe85e4124
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/149.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:63ef616915037d280fd308fe324d377bbb5479b1f1b49ffe9fb9735722233c94
+size 351799
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/151.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/151.png
new file mode 100644
index 0000000000000000000000000000000000000000..bb69a22775a41d54fb2669f97a191dcdec64ac2d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/151.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9aa265bf13265e5631f85bad225b217515935554153c0f79d311c9254f6fcf7f
+size 336877
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/155.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/155.png
new file mode 100644
index 0000000000000000000000000000000000000000..81c7adc460d9ed9519fe4b982b42259779cece72
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/155.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:515fb7abe45615955b0083f14122e77244f98e36d5eb4a9bfc88a9881c6ef668
+size 433342
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/157.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/157.png
new file mode 100644
index 0000000000000000000000000000000000000000..68d881db01a882fca6c603c67a3754efb318ab8e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/157.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c7dbb87f7df4349a0a338479707aae82af32573c7185645a691c91cbe51c8e71
+size 407532
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/158.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/158.png
new file mode 100644
index 0000000000000000000000000000000000000000..78d5675f87b4a1ec0a2d4424773ed3c56d505424
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/158.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9c3c3c5680f2e040c9ae694617410d434ba90b51e47f49cc571d3cb395fd656b
+size 399590
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/164.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/164.png
new file mode 100644
index 0000000000000000000000000000000000000000..be28a87d9f0fc600d95fb3abac247963e7b8e48e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/164.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8e835fbc199964db94d985108a37b48116497c04984320899bc79cd02dcd272c
+size 372198
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/165.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/165.png
new file mode 100644
index 0000000000000000000000000000000000000000..3846319be949fe7707614f09b682c894fba9cf85
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/165.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bfcbb386dee221374a5055b831547e8de4dce4c3d77e2f3ce1a1110037fc4061
+size 385060
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/166.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/166.png
new file mode 100644
index 0000000000000000000000000000000000000000..6bed1c5350963a1808cda151d3424f6825fe9d99
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/166.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d7f41fba677cfd3aad4dc9f725e92fa7554ecf087ba74ac737c22fe0a64a2570
+size 351414
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/168.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/168.png
new file mode 100644
index 0000000000000000000000000000000000000000..b98cef37004321acd88b9f7fa1842a27aa956a76
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/168.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:33e35c41001d62cb4de8838f79518ffb1efac37718c891fffc797abfb4654bd4
+size 344846
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/169.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/169.png
new file mode 100644
index 0000000000000000000000000000000000000000..d5adfd112e64493a13ff96f98125b78539bf87a6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/169.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fa9b1dfd4fc0d1cb6c54e295566cad624d429afeffd5f27b1c03ef3630acad19
+size 211185
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/172.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/172.png
new file mode 100644
index 0000000000000000000000000000000000000000..bdc2d8f99947a45c43e0b37bac4ca781da1cfc69
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/172.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0722fbd2cbb3a97fde96882b0f3f6cf2d76d92ad8cc486ed4f79013671852e9a
+size 315037
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/176.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/176.png
new file mode 100644
index 0000000000000000000000000000000000000000..636e62ca48ec6a7fe42359a6297c9121d687e856
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/176.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1dd908c2f186d563db3a82c53a74a5b969c254d0a7a4fab054caca2010e0f95e
+size 342782
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/177.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/177.png
new file mode 100644
index 0000000000000000000000000000000000000000..e351daebd70acd341c77374a24dc83656f4a8b0c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/177.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:43589f79ad74495a1aa054d7b187f0b9a08550e6e418422c4b42a3084bb3061a
+size 307339
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/179.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/179.png
new file mode 100644
index 0000000000000000000000000000000000000000..9e9b102a0f9de9160a22d2950af9586de39fd10c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/179.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:37d7624938047c94ffb97421e18f488994bc294e181ca2359284d809b72afd81
+size 536281
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/181.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/181.png
new file mode 100644
index 0000000000000000000000000000000000000000..1c482edd71a749b9dbc8ca73d34147880a226c8e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/181.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c8e8ebf67516bc61ab67aa6e7d182f841ec8c263b8b09ff0a1887b72d33a983a
+size 404166
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/185.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/185.png
new file mode 100644
index 0000000000000000000000000000000000000000..e49414dc5b8092e9aa95742d1b1063ff8132b156
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/185.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:17765949a3a39d46b17bfe59557af9a64e34d9a0e8b0ffdf00da4c9cf2f30746
+size 409168
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/186.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/186.png
new file mode 100644
index 0000000000000000000000000000000000000000..58d460811e3af9fe2bf3e27c3064b80ee840e392
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/186.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3c2bb46c4e8cafd3ec2853ddfab75cde24335b067bc1a297171e9896cf523382
+size 429889
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/188.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/188.png
new file mode 100644
index 0000000000000000000000000000000000000000..65d5ada56de6512ba4100568e4b10b9304d34537
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/188.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c13fa69858356e760d2d64819582381585c20c8700308971f463772563861be9
+size 383909
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/190.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/190.png
new file mode 100644
index 0000000000000000000000000000000000000000..b23c72e2042c11e010b5bff240a65df8465e3021
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/190.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ebd9e60f85d19aceff37bf7e589a092d4187fe6ab88da79e3e35ea5df4921f39
+size 402387
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/191.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/191.png
new file mode 100644
index 0000000000000000000000000000000000000000..08f1ef613f4b6183f4d54434f83c445cf972d5c2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/191.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a365e548b414ab40edaa3f5b0b7115ba194c4e53964a14ca3da2a6689887535d
+size 489858
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/193.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/193.png
new file mode 100644
index 0000000000000000000000000000000000000000..730c9f5e6496ef285c7efde0ffe45d0f9f4ed689
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/193.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b25db9634d68027b7a69d8929bc515050b567441ab768c3a830f2c99323e688b
+size 492720
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/195.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/195.png
new file mode 100644
index 0000000000000000000000000000000000000000..7beb34bd70d911e66f3c08f55af76034c0a7f8bd
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/195.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5026c7f4d79a34278bf855efddc40fae615252520e5264845e9e21fc5da9cc5a
+size 573515
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/197.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/197.png
new file mode 100644
index 0000000000000000000000000000000000000000..f6947d78488593dbfc899cbec0441259be953ac7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/197.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:86d74eed8a3b9bb48caef1af7be5e68a6d10eb3c9ee247f9e498b74f2038e19a
+size 383147
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/198.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/198.png
new file mode 100644
index 0000000000000000000000000000000000000000..5a814f5f480eebeb2d98b27225c688519af9e998
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/198.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:53249de7b85c3d7be3d64553f0c2cb02c8bbaa19fcab6e2f4ffc2b01e7c4c112
+size 401740
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/199.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/199.png
new file mode 100644
index 0000000000000000000000000000000000000000..23eacf565114c2673e6134e63e6227358b99ab98
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/199.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:79fb120f8222c29ec576b24ff044be5ed584a8b88d3c33e60a2a99144bf327b7
+size 397201
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/200.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/200.png
new file mode 100644
index 0000000000000000000000000000000000000000..be9dbb493886e73b87e9221cbd0a976d3858d0b0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/200.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c0a7fc3c2de2dfab44773f382d41110eadd3ab697127e8d71f3cbeae4d08d688
+size 442642
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/203.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/203.png
new file mode 100644
index 0000000000000000000000000000000000000000..ad45a1dc1c3700f15e3bdfa150d9af51664f1681
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/203.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3a0e8c12d9894bea89b4e25739d9f7c594a9dcb8faac6240cdcbe0d6b8b378c6
+size 442491
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/206.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/206.png
new file mode 100644
index 0000000000000000000000000000000000000000..2f1745a6928fb4b450a7c2a13c3fbe8c01ee483e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/206.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9b42098de46e69fc755eacf94e166e96192175efb9304dce3240537ecad1b8ef
+size 434398
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/207.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/207.png
new file mode 100644
index 0000000000000000000000000000000000000000..03332777c393cebabf7a86d5b6cdb5d59de2bca3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/207.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bbdd4ae5ca305c0c27c4f5a55bb897f37350856e4414c7b1ad6cd26a393e3dfb
+size 394431
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/208.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/208.png
new file mode 100644
index 0000000000000000000000000000000000000000..56e7f36dfe42d947f4b5e0cab28efbd2ea88d5ee
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/208.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fac91d38db66cb381f284e3bd6edacac1bb58b02b9d04015077bee27fc071045
+size 431982
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/209.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/209.png
new file mode 100644
index 0000000000000000000000000000000000000000..2d3a390556becf04aa5d475ecab07c7baee381a9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/209.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bd7611df490073c6d775dfdbca5adc8fa07fd005bcb0c38e7c6cb9d446ae3036
+size 473371
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/210.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/210.png
new file mode 100644
index 0000000000000000000000000000000000000000..bb1cdff130362e176207ef13345c0cf8bd6b35a0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/210.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0c4292967be104b398c0879ca3363118b21afb4e7e6b5a419ea91324cdbb6fe2
+size 523529
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/211.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/211.png
new file mode 100644
index 0000000000000000000000000000000000000000..f7ef63a80ac60b4998eacb53631336a7252187cb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/211.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ae6e8c191c34b9d74e6bc51456b73b29eae4bdafd3dd73976c9f83d68e546034
+size 379556
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/212.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/212.png
new file mode 100644
index 0000000000000000000000000000000000000000..7ba09f1b837be1a662aee30748dcd4621364cdcb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/212.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:29fac21c33c39fc8f927a13a46145c7691dcb9a9f41c3224c7e9334e23c529fb
+size 409735
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/213.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/213.png
new file mode 100644
index 0000000000000000000000000000000000000000..eef9e1c8ae36cb97fb5066ecd8bc008872081420
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/213.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8e2025411d303caf7e7190cd7678d46266cdeb359af252067e08859e17eb78cd
+size 519732
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/214.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/214.png
new file mode 100644
index 0000000000000000000000000000000000000000..51fdd9024532ce94190561a63a884b9afc72789d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/214.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:88eb6465f16becf6f711ae7fc6ee38354316d10f37ba77b70a652cc32cdf3f13
+size 521970
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/215.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/215.png
new file mode 100644
index 0000000000000000000000000000000000000000..1b87454f30a4312c5f63eaa5119b2878963fef22
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/215.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:80efa9daf38fa3abacfcda551cc0b5b8faf35ab62250811358e9d54a90a3f409
+size 320172
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/216.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/216.png
new file mode 100644
index 0000000000000000000000000000000000000000..d920a63a3acfc792971aa4e92f68874293ac33ff
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/216.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:208c337b5e8517e672c20e05fe8f83556bf9f0fc9f3170febfa466b63b733897
+size 343567
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/218.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/218.png
new file mode 100644
index 0000000000000000000000000000000000000000..2907df12bdfbf51c2ac3bf39828abe9e318eac43
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/218.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4dca34c30ae910701ad124e412e6cc1841a9e89b96cf0533076229fd4fb80ae7
+size 435792
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/219.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/219.png
new file mode 100644
index 0000000000000000000000000000000000000000..f2c277c9c838a93d86b7e66db06e27aeee59e731
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/219.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9118791147d732c35c9536fe8b2dd6b5bed5747207252102ca8747be3159c886
+size 565791
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/220.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/220.png
new file mode 100644
index 0000000000000000000000000000000000000000..e3b8c62afb6e399eab83e852b3f6ce1399254121
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/220.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:72d60737f3b844d3770d274d1a83ccb7bb13078b6dc82bb7e5d827d2ee693a05
+size 473347
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/222.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/222.png
new file mode 100644
index 0000000000000000000000000000000000000000..a3b9940cf8b5dcbc42fb1fc613724ead69e27234
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/222.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c363e439def778f0e0c495c546a118e3485cd47c601657bb16afe8a4bc6edaa5
+size 414649
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/223.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/223.png
new file mode 100644
index 0000000000000000000000000000000000000000..fb8f783e80b0e371b33f2e61b6e87797cab069c7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/223.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:00bc3aea1361979364f32a7ecb9b8c8a039c122184a88b8be298d42b83799c68
+size 490883
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/224.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/224.png
new file mode 100644
index 0000000000000000000000000000000000000000..718ef130d6a14f19c43d79003ce867b6a51ed737
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/224.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:76c54cdd7f4f27d8f9e2bb7466c4c29c028c907fe62d015cac26e204a916a3e8
+size 571395
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/Remove.json b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/Remove.json
new file mode 100644
index 0000000000000000000000000000000000000000..1aa45f6d5d85a917f82c61c60ddff5488e11ece5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/Remove.json
@@ -0,0 +1,1357 @@
+[
+    {
+        "id": "3",
+        "source_image": "Part1/image/3.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the blue overhead traffic sign from the image.",
+        "prompt_cn": "移除蓝色的交通指路牌。",
+        "save_id": 132,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/132.png",
+        "status": "skipped"
+    },
+    {
+        "id": "3",
+        "source_image": "Part1/image/3.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the rainbow from the sky.",
+        "prompt_cn": "移除天空中的彩虹。",
+        "save_id": 133,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/133.png",
+        "status": "skipped"
+    },
+    {
+        "id": "5",
+        "source_image": "Part1/image/5.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove Golden Panda Sculpture.",
+        "prompt_cn": "移除金色熊猫雕塑",
+        "save_id": 134,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/134.png",
+        "status": "skipped"
+    },
+    {
+        "id": "10",
+        "source_image": "Part1/image/10.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the magnifying glass from the image.",
+        "prompt_cn": "移除图中的放大镜 ",
+        "save_id": 136,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/136.png",
+        "status": "skipped"
+    },
+    {
+        "id": "13",
+        "source_image": "Part1/image/13.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the green plant on the cabinet.",
+        "prompt_cn": "移除柜子上的绿色植物",
+        "save_id": 137,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/137.png",
+        "status": "skipped"
+    },
+    {
+        "id": "16",
+        "source_image": "Part1/image/16.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the robot figure on the right.",
+        "prompt_cn": "移除右边的机器人公仔",
+        "save_id": 138,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/138.png",
+        "status": "skipped"
+    },
+    {
+        "id": "25",
+        "source_image": "Part1/image/25.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Delete the net in the image.",
+        "prompt_cn": "删除图像中的篮网。",
+        "save_id": 139,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/139.png",
+        "status": "skipped"
+    },
+    {
+        "id": "27",
+        "source_image": "Part1/image/27.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the heart from the image.",
+        "prompt_cn": "移除图像中的爱心。",
+        "save_id": 140,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/140.png",
+        "status": "skipped"
+    },
+    {
+        "id": "30",
+        "source_image": "Part1/image/30.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the umbrella in the air.",
+        "prompt_cn": "移除空中的雨伞。",
+        "save_id": 142,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/142.png",
+        "status": "skipped"
+    },
+    {
+        "id": "36",
+        "source_image": "Part1/image/36.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the framed artwork on the wall above the bed.",
+        "prompt_cn": "移除床头上方墙上的挂画。",
+        "save_id": 144,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/144.png",
+        "status": "skipped"
+    },
+    {
+        "id": "37",
+        "source_image": "Part1/image/37.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the black headphones hanging on the wall.",
+        "prompt_cn": "移除挂在墙上的黑色耳机。",
+        "save_id": 145,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/145.png",
+        "status": "skipped"
+    },
+    {
+        "id": "61",
+        "source_image": "Part1/image/61.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the bus from the road.",
+        "prompt_cn": "移除路上的公交车。",
+        "save_id": 146,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/146.png",
+        "status": "skipped"
+    },
+    {
+        "id": "66",
+        "source_image": "Part1/image/66.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the letter in the center of the image.",
+        "prompt_cn": "移除图片中间的信。 ",
+        "save_id": 147,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/147.png",
+        "status": "skipped"
+    },
+    {
+        "id": "72",
+        "source_image": "Part1/image/72.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the metal fork resting on the plate near the cake.",
+        "prompt_cn": "移除盘子上靠近蛋糕的金属叉子",
+        "save_id": 149,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/149.png",
+        "status": "skipped"
+    },
+    {
+        "id": "87",
+        "source_image": "Part1/image/87.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the single noticeable white egg from the middle of the carton.",
+        "prompt_cn": "移除蛋盒中唯一那颗显眼的白色鸡蛋",
+        "save_id": 152,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/152.png",
+        "status": "skipped"
+    },
+    {
+        "id": "141",
+        "source_image": "Part1/image/141.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the curtains from the image.",
+        "prompt_cn": "移除图中的窗帘。",
+        "save_id": 154,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/154.png",
+        "status": "skipped"
+    },
+    {
+        "id": "245",
+        "source_image": "Part1/image/245.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the small boat from the image.",
+        "prompt_cn": "移除图中的小船。",
+        "save_id": 155,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/155.png",
+        "status": "skipped"
+    },
+    {
+        "id": "257",
+        "source_image": "Part1/image/257.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the camera from the image.",
+        "prompt_cn": "移除图中的相机。",
+        "save_id": 157,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/157.png",
+        "status": "skipped"
+    },
+    {
+        "id": "261",
+        "source_image": "Part1/image/261.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove all the popcorn pieces that are scattered on the table.",
+        "prompt_cn": "移除桌面上所有散落的爆米花粒。",
+        "save_id": 158,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/158.png",
+        "status": "skipped"
+    },
+    {
+        "id": "269",
+        "source_image": "Part1/image/269.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the toilet from the image.",
+        "prompt_cn": "移除图像中的马桶。",
+        "save_id": 162,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/162.png",
+        "status": "skipped"
+    },
+    {
+        "id": "272",
+        "source_image": "Part1/image/272.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the seagull from the image.",
+        "prompt_cn": "移除图片中的海鸥。",
+        "save_id": 164,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/164.png",
+        "status": "skipped"
+    },
+    {
+        "id": "276",
+        "source_image": "Part1/image/276.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the guitar from the image.",
+        "prompt_cn": "移除图中的吉他。",
+        "save_id": 165,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/165.png",
+        "status": "skipped"
+    },
+    {
+        "id": "277",
+        "source_image": "Part1/image/277.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove any candles from the composition.",
+        "prompt_cn": "移除图中的蜡烛。",
+        "save_id": 166,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/166.png",
+        "status": "skipped"
+    },
+    {
+        "id": "290",
+        "source_image": "Part1/image/290.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the topmost roll of paper.",
+        "prompt_cn": "移除最上面的卷纸。",
+        "save_id": 168,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/168.png",
+        "status": "skipped"
+    },
+    {
+        "id": "293",
+        "source_image": "Part1/image/293.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the balls in the image that are not smiling.",
+        "prompt_cn": "移除图中没有微笑的小球。",
+        "save_id": 169,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/169.png",
+        "status": "skipped"
+    },
+    {
+        "id": "300",
+        "source_image": "Part1/image/300.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the red trash can.",
+        "prompt_cn": "移除红色的垃圾桶。",
+        "save_id": 171,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/171.png",
+        "status": "skipped"
+    },
+    {
+        "id": "388",
+        "source_image": "Part1/image/388.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the blanket from the sofa.",
+        "prompt_cn": "移除沙发上的毯子。",
+        "save_id": 172,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/172.png",
+        "status": "skipped"
+    },
+    {
+        "id": "393",
+        "source_image": "Part1/image/393.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the microwave from the image.",
+        "prompt_cn": "移除图中的微波炉。",
+        "save_id": 173,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/173.png",
+        "status": "skipped"
+    },
+    {
+        "id": "394",
+        "source_image": "Part1/image/394.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the satellite dish from the image.",
+        "prompt_cn": "移除图中的卫星天线",
+        "save_id": 174,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/174.png",
+        "status": "skipped"
+    },
+    {
+        "id": "408",
+        "source_image": "Part1/image/408.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the sunglasses from the table.",
+        "prompt_cn": "移除桌子上的墨镜。",
+        "save_id": 176,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/176.png",
+        "status": "skipped"
+    },
+    {
+        "id": "416",
+        "source_image": "Part1/image/416.png",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the largest rubber duck from the image.",
+        "prompt_cn": "移除图中的最大的橡皮鸭。",
+        "save_id": 177,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/177.png",
+        "status": "skipped"
+    },
+    {
+        "id": "442",
+        "source_image": "Part1/image/442.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the black lamppost.",
+        "prompt_cn": "删除黑色路灯。",
+        "save_id": 179,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/179.png",
+        "status": "skipped"
+    },
+    {
+        "id": "501",
+        "source_image": "Part1/image/501.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the solid-color cushion.",
+        "prompt_cn": "移除纯色的抱枕。",
+        "save_id": 180,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/180.png",
+        "status": "skipped"
+    },
+    {
+        "id": "1",
+        "source_image": "Part2/Remove_attribute/1.png",
+        "edit_type": "gen_attribute_remove",
+        "prompt_en": "Remove all red objects from the scene.",
+        "GPT_translation_prompt_cn": "从画面中移除所有红色物体。",
+        "GPT_refined_prompt_en": "Remove all red objects from the scene.",
+        "GPT_refined_prompt_cn": "从场景中移除所有红色物体。",
+        "prompt_cn": "从场景中移除所有红色物体。",
+        "save_id": 181,
+        "sub_type": "Remove_attribute",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/181.png",
+        "status": "skipped"
+    },
+    {
+        "id": "4",
+        "source_image": "Part2/Remove_attribute/4.png",
+        "edit_type": "gen_attribute_remove",
+        "prompt_en": "Take out all the glassware from the table.",
+        "GPT_translation_prompt_cn": "把桌子上所有的玻璃器皿都拿走。",
+        "GPT_refined_prompt_en": "Remove all the glassware from the table.",
+        "GPT_refined_prompt_cn": "将桌面上的所有玻璃器皿移除。",
+        "prompt_cn": "将桌面上的所有玻璃器皿移除。",
+        "save_id": 183,
+        "sub_type": "Remove_attribute",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/183.png",
+        "status": "skipped"
+    },
+    {
+        "id": "6",
+        "source_image": "Part2/Remove_attribute/6.png",
+        "edit_type": "gen_attribute_remove",
+        "prompt_en": "Remove all the blue cars.",
+        "GPT_translation_prompt_cn": "移除所有蓝色的汽车。",
+        "GPT_refined_prompt_en": "Remove all of the blue cars.",
+        "GPT_refined_prompt_cn": "移除所有蓝色的汽车。",
+        "prompt_cn": "移除所有蓝色的汽车。",
+        "save_id": 184,
+        "sub_type": "Remove_attribute",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/184.png",
+        "status": "skipped"
+    },
+    {
+        "id": "7",
+        "source_image": "Part2/Remove_attribute/7.png",
+        "edit_type": "gen_attribute_remove",
+        "prompt_en": "Remove all writing instruments.",
+        "GPT_translation_prompt_cn": "移除所有书写工具。",
+        "GPT_refined_prompt_en": "Remove all writing instruments.",
+        "GPT_refined_prompt_cn": "移除所有书写工具。",
+        "prompt_cn": "移除所有书写工具。",
+        "save_id": 185,
+        "sub_type": "Remove_attribute",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/185.png",
+        "status": "skipped"
+    },
+    {
+        "id": "8",
+        "source_image": "Part2/Remove_attribute/8.png",
+        "edit_type": "gen_attribute_remove",
+        "prompt_en": "Remove all leather furniture.",
+        "GPT_translation_prompt_cn": "移除所有皮革家具。",
+        "GPT_refined_prompt_en": "Remove all leather furniture.",
+        "GPT_refined_prompt_cn": "移除所有皮革家具。",
+        "prompt_cn": "移除所有皮革家具。",
+        "save_id": 186,
+        "sub_type": "Remove_attribute",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/186.png",
+        "status": "skipped"
+    },
+    {
+        "id": "10",
+        "source_image": "Part2/Remove_attribute/10.png",
+        "edit_type": "gen_attribute_remove",
+        "prompt_en": "Remove all black items.",
+        "GPT_translation_prompt_cn": "删除所有黑色物品。",
+        "GPT_refined_prompt_en": "Remove all black items from the image.",
+        "GPT_refined_prompt_cn": "从图像中移除所有黑色物品。",
+        "prompt_cn": "从图像中移除所有黑色物品。",
+        "save_id": 188,
+        "sub_type": "Remove_attribute",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/188.png",
+        "status": "skipped"
+    },
+    {
+        "id": "11",
+        "source_image": "Part2/Remove_attribute/11.png",
+        "edit_type": "gen_attribute_remove",
+        "prompt_en": "Remove the broken cookies.",
+        "GPT_translation_prompt_cn": "去掉那些碎掉的饼干。",
+        "GPT_refined_prompt_en": "Remove the broken cookies.",
+        "GPT_refined_prompt_cn": "移除破碎的饼干。",
+        "prompt_cn": "移除破碎的饼干。",
+        "save_id": 189,
+        "sub_type": "Remove_attribute",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/189.png",
+        "status": "skipped"
+    },
+    {
+        "id": "12",
+        "source_image": "Part2/Remove_attribute/12.png",
+        "edit_type": "gen_attribute_remove",
+        "prompt_en": "Remove all spherical objects.",
+        "GPT_translation_prompt_cn": "移除所有球形物体。",
+        "GPT_refined_prompt_en": "Remove all spherical objects.",
+        "GPT_refined_prompt_cn": "移除所有球形物体。",
+        "prompt_cn": "移除所有球形物体。",
+        "save_id": 190,
+        "sub_type": "Remove_attribute",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/190.png",
+        "status": "skipped"
+    },
+    {
+        "id": "13",
+        "source_image": "Part2/Remove_attribute/13.png",
+        "edit_type": "gen_attribute_remove",
+        "prompt_en": "Remove all meat products.",
+        "GPT_translation_prompt_cn": "去除所有肉类食品。",
+        "GPT_refined_prompt_en": "Remove all meat products.",
+        "GPT_refined_prompt_cn": "移除所有肉类食品。",
+        "prompt_cn": "移除所有肉类食品。",
+        "save_id": 191,
+        "sub_type": "Remove_attribute",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/191.png",
+        "status": "skipped"
+    },
+    {
+        "id": "14",
+        "source_image": "Part2/Remove_attribute/14.png",
+        "edit_type": "gen_attribute_remove",
+        "prompt_en": "Remove all electronic devices.",
+        "GPT_translation_prompt_cn": "移除所有电子设备。",
+        "GPT_refined_prompt_en": "Remove all electronic devices.",
+        "GPT_refined_prompt_cn": "移除所有电子设备。",
+        "prompt_cn": "移除所有电子设备。",
+        "save_id": 192,
+        "sub_type": "Remove_attribute",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/192.png",
+        "status": "skipped"
+    },
+    {
+        "id": "15",
+        "source_image": "Part2/Remove_attribute/15.png",
+        "edit_type": "gen_attribute_remove",
+        "prompt_en": "Remove all animals from the room.",
+        "GPT_translation_prompt_cn": "把房间里的所有动物都移除。",
+        "GPT_refined_prompt_en": "Remove all animals from the room.",
+        "GPT_refined_prompt_cn": "将房间中的所有动物移除。",
+        "prompt_cn": "将房间中的所有动物移除。",
+        "save_id": 193,
+        "sub_type": "Remove_attribute",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/193.png",
+        "status": "skipped"
+    },
+    {
+        "id": "17",
+        "source_image": "Part2/Remove_attribute/17.png",
+        "edit_type": "gen_attribute_remove",
+        "prompt_en": "Remove all vehicles from the street.",
+        "GPT_translation_prompt_cn": "从街道上移除所有车辆。",
+        "GPT_refined_prompt_en": "Remove all vehicles from the street.",
+        "GPT_refined_prompt_cn": "从街道上移除所有车辆。",
+        "prompt_cn": "从街道上移除所有车辆。",
+        "save_id": 195,
+        "sub_type": "Remove_attribute",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/195.png",
+        "status": "skipped"
+    },
+    {
+        "id": "1",
+        "source_image": "Part2/Remove_spatial/1.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the armchair on the left side.",
+        "GPT_translation_prompt_cn": "删除左侧的扶手椅。",
+        "GPT_refined_prompt_en": "Remove the armchair on the left side of the image.",
+        "GPT_refined_prompt_cn": "删除图像左侧的扶手椅。",
+        "prompt_cn": "删除图像左侧的扶手椅。",
+        "save_id": 196,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/196.png",
+        "status": "skipped"
+    },
+    {
+        "id": "2",
+        "source_image": "Part2/Remove_spatial/2.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the ceramic vase located in the center of the image.",
+        "GPT_translation_prompt_cn": "移除中间的陶瓷花瓶。",
+        "GPT_refined_prompt_en": "Remove the ceramic vase located in the center of the image.",
+        "GPT_refined_prompt_cn": "移除中间的陶瓷花瓶。",
+        "prompt_cn": "移除中间的陶瓷花瓶。",
+        "save_id": 197,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/197.png",
+        "status": "skipped"
+    },
+    {
+        "id": "3",
+        "source_image": "Part2/Remove_spatial/3.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the plant on the far right.",
+        "GPT_translation_prompt_cn": "移除最右边的那盆植物。",
+        "GPT_refined_prompt_en": "Remove the plant on the far right.",
+        "GPT_refined_prompt_cn": "移除最右侧的那盆植物。",
+        "prompt_cn": "移除最右侧的那盆植物。",
+        "save_id": 198,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/198.png",
+        "status": "skipped"
+    },
+    {
+        "id": "4",
+        "source_image": "Part2/Remove_spatial/4.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the top book from the stack on the right side of the image.",
+        "GPT_translation_prompt_cn": "移除右边最上面的那本书。",
+        "GPT_refined_prompt_en": "Remove the top book from the stack on the right side of the image.",
+        "GPT_refined_prompt_cn": "移除右边最上面的那本书。",
+        "prompt_cn": "移除右边最上面的那本书。",
+        "save_id": 199,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/199.png",
+        "status": "skipped"
+    },
+    {
+        "id": "6",
+        "source_image": "Part2/Remove_spatial/6.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the vehicle that is nearest to the traffic sign.",
+        "GPT_translation_prompt_cn": "移除离交通指示牌最近的车辆。",
+        "GPT_refined_prompt_en": "Remove the vehicle that is nearest to the traffic sign.",
+        "GPT_refined_prompt_cn": "移除离交通指示牌最近的车辆。",
+        "prompt_cn": "移除离交通指示牌最近的车辆。",
+        "save_id": 200,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/200.png",
+        "status": "skipped"
+    },
+    {
+        "id": "7",
+        "source_image": "Part2/Remove_spatial/7.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the vehicle that is farther away from the camera.",
+        "GPT_translation_prompt_cn": "移除离镜头更远的车辆。",
+        "GPT_refined_prompt_en": "Remove the vehicle that is farther away from the camera.",
+        "GPT_refined_prompt_cn": "移除离镜头更远的车辆。",
+        "prompt_cn": "移除离镜头更远的车辆。",
+        "save_id": 201,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/201.png",
+        "status": "skipped"
+    },
+    {
+        "id": "8",
+        "source_image": "Part2/Remove_spatial/8.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the pillow on the right.",
+        "GPT_translation_prompt_cn": "移除右边的枕头。",
+        "GPT_refined_prompt_en": "Remove the pillow on the right side.",
+        "GPT_refined_prompt_cn": "移除右侧的枕头。",
+        "prompt_cn": "移除右侧的枕头。",
+        "save_id": 202,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/202.png",
+        "status": "skipped"
+    },
+    {
+        "id": "9",
+        "source_image": "Part2/Remove_spatial/9.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the sneaker on the left.",
+        "GPT_translation_prompt_cn": "移除左边的运动鞋。",
+        "GPT_refined_prompt_en": "Remove the sneaker on the left.",
+        "GPT_refined_prompt_cn": "移除左侧的运动鞋。",
+        "prompt_cn": "移除左侧的运动鞋。",
+        "save_id": 203,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/203.png",
+        "status": "skipped"
+    },
+    {
+        "id": "10",
+        "source_image": "Part2/Remove_spatial/10.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the plate closest to the camera.",
+        "GPT_translation_prompt_cn": "移除离相机最近的盘子。",
+        "GPT_refined_prompt_en": "Remove the plate that is closest to the camera.",
+        "GPT_refined_prompt_cn": "移除距离相机最近的那个盘子。",
+        "prompt_cn": "移除距离相机最近的那个盘子。",
+        "save_id": 204,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/204.png",
+        "status": "skipped"
+    },
+    {
+        "id": "11",
+        "source_image": "Part2/Remove_spatial/11.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the water bottle on the right.",
+        "GPT_translation_prompt_cn": "删除右边的水瓶。",
+        "GPT_refined_prompt_en": "Remove the water bottle on the right.",
+        "GPT_refined_prompt_cn": "删除右侧的水瓶。",
+        "prompt_cn": "删除右侧的水瓶。",
+        "save_id": 205,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/205.png",
+        "status": "skipped"
+    },
+    {
+        "id": "12",
+        "source_image": "Part2/Remove_spatial/12.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the teddy bear on the left.",
+        "GPT_translation_prompt_cn": "移除左边的泰迪熊。",
+        "GPT_refined_prompt_en": "Remove the teddy bear on the left.",
+        "GPT_refined_prompt_cn": "移除左侧的泰迪熊。",
+        "prompt_cn": "移除左侧的泰迪熊。",
+        "save_id": 206,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/206.png",
+        "status": "skipped"
+    },
+    {
+        "id": "13",
+        "source_image": "Part2/Remove_spatial/13.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the coffee mug next to the potted plant.",
+        "GPT_translation_prompt_cn": "移除盆栽旁边的咖啡杯。",
+        "GPT_refined_prompt_en": "Remove the coffee mug that is next to the potted plant.",
+        "GPT_refined_prompt_cn": "移除放在盆栽旁边的咖啡杯。",
+        "prompt_cn": "移除放在盆栽旁边的咖啡杯。",
+        "save_id": 207,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/207.png",
+        "status": "skipped"
+    },
+    {
+        "id": "14",
+        "source_image": "Part2/Remove_spatial/14.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the apple closest to the banana.",
+        "GPT_translation_prompt_cn": "删除香蕉旁边的苹果。",
+        "GPT_refined_prompt_en": "Remove the apple that is next to the banana.",
+        "GPT_refined_prompt_cn": "移除在香蕉旁边的那个苹果。",
+        "prompt_cn": "移除离香蕉最近的苹果。",
+        "save_id": 208,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/208.png",
+        "status": "success"
+    },
+    {
+        "id": "15",
+        "source_image": "Part2/Remove_spatial/15.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the dog closest to the fire hydrant.",
+        "GPT_translation_prompt_cn": "移除站在消防栓旁边的那只狗。",
+        "GPT_refined_prompt_en": "Remove the dog that is standing next to the fire hydrant.",
+        "GPT_refined_prompt_cn": "移除站在消防栓旁边的那只狗。",
+        "prompt_cn": "移除距离消防栓最近的那只狗。",
+        "save_id": 209,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/209.png",
+        "status": "success"
+    },
+    {
+        "id": "16",
+        "source_image": "Part2/Remove_spatial/16.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the blue sedan parked in front of the pharmacy.",
+        "GPT_translation_prompt_cn": "将停在药店前面的蓝色轿车移除。",
+        "GPT_refined_prompt_en": "Remove the blue sedan parked in front of the pharmacy.",
+        "GPT_refined_prompt_cn": "移除停在药店前面的蓝色轿车。",
+        "prompt_cn": "移除停在药店门口的蓝色轿车。",
+        "save_id": 210,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/210.png",
+        "status": "skipped"
+    },
+    {
+        "id": "17",
+        "source_image": "Part2/Remove_spatial/17.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the pen near the glue stick.",
+        "GPT_translation_prompt_cn": "移除胶棒附近的那支笔。",
+        "GPT_refined_prompt_en": "Remove the pen that is near the glue stick.",
+        "GPT_refined_prompt_cn": "移除靠近胶棒的那支笔。",
+        "prompt_cn": "移除靠近胶棒的那支笔。",
+        "save_id": 211,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/211.png",
+        "status": "skipped"
+    },
+    {
+        "id": "18",
+        "source_image": "Part2/Remove_spatial/18.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the toy car near the dollhouse.",
+        "GPT_translation_prompt_cn": "把靠近玩偶屋的玩具汽车移除。",
+        "GPT_refined_prompt_en": "Remove the toy car that is near the dollhouse.",
+        "GPT_refined_prompt_cn": "移除靠近玩偶屋的那辆玩具汽车。",
+        "prompt_cn": "移除靠近玩偶屋的那辆玩具汽车。",
+        "save_id": 212,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/212.png",
+        "status": "skipped"
+    },
+    {
+        "id": "19",
+        "source_image": "Part2/Remove_spatial/19.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the tennis ball near the racket.",
+        "GPT_translation_prompt_cn": "删除靠近球拍的那个网球。",
+        "GPT_refined_prompt_en": "Remove the tennis ball that is next to the racket.",
+        "GPT_refined_prompt_cn": "删除在球拍旁边的那个网球。",
+        "prompt_cn": "删除在球拍旁边的那个网球。",
+        "save_id": 213,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/213.png",
+        "status": "skipped"
+    },
+    {
+        "id": "20",
+        "source_image": "Part2/Remove_spatial/20.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the cat next to the ball of yarn.",
+        "GPT_translation_prompt_cn": "移除靠近毛线球的那只猫。",
+        "GPT_refined_prompt_en": "Remove the cat that is next to the ball of yarn.",
+        "GPT_refined_prompt_cn": "移除在毛线球旁边的那只猫。",
+        "prompt_cn": "移除靠近毛线球的那只猫。",
+        "save_id": 214,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/214.png",
+        "status": "skipped"
+    },
+    {
+        "id": "21",
+        "source_image": "Part2/Remove_spatial/21.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the baseball cap that is nearest to the jacket.",
+        "GPT_translation_prompt_cn": "移除离夹克最近的棒球帽。",
+        "GPT_refined_prompt_en": "Remove the baseball cap that is nearest to the jacket.",
+        "GPT_refined_prompt_cn": "移除离夹克最近的棒球帽。",
+        "prompt_cn": "移除离夹克最近的棒球帽。",
+        "save_id": 215,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/215.png",
+        "status": "skipped"
+    },
+    {
+        "id": "22",
+        "source_image": "Part2/Remove_spatial/22.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the wine bottle nearest to the corkscrew.",
+        "GPT_translation_prompt_cn": "移除开瓶器旁边的葡萄酒瓶。",
+        "GPT_refined_prompt_en": "Remove the wine bottle that is next to the corkscrew.",
+        "GPT_refined_prompt_cn": "移除在开瓶器旁边的那只葡萄酒瓶。",
+        "prompt_cn": "移除离开瓶器最近的葡萄酒瓶。",
+        "save_id": 216,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/216.png",
+        "status": "success"
+    },
+    {
+        "id": "23",
+        "source_image": "Part2/Remove_spatial/23.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the USB drive that is nearest to the mouse.",
+        "GPT_translation_prompt_cn": "移除离鼠标最近的U盘。",
+        "GPT_refined_prompt_en": "Remove the USB flash drive that is closest to the mouse.",
+        "GPT_refined_prompt_cn": "移除离鼠标最近的USB闪存盘。",
+        "prompt_cn": "移除离鼠标最近的USB闪存盘。",
+        "save_id": 217,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/217.png",
+        "status": "skipped"
+    },
+    {
+        "id": "24",
+        "source_image": "Part2/Remove_spatial/24.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the spoon lying beside the knife.",
+        "GPT_translation_prompt_cn": "移除刀旁边放着的那把勺子。",
+        "GPT_refined_prompt_en": "Remove the spoon that is lying next to the knife.",
+        "GPT_refined_prompt_cn": "移除那把放在刀旁边的勺子。",
+        "prompt_cn": "移除那把放在刀旁边的勺子。",
+        "save_id": 218,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/218.png",
+        "status": "skipped"
+    },
+    {
+        "id": "25",
+        "source_image": "Part2/Remove_spatial/25.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the clay flower pot closest to the shovel.",
+        "GPT_translation_prompt_cn": "移除离铲子最近的陶土花盆。",
+        "GPT_refined_prompt_en": "Remove the clay flower pot closest to the shovel.",
+        "GPT_refined_prompt_cn": "移除离铲子最近的陶土花盆。",
+        "prompt_cn": "移除离铲子最近的陶土花盆。",
+        "save_id": 219,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/219.png",
+        "status": "skipped"
+    },
+    {
+        "id": "26",
+        "source_image": "Part2/Remove_spatial/26.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the puppy playing with the frisbee.",
+        "GPT_translation_prompt_cn": "移除正在玩飞盘的小狗。",
+        "GPT_refined_prompt_en": "Remove the puppy that is playing with the frisbee.",
+        "GPT_refined_prompt_cn": "移除正在玩飞盘的那只小狗。",
+        "prompt_cn": "移除正在玩飞盘的那只小狗。",
+        "save_id": 220,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/220.png",
+        "status": "skipped"
+    },
+    {
+        "id": "27",
+        "source_image": "Part2/Remove_spatial/27.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the toy building block closest to the doll.",
+        "GPT_translation_prompt_cn": "移除洋娃娃旁边的积木块。",
+        "GPT_refined_prompt_en": "Remove the toy block that is next to the doll.",
+        "GPT_refined_prompt_cn": "移除在洋娃娃旁边的玩具积木块。",
+        "prompt_cn": "移除离洋娃娃最近的玩具积木块。",
+        "save_id": 221,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/221.png",
+        "status": "success"
+    },
+    {
+        "id": "28",
+        "source_image": "Part2/Remove_spatial/28.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the diamond ring closest to the gold bracelet.",
+        "GPT_translation_prompt_cn": "删除金手镯旁边的钻戒。",
+        "GPT_refined_prompt_en": "Remove the diamond ring next to the gold bracelet.",
+        "GPT_refined_prompt_cn": "去除金手镯旁边的钻石戒指。",
+        "prompt_cn": "移除离金手镯最近的钻石戒指。",
+        "save_id": 222,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/222.png",
+        "status": "success"
+    },
+    {
+        "id": "29",
+        "source_image": "Part2/Remove_spatial/29.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the remote control next to the magazine.",
+        "GPT_translation_prompt_cn": "移除杂志旁边的遥控器。",
+        "GPT_refined_prompt_en": "Remove the remote control that is next to the magazine.",
+        "GPT_refined_prompt_cn": "移除在杂志旁边的遥控器。",
+        "prompt_cn": "移除在杂志旁边的遥控器。",
+        "save_id": 223,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/223.png",
+        "status": "skipped"
+    },
+    {
+        "id": "30",
+        "source_image": "Part2/Remove_spatial/30.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the helmet closest to the bicycle.",
+        "GPT_translation_prompt_cn": "把离自行车最近的头盔移除。",
+        "GPT_refined_prompt_en": "Remove the helmet closest to the bicycle.",
+        "GPT_refined_prompt_cn": "把离自行车最近的头盔移除。",
+        "prompt_cn": "把离自行车最近的头盔移除。",
+        "save_id": 224,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/224.png",
+        "status": "skipped"
+    },
+    {
+        "id": "31",
+        "source_image": "Part1/image/28.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the small beige pillow on the right side of the table.",
+        "prompt_cn": "移除桌子右侧的米白色小抱枕。",
+        "save_id": 141,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/141.png",
+        "status": "skipped"
+    },
+    {
+        "id": "32",
+        "source_image": "Part1/image/33.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the lamp on the right bedside table.",
+        "prompt_cn": "移除右侧床头柜的台灯。",
+        "save_id": 143,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/143.png",
+        "status": "skipped"
+    },
+    {
+        "id": "33",
+        "source_image": "Part1/image/80.jpg",
+        "type": "Remove",
+        "sub_type": "Remove_Common_single_obj",
+        "prompt_en": "Remove the orange pumpkin on the right side of the image.",
+        "prompt_cn": "移除画面右侧的橙色南瓜。",
+        "save_id": 151,
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/151.png",
+        "status": "skipped"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/Remove_rank0.json b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/Remove_rank0.json
new file mode 100644
index 0000000000000000000000000000000000000000..5924cf062f38bd7e492b35bc91d9747ddfda9e8f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Remove/Remove_rank0.json
@@ -0,0 +1,102 @@
+[
+    {
+        "id": "14",
+        "source_image": "Part2/Remove_spatial/14.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the apple closest to the banana.",
+        "GPT_translation_prompt_cn": "删除香蕉旁边的苹果。",
+        "GPT_refined_prompt_en": "Remove the apple that is next to the banana.",
+        "GPT_refined_prompt_cn": "移除在香蕉旁边的那个苹果。",
+        "prompt_cn": "移除离香蕉最近的苹果。",
+        "save_id": 208,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/208.png",
+        "_merge_order": 57,
+        "status": "success"
+    },
+    {
+        "id": "15",
+        "source_image": "Part2/Remove_spatial/15.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the dog closest to the fire hydrant.",
+        "GPT_translation_prompt_cn": "移除站在消防栓旁边的那只狗。",
+        "GPT_refined_prompt_en": "Remove the dog that is standing next to the fire hydrant.",
+        "GPT_refined_prompt_cn": "移除站在消防栓旁边的那只狗。",
+        "prompt_cn": "移除距离消防栓最近的那只狗。",
+        "save_id": 209,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/209.png",
+        "_merge_order": 58,
+        "status": "success"
+    },
+    {
+        "id": "22",
+        "source_image": "Part2/Remove_spatial/22.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the wine bottle nearest to the corkscrew.",
+        "GPT_translation_prompt_cn": "移除开瓶器旁边的葡萄酒瓶。",
+        "GPT_refined_prompt_en": "Remove the wine bottle that is next to the corkscrew.",
+        "GPT_refined_prompt_cn": "移除在开瓶器旁边的那只葡萄酒瓶。",
+        "prompt_cn": "移除离开瓶器最近的葡萄酒瓶。",
+        "save_id": 216,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/216.png",
+        "_merge_order": 65,
+        "status": "success"
+    },
+    {
+        "id": "27",
+        "source_image": "Part2/Remove_spatial/27.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the toy building block closest to the doll.",
+        "GPT_translation_prompt_cn": "移除洋娃娃旁边的积木块。",
+        "GPT_refined_prompt_en": "Remove the toy block that is next to the doll.",
+        "GPT_refined_prompt_cn": "移除在洋娃娃旁边的玩具积木块。",
+        "prompt_cn": "移除离洋娃娃最近的玩具积木块。",
+        "save_id": 221,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/221.png",
+        "_merge_order": 70,
+        "status": "success"
+    },
+    {
+        "id": "28",
+        "source_image": "Part2/Remove_spatial/28.png",
+        "edit_type": "gen_spatial_remove",
+        "prompt_en": "Remove the diamond ring closest to the gold bracelet.",
+        "GPT_translation_prompt_cn": "删除金手镯旁边的钻戒。",
+        "GPT_refined_prompt_en": "Remove the diamond ring next to the gold bracelet.",
+        "GPT_refined_prompt_cn": "去除金手镯旁边的钻石戒指。",
+        "prompt_cn": "移除离金手镯最近的钻石戒指。",
+        "save_id": 222,
+        "sub_type": "Remove_spatial",
+        "IC": false,
+        "IF": true,
+        "WA": false,
+        "VC": true,
+        "VQ": true,
+        "output_image_path": "/ytech_m2v8_hdd/workspace/kling_mm/shiyang06/Project/Edit_RM_Bench/OmniBench_V4_Res/UltraEdit/UltraEdit/en/Part1/Remove/222.png",
+        "_merge_order": 71,
+        "status": "success"
+    }
+]
\ No newline at end of file
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/616.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/616.png
new file mode 100644
index 0000000000000000000000000000000000000000..47ed152886a299c990c06d91a1253efc027fcac4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/616.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:10c45df711033d629d1498d9598d38e491c06d7b5ffb742007f05e107697effa
+size 356342
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/618.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/618.png
new file mode 100644
index 0000000000000000000000000000000000000000..0087f75a378fe330d21490419e7b142b8a6593f0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/618.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:65a82330dd1552539cfc0cd778ce034f58b6c286aff7aab2497184b79a378e42
+size 402743
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/619.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/619.png
new file mode 100644
index 0000000000000000000000000000000000000000..b314c766b323a7edad4cdf2dc5cd3162a89169c5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/619.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:88dffcd672fd34b489acd0187c1c74137a001f6a156e9f6a386e133da8f30089
+size 421808
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/620.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/620.png
new file mode 100644
index 0000000000000000000000000000000000000000..255dda0d34b622de0fb231638068db1372b26406
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/620.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f86377fa905fd480b706012633a301321224e7de520e653a19e26b2d08d4da43
+size 273875
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/621.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/621.png
new file mode 100644
index 0000000000000000000000000000000000000000..771ca0c639e587bdf5add3314fbee443eb8df6d0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/621.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:95939754aa1e6c2b7e55dcd9e1abfad9fb1644a944c695b8f95548343fac642f
+size 438197
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/622.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/622.png
new file mode 100644
index 0000000000000000000000000000000000000000..a0b07c37e2683d55d2bef12786f4c426e814536a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/622.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:09d8201b019c4f66b0f49daa4e0f58496347549d03d37e1d62b491f992177dfd
+size 322366
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/623.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/623.png
new file mode 100644
index 0000000000000000000000000000000000000000..463516afffa13d1b33d5175d97a7ea96768e0634
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/623.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e732977db3a43419070c374cfd17840e042ee4cc1c47852c0a0aad0097bbcb68
+size 380234
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/624.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/624.png
new file mode 100644
index 0000000000000000000000000000000000000000..8045bc8787e17d9625642f0406067d79851037b8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/624.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ebb98e9d61f814b58e9b211f2021f0927ebb100480b9b176c4391c29851ae299
+size 347518
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/625.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/625.png
new file mode 100644
index 0000000000000000000000000000000000000000..6d33d9e76a79da3bf4b599d1934e11d1a92b9e9b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/625.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5b9da0c27e1f447c94ce0cf9cce3b5a6dfcc04723a781d4bdd3fe409bfce9490
+size 512229
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/626.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/626.png
new file mode 100644
index 0000000000000000000000000000000000000000..5d2a4cc5c5052b6c28087947c971002ad7967eef
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/626.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3f15a6a426fde9f1a3038f24a451ab334831267ed296b87bdf1445658cd36b8c
+size 387757
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/627.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/627.png
new file mode 100644
index 0000000000000000000000000000000000000000..6c5ac0275ee11b505a1c236aeefc2b4b25c03817
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/627.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1d9381c8b36a74a8ce9a60cd54cb31d99bb3e3fab253c3ebd0ae53215ae3fe9a
+size 457177
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/629.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/629.png
new file mode 100644
index 0000000000000000000000000000000000000000..9fc8fef38a72747188a80ecb2d2ba4388e1b4ea5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/629.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:60848350809b239d83132fef16ea5746a741c253f1f79f43334ae1ea5120cced
+size 422604
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/630.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/630.png
new file mode 100644
index 0000000000000000000000000000000000000000..67ef29503c705a15825cd0c36ec3fcfc6c831825
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/630.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:46f686179e5d1f97091de06e78a239115f19ee01933cdd33f4933506bce09b0d
+size 475781
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/631.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/631.png
new file mode 100644
index 0000000000000000000000000000000000000000..8e614f6bfdeb02abaac99be90646296caaa85ca7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/631.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dc71386966c13ada289f164c851e4b730c806e3b8f342837a5e8dd5c48863b79
+size 376658
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/632.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/632.png
new file mode 100644
index 0000000000000000000000000000000000000000..4cde779bec2896c696340f559a0b57e3d1c96f29
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/632.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:061968a90e106aa00cc3cce551b660a66277df44598d38b5b38a308502b3d603
+size 336329
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/633.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/633.png
new file mode 100644
index 0000000000000000000000000000000000000000..032a2a0f83c0ac833a60722d373caee49ac1a11d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/633.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a6574fa82ca287a6bf44455500432d85ace8e5964d28d959e17a7e0274ef7ad4
+size 291224
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/634.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/634.png
new file mode 100644
index 0000000000000000000000000000000000000000..028c260461ee66986584ef828c1ce4b70faebc88
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/634.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0700fd535caff77b85aca8a4dab791a9633e01963d665bd44abf5829537fe182
+size 407274
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/635.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/635.png
new file mode 100644
index 0000000000000000000000000000000000000000..b45009b0045969d3baf344361007bad38fc1e895
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/635.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ece439726fced4dbf76dce6835cc8a11967875adb5f6211c03e407123382dee3
+size 338389
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/636.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/636.png
new file mode 100644
index 0000000000000000000000000000000000000000..e1ff64873f96e4bff6aeca66a49dc6ac729525ad
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/636.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:790fd63dbd5a97a682a7066f8bf747799760a2a35aecafc700f3e28743d4e1e4
+size 386273
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/637.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/637.png
new file mode 100644
index 0000000000000000000000000000000000000000..d6d23767b6b5045f85a35997b10fce525d84248d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/637.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:045145f9635c53d4fb3fff7cad42307da8621df2ee13a1a89bb651ce6b539ad7
+size 539739
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/638.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/638.png
new file mode 100644
index 0000000000000000000000000000000000000000..f5f59f836b8652db8cd654ebaced4da6b7364730
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/638.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:05621158f9eb7dfc136b60aed370a40548d098040df2525ed63440c6ae8242f0
+size 322893
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/639.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/639.png
new file mode 100644
index 0000000000000000000000000000000000000000..9cca2ff1d910c74906c10309be7772b2fb742815
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/639.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dd926ae9d115598f377b4bf00a91ef704613161038975d5fa59bcccb18ebffef
+size 324630
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/640.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/640.png
new file mode 100644
index 0000000000000000000000000000000000000000..035442da37985551195f4094d4712d3db3ffacdb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/640.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:da1bd560b1f7c03d783af7adeb150e6ed6fa38d459e699e96b1f58cc954b0028
+size 318458
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/641.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/641.png
new file mode 100644
index 0000000000000000000000000000000000000000..95076de5a22d34754f9401af7cd7617239f7284e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/641.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4cd0bd8d4afb5c75f23e8d62f224c509a792b1d5801b39f132829a34c8f0a09f
+size 364654
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/642.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/642.png
new file mode 100644
index 0000000000000000000000000000000000000000..4b9bba3eb47660cbab774bd8a29ab2e8fe30cf4f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/642.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9742731dd662af597768df5d2f437041485c4966731cbf2c28d18f8b27041536
+size 318267
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/643.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/643.png
new file mode 100644
index 0000000000000000000000000000000000000000..23d2a658825caeea2aea472bdca699caed264e7d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/643.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b0f80eb5d0417b4173fe1f21823eabeb2ade85cdd341ec04307c52e3b857026a
+size 446519
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/644.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/644.png
new file mode 100644
index 0000000000000000000000000000000000000000..7d1bb2324351f24e6804d4a72fd0d5511e61ddd6
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/644.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:87c8f52dd45c2e87c7f6854ae9a0ce57a50d9716507f9ead2bffb4bcc9cac55d
+size 346028
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/645.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/645.png
new file mode 100644
index 0000000000000000000000000000000000000000..6b2955d314022f9f88b1b1a583b400c9e0ba0ab7
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/645.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cedf7f979f844f533be5e63269ac72a1a617a3666099e8f0c964085e81d6e416
+size 334334
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/646.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/646.png
new file mode 100644
index 0000000000000000000000000000000000000000..f158292ddb3f509a562514dfb2be680b096d84ac
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/646.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9928c300432584963e3282edf0d84d0f50ccc1cde423cef640b638aece66a9eb
+size 348741
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/647.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/647.png
new file mode 100644
index 0000000000000000000000000000000000000000..6fc7833dde5d4c70be3dd4e7622384db59d8d03a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/647.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c36312a0c924820a38c7f75928b08cbf3995aaf89db71a14eea3b05d22994651
+size 418442
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/648.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/648.png
new file mode 100644
index 0000000000000000000000000000000000000000..e19921154e77780e37db25138baf7e4632562599
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/648.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fccb7722af300240bc26074324da88e1612ea2728df0c6a615e76c3dfa3c535a
+size 546415
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/649.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/649.png
new file mode 100644
index 0000000000000000000000000000000000000000..a87357857027751384e113bc9703e251cccf3ef9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/649.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:db07f649a47e78c0beb951f60f7c6f17e7857aea11ee80802addb58b60d0e9bd
+size 308378
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/650.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/650.png
new file mode 100644
index 0000000000000000000000000000000000000000..6331cab505a3f3770a70467a68a18a2d5e94da28
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/650.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:625c981c909ec7067e4d5c0604cc729825267df3cd5d29b3567d07e6c869c559
+size 408714
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/651.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/651.png
new file mode 100644
index 0000000000000000000000000000000000000000..d581fd3a8d7bb2acd0181a875bd0039d61fc7fd1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/651.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e71343247cc0c968adfbbcb37a6548f634cc72ec6f074b8271cfe0195549c250
+size 238057
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/652.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/652.png
new file mode 100644
index 0000000000000000000000000000000000000000..a3e9a5353c1db1a90e3f25cfa66f3ddaa41e7ae4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/652.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4d80769211355f5505990d0fcf94f2e144a0791e0514ba3620cc79c9c2e0bb04
+size 377598
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/653.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/653.png
new file mode 100644
index 0000000000000000000000000000000000000000..bc890f16e52762b30e815548bead2882064f9ca4
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/653.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5eb713a064dfd169c36521b096f3d2758511b956d9575a7d2993e4032972ba7c
+size 375028
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/654.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/654.png
new file mode 100644
index 0000000000000000000000000000000000000000..05d7c6a0855a87f69bd7efe4889c01ddf8fbefda
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/654.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3837aff84c57ebdb307e81fa49f5d264049e53ef96c261817d6d00ba2f61778c
+size 365487
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/655.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/655.png
new file mode 100644
index 0000000000000000000000000000000000000000..8c158b912f97aafc55a713226bfbeefcff504dde
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/655.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:74d8f5caed9ac4bbad562f3d4ed63b49ac2671d045bbc2b76b2f70058c1da941
+size 364420
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/656.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/656.png
new file mode 100644
index 0000000000000000000000000000000000000000..5de4fb8067b50e8d162873063a2cd1fed093e425
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/656.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:051a76b1d57a3be5ccb44203c780cd2102be33ce52ab9525478cce3aa0539f4f
+size 306569
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/657.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/657.png
new file mode 100644
index 0000000000000000000000000000000000000000..5bbb63d5bfcbdfb1ed33334bb1cd4195f48a97f8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/657.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:152418ca3d1bc1ff4461a83e583c741e8bd3f6e93fd00c70c0de6f6f02a25765
+size 452105
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/658.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/658.png
new file mode 100644
index 0000000000000000000000000000000000000000..5348da4f68f63c6632397104cec489bec10522fd
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/658.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:49c310310ed27d53c793b5e12a391a5c0d759610d84660802c02fbd01a2bce73
+size 412834
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/659.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/659.png
new file mode 100644
index 0000000000000000000000000000000000000000..94df7f1c20cc699831e388f657b403f5de4119d0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/659.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8ea4fcedcbfb6b7a57779b1f447810879cf470ab0e077b68d2253b362b2d3491
+size 454974
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/660.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/660.png
new file mode 100644
index 0000000000000000000000000000000000000000..93587de5ccfa6cefefa3329b06abdbceed751ae3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/660.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ab723c0652ec79b7852b166daef113357d09d8b652b0ec0fd27cf66b129a5296
+size 479554
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/662.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/662.png
new file mode 100644
index 0000000000000000000000000000000000000000..fc93c1660063b6e59e5945123a433359d5d6784f
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/662.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e3996942f81146ec326e2bd6f16b638325f894bbedbeeb418d901611a0c67a25
+size 372759
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/663.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/663.png
new file mode 100644
index 0000000000000000000000000000000000000000..40182791e1b048e37ebca8f1b748156da2ccf77d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/663.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4ac0025f7f996a0cb4e9c2527e3f5b39a384217e083500b5302fb21d1a20c628
+size 545311
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/664.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/664.png
new file mode 100644
index 0000000000000000000000000000000000000000..68c459d043e1b7ac2a810591f98ab85f521b1ca5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/664.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9ebc59b9f40e6ec5ebf1c086b7b9f4f3a0f70fefbdf1748f8888ac4a67dcfa1d
+size 491519
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/665.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/665.png
new file mode 100644
index 0000000000000000000000000000000000000000..e2d62ef13fbb7fa0924565e06852d198c3583e30
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/665.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:903bf0d7bd62bbc7ea196220190f694bebbebf315c0ff5a35f09026b848c9619
+size 510773
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/666.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/666.png
new file mode 100644
index 0000000000000000000000000000000000000000..c909116f83a6ed7a1d1c2fdc27ed343d328fe2d2
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/666.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:040a1d4019c0f32138de325d213ce68b657cd66ab5184adb9f6e77402901cd81
+size 374583
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/667.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/667.png
new file mode 100644
index 0000000000000000000000000000000000000000..24e836d7aad224e126f77d1503b8c8458b61695d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/667.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ea5f66679755600638e9fece426c60ab58c78bd7dec543cf9bd9eb8580853886
+size 464548
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/668.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/668.png
new file mode 100644
index 0000000000000000000000000000000000000000..27208cde550de7b0f8405df39dfebbb25453c153
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/668.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8f5bfda697b069bbd7ec0e3de8f0f59412bf757204615123eeaf7c6220b7cd12
+size 390354
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/669.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/669.png
new file mode 100644
index 0000000000000000000000000000000000000000..8efd7123d880f548850b6f33373f0e727425b4eb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/669.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d0070d8e2c37fed13a948bd7aee75aa70f4b9c5127a3e0dfbf23d8b32e241b77
+size 347631
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/670.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/670.png
new file mode 100644
index 0000000000000000000000000000000000000000..9bb34cd698f83466a951f5d91f9fbb3adf1d2982
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/670.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:069f38808e3fa16a4e422544c2f85f67f9c61a683f26061e5c179dbfff13bb59
+size 283643
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/671.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/671.png
new file mode 100644
index 0000000000000000000000000000000000000000..bebd3cebf9e519b213bb56124c84a3655c6de17a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/671.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:31df8934120588ac8e5c3284946526cda8b206559d95e1571ae0bf0aa11bd2ef
+size 405722
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/672.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/672.png
new file mode 100644
index 0000000000000000000000000000000000000000..be417eab312126da19cfbb6d1a8e7441fc71bcbb
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/672.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2be01d88dab78b65181a1c0c171a858ff18522b4049e7efc7c93be00aa58d24d
+size 309552
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/674.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/674.png
new file mode 100644
index 0000000000000000000000000000000000000000..b16029fcce305b9ed4e9a5f27b8516920ec6b5ce
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/674.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a1d18958538ba67111bbb9c832d16ddf3602d53f21dc501c8864c15b61485370
+size 522567
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/675.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/675.png
new file mode 100644
index 0000000000000000000000000000000000000000..e1f273a4255f6614545a69aaacd9124800140794
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/675.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f046c9072e498f9017b71dff2be8e93276206a4435470a0c5e8d6e7460e5aa3b
+size 499092
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/676.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/676.png
new file mode 100644
index 0000000000000000000000000000000000000000..6be1d146139cc699057b2aea28c1d6071c131923
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/676.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a555fbae31494623ed99e36b27c9e19da66add6397dafccf0d091ad8b602031e
+size 293124
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/677.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/677.png
new file mode 100644
index 0000000000000000000000000000000000000000..c0ca69d2864ac9419734f63ccac316305b00fe91
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/677.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1773d39f358062c6643737ac05c3aefa4b4d269fd1af1b054ec5455e9626b7ee
+size 482483
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/679.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/679.png
new file mode 100644
index 0000000000000000000000000000000000000000..caf974d55607200bdf0e0ef3ce8c884b7c7b8370
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/679.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e1bda7ebe2c3b129228c790091c0f6d9828cc111804e71c0a5faa5a5a770325a
+size 487896
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/680.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/680.png
new file mode 100644
index 0000000000000000000000000000000000000000..7b74ffac7b0f07d89b86ed399c17f3e11cee44c8
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/680.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bf674511a82acbcd445272b1e3d671cc28caefb253c0716276e0be438369dc8a
+size 443263
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/682.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/682.png
new file mode 100644
index 0000000000000000000000000000000000000000..91dbe3851197b8dd4dc60aeacc2eda35191976df
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/682.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d24f955fcebe976ae51838da6ebdd08bc21721c7c43eb5a5b7b0d888450b55a5
+size 456583
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/683.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/683.png
new file mode 100644
index 0000000000000000000000000000000000000000..2565ddd436643e0ab244eaaa5550463fb977e222
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/683.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:244380334a6d029e426faf606492aeaf9cca7d1825f1aa00842ba75307b5d2b5
+size 297610
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/684.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/684.png
new file mode 100644
index 0000000000000000000000000000000000000000..6a0df335ec57fecdb885c0786d45faed3e0a7a00
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/684.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9052359218fb660457ea8f2829a8ccbc9ee1930aa25be6fdbac4595fc92eed28
+size 326568
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/685.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/685.png
new file mode 100644
index 0000000000000000000000000000000000000000..a6d1449220e5242eda7e46b75a075cc1416d1ada
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/685.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3e616ec49878814205156beedc8a13c1af92b297b7377777a7173de60213be3b
+size 317107
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/686.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/686.png
new file mode 100644
index 0000000000000000000000000000000000000000..29fba7a307e10d0794c22464ed41d2b8b2c26954
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/686.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:15d07373170a5a35d302fa79be011c28bddb7b48d5666b51b30b9d62368ad7c2
+size 351926
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/687.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/687.png
new file mode 100644
index 0000000000000000000000000000000000000000..cc2c6083e6d5d8304d1783044281df80bd50f191
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/687.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:56cb91d47ae6d1ec35447b3b50ac63898b5d8a5cde5b2a233493dd5bfa012483
+size 486245
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/688.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/688.png
new file mode 100644
index 0000000000000000000000000000000000000000..b6168208404ec4c6593274c98a6980feda6c8915
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/688.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fa7dc045b6a5f90673cbc23affb6e88224e29f389458d93233adf783516a7266
+size 368198
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/689.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/689.png
new file mode 100644
index 0000000000000000000000000000000000000000..bb1134e5af2d07e107f9d5fd83f7501a7f599a60
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/689.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4f6bf3a6a746185c9220e45d8fe117c0923b1df736583bf921e7dc3477d69621
+size 508111
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/690.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/690.png
new file mode 100644
index 0000000000000000000000000000000000000000..dd077dfd717b4657cae9309f0361682871005ef1
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/690.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5471ae44b8f00444c30748ac5d086d90a8d6539989f9dc7065979e00bb43067e
+size 386534
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/691.png b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/691.png
new file mode 100644
index 0000000000000000000000000000000000000000..514e00cd7a8cdc9b5b504a668e2b01210e897a30
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part1/Style_Transfer/691.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1ee4b37fc61d851d0e23007b09509471f7accae2bd6293b86646b235e90ae7a4
+size 431717
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1232.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1232.png
new file mode 100644
index 0000000000000000000000000000000000000000..da0299c6c119b583a8daf3e7123cbe63acfe6cac
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1232.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fabe5ccd298bb4367625bdac3e28eacb7415448a030d1b11d112edbdd8f438c7
+size 135873
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1234.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1234.png
new file mode 100644
index 0000000000000000000000000000000000000000..e66bec2394256f6275fa5484213786960864683b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1234.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c5eb9a3e983209368f08a5ee0b31acb0fae7f066ed2077889d44447714ac4b84
+size 232932
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1237.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1237.png
new file mode 100644
index 0000000000000000000000000000000000000000..76dd088e544767794e6cb20634e8d760f6809d48
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1237.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dfb9c6d3ad8f62c532724826204c69de3eec4947d930ae01b48bd1c82a4cc8d3
+size 328063
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1239.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1239.png
new file mode 100644
index 0000000000000000000000000000000000000000..3573a7cdefb3e202d5b41428c58f29e3e4f0e243
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1239.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bae847a7b3cb89e84a0626b307def24fca34380fba176b7cfbbf3114af6bc5c5
+size 334707
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1242.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1242.png
new file mode 100644
index 0000000000000000000000000000000000000000..6011739d5a4a1ab233c12fc9a7ee086fd0b969ce
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1242.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e4874239aeec7168d7353bc44d6b94d7703f9f0c10073de0eaaef784818d9740
+size 486771
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1245.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1245.png
new file mode 100644
index 0000000000000000000000000000000000000000..d1f6600c7642d010c82c342f14d9df55d3a3ce95
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1245.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:414e3b920ce3c7e370410a05e731bb491078bc28449944e6c4b76c65cfb8a451
+size 398459
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1247.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1247.png
new file mode 100644
index 0000000000000000000000000000000000000000..e63a83bd6d6a721e8aa2819e59673d696e527140
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1247.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:788a47ae9323bdd8433669f9719fcc79a0ae28aa4e4aa30ddd75f67043f308ab
+size 396182
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1250.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1250.png
new file mode 100644
index 0000000000000000000000000000000000000000..0fb7075730ea06416062da53f16fa3d505295a2d
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1250.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:061798e8ebf0c5852a6b020d377233eb72afb2f1facc25b1f242a17435dc478b
+size 266333
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1252.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1252.png
new file mode 100644
index 0000000000000000000000000000000000000000..6865dfd55dd363f1022d658208a83816a9fe75e0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1252.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7203856947b23a870878c97f01e438be96ef3b5898e7b00801e01c1737c71c44
+size 360222
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1255.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1255.png
new file mode 100644
index 0000000000000000000000000000000000000000..b8bb27bedaf6e84de681db0b752caf79369ea240
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1255.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:596e80a01e5263f134b4c298eb726802baeec88dcd813bb2272756833f8f35e4
+size 351680
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1256.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1256.png
new file mode 100644
index 0000000000000000000000000000000000000000..9153703891bb65dfa4c76c22a17c16b701465620
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1256.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2d1ca9a6befbb5a8a3a561644a35e6967cf6febc1106c17ca6cfb5284fbdfc86
+size 402967
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1257.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1257.png
new file mode 100644
index 0000000000000000000000000000000000000000..c97d36502f10c5a7852973dd9be1c601fada74c0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1257.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:786386285a93516b91b22e79289a52e6db767aac013e30919c1dbd81e9748988
+size 340679
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1258.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1258.png
new file mode 100644
index 0000000000000000000000000000000000000000..45b8ca06c70329fb91573027c0e01571aad78d8e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1258.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2fb387aad93559fb68b0fdb8070bdc249ca596c84bf15bd2681c991cb47adcb8
+size 396521
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1259.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1259.png
new file mode 100644
index 0000000000000000000000000000000000000000..8bdf1a4396a66393320e8c56c8843c5e179bac02
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1259.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a78ace718fd1d6f40bd579df7a04995d5f49632fd8026f59a392f0d84873f817
+size 337955
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1260.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1260.png
new file mode 100644
index 0000000000000000000000000000000000000000..4e20701bd8c24b9aed94fde2bd0d3af014096b7a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1260.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:636a7beef0433c6550bf580dc2fc0c19716a00d62cfc07ae15e96db4c01eced7
+size 158794
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1263.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1263.png
new file mode 100644
index 0000000000000000000000000000000000000000..7cb740f7caf1ac9de54fc596b350889ed7f06f37
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1263.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:458689cac317c83d6906f22ae54018d34f1c6706be86c86c4ca8b885835e9cd9
+size 339293
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1264.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1264.png
new file mode 100644
index 0000000000000000000000000000000000000000..0a36a4e9f7d8330248fc1cce32a4bd9534d47178
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1264.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:20f1b32e65f8ad976fb64f98fca5fa4c7adca3e22e1e02acb60134b9055bc740
+size 452676
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1265.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1265.png
new file mode 100644
index 0000000000000000000000000000000000000000..427bbafc1a723ba34ce73065a4c2ea23ebd44cae
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1265.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d301ca571b6094fba3c4e33d19b6b4110e7dbb2f7fe674b229ec4405e265a365
+size 443055
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1266.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1266.png
new file mode 100644
index 0000000000000000000000000000000000000000..58722789f9fef2307b0089d6d83c3d906603a0a5
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1266.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9e9a5297c21b37b560a9ea4a7dcf3a41f059d1b2bacd82a67417bd3563a4301a
+size 268471
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1267.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1267.png
new file mode 100644
index 0000000000000000000000000000000000000000..3a6f2580073efd5c42a4b305063e9fe5a249d498
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1267.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2bf57f50556a88ba9d00ea52d0d2b1f6a3fcbc09e96f7e06c496fc9aed1609d7
+size 475623
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1269.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1269.png
new file mode 100644
index 0000000000000000000000000000000000000000..ca5276e3f2dce0980b3bd509336bd42a06f09534
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1269.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f944f1f71ed797305843a50ddc396ce8f783f9aa40bfa4004cf2e995a3b1c23d
+size 359960
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1271.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1271.png
new file mode 100644
index 0000000000000000000000000000000000000000..a3b9d1b66f1ec0f444a69131044f460bdbadc9ad
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1271.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e5a2b617aa2b95163bd74fcdac26d9b581764777536652e2ae299de52c046daa
+size 406796
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1273.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1273.png
new file mode 100644
index 0000000000000000000000000000000000000000..1187cfafb9d37d2ffdbface9806288ff3f7a2e4e
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1273.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:33cb40198e5df76816ab7ca898fcd005823d3c9481976b3c212c090125bf64fc
+size 325682
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1274.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1274.png
new file mode 100644
index 0000000000000000000000000000000000000000..b403e609e1f557bad1848a9732ddcac93740dd47
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1274.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f098fe9f42095b21c799fc5ff647a9bb56c4ab33c49db02cad70bc4615eea7fe
+size 398640
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1275.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1275.png
new file mode 100644
index 0000000000000000000000000000000000000000..0911caad4a1d70c9abe695d3afc6f5b1dc82414c
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1275.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8d5e36a6c28916625e6663ba9d2fee9e7eabf3f57cc295e75b26a5328f189570
+size 452532
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1277.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1277.png
new file mode 100644
index 0000000000000000000000000000000000000000..6098268d277fa2d26b5164f15c30d7ca86a01834
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1277.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:eae0e584d0be6539524f72c7360bc44a98f2dcb64a0f74d7bb4dfe59ed55bb99
+size 413608
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1280.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1280.png
new file mode 100644
index 0000000000000000000000000000000000000000..45a03ce3b999fc3f5a006209addeb87fccb146d0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1280.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:50f6d04feacb74fe961a6338f473f8a560bd82c54cd5c74158002180d3be4068
+size 460669
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1283.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1283.png
new file mode 100644
index 0000000000000000000000000000000000000000..d78025932d8922c71a08c2002433811de7444fc3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1283.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:53a667621f23a2f19064d88c554c3a46e0b73bfc28d761b78c637cbd699639bd
+size 462635
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1287.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1287.png
new file mode 100644
index 0000000000000000000000000000000000000000..5295aa7740d7c8abda4519603cc476f94ed6ac04
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1287.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:36588fa71ca1ecc7a6027da0347a35d5ed24915a43f59e8c2b27b117d19f1d55
+size 338555
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1288.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1288.png
new file mode 100644
index 0000000000000000000000000000000000000000..1dec6f5fa33f7a60df8f56251b935c3a6b30e1ff
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1288.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6517a9768a0d158e69df46725568eca92ad601d04477a61f9b934c96e9776e12
+size 310470
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1289.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1289.png
new file mode 100644
index 0000000000000000000000000000000000000000..261755314586b84a1a867f5d6d3b88ca0f07a119
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1289.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:17003077d7ec699372f4b6e42e2e4507355dfd697c91dac440f08ca4cf4afa57
+size 403806
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1290.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1290.png
new file mode 100644
index 0000000000000000000000000000000000000000..035df38f4e2f150b4e0095195c7ad7f0d3ef276a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1290.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7602f67de73bc4e0a25198b904ddbb3664ae57f399e102732c727cd0ba7e9155
+size 386913
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1294.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1294.png
new file mode 100644
index 0000000000000000000000000000000000000000..d33582a67469baf91d81a28c7119c7982cbd7384
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1294.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:efb8b99192a3d45ca5e8935884529825f9a1c6ec0d9991d2453c28c6c00ebdb6
+size 440195
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1295.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1295.png
new file mode 100644
index 0000000000000000000000000000000000000000..0b64b766654d7e894d206865ef41b3fc6713c521
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1295.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c596918fcc992867287b4487f4a4b9ee0b0a05f9566abe6fa9b732eebed6cb01
+size 424187
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1299.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1299.png
new file mode 100644
index 0000000000000000000000000000000000000000..b31921f750fcb044414f57a103638937cfd6e9b9
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1299.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5239adbe9d52e328882280fa89acc77cf857a0a6307d17adf6cd552ded9dd202
+size 243773
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1303.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1303.png
new file mode 100644
index 0000000000000000000000000000000000000000..deffa304230a20796c3c3394766ffa79dc313e9a
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1303.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9c71453ce03b60dc5277c05c05c4c86dfdc24234993caec451b2b05e660b488e
+size 334964
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1304.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1304.png
new file mode 100644
index 0000000000000000000000000000000000000000..134ea864dfda268da55274a64eea3ec1e30399d0
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1304.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1c4bddd449eddf3ca5b0c1196af5d8651ca8915ecf2db19753fc6a6024297a89
+size 306322
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1308.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1308.png
new file mode 100644
index 0000000000000000000000000000000000000000..5d63eec212f4c8e81ef674b28e47b4bb65da4e6b
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/1308.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:99bb029e0d524dc061065e19b2daa0d73dd2302ffd1356f9d8de79683d025c48
+size 476648
diff --git a/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/2.png b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/2.png
new file mode 100644
index 0000000000000000000000000000000000000000..242fdf67a3326165d16b15a0e29e7862b6e859a3
--- /dev/null
+++ b/Edit-Res/UltraEdit/UltraEdit/en/Part3/Casual_Aware/2.png
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:55231a55e72874abe42bbd44a5d25f0db93c3370f496ce25f69c2a54860b0ef3
+size 406117