+
+
+
+
+
+ 
+
+
+
+
+
diff --git a/htmls/InterviewDetails.html b/htmls/InterviewDetails.html
new file mode 100644
index 0000000..79a6fbd
--- /dev/null
+++ b/htmls/InterviewDetails.html
@@ -0,0 +1,77 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 
+ 人物專訪標題文字後台上傳人物專訪標題文字後台上傳
+
+ 
+ + 專職為高品質業主、地產商、精品酒店，商業綜合體，企業大廈提供建築設計，室內外裝飾設計，園林景觀，家居，軟裝藝術配飾，機電設備，燈光，標識，藝術品等全案設計定製。實行多對一的全程托管服務模式。名稱起源:「盛堂世家」代表了一個高端群體，也正是這個群體對於「家」所承載的責任和所能傳承的文化，盛堂世家就是專業服務於這樣一個群體的機構 +
+
+
+
+
+
+
diff --git a/htmls/aboutUs.html b/htmls/aboutUs.html
new file mode 100644
index 0000000..317d0f3
--- /dev/null
+++ b/htmls/aboutUs.html
@@ -0,0 +1,81 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 
+
+ 關於Allen Zhou
+
+ Allen Zhou
+執行副總裁
+管理合夥人
+設計總監
++ 專職為高品質業主、地產商、精品酒店，商業綜合體，企業大廈提供建築設計，室內外裝飾設計，園林景觀，家居，軟裝藝術配飾，機電設備，燈光，標識，藝術品等全案設計定製。實行多對一的全程托管服務模式。名稱起源:「盛堂世家」代表了一個高端群體，也正是這個群體對於「家」所承載的責任和所能傳承的文化，盛堂世家就是專業服務於這樣一個群體的機構， +
+
+
+
+
+
+
diff --git a/htmls/brand.html b/htmls/brand.html
new file mode 100644
index 0000000..127c439
--- /dev/null
+++ b/htmls/brand.html
@@ -0,0 +1,84 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 
+
+ 名品軟裝
+专注为您量需定制更优生活方式
++ 成都盛堂世家裝飾工程有限公司專職為高端品質客戶、地產商、酒店投資商提供整體規劃設計與施工，陳設搭配等配套服務。設計範疇遍及私人別墅、樣板房、高級會所、精品酒店及商業空間，實行多對一的全程托管式服務模式，令您盡享尊貴專屬服務;同時我們秉承「與時俱進、開拓創新」的發展思路，進一步整合資源，學習先進設計理念，強調工藝和材料研發不斷延展，完善服務產業鏈，提升綜合水平，打造設計、施工、主材選購、軟裝搭配、售後服務於一體的完善服務體系，為大客戶打造更高品位，更具個性、更高品質家居、公共裝飾工程。推動企業向一體化、產業化、品牌化、集團化方向發展，引領行業發展新潮流。 +
+成都盛堂世家裝飾工程有限公司專職為高端品質客戶、地產商、酒店投資商提供整體規劃設計與施工，陳設搭配等配套服務。設計範疇遍及私人
+
+
+
+
+
+
+
diff --git a/htmls/contactUs.html b/htmls/contactUs.html
new file mode 100644
index 0000000..fead9df
--- /dev/null
+++ b/htmls/contactUs.html
@@ -0,0 +1,119 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 
+
+ 联系我们
+
+ 公司地址：
+四川省成都市環球中心西W6區7樓713
+
+ 座機電話：
+400 028 0558
+
+ 郵箱地址：
+222222222222@163.com
+
+ 微信公众号
+
+ 微信公众号
+留言
+ +
+
+
+
+
+
diff --git a/htmls/contentPage.html b/htmls/contentPage.html
new file mode 100644
index 0000000..1d0c245
--- /dev/null
+++ b/htmls/contentPage.html
@@ -0,0 +1,89 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 盛堂世家設計機構
+品牌豪宅室內設計機構之一
++ 專職為高品質業主、地產商、精品酒店，商業綜合體，企業大廈提供建築設計，室內外裝飾設計，園林景觀，家居，軟裝藝術配飾，機電設備，燈光，標識，藝術品等全案設計定製。實行多對一的全程托管服務模式。名稱起源:「盛堂世家」代表了一個高端群體，也正是這個群體對於「家」所承載的責任和所能傳承的文化，盛堂世家就是專業服務於這樣一個群體的機構 +
+
+ 盛堂世家設計機構
+品牌豪宅室內設計機構之一
++ 專職為高品質業主、地產商、精品酒店，商業綜合體，企業大廈提供建築設計，室內外裝飾設計，園林景觀，家居，軟裝藝術配飾，機電設備，燈光，標識，藝術品等全案設計定製。實行多對一的全程托管服務模式。名稱起源:「盛堂世家」代表了一個高端群體，也正是這個群體對於「家」所承載的責任和所能傳承的文化，盛堂世家就是專業服務於這樣一個群體的機構 +
+
+ 盛堂世家設計機構
+品牌豪宅室內設計機構之一
++ 專職為高品質業主、地產商、精品酒店，商業綜合體，企業大廈提供建築設計，室內外裝飾設計，園林景觀，家居，軟裝藝術配飾，機電設備，燈光，標識，藝術品等全案設計定製。實行多對一的全程托管服務模式。名稱起源:「盛堂世家」代表了一個高端群體，也正是這個群體對於「家」所承載的責任和所能傳承的文化，盛堂世家就是專業服務於這樣一個群體的機構 +
+
+ 盛堂世家設計機構
+品牌豪宅室內設計機構之一
++ 專職為高品質業主、地產商、精品酒店，商業綜合體，企業大廈提供建築設計，室內外裝飾設計，園林景觀，家居，軟裝藝術配飾，機電設備，燈光，標識，藝術品等全案設計定製。實行多對一的全程托管服務模式。名稱起源:「盛堂世家」代表了一個高端群體，也正是這個群體對於「家」所承載的責任和所能傳承的文化，盛堂世家就是專業服務於這樣一個群體的機構 +
+
+
+
+
+
+
+
diff --git a/htmls/engineering.html b/htmls/engineering.html
new file mode 100644
index 0000000..a1d4bed
--- /dev/null
+++ b/htmls/engineering.html
@@ -0,0 +1,240 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 
+
+ 工程工藝
+地面找平
+ +
+ + 專職為高品質業主、地產商、精品酒店，商業綜合體，企業大廈提供建築設計，室內外裝飾設計，園林景觀，家居，軟裝藝術配飾園林景觀，家居軟裝藝術配飾機電設備，燈光，標識，藝術品等全案設計定製。實行多對一的全程托管服務模式。名稱起源:「盛堂世家」代表了一個高端群體，也正是這個群體對於「家」所承載的責任和所能傳承的文化，盛堂世家就是專業服務於這樣一個群體的機構。 +
+
+
+
+
+
+
+
diff --git a/htmls/honoraryCertificate.html b/htmls/honoraryCertificate.html
new file mode 100644
index 0000000..1c92fbd
--- /dev/null
+++ b/htmls/honoraryCertificate.html
@@ -0,0 +1,109 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 資質榮譽
+
+ 2021
+工程設計資質證書
+
+ 2021
+工程設計資質證書
+
+ 2021
+工程設計資質證書
+
+ 2021
+工程設計資質證書
+
+
+
+
+
+
+
diff --git a/htmls/ia.html b/htmls/ia.html
new file mode 100644
index 0000000..5de4eb0
--- /dev/null
+++ b/htmls/ia.html
@@ -0,0 +1,264 @@
+
+首页
+工单管理
+合并请求
+里程碑
+探索
+通知
+ 创建…
+ 个人信息和配置
+ chen / huaxia
+关注
+1
+点赞
+0
+派生
+0
+代码
+工单
+0
+合并请求
+0
+项目
+0
+版本发布
+0
+百科
+动态
+仓库设置
+暂无描述
+管理主题
+ 120 提交
+ 1 分支
+ 58 MiB
+ 分支: master
+huaxia/htmls/aboutUs/aboutUs.html
+221 行
+15 KiB
+原始文件
+永久链接
+Blame
+文件历史
+
+
+
+
+
+
+
+
+
+
+ 
+
+ 华夏艺术网于1998年开通，是国内最早最大的书画艺术门户网站之一，由四川省美术家协会、四川省书法家协会、四川省诗书画院、成都画院、四川省政协书画研究院等授权主办。经过多年来不间断的运营发展，已成为国内知名的艺术类门户网站。华夏艺术网为艺术家、艺术行业单位构建了艺术信息的交流平台，吸引了来自全国各地的艺术家及艺术机构加盟。通过网络信息技术手段，不断加强与社会各界的合作，与广大艺术家及画廊、拍卖行、收藏家、艺术团体建立起了业务联系，架起了艺术家与艺术市场之间的桥梁。
+
+ 
+ 谭朝晖，斋号“净砚斋”。原为空军某企业党委干部，曾先后任四川电信天府热线执行主编、成都信息港电子商务部部长、四川铁通互联网业务中心副总经理等职。1998年创办华夏艺术网，2003年创办净砚斋画廊。现为摩空精舍董事长、北京视觉经典美术馆副馆长，成都市画廊协会副会长，成都惠民职工画院理事长兼秘书长，成都市版权协会副会长，成都市阅读协会理事，成都市人民对外友好协会理事，四川省文化产业商会常务理事。
+
+ 谭朝晖与著名画家任重先生合影。华夏艺术网在2000-2004年期间成功代理任重先生作品,在国内艺术市场有较大影响。
+图片展示
+
+ 8月10日下午，有华樱出国主办，摩空精舍协办的主题为“四川人快速养成计划”的文化交流活动，汇集了五湖四海的各方宾客。有来自德国、意大利、英国、新加坡、俄罗斯、摩洛哥、柬埔寨、阿塞拜疆、泰国、格鲁吉亚、越南、马来西亚、埃及、罗马尼亚、印度等多国外国友人，也有来自我们中国的中学生和大学生。
+ +
+ 8月10日下午，有华樱出国主办，摩空精舍协办的主题为“四川人快速养成计划”的文化交流活动，汇集了五湖四海的各方宾客。有来自德国、意大利、英国、新加坡、俄罗斯、摩洛哥、柬埔寨、阿塞拜疆、泰国、格鲁吉亚、越南、马来西亚、埃及、罗马尼亚、印度等多国外国友人，也有来自我们中国的中学生和大学生。
+ +
+ 8月10日下午，有华樱出国主办，摩空精舍协办的主题为“四川人快速养成计划”的文化交流活动，汇集了五湖四海的各方宾客。有来自德国、意大利、英国、新加坡、俄罗斯、摩洛哥、柬埔寨、阿塞拜疆、泰国、格鲁吉亚、越南、马来西亚、埃及、罗马尼亚、印度等多国外国友人，也有来自我们中国的中学生和大学生。
+ +
+ 8月10日下午，有华樱出国主办，摩空精舍协办的主题为“四川人快速养成计划”的文化交流活动，汇集了五湖四海的各方宾客。有来自德国、意大利、英国、新加坡、俄罗斯、摩洛哥、柬埔寨、阿塞拜疆、泰国、格鲁吉亚、越南、马来西亚、埃及、罗马尼亚、印度等多国外国友人，也有来自我们中国的中学生和大学生。
+ +
+ 8月10日下午，有华樱出国主办，摩空精舍协办的主题为“四川人快速养成计划”的文化交流活动，汇集了五湖四海的各方宾客。有来自德国、意大利、英国、新加坡、俄罗斯、摩洛哥、柬埔寨、阿塞拜疆、泰国、格鲁吉亚、越南、马来西亚、埃及、罗马尼亚、印度等多国外国友人，也有来自我们中国的中学生和大学生。
+ +
+ 8月10日下午，有华樱出国主办，摩空精舍协办的主题为“四川人快速养成计划”的文化交流活动，汇集了五湖四海的各方宾客。有来自德国、意大利、英国、新加坡、俄罗斯、摩洛哥、柬埔寨、阿塞拜疆、泰国、格鲁吉亚、越南、马来西亚、埃及、罗马尼亚、印度等多国外国友人，也有来自我们中国的中学生和大学生。
+ +
+ 8月10日下午，有华樱出国主办，摩空精舍协办的主题为“四川人快速养成计划”的文化交流活动，汇集了五湖四海的各方宾客。有来自德国、意大利、英国、新加坡、俄罗斯、摩洛哥、柬埔寨、阿塞拜疆、泰国、格鲁吉亚、越南、马来西亚、埃及、罗马尼亚、印度等多国外国友人，也有来自我们中国的中学生和大学生。
+ +
+ 
+ 
+ 
+ 
+
+ 名品軟裝
+【盛堂世家】下辖企业
+成都盛堂世家装饰工程有限公司
+盛堂世家·空间美学馆
+盛堂世家·名品软装
+四川三鼎联创贸易有限公司
+
+ 专注为您量需定制更优生活方式
++ 成都盛堂世家裝飾工程有限公司專職為高端品質客戶、地產商、酒店投資商提供整體規劃設計與施工，陳設搭配等配套服務。設計範疇遍及私人別墅、樣板房、高級會所、精品酒店及商業空間，實行多對一的全程托管式服務模式，令您盡享尊貴專屬服務;同時我們秉承「與時俱進、開拓創新」的發展思路，進一步整合資源，學習先進設計理念，強調工藝和材料研發不斷延展，完善服務產業鏈，提升綜合水平，打造設計、施工、主材選購、軟裝搭配、售後服務於一體的完善服務體系，為大客戶打造更高品位，更具個性、更高品質家居、公共裝飾工程。推動企業向一體化、產業化、品牌化、集團化方向發展，引領行業發展新潮流。 +
+成都盛堂世家裝飾工程有限公司專職為高端品質客戶、地產商、酒店投資商提供整體規劃設計與施工，陳設搭配等配套服務。設計範疇遍及私人
+
+
+
+
+
+
+
diff --git a/htmls/projectIntroduction.html b/htmls/projectIntroduction.html
new file mode 100644
index 0000000..9e0e01c
--- /dev/null
+++ b/htmls/projectIntroduction.html
@@ -0,0 +1,208 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 
+
+ 項目介紹
+開元集團光霧合谷酒店
+釋玥森林度假酒店
+樂山.清水荷花素食餐廳
+巴中通江主題酒店
+甘南州臨潭縣臨潭大酒店
+南部銘流主題酒店
+長城國際酒店
+康普雷斯國際酒店
+紅原羅布林卡酒店
+新疆庫爾勒金泰國際酒店
+烏魯木齊天成國際酒店
+長城國際酒店
+康普雷斯國際酒店
+寬窄巷子.天趣.紫園
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/htmls/projectIntroductionDetails.html b/htmls/projectIntroductionDetails.html
new file mode 100644
index 0000000..05aa101
--- /dev/null
+++ b/htmls/projectIntroductionDetails.html
@@ -0,0 +1,147 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 
+
+ 開元集團光霧合谷酒店
+釋玥森林度假酒店
+樂山.清水荷花素食餐廳
+巴中通江主題酒店
+甘南州臨潭縣臨潭大酒店
+南部銘流主題酒店
+長城國際酒店
+康普雷斯國際酒店
+紅原羅布林卡酒店
+新疆庫爾勒金泰國際酒店
+烏魯木齊天成國際酒店
+長城國際酒店
+康普雷斯國際酒店
+寬窄巷子.天趣.紫園
+
+
+
+
+ 釋玥森林度假酒店
++ 專職為高品質業主、地產商、精品酒店，商業綜合體，企業大廈提供建築設計，室內外裝飾設計，園林景觀，家居，軟裝藝術配飾，機電設備，燈光，標識，藝術品等全案設計定製。實行多對一的全程托管服務模式。名稱起源:「盛堂世家」代表了一個高端群體，也正是這個群體對於「家」所承載的責任和所能傳承的文化，盛堂世家就是專業服務於這樣一個群體的機構。 +
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/htmls/serviceConcept.html b/htmls/serviceConcept.html
new file mode 100644
index 0000000..cea7bd9
--- /dev/null
+++ b/htmls/serviceConcept.html
@@ -0,0 +1,138 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 名品軟裝
+
+ 
+ 90%+ · 設計還原
+90% + · design restoration
+風格定向，產品預選
+真實產品建模，有的放矢
+
+ 
+ 90%+ · 設計還原
+90% + · design restoration
+風格定向，產品預選
+真實產品建模，有的放矢
+
+ 
+ 整體交付 · 施工提速30%
+Overall delivery and construction speed up by 30%
+材料到施工無縫對接
+專業訂單中心，項目經理負責製
+
+ 
+ 甄選全球 · 一線大牌
+Select global and first-line brands
+產品優中選優
+高質優價高顏好物
+
+ 
+ 損耗全包節省20%成本
+20% cost savings for all losses
+所需材料滿配滿含
+切割損耗優選承擔
+
+ 
+ 全責售後 · 服務終身
+Full responsibility after-sales and lifelong service
+拒絕推諉扯皮
+主材施工，一站保修
+
+
+
+
+
+
diff --git a/htmls/siteImage.html b/htmls/siteImage.html
new file mode 100644
index 0000000..45e366a
--- /dev/null
+++ b/htmls/siteImage.html
@@ -0,0 +1,217 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 工程工藝
+
+ 
+ 
+ 
+ 
+
+
+
+
+
+
+
+
diff --git a/htmls/wellKnownProducts.html b/htmls/wellKnownProducts.html
new file mode 100644
index 0000000..14c1dc2
--- /dev/null
+++ b/htmls/wellKnownProducts.html
@@ -0,0 +1,217 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/htmls/测量工具1.jpg b/htmls/测量工具1.jpg
new file mode 100644
index 0000000..f948c6f
Binary files /dev/null and b/htmls/测量工具1.jpg differ
diff --git a/imgs/ber.png b/imgs/ber.png
new file mode 100644
index 0000000..a410c3d
Binary files /dev/null and b/imgs/ber.png differ
diff --git a/imgs/ber2.png b/imgs/ber2.png
new file mode 100644
index 0000000..03c5544
Binary files /dev/null and b/imgs/ber2.png differ
diff --git a/imgs/ber3.png b/imgs/ber3.png
new file mode 100644
index 0000000..14a0801
Binary files /dev/null and b/imgs/ber3.png differ
diff --git a/imgs/dh.png b/imgs/dh.png
new file mode 100644
index 0000000..bd35057
Binary files /dev/null and b/imgs/dh.png differ
diff --git a/imgs/facebook.png b/imgs/facebook.png
new file mode 100644
index 0000000..c199f73
Binary files /dev/null and b/imgs/facebook.png differ
diff --git a/imgs/gy.png b/imgs/gy.png
new file mode 100644
index 0000000..1cc46b0
Binary files /dev/null and b/imgs/gy.png differ
diff --git a/imgs/gyber.png b/imgs/gyber.png
new file mode 100644
index 0000000..6af4e24
Binary files /dev/null and b/imgs/gyber.png differ
diff --git a/imgs/home.png b/imgs/home.png
new file mode 100644
index 0000000..329bc61
Binary files /dev/null and b/imgs/home.png differ
diff --git a/imgs/im1.png b/imgs/im1.png
new file mode 100644
index 0000000..d3e6b5d
Binary files /dev/null and b/imgs/im1.png differ
diff --git a/imgs/im2.png b/imgs/im2.png
new file mode 100644
index 0000000..8124e6a
Binary files /dev/null and b/imgs/im2.png differ
diff --git a/imgs/im3.png b/imgs/im3.png
new file mode 100644
index 0000000..0e0da10
Binary files /dev/null and b/imgs/im3.png differ
diff --git a/imgs/im4.png b/imgs/im4.png
new file mode 100644
index 0000000..d07fa63
Binary files /dev/null and b/imgs/im4.png differ
diff --git a/imgs/img.png b/imgs/img.png
new file mode 100644
index 0000000..1fe2589
Binary files /dev/null and b/imgs/img.png differ
diff --git a/imgs/imga.png b/imgs/imga.png
new file mode 100644
index 0000000..dac7a17
Binary files /dev/null and b/imgs/imga.png differ
diff --git a/imgs/imga1.png b/imgs/imga1.png
new file mode 100644
index 0000000..478003b
Binary files /dev/null and b/imgs/imga1.png differ
diff --git a/imgs/imgaw.png b/imgs/imgaw.png
new file mode 100644
index 0000000..56f3929
Binary files /dev/null and b/imgs/imgaw.png differ
diff --git a/imgs/imgob.png b/imgs/imgob.png
new file mode 100644
index 0000000..d7d3a2d
Binary files /dev/null and b/imgs/imgob.png differ
diff --git a/imgs/iocn.png b/imgs/iocn.png
new file mode 100644
index 0000000..9a08d2f
Binary files /dev/null and b/imgs/iocn.png differ
diff --git a/imgs/iocn1.png b/imgs/iocn1.png
new file mode 100644
index 0000000..ba7f2d9
Binary files /dev/null and b/imgs/iocn1.png differ
diff --git a/imgs/iocn10.png b/imgs/iocn10.png
new file mode 100644
index 0000000..45b3e77
Binary files /dev/null and b/imgs/iocn10.png differ
diff --git a/imgs/iocn11.png b/imgs/iocn11.png
new file mode 100644
index 0000000..2fc897c
Binary files /dev/null and b/imgs/iocn11.png differ
diff --git a/imgs/iocn12.png b/imgs/iocn12.png
new file mode 100644
index 0000000..9d4ec33
Binary files /dev/null and b/imgs/iocn12.png differ
diff --git a/imgs/iocn2.png b/imgs/iocn2.png
new file mode 100644
index 0000000..065a305
Binary files /dev/null and b/imgs/iocn2.png differ
diff --git a/imgs/iocn3.png b/imgs/iocn3.png
new file mode 100644
index 0000000..3fdf3c9
Binary files /dev/null and b/imgs/iocn3.png differ
diff --git a/imgs/iocn5.png b/imgs/iocn5.png
new file mode 100644
index 0000000..7576333
Binary files /dev/null and b/imgs/iocn5.png differ
diff --git a/imgs/iocn6.png b/imgs/iocn6.png
new file mode 100644
index 0000000..10a6538
Binary files /dev/null and b/imgs/iocn6.png differ
diff --git a/imgs/iocn7.png b/imgs/iocn7.png
new file mode 100644
index 0000000..96152dc
Binary files /dev/null and b/imgs/iocn7.png differ
diff --git a/imgs/iocn8.png b/imgs/iocn8.png
new file mode 100644
index 0000000..807d28d
Binary files /dev/null and b/imgs/iocn8.png differ
diff --git a/imgs/iocn9.png b/imgs/iocn9.png
new file mode 100644
index 0000000..3b00ec0
Binary files /dev/null and b/imgs/iocn9.png differ
diff --git a/imgs/jt.png b/imgs/jt.png
new file mode 100644
index 0000000..8f39bae
Binary files /dev/null and b/imgs/jt.png differ
diff --git a/imgs/jt2.png b/imgs/jt2.png
new file mode 100644
index 0000000..222f2b7
Binary files /dev/null and b/imgs/jt2.png differ
diff --git a/imgs/jt3.png b/imgs/jt3.png
new file mode 100644
index 0000000..7f0a5c2
Binary files /dev/null and b/imgs/jt3.png differ
diff --git a/imgs/jta.png b/imgs/jta.png
new file mode 100644
index 0000000..ffbccfa
Binary files /dev/null and b/imgs/jta.png differ
diff --git a/imgs/logo.png b/imgs/logo.png
new file mode 100644
index 0000000..3692e78
Binary files /dev/null and b/imgs/logo.png differ
diff --git a/imgs/lx.png b/imgs/lx.png
new file mode 100644
index 0000000..d4f94ce
Binary files /dev/null and b/imgs/lx.png differ
diff --git a/imgs/nr.png b/imgs/nr.png
new file mode 100644
index 0000000..b373789
Binary files /dev/null and b/imgs/nr.png differ
diff --git a/imgs/public/小桶龙.png b/imgs/public/小桶龙.png
new file mode 100644
index 0000000..0d84a3e
Binary files /dev/null and b/imgs/public/小桶龙.png differ
diff --git a/imgs/rw.png b/imgs/rw.png
new file mode 100644
index 0000000..593d8a7
Binary files /dev/null and b/imgs/rw.png differ
diff --git a/imgs/rwgy.png b/imgs/rwgy.png
new file mode 100644
index 0000000..a8f4918
Binary files /dev/null and b/imgs/rwgy.png differ
diff --git a/imgs/rwzf.png b/imgs/rwzf.png
new file mode 100644
index 0000000..2fd460e
Binary files /dev/null and b/imgs/rwzf.png differ
diff --git a/imgs/ry.png b/imgs/ry.png
new file mode 100644
index 0000000..c13ed5f
Binary files /dev/null and b/imgs/ry.png differ
diff --git a/imgs/stpp.png b/imgs/stpp.png
new file mode 100644
index 0000000..6af4e24
Binary files /dev/null and b/imgs/stpp.png differ
diff --git a/imgs/twitter.png b/imgs/twitter.png
new file mode 100644
index 0000000..9806d63
Binary files /dev/null and b/imgs/twitter.png differ
diff --git a/imgs/wx.jpg b/imgs/wx.jpg
new file mode 100644
index 0000000..cbdc6ce
Binary files /dev/null and b/imgs/wx.jpg differ
diff --git a/imgs/wz.png b/imgs/wz.png
new file mode 100644
index 0000000..1e0e131
Binary files /dev/null and b/imgs/wz.png differ
diff --git a/imgs/xmjs.png b/imgs/xmjs.png
new file mode 100644
index 0000000..6af4e24
Binary files /dev/null and b/imgs/xmjs.png differ
diff --git a/imgs/yx.png b/imgs/yx.png
new file mode 100644
index 0000000..26561e0
Binary files /dev/null and b/imgs/yx.png differ
diff --git a/imgs/zk.png b/imgs/zk.png
new file mode 100644
index 0000000..85907f0
Binary files /dev/null and b/imgs/zk.png differ
diff --git a/imgs/zt.png b/imgs/zt.png
new file mode 100644
index 0000000..56821da
Binary files /dev/null and b/imgs/zt.png differ
diff --git a/imgs/zz.png b/imgs/zz.png
new file mode 100644
index 0000000..83f0607
Binary files /dev/null and b/imgs/zz.png differ
diff --git a/index.html b/index.html
new file mode 100644
index 0000000..a4a5e3d
--- /dev/null
+++ b/index.html
@@ -0,0 +1,55 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 
+ 
+ 
+ 
+ 
+
+
+
diff --git a/js/jquery.min.js b/js/jquery.min.js
new file mode 100644
index 0000000..3e7a3c3
--- /dev/null
+++ b/js/jquery.min.js
@@ -0,0 +1,3652 @@
+/*! jQuery v3.6.0 | (c) OpenJS Foundation and other contributors | jquery.org/license */ ! function(e, t) {
+ "use strict";
+ "object" == typeof module && "object" == typeof module.exports ? module.exports = e.document ? t(e, !0) : function(
+ e) {
+ if (!e.document) throw new Error("jQuery requires a window with a document");
+ return t(e)
+ } : t(e)
+}("undefined" != typeof window ? window : this, function(C, e) {
+ "use strict";
+ var t = [],
+ r = Object.getPrototypeOf,
+ s = t.slice,
+ g = t.flat ? function(e) {
+ return t.flat.call(e)
+ } : function(e) {
+ return t.concat.apply([], e)
+ },
+ u = t.push,
+ i = t.indexOf,
+ n = {},
+ o = n.toString,
+ v = n.hasOwnProperty,
+ a = v.toString,
+ l = a.call(Object),
+ y = {},
+ m = function(e) {
+ return "function" == typeof e && "number" != typeof e.nodeType && "function" != typeof e.item
+ },
+ x = function(e) {
+ return null != e && e === e.window
+ },
+ E = C.document,
+ c = {
+ type: !0,
+ src: !0,
+ nonce: !0,
+ noModule: !0
+ };
+
+ function b(e, t, n) {
+ var r, i, o = (n = n || E).createElement("script");
+ if (o.text = e, t)
+ for (r in c)(i = t[r] || t.getAttribute && t.getAttribute(r)) && o.setAttribute(r, i);
+ n.head.appendChild(o).parentNode.removeChild(o)
+ }
+
+ function w(e) {
+ return null == e ? e + "" : "object" == typeof e || "function" == typeof e ? n[o.call(e)] || "object" :
+ typeof e
+ }
+ var f = "3.6.0",
+ S = function(e, t) {
+ return new S.fn.init(e, t)
+ };
+
+ function p(e) {
+ var t = !!e && "length" in e && e.length,
+ n = w(e);
+ return !m(e) && !x(e) && ("array" === n || 0 === t || "number" == typeof t && 0 < t && t - 1 in e)
+ }
+ S.fn = S.prototype = {
+ jquery: f,
+ constructor: S,
+ length: 0,
+ toArray: function() {
+ return s.call(this)
+ },
+ get: function(e) {
+ return null == e ? s.call(this) : e < 0 ? this[e + this.length] : this[e]
+ },
+ pushStack: function(e) {
+ var t = S.merge(this.constructor(), e);
+ return t.prevObject = this, t
+ },
+ each: function(e) {
+ return S.each(this, e)
+ },
+ map: function(n) {
+ return this.pushStack(S.map(this, function(e, t) {
+ return n.call(e, t, e)
+ }))
+ },
+ slice: function() {
+ return this.pushStack(s.apply(this, arguments))
+ },
+ first: function() {
+ return this.eq(0)
+ },
+ last: function() {
+ return this.eq(-1)
+ },
+ even: function() {
+ return this.pushStack(S.grep(this, function(e, t) {
+ return (t + 1) % 2
+ }))
+ },
+ odd: function() {
+ return this.pushStack(S.grep(this, function(e, t) {
+ return t % 2
+ }))
+ },
+ eq: function(e) {
+ var t = this.length,
+ n = +e + (e < 0 ? t : 0);
+ return this.pushStack(0 <= n && n < t ? [this[n]] : [])
+ },
+ end: function() {
+ return this.prevObject || this.constructor()
+ },
+ push: u,
+ sort: t.sort,
+ splice: t.splice
+ }, S.extend = S.fn.extend = function() {
+ var e, t, n, r, i, o, a = arguments[0] || {},
+ s = 1,
+ u = arguments.length,
+ l = !1;
+ for ("boolean" == typeof a && (l = a, a = arguments[s] || {}, s++), "object" == typeof a || m(a) || (
+ a = {}), s === u && (a = this, s--); s < u; s++)
+ if (null != (e = arguments[s]))
+ for (t in e) r = e[t], "__proto__" !== t && a !== r && (l && r && (S.isPlainObject(r) || (i =
+ Array.isArray(r))) ? (n = a[t], o = i && !Array.isArray(n) ? [] : i || S
+ .isPlainObject(n) ? n : {}, i = !1, a[t] = S.extend(l, o, r)) : void 0 !== r && (a[
+ t] = r));
+ return a
+ }, S.extend({
+ expando: "jQuery" + (f + Math.random()).replace(/\D/g, ""),
+ isReady: !0,
+ error: function(e) {
+ throw new Error(e)
+ },
+ noop: function() {},
+ isPlainObject: function(e) {
+ var t, n;
+ return !(!e || "[object Object]" !== o.call(e)) && (!(t = r(e)) || "function" == typeof(n =
+ v.call(t, "constructor") && t.constructor) && a.call(n) === l)
+ },
+ isEmptyObject: function(e) {
+ var t;
+ for (t in e) return !1;
+ return !0
+ },
+ globalEval: function(e, t, n) {
+ b(e, {
+ nonce: t && t.nonce
+ }, n)
+ },
+ each: function(e, t) {
+ var n, r = 0;
+ if (p(e)) {
+ for (n = e.length; r < n; r++)
+ if (!1 === t.call(e[r], r, e[r])) break
+ } else
+ for (r in e)
+ if (!1 === t.call(e[r], r, e[r])) break;
+ return e
+ },
+ makeArray: function(e, t) {
+ var n = t || [];
+ return null != e && (p(Object(e)) ? S.merge(n, "string" == typeof e ? [e] : e) : u.call(n,
+ e)), n
+ },
+ inArray: function(e, t, n) {
+ return null == t ? -1 : i.call(t, e, n)
+ },
+ merge: function(e, t) {
+ for (var n = +t.length, r = 0, i = e.length; r < n; r++) e[i++] = t[r];
+ return e.length = i, e
+ },
+ grep: function(e, t, n) {
+ for (var r = [], i = 0, o = e.length, a = !n; i < o; i++) !t(e[i], i) !== a && r.push(e[i]);
+ return r
+ },
+ map: function(e, t, n) {
+ var r, i, o = 0,
+ a = [];
+ if (p(e))
+ for (r = e.length; o < r; o++) null != (i = t(e[o], o, n)) && a.push(i);
+ else
+ for (o in e) null != (i = t(e[o], o, n)) && a.push(i);
+ return g(a)
+ },
+ guid: 1,
+ support: y
+ }), "function" == typeof Symbol && (S.fn[Symbol.iterator] = t[Symbol.iterator]), S.each(
+ "Boolean Number String Function Array Date RegExp Object Error Symbol".split(" "),
+ function(e, t) {
+ n["[object " + t + "]"] = t.toLowerCase()
+ });
+ var d = function(n) {
+ var e, d, b, o, i, h, f, g, w, u, l, T, C, a, E, v, s, c, y, S = "sizzle" + 1 * new Date,
+ p = n.document,
+ k = 0,
+ r = 0,
+ m = ue(),
+ x = ue(),
+ A = ue(),
+ N = ue(),
+ j = function(e, t) {
+ return e === t && (l = !0), 0
+ },
+ D = {}.hasOwnProperty,
+ t = [],
+ q = t.pop,
+ L = t.push,
+ H = t.push,
+ O = t.slice,
+ P = function(e, t) {
+ for (var n = 0, r = e.length; n < r; n++)
+ if (e[n] === t) return n;
+ return -1
+ },
+ R =
+ "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped",
+ M = "[\\x20\\t\\r\\n\\f]",
+ I = "(?:\\\\[\\da-fA-F]{1,6}" + M + "?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+",
+ W = "\\[" + M + "*(" + I + ")(?:" + M + "*([*^$|!~]?=)" + M +
+ "*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + I + "))|)" + M + "*\\]",
+ F = ":(" + I +
+ ")(?:\\((('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|((?:\\\\.|[^\\\\()[\\]]|" + W +
+ ")*)|.*)\\)|)",
+ B = new RegExp(M + "+", "g"),
+ $ = new RegExp("^" + M + "+|((?:^|[^\\\\])(?:\\\\.)*)" + M + "+$", "g"),
+ _ = new RegExp("^" + M + "*," + M + "*"),
+ z = new RegExp("^" + M + "*([>+~]|" + M + ")" + M + "*"),
+ U = new RegExp(M + "|>"),
+ X = new RegExp(F),
+ V = new RegExp("^" + I + "$"),
+ G = {
+ ID: new RegExp("^#(" + I + ")"),
+ CLASS: new RegExp("^\\.(" + I + ")"),
+ TAG: new RegExp("^(" + I + "|[*])"),
+ ATTR: new RegExp("^" + W),
+ PSEUDO: new RegExp("^" + F),
+ CHILD: new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" + M +
+ "*(even|odd|(([+-]|)(\\d*)n|)" + M + "*(?:([+-]|)" + M + "*(\\d+)|))" + M + "*\\)|)",
+ "i"),
+ bool: new RegExp("^(?:" + R + ")$", "i"),
+ needsContext: new RegExp("^" + M + "*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + M +
+ "*((?:-\\d)?\\d*)" + M + "*\\)|)(?=[^-]|$)", "i")
+ },
+ Y = /HTML$/i,
+ Q = /^(?:input|select|textarea|button)$/i,
+ J = /^h\d$/i,
+ K = /^[^{]+\{\s*\[native \w/,
+ Z = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,
+ ee = /[+~]/,
+ te = new RegExp("\\\\[\\da-fA-F]{1,6}" + M + "?|\\\\([^\\r\\n\\f])", "g"),
+ ne = function(e, t) {
+ var n = "0x" + e.slice(1) - 65536;
+ return t || (n < 0 ? String.fromCharCode(n + 65536) : String.fromCharCode(n >> 10 | 55296,
+ 1023 & n | 56320))
+ },
+ re = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,
+ ie = function(e, t) {
+ return t ? "\0" === e ? "\ufffd" : e.slice(0, -1) + "\\" + e.charCodeAt(e.length - 1).toString(
+ 16) + " " : "\\" + e
+ },
+ oe = function() {
+ T()
+ },
+ ae = be(function(e) {
+ return !0 === e.disabled && "fieldset" === e.nodeName.toLowerCase()
+ }, {
+ dir: "parentNode",
+ next: "legend"
+ });
+ try {
+ H.apply(t = O.call(p.childNodes), p.childNodes), t[p.childNodes.length].nodeType
+ } catch (e) {
+ H = {
+ apply: t.length ? function(e, t) {
+ L.apply(e, O.call(t))
+ } : function(e, t) {
+ var n = e.length,
+ r = 0;
+ while (e[n++] = t[r++]);
+ e.length = n - 1
+ }
+ }
+ }
+
+ function se(t, e, n, r) {
+ var i, o, a, s, u, l, c, f = e && e.ownerDocument,
+ p = e ? e.nodeType : 9;
+ if (n = n || [], "string" != typeof t || !t || 1 !== p && 9 !== p && 11 !== p) return n;
+ if (!r && (T(e), e = e || C, E)) {
+ if (11 !== p && (u = Z.exec(t)))
+ if (i = u[1]) {
+ if (9 === p) {
+ if (!(a = e.getElementById(i))) return n;
+ if (a.id === i) return n.push(a), n
+ } else if (f && (a = f.getElementById(i)) && y(e, a) && a.id === i) return n.push(a), n
+ } else {
+ if (u[2]) return H.apply(n, e.getElementsByTagName(t)), n;
+ if ((i = u[3]) && d.getElementsByClassName && e.getElementsByClassName) return H.apply(
+ n, e.getElementsByClassName(i)), n
+ } if (d.qsa && !N[t + " "] && (!v || !v.test(t)) && (1 !== p || "object" !== e.nodeName
+ .toLowerCase())) {
+ if (c = t, f = e, 1 === p && (U.test(t) || z.test(t))) {
+ (f = ee.test(t) && ye(e.parentNode) || e) === e && d.scope || ((s = e.getAttribute(
+ "id")) ? s = s.replace(re, ie) : e.setAttribute("id", s = S)), o = (l = h(t))
+ .length;
+ while (o--) l[o] = (s ? "#" + s : ":scope") + " " + xe(l[o]);
+ c = l.join(",")
+ }
+ try {
+ return H.apply(n, f.querySelectorAll(c)), n
+ } catch (e) {
+ N(t, !0)
+ } finally {
+ s === S && e.removeAttribute("id")
+ }
+ }
+ }
+ return g(t.replace($, "$1"), e, n, r)
+ }
+
+ function ue() {
+ var r = [];
+ return function e(t, n) {
+ return r.push(t + " ") > b.cacheLength && delete e[r.shift()], e[t + " "] = n
+ }
+ }
+
+ function le(e) {
+ return e[S] = !0, e
+ }
+
+ function ce(e) {
+ var t = C.createElement("fieldset");
+ try {
+ return !!e(t)
+ } catch (e) {
+ return !1
+ } finally {
+ t.parentNode && t.parentNode.removeChild(t), t = null
+ }
+ }
+
+ function fe(e, t) {
+ var n = e.split("|"),
+ r = n.length;
+ while (r--) b.attrHandle[n[r]] = t
+ }
+
+ function pe(e, t) {
+ var n = t && e,
+ r = n && 1 === e.nodeType && 1 === t.nodeType && e.sourceIndex - t.sourceIndex;
+ if (r) return r;
+ if (n)
+ while (n = n.nextSibling)
+ if (n === t) return -1;
+ return e ? 1 : -1
+ }
+
+ function de(t) {
+ return function(e) {
+ return "input" === e.nodeName.toLowerCase() && e.type === t
+ }
+ }
+
+ function he(n) {
+ return function(e) {
+ var t = e.nodeName.toLowerCase();
+ return ("input" === t || "button" === t) && e.type === n
+ }
+ }
+
+ function ge(t) {
+ return function(e) {
+ return "form" in e ? e.parentNode && !1 === e.disabled ? "label" in e ? "label" in e
+ .parentNode ? e.parentNode.disabled === t : e.disabled === t : e.isDisabled === t || e
+ .isDisabled !== !t && ae(e) === t : e.disabled === t : "label" in e && e.disabled === t
+ }
+ }
+
+ function ve(a) {
+ return le(function(o) {
+ return o = +o, le(function(e, t) {
+ var n, r = a([], e.length, o),
+ i = r.length;
+ while (i--) e[n = r[i]] && (e[n] = !(t[n] = e[n]))
+ })
+ })
+ }
+
+ function ye(e) {
+ return e && "undefined" != typeof e.getElementsByTagName && e
+ }
+ for (e in d = se.support = {}, i = se.isXML = function(e) {
+ var t = e && e.namespaceURI,
+ n = e && (e.ownerDocument || e).documentElement;
+ return !Y.test(t || n && n.nodeName || "HTML")
+ }, T = se.setDocument = function(e) {
+ var t, n, r = e ? e.ownerDocument || e : p;
+ return r != C && 9 === r.nodeType && r.documentElement && (a = (C = r).documentElement, E = !i(
+ C), p != C && (n = C.defaultView) && n.top !== n && (n.addEventListener ? n
+ .addEventListener("unload", oe, !1) : n.attachEvent && n.attachEvent("onunload", oe)
+ ), d.scope = ce(function(e) {
+ return a.appendChild(e).appendChild(C.createElement("div")), "undefined" !=
+ typeof e.querySelectorAll && !e.querySelectorAll(":scope fieldset div")
+ .length
+ }), d.attributes = ce(function(e) {
+ return e.className = "i", !e.getAttribute("className")
+ }), d.getElementsByTagName = ce(function(e) {
+ return e.appendChild(C.createComment("")), !e.getElementsByTagName("*").length
+ }), d.getElementsByClassName = K.test(C.getElementsByClassName), d.getById = ce(
+ function(e) {
+ return a.appendChild(e).id = S, !C.getElementsByName || !C.getElementsByName(S)
+ .length
+ }), d.getById ? (b.filter.ID = function(e) {
+ var t = e.replace(te, ne);
+ return function(e) {
+ return e.getAttribute("id") === t
+ }
+ }, b.find.ID = function(e, t) {
+ if ("undefined" != typeof t.getElementById && E) {
+ var n = t.getElementById(e);
+ return n ? [n] : []
+ }
+ }) : (b.filter.ID = function(e) {
+ var n = e.replace(te, ne);
+ return function(e) {
+ var t = "undefined" != typeof e.getAttributeNode && e.getAttributeNode(
+ "id");
+ return t && t.value === n
+ }
+ }, b.find.ID = function(e, t) {
+ if ("undefined" != typeof t.getElementById && E) {
+ var n, r, i, o = t.getElementById(e);
+ if (o) {
+ if ((n = o.getAttributeNode("id")) && n.value === e) return [o];
+ i = t.getElementsByName(e), r = 0;
+ while (o = i[r++])
+ if ((n = o.getAttributeNode("id")) && n.value === e) return [o]
+ }
+ return []
+ }
+ }), b.find.TAG = d.getElementsByTagName ? function(e, t) {
+ return "undefined" != typeof t.getElementsByTagName ? t.getElementsByTagName(e) : d
+ .qsa ? t.querySelectorAll(e) : void 0
+ } : function(e, t) {
+ var n, r = [],
+ i = 0,
+ o = t.getElementsByTagName(e);
+ if ("*" === e) {
+ while (n = o[i++]) 1 === n.nodeType && r.push(n);
+ return r
+ }
+ return o
+ }, b.find.CLASS = d.getElementsByClassName && function(e, t) {
+ if ("undefined" != typeof t.getElementsByClassName && E) return t
+ .getElementsByClassName(e)
+ }, s = [], v = [], (d.qsa = K.test(C.querySelectorAll)) && (ce(function(e) {
+ var t;
+ a.appendChild(e).innerHTML = "", e
+ .querySelectorAll("[msallowcapture^='']").length && v.push("[*^$]=" +
+ M + "*(?:''|\"\")"), e.querySelectorAll("[selected]").length || v
+ .push("\\[" + M + "*(?:value|" + R + ")"), e.querySelectorAll("[id~=" +
+ S + "-]").length || v.push("~="), (t = C.createElement("input"))
+ .setAttribute("name", ""), e.appendChild(t), e.querySelectorAll(
+ "[name='']").length || v.push("\\[" + M + "*name" + M + "*=" + M +
+ "*(?:''|\"\")"), e.querySelectorAll(":checked").length || v.push(
+ ":checked"), e.querySelectorAll("a#" + S + "+*").length || v.push(
+ ".#.+[+~]"), e.querySelectorAll("\\\f"), v.push("[\\r\\n\\f]")
+ }), ce(function(e) {
+ e.innerHTML =
+ "";
+ var t = C.createElement("input");
+ t.setAttribute("type", "hidden"), e.appendChild(t).setAttribute("name",
+ "D"), e.querySelectorAll("[name=d]").length && v.push("name" + M +
+ "*[*^$|!~]?="), 2 !== e.querySelectorAll(":enabled").length && v
+ .push(":enabled", ":disabled"), a.appendChild(e).disabled = !0, 2 !== e
+ .querySelectorAll(":disabled").length && v.push(":enabled",
+ ":disabled"), e.querySelectorAll("*,:x"), v.push(",.*:")
+ })), (d.matchesSelector = K.test(c = a.matches || a.webkitMatchesSelector || a
+ .mozMatchesSelector || a.oMatchesSelector || a.msMatchesSelector)) && ce(function(
+ e) {
+ d.disconnectedMatch = c.call(e, "*"), c.call(e, "[s!='']:x"), s.push("!=", F)
+ }), v = v.length && new RegExp(v.join("|")), s = s.length && new RegExp(s.join("|")),
+ t = K.test(a.compareDocumentPosition), y = t || K.test(a.contains) ? function(e, t) {
+ var n = 9 === e.nodeType ? e.documentElement : e,
+ r = t && t.parentNode;
+ return e === r || !(!r || 1 !== r.nodeType || !(n.contains ? n.contains(r) : e
+ .compareDocumentPosition && 16 & e.compareDocumentPosition(r)))
+ } : function(e, t) {
+ if (t)
+ while (t = t.parentNode)
+ if (t === e) return !0;
+ return !1
+ }, j = t ? function(e, t) {
+ if (e === t) return l = !0, 0;
+ var n = !e.compareDocumentPosition - !t.compareDocumentPosition;
+ return n || (1 & (n = (e.ownerDocument || e) == (t.ownerDocument || t) ? e
+ .compareDocumentPosition(t) : 1) || !d.sortDetached && t
+ .compareDocumentPosition(e) === n ? e == C || e.ownerDocument == p && y(p,
+ e) ? -1 : t == C || t.ownerDocument == p && y(p, t) ? 1 : u ? P(u, e) -
+ P(u, t) : 0 : 4 & n ? -1 : 1)
+ } : function(e, t) {
+ if (e === t) return l = !0, 0;
+ var n, r = 0,
+ i = e.parentNode,
+ o = t.parentNode,
+ a = [e],
+ s = [t];
+ if (!i || !o) return e == C ? -1 : t == C ? 1 : i ? -1 : o ? 1 : u ? P(u, e) - P(u,
+ t) : 0;
+ if (i === o) return pe(e, t);
+ n = e;
+ while (n = n.parentNode) a.unshift(n);
+ n = t;
+ while (n = n.parentNode) s.unshift(n);
+ while (a[r] === s[r]) r++;
+ return r ? pe(a[r], s[r]) : a[r] == p ? -1 : s[r] == p ? 1 : 0
+ }), C
+ }, se.matches = function(e, t) {
+ return se(e, null, null, t)
+ }, se.matchesSelector = function(e, t) {
+ if (T(e), d.matchesSelector && E && !N[t + " "] && (!s || !s.test(t)) && (!v || !v.test(t)))
+ try {
+ var n = c.call(e, t);
+ if (n || d.disconnectedMatch || e.document && 11 !== e.document.nodeType) return n
+ } catch (e) {
+ N(t, !0)
+ }
+ return 0 < se(t, C, null, [e]).length
+ }, se.contains = function(e, t) {
+ return (e.ownerDocument || e) != C && T(e), y(e, t)
+ }, se.attr = function(e, t) {
+ (e.ownerDocument || e) != C && T(e);
+ var n = b.attrHandle[t.toLowerCase()],
+ r = n && D.call(b.attrHandle, t.toLowerCase()) ? n(e, t, !E) : void 0;
+ return void 0 !== r ? r : d.attributes || !E ? e.getAttribute(t) : (r = e.getAttributeNode(
+ t)) && r.specified ? r.value : null
+ }, se.escape = function(e) {
+ return (e + "").replace(re, ie)
+ }, se.error = function(e) {
+ throw new Error("Syntax error, unrecognized expression: " + e)
+ }, se.uniqueSort = function(e) {
+ var t, n = [],
+ r = 0,
+ i = 0;
+ if (l = !d.detectDuplicates, u = !d.sortStable && e.slice(0), e.sort(j), l) {
+ while (t = e[i++]) t === e[i] && (r = n.push(i));
+ while (r--) e.splice(n[r], 1)
+ }
+ return u = null, e
+ }, o = se.getText = function(e) {
+ var t, n = "",
+ r = 0,
+ i = e.nodeType;
+ if (i) {
+ if (1 === i || 9 === i || 11 === i) {
+ if ("string" == typeof e.textContent) return e.textContent;
+ for (e = e.firstChild; e; e = e.nextSibling) n += o(e)
+ } else if (3 === i || 4 === i) return e.nodeValue
+ } else
+ while (t = e[r++]) n += o(t);
+ return n
+ }, (b = se.selectors = {
+ cacheLength: 50,
+ createPseudo: le,
+ match: G,
+ attrHandle: {},
+ find: {},
+ relative: {
+ ">": {
+ dir: "parentNode",
+ first: !0
+ },
+ " ": {
+ dir: "parentNode"
+ },
+ "+": {
+ dir: "previousSibling",
+ first: !0
+ },
+ "~": {
+ dir: "previousSibling"
+ }
+ },
+ preFilter: {
+ ATTR: function(e) {
+ return e[1] = e[1].replace(te, ne), e[3] = (e[3] || e[4] || e[5] || "").replace(
+ te, ne), "~=" === e[2] && (e[3] = " " + e[3] + " "), e.slice(0, 4)
+ },
+ CHILD: function(e) {
+ return e[1] = e[1].toLowerCase(), "nth" === e[1].slice(0, 3) ? (e[3] || se
+ .error(e[0]), e[4] = +(e[4] ? e[5] + (e[6] || 1) : 2 * ("even" === e[
+ 3] || "odd" === e[3])), e[5] = +(e[7] + e[8] || "odd" === e[3])) :
+ e[3] && se.error(e[0]), e
+ },
+ PSEUDO: function(e) {
+ var t, n = !e[6] && e[2];
+ return G.CHILD.test(e[0]) ? null : (e[3] ? e[2] = e[4] || e[5] || "" : n && X
+ .test(n) && (t = h(n, !0)) && (t = n.indexOf(")", n.length - t) - n
+ .length) && (e[0] = e[0].slice(0, t), e[2] = n.slice(0, t)), e
+ .slice(0, 3))
+ }
+ },
+ filter: {
+ TAG: function(e) {
+ var t = e.replace(te, ne).toLowerCase();
+ return "*" === e ? function() {
+ return !0
+ } : function(e) {
+ return e.nodeName && e.nodeName.toLowerCase() === t
+ }
+ },
+ CLASS: function(e) {
+ var t = m[e + " "];
+ return t || (t = new RegExp("(^|" + M + ")" + e + "(" + M + "|$)")) && m(e,
+ function(e) {
+ return t.test("string" == typeof e.className && e.className ||
+ "undefined" != typeof e.getAttribute && e.getAttribute(
+ "class") || "")
+ })
+ },
+ ATTR: function(n, r, i) {
+ return function(e) {
+ var t = se.attr(e, n);
+ return null == t ? "!=" === r : !r || (t += "", "=" === r ? t === i :
+ "!=" === r ? t !== i : "^=" === r ? i && 0 === t.indexOf(i) :
+ "*=" === r ? i && -1 < t.indexOf(i) : "$=" === r ? i && t.slice(
+ -i.length) === i : "~=" === r ? -1 < (" " + t.replace(B,
+ " ") + " ").indexOf(i) : "|=" === r && (t === i || t.slice(
+ 0, i.length + 1) === i + "-"))
+ }
+ },
+ CHILD: function(h, e, t, g, v) {
+ var y = "nth" !== h.slice(0, 3),
+ m = "last" !== h.slice(-4),
+ x = "of-type" === e;
+ return 1 === g && 0 === v ? function(e) {
+ return !!e.parentNode
+ } : function(e, t, n) {
+ var r, i, o, a, s, u, l = y !== m ? "nextSibling" : "previousSibling",
+ c = e.parentNode,
+ f = x && e.nodeName.toLowerCase(),
+ p = !n && !x,
+ d = !1;
+ if (c) {
+ if (y) {
+ while (l) {
+ a = e;
+ while (a = a[l])
+ if (x ? a.nodeName.toLowerCase() === f : 1 === a
+ .nodeType) return !1;
+ u = l = "only" === h && !u && "nextSibling"
+ }
+ return !0
+ }
+ if (u = [m ? c.firstChild : c.lastChild], m && p) {
+ d = (s = (r = (i = (o = (a = c)[S] || (a[S] = {}))[a
+ .uniqueID] || (o[a.uniqueID] = {}))[h] || [])[0] ===
+ k && r[1]) && r[2], a = s && c.childNodes[s];
+ while (a = ++s && a && a[l] || (d = s = 0) || u.pop())
+ if (1 === a.nodeType && ++d && a === e) {
+ i[h] = [k, s, d];
+ break
+ }
+ } else if (p && (d = s = (r = (i = (o = (a = e)[S] || (a[S] = {}))[a
+ .uniqueID] || (o[a.uniqueID] = {}))[h] || [])[0] ===
+ k && r[1]), !1 === d)
+ while (a = ++s && a && a[l] || (d = s = 0) || u.pop())
+ if ((x ? a.nodeName.toLowerCase() === f : 1 === a
+ .nodeType) && ++d && (p && ((i = (o = a[S] || (a[
+ S] = {}))[a.uniqueID] || (o[a
+ .uniqueID] = {}))[h] = [k, d]), a === e)) break;
+ return (d -= v) === g || d % g == 0 && 0 <= d / g
+ }
+ }
+ },
+ PSEUDO: function(e, o) {
+ var t, a = b.pseudos[e] || b.setFilters[e.toLowerCase()] || se.error(
+ "unsupported pseudo: " + e);
+ return a[S] ? a(o) : 1 < a.length ? (t = [e, e, "", o], b.setFilters
+ .hasOwnProperty(e.toLowerCase()) ? le(function(e, t) {
+ var n, r = a(e, o),
+ i = r.length;
+ while (i--) e[n = P(e, r[i])] = !(t[n] = r[i])
+ }) : function(e) {
+ return a(e, 0, t)
+ }) : a
+ }
+ },
+ pseudos: {
+ not: le(function(e) {
+ var r = [],
+ i = [],
+ s = f(e.replace($, "$1"));
+ return s[S] ? le(function(e, t, n, r) {
+ var i, o = s(e, null, r, []),
+ a = e.length;
+ while (a--)(i = o[a]) && (e[a] = !(t[a] = i))
+ }) : function(e, t, n) {
+ return r[0] = e, s(r, null, n, i), r[0] = null, !i.pop()
+ }
+ }),
+ has: le(function(t) {
+ return function(e) {
+ return 0 < se(t, e).length
+ }
+ }),
+ contains: le(function(t) {
+ return t = t.replace(te, ne),
+ function(e) {
+ return -1 < (e.textContent || o(e)).indexOf(t)
+ }
+ }),
+ lang: le(function(n) {
+ return V.test(n || "") || se.error("unsupported lang: " + n), n = n.replace(
+ te, ne).toLowerCase(),
+ function(e) {
+ var t;
+ do {
+ if (t = E ? e.lang : e.getAttribute("xml:lang") || e
+ .getAttribute("lang")) return (t = t.toLowerCase()) === n ||
+ 0 === t.indexOf(n + "-")
+ } while ((e = e.parentNode) && 1 === e.nodeType);
+ return !1
+ }
+ }),
+ target: function(e) {
+ var t = n.location && n.location.hash;
+ return t && t.slice(1) === e.id
+ },
+ root: function(e) {
+ return e === a
+ },
+ focus: function(e) {
+ return e === C.activeElement && (!C.hasFocus || C.hasFocus()) && !!(e.type || e
+ .href || ~e.tabIndex)
+ },
+ enabled: ge(!1),
+ disabled: ge(!0),
+ checked: function(e) {
+ var t = e.nodeName.toLowerCase();
+ return "input" === t && !!e.checked || "option" === t && !!e.selected
+ },
+ selected: function(e) {
+ return e.parentNode && e.parentNode.selectedIndex, !0 === e.selected
+ },
+ empty: function(e) {
+ for (e = e.firstChild; e; e = e.nextSibling)
+ if (e.nodeType < 6) return !1;
+ return !0
+ },
+ parent: function(e) {
+ return !b.pseudos.empty(e)
+ },
+ header: function(e) {
+ return J.test(e.nodeName)
+ },
+ input: function(e) {
+ return Q.test(e.nodeName)
+ },
+ button: function(e) {
+ var t = e.nodeName.toLowerCase();
+ return "input" === t && "button" === e.type || "button" === t
+ },
+ text: function(e) {
+ var t;
+ return "input" === e.nodeName.toLowerCase() && "text" === e.type && (null == (
+ t = e.getAttribute("type")) || "text" === t.toLowerCase())
+ },
+ first: ve(function() {
+ return [0]
+ }),
+ last: ve(function(e, t) {
+ return [t - 1]
+ }),
+ eq: ve(function(e, t, n) {
+ return [n < 0 ? n + t : n]
+ }),
+ even: ve(function(e, t) {
+ for (var n = 0; n < t; n += 2) e.push(n);
+ return e
+ }),
+ odd: ve(function(e, t) {
+ for (var n = 1; n < t; n += 2) e.push(n);
+ return e
+ }),
+ lt: ve(function(e, t, n) {
+ for (var r = n < 0 ? n + t : t < n ? t : n; 0 <= --r;) e.push(r);
+ return e
+ }),
+ gt: ve(function(e, t, n) {
+ for (var r = n < 0 ? n + t : n; ++r < t;) e.push(r);
+ return e
+ })
+ }
+ }).pseudos.nth = b.pseudos.eq, {
+ radio: !0,
+ checkbox: !0,
+ file: !0,
+ password: !0,
+ image: !0
+ }) b.pseudos[e] = de(e);
+ for (e in {
+ submit: !0,
+ reset: !0
+ }) b.pseudos[e] = he(e);
+
+ function me() {}
+
+ function xe(e) {
+ for (var t = 0, n = e.length, r = ""; t < n; t++) r += e[t].value;
+ return r
+ }
+
+ function be(s, e, t) {
+ var u = e.dir,
+ l = e.next,
+ c = l || u,
+ f = t && "parentNode" === c,
+ p = r++;
+ return e.first ? function(e, t, n) {
+ while (e = e[u])
+ if (1 === e.nodeType || f) return s(e, t, n);
+ return !1
+ } : function(e, t, n) {
+ var r, i, o, a = [k, p];
+ if (n) {
+ while (e = e[u])
+ if ((1 === e.nodeType || f) && s(e, t, n)) return !0
+ } else
+ while (e = e[u])
+ if (1 === e.nodeType || f)
+ if (i = (o = e[S] || (e[S] = {}))[e.uniqueID] || (o[e.uniqueID] = {}), l &&
+ l === e.nodeName.toLowerCase()) e = e[u] || e;
+ else {
+ if ((r = i[c]) && r[0] === k && r[1] === p) return a[2] = r[2];
+ if ((i[c] = a)[2] = s(e, t, n)) return !0
+ } return !1
+ }
+ }
+
+ function we(i) {
+ return 1 < i.length ? function(e, t, n) {
+ var r = i.length;
+ while (r--)
+ if (!i[r](e, t, n)) return !1;
+ return !0
+ } : i[0]
+ }
+
+ function Te(e, t, n, r, i) {
+ for (var o, a = [], s = 0, u = e.length, l = null != t; s < u; s++)(o = e[s]) && (n && !n(o, r,
+ i) || (a.push(o), l && t.push(s)));
+ return a
+ }
+
+ function Ce(d, h, g, v, y, e) {
+ return v && !v[S] && (v = Ce(v)), y && !y[S] && (y = Ce(y, e)), le(function(e, t, n, r) {
+ var i, o, a, s = [],
+ u = [],
+ l = t.length,
+ c = e || function(e, t, n) {
+ for (var r = 0, i = t.length; r < i; r++) se(e, t[r], n);
+ return n
+ }(h || "*", n.nodeType ? [n] : n, []),
+ f = !d || !e && h ? c : Te(c, s, d, n, r),
+ p = g ? y || (e ? d : l || v) ? [] : t : f;
+ if (g && g(f, p, n, r), v) {
+ i = Te(p, u), v(i, [], n, r), o = i.length;
+ while (o--)(a = i[o]) && (p[u[o]] = !(f[u[o]] = a))
+ }
+ if (e) {
+ if (y || d) {
+ if (y) {
+ i = [], o = p.length;
+ while (o--)(a = p[o]) && i.push(f[o] = a);
+ y(null, p = [], i, r)
+ }
+ o = p.length;
+ while (o--)(a = p[o]) && -1 < (i = y ? P(e, a) : s[o]) && (e[i] = !(t[i] = a))
+ }
+ } else p = Te(p === t ? p.splice(l, p.length) : p), y ? y(null, t, p, r) : H.apply(t, p)
+ })
+ }
+
+ function Ee(e) {
+ for (var i, t, n, r = e.length, o = b.relative[e[0].type], a = o || b.relative[" "], s = o ? 1 : 0,
+ u = be(function(e) {
+ return e === i
+ }, a, !0), l = be(function(e) {
+ return -1 < P(i, e)
+ }, a, !0), c = [function(e, t, n) {
+ var r = !o && (n || t !== w) || ((i = t).nodeType ? u(e, t, n) : l(e, t, n));
+ return i = null, r
+ }]; s < r; s++)
+ if (t = b.relative[e[s].type]) c = [be(we(c), t)];
+ else {
+ if ((t = b.filter[e[s].type].apply(null, e[s].matches))[S]) {
+ for (n = ++s; n < r; n++)
+ if (b.relative[e[n].type]) break;
+ return Ce(1 < s && we(c), 1 < s && xe(e.slice(0, s - 1).concat({
+ value: " " === e[s - 2].type ? "*" : ""
+ })).replace($, "$1"), t, s < n && Ee(e.slice(s, n)), n < r && Ee(e = e.slice(
+ n)), n < r && xe(e))
+ }
+ c.push(t)
+ } return we(c)
+ }
+ return me.prototype = b.filters = b.pseudos, b.setFilters = new me, h = se.tokenize = function(e, t) {
+ var n, r, i, o, a, s, u, l = x[e + " "];
+ if (l) return t ? 0 : l.slice(0);
+ a = e, s = [], u = b.preFilter;
+ while (a) {
+ for (o in n && !(r = _.exec(a)) || (r && (a = a.slice(r[0].length) || a), s.push(i = [])),
+ n = !1, (r = z.exec(a)) && (n = r.shift(), i.push({
+ value: n,
+ type: r[0].replace($, " ")
+ }), a = a.slice(n.length)), b.filter) !(r = G[o].exec(a)) || u[o] && !(r = u[o](r)) || (
+ n = r.shift(), i.push({
+ value: n,
+ type: o,
+ matches: r
+ }), a = a.slice(n.length));
+ if (!n) break
+ }
+ return t ? a.length : a ? se.error(e) : x(e, s).slice(0)
+ }, f = se.compile = function(e, t) {
+ var n, v, y, m, x, r, i = [],
+ o = [],
+ a = A[e + " "];
+ if (!a) {
+ t || (t = h(e)), n = t.length;
+ while (n--)(a = Ee(t[n]))[S] ? i.push(a) : o.push(a);
+ (a = A(e, (v = o, m = 0 < (y = i).length, x = 0 < v.length, r = function(e, t, n, r, i) {
+ var o, a, s, u = 0,
+ l = "0",
+ c = e && [],
+ f = [],
+ p = w,
+ d = e || x && b.find.TAG("*", i),
+ h = k += null == p ? 1 : Math.random() || .1,
+ g = d.length;
+ for (i && (w = t == C || t || i); l !== g && null != (o = d[l]); l++) {
+ if (x && o) {
+ a = 0, t || o.ownerDocument == C || (T(o), n = !E);
+ while (s = v[a++])
+ if (s(o, t || C, n)) {
+ r.push(o);
+ break
+ } i && (k = h)
+ }
+ m && ((o = !s && o) && u--, e && c.push(o))
+ }
+ if (u += l, m && l !== u) {
+ a = 0;
+ while (s = y[a++]) s(c, f, t, n);
+ if (e) {
+ if (0 < u)
+ while (l--) c[l] || f[l] || (f[l] = q.call(r));
+ f = Te(f)
+ }
+ H.apply(r, f), i && !e && 0 < f.length && 1 < u + y.length && se
+ .uniqueSort(r)
+ }
+ return i && (k = h, w = p), c
+ }, m ? le(r) : r))).selector = e
+ }
+ return a
+ }, g = se.select = function(e, t, n, r) {
+ var i, o, a, s, u, l = "function" == typeof e && e,
+ c = !r && h(e = l.selector || e);
+ if (n = n || [], 1 === c.length) {
+ if (2 < (o = c[0] = c[0].slice(0)).length && "ID" === (a = o[0]).type && 9 === t.nodeType &&
+ E && b.relative[o[1].type]) {
+ if (!(t = (b.find.ID(a.matches[0].replace(te, ne), t) || [])[0])) return n;
+ l && (t = t.parentNode), e = e.slice(o.shift().value.length)
+ }
+ i = G.needsContext.test(e) ? 0 : o.length;
+ while (i--) {
+ if (a = o[i], b.relative[s = a.type]) break;
+ if ((u = b.find[s]) && (r = u(a.matches[0].replace(te, ne), ee.test(o[0].type) && ye(t
+ .parentNode) || t))) {
+ if (o.splice(i, 1), !(e = r.length && xe(o))) return H.apply(n, r), n;
+ break
+ }
+ }
+ }
+ return (l || f(e, c))(r, t, !E, n, !t || ee.test(e) && ye(t.parentNode) || t), n
+ }, d.sortStable = S.split("").sort(j).join("") === S, d.detectDuplicates = !!l, T(), d
+ .sortDetached = ce(function(e) {
+ return 1 & e.compareDocumentPosition(C.createElement("fieldset"))
+ }), ce(function(e) {
+ return e.innerHTML = "", "#" === e.firstChild.getAttribute("href")
+ }) || fe("type|href|height|width", function(e, t, n) {
+ if (!n) return e.getAttribute(t, "type" === t.toLowerCase() ? 1 : 2)
+ }), d.attributes && ce(function(e) {
+ return e.innerHTML = "", e.firstChild.setAttribute("value", ""), "" === e.firstChild
+ .getAttribute("value")
+ }) || fe("value", function(e, t, n) {
+ if (!n && "input" === e.nodeName.toLowerCase()) return e.defaultValue
+ }), ce(function(e) {
+ return null == e.getAttribute("disabled")
+ }) || fe(R, function(e, t, n) {
+ var r;
+ if (!n) return !0 === e[t] ? t.toLowerCase() : (r = e.getAttributeNode(t)) && r.specified ?
+ r.value : null
+ }), se
+ }(C);
+ S.find = d, S.expr = d.selectors, S.expr[":"] = S.expr.pseudos, S.uniqueSort = S.unique = d.uniqueSort, S.text =
+ d.getText, S.isXMLDoc = d.isXML, S.contains = d.contains, S.escapeSelector = d.escape;
+ var h = function(e, t, n) {
+ var r = [],
+ i = void 0 !== n;
+ while ((e = e[t]) && 9 !== e.nodeType)
+ if (1 === e.nodeType) {
+ if (i && S(e).is(n)) break;
+ r.push(e)
+ } return r
+ },
+ T = function(e, t) {
+ for (var n = []; e; e = e.nextSibling) 1 === e.nodeType && e !== t && n.push(e);
+ return n
+ },
+ k = S.expr.match.needsContext;
+
+ function A(e, t) {
+ return e.nodeName && e.nodeName.toLowerCase() === t.toLowerCase()
+ }
+ var N = /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;
+
+ function j(e, n, r) {
+ return m(n) ? S.grep(e, function(e, t) {
+ return !!n.call(e, t, e) !== r
+ }) : n.nodeType ? S.grep(e, function(e) {
+ return e === n !== r
+ }) : "string" != typeof n ? S.grep(e, function(e) {
+ return -1 < i.call(n, e) !== r
+ }) : S.filter(n, e, r)
+ }
+ S.filter = function(e, t, n) {
+ var r = t[0];
+ return n && (e = ":not(" + e + ")"), 1 === t.length && 1 === r.nodeType ? S.find.matchesSelector(r, e) ?
+ [r] : [] : S.find.matches(e, S.grep(t, function(e) {
+ return 1 === e.nodeType
+ }))
+ }, S.fn.extend({
+ find: function(e) {
+ var t, n, r = this.length,
+ i = this;
+ if ("string" != typeof e) return this.pushStack(S(e).filter(function() {
+ for (t = 0; t < r; t++)
+ if (S.contains(i[t], this)) return !0
+ }));
+ for (n = this.pushStack([]), t = 0; t < r; t++) S.find(e, i[t], n);
+ return 1 < r ? S.uniqueSort(n) : n
+ },
+ filter: function(e) {
+ return this.pushStack(j(this, e || [], !1))
+ },
+ not: function(e) {
+ return this.pushStack(j(this, e || [], !0))
+ },
+ is: function(e) {
+ return !!j(this, "string" == typeof e && k.test(e) ? S(e) : e || [], !1).length
+ }
+ });
+ var D, q = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/;
+ (S.fn.init = function(e, t, n) {
+ var r, i;
+ if (!e) return this;
+ if (n = n || D, "string" == typeof e) {
+ if (!(r = "<" === e[0] && ">" === e[e.length - 1] && 3 <= e.length ? [null, e, null] : q.exec(e)) ||
+ !r[1] && t) return !t || t.jquery ? (t || n).find(e) : this.constructor(t).find(e);
+ if (r[1]) {
+ if (t = t instanceof S ? t[0] : t, S.merge(this, S.parseHTML(r[1], t && t.nodeType ? t
+ .ownerDocument || t : E, !0)), N.test(r[1]) && S.isPlainObject(t))
+ for (r in t) m(this[r]) ? this[r](t[r]) : this.attr(r, t[r]);
+ return this
+ }
+ return (i = E.getElementById(r[2])) && (this[0] = i, this.length = 1), this
+ }
+ return e.nodeType ? (this[0] = e, this.length = 1, this) : m(e) ? void 0 !== n.ready ? n.ready(e) : e(
+ S) : S.makeArray(e, this)
+ }).prototype = S.fn, D = S(E);
+ var L = /^(?:parents|prev(?:Until|All))/,
+ H = {
+ children: !0,
+ contents: !0,
+ next: !0,
+ prev: !0
+ };
+
+ function O(e, t) {
+ while ((e = e[t]) && 1 !== e.nodeType);
+ return e
+ }
+ S.fn.extend({
+ has: function(e) {
+ var t = S(e, this),
+ n = t.length;
+ return this.filter(function() {
+ for (var e = 0; e < n; e++)
+ if (S.contains(this, t[e])) return !0
+ })
+ },
+ closest: function(e, t) {
+ var n, r = 0,
+ i = this.length,
+ o = [],
+ a = "string" != typeof e && S(e);
+ if (!k.test(e))
+ for (; r < i; r++)
+ for (n = this[r]; n && n !== t; n = n.parentNode)
+ if (n.nodeType < 11 && (a ? -1 < a.index(n) : 1 === n.nodeType && S.find
+ .matchesSelector(n, e))) {
+ o.push(n);
+ break
+ } return this.pushStack(1 < o.length ? S.uniqueSort(o) : o)
+ },
+ index: function(e) {
+ return e ? "string" == typeof e ? i.call(S(e), this[0]) : i.call(this, e.jquery ? e[0] :
+ e) : this[0] && this[0].parentNode ? this.first().prevAll().length : -1
+ },
+ add: function(e, t) {
+ return this.pushStack(S.uniqueSort(S.merge(this.get(), S(e, t))))
+ },
+ addBack: function(e) {
+ return this.add(null == e ? this.prevObject : this.prevObject.filter(e))
+ }
+ }), S.each({
+ parent: function(e) {
+ var t = e.parentNode;
+ return t && 11 !== t.nodeType ? t : null
+ },
+ parents: function(e) {
+ return h(e, "parentNode")
+ },
+ parentsUntil: function(e, t, n) {
+ return h(e, "parentNode", n)
+ },
+ next: function(e) {
+ return O(e, "nextSibling")
+ },
+ prev: function(e) {
+ return O(e, "previousSibling")
+ },
+ nextAll: function(e) {
+ return h(e, "nextSibling")
+ },
+ prevAll: function(e) {
+ return h(e, "previousSibling")
+ },
+ nextUntil: function(e, t, n) {
+ return h(e, "nextSibling", n)
+ },
+ prevUntil: function(e, t, n) {
+ return h(e, "previousSibling", n)
+ },
+ siblings: function(e) {
+ return T((e.parentNode || {}).firstChild, e)
+ },
+ children: function(e) {
+ return T(e.firstChild)
+ },
+ contents: function(e) {
+ return null != e.contentDocument && r(e.contentDocument) ? e.contentDocument : (A(e,
+ "template") && (e = e.content || e), S.merge([], e.childNodes))
+ }
+ }, function(r, i) {
+ S.fn[r] = function(e, t) {
+ var n = S.map(this, i, e);
+ return "Until" !== r.slice(-5) && (t = e), t && "string" == typeof t && (n = S.filter(t,
+ n)), 1 < this.length && (H[r] || S.uniqueSort(n), L.test(r) && n.reverse()), this
+ .pushStack(n)
+ }
+ });
+ var P = /[^\x20\t\r\n\f]+/g;
+
+ function R(e) {
+ return e
+ }
+
+ function M(e) {
+ throw e
+ }
+
+ function I(e, t, n, r) {
+ var i;
+ try {
+ e && m(i = e.promise) ? i.call(e).done(t).fail(n) : e && m(i = e.then) ? i.call(e, t, n) : t.apply(
+ void 0, [e].slice(r))
+ } catch (e) {
+ n.apply(void 0, [e])
+ }
+ }
+ S.Callbacks = function(r) {
+ var e, n;
+ r = "string" == typeof r ? (e = r, n = {}, S.each(e.match(P) || [], function(e, t) {
+ n[t] = !0
+ }), n) : S.extend({}, r);
+ var i, t, o, a, s = [],
+ u = [],
+ l = -1,
+ c = function() {
+ for (a = a || r.once, o = i = !0; u.length; l = -1) {
+ t = u.shift();
+ while (++l < s.length) !1 === s[l].apply(t[0], t[1]) && r.stopOnFalse && (l = s.length,
+ t = !1)
+ }
+ r.memory || (t = !1), i = !1, a && (s = t ? [] : "")
+ },
+ f = {
+ add: function() {
+ return s && (t && !i && (l = s.length - 1, u.push(t)), function n(e) {
+ S.each(e, function(e, t) {
+ m(t) ? r.unique && f.has(t) || s.push(t) : t && t.length &&
+ "string" !== w(t) && n(t)
+ })
+ }(arguments), t && !i && c()), this
+ },
+ remove: function() {
+ return S.each(arguments, function(e, t) {
+ var n;
+ while (-1 < (n = S.inArray(t, s, n))) s.splice(n, 1), n <= l && l--
+ }), this
+ },
+ has: function(e) {
+ return e ? -1 < S.inArray(e, s) : 0 < s.length
+ },
+ empty: function() {
+ return s && (s = []), this
+ },
+ disable: function() {
+ return a = u = [], s = t = "", this
+ },
+ disabled: function() {
+ return !s
+ },
+ lock: function() {
+ return a = u = [], t || i || (s = t = ""), this
+ },
+ locked: function() {
+ return !!a
+ },
+ fireWith: function(e, t) {
+ return a || (t = [e, (t = t || []).slice ? t.slice() : t], u.push(t), i || c()), this
+ },
+ fire: function() {
+ return f.fireWith(this, arguments), this
+ },
+ fired: function() {
+ return !!o
+ }
+ };
+ return f
+ }, S.extend({
+ Deferred: function(e) {
+ var o = [
+ ["notify", "progress", S.Callbacks("memory"), S.Callbacks("memory"), 2],
+ ["resolve", "done", S.Callbacks("once memory"), S.Callbacks("once memory"), 0,
+ "resolved"
+ ],
+ ["reject", "fail", S.Callbacks("once memory"), S.Callbacks("once memory"), 1,
+ "rejected"
+ ]
+ ],
+ i = "pending",
+ a = {
+ state: function() {
+ return i
+ },
+ always: function() {
+ return s.done(arguments).fail(arguments), this
+ },
+ "catch": function(e) {
+ return a.then(null, e)
+ },
+ pipe: function() {
+ var i = arguments;
+ return S.Deferred(function(r) {
+ S.each(o, function(e, t) {
+ var n = m(i[t[4]]) && i[t[4]];
+ s[t[1]](function() {
+ var e = n && n.apply(this, arguments);
+ e && m(e.promise) ? e.promise()
+ .progress(r.notify).done(r.resolve)
+ .fail(r.reject) : r[t[0] + "With"](
+ this, n ? [e] : arguments)
+ })
+ }), i = null
+ }).promise()
+ },
+ then: function(t, n, r) {
+ var u = 0;
+
+ function l(i, o, a, s) {
+ return function() {
+ var n = this,
+ r = arguments,
+ e = function() {
+ var e, t;
+ if (!(i < u)) {
+ if ((e = a.apply(n, r)) === o.promise())
+ throw new TypeError("Thenable self-resolution");
+ t = e && ("object" == typeof e || "function" ==
+ typeof e) && e.then, m(t) ? s ? t.call(e, l(
+ u, o, R, s), l(u, o, M, s)) : (u++, t.call(
+ e, l(u, o, R, s), l(u, o, M, s), l(u, o,
+ R, o.notifyWith))) : (a !== R && (n =
+ void 0, r = [e]), (s || o.resolveWith)(
+ n, r))
+ }
+ },
+ t = s ? e : function() {
+ try {
+ e()
+ } catch (e) {
+ S.Deferred.exceptionHook && S.Deferred
+ .exceptionHook(e, t.stackTrace), u <= i + 1 && (
+ a !== M && (n = void 0, r = [e]), o
+ .rejectWith(n, r))
+ }
+ };
+ i ? t() : (S.Deferred.getStackHook && (t.stackTrace = S.Deferred
+ .getStackHook()), C.setTimeout(t))
+ }
+ }
+ return S.Deferred(function(e) {
+ o[0][3].add(l(0, e, m(r) ? r : R, e.notifyWith)), o[1][3].add(l(
+ 0, e, m(t) ? t : R)), o[2][3].add(l(0, e, m(n) ? n : M))
+ }).promise()
+ },
+ promise: function(e) {
+ return null != e ? S.extend(e, a) : a
+ }
+ },
+ s = {};
+ return S.each(o, function(e, t) {
+ var n = t[2],
+ r = t[5];
+ a[t[1]] = n.add, r && n.add(function() {
+ i = r
+ }, o[3 - e][2].disable, o[3 - e][3].disable, o[0][2].lock, o[0][3].lock), n
+ .add(t[3].fire), s[t[0]] = function() {
+ return s[t[0] + "With"](this === s ? void 0 : this, arguments), this
+ }, s[t[0] + "With"] = n.fireWith
+ }), a.promise(s), e && e.call(s, s), s
+ },
+ when: function(e) {
+ var n = arguments.length,
+ t = n,
+ r = Array(t),
+ i = s.call(arguments),
+ o = S.Deferred(),
+ a = function(t) {
+ return function(e) {
+ r[t] = this, i[t] = 1 < arguments.length ? s.call(arguments) : e, --n || o
+ .resolveWith(r, i)
+ }
+ };
+ if (n <= 1 && (I(e, o.done(a(t)).resolve, o.reject, !n), "pending" === o.state() || m(i[
+ t] && i[t].then))) return o.then();
+ while (t--) I(i[t], a(t), o.reject);
+ return o.promise()
+ }
+ });
+ var W = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;
+ S.Deferred.exceptionHook = function(e, t) {
+ C.console && C.console.warn && e && W.test(e.name) && C.console.warn("jQuery.Deferred exception: " + e
+ .message, e.stack, t)
+ }, S.readyException = function(e) {
+ C.setTimeout(function() {
+ throw e
+ })
+ };
+ var F = S.Deferred();
+
+ function B() {
+ E.removeEventListener("DOMContentLoaded", B), C.removeEventListener("load", B), S.ready()
+ }
+ S.fn.ready = function(e) {
+ return F.then(e)["catch"](function(e) {
+ S.readyException(e)
+ }), this
+ }, S.extend({
+ isReady: !1,
+ readyWait: 1,
+ ready: function(e) {
+ (!0 === e ? --S.readyWait : S.isReady) || (S.isReady = !0) !== e && 0 < --S.readyWait || F
+ .resolveWith(E, [S])
+ }
+ }), S.ready.then = F.then, "complete" === E.readyState || "loading" !== E.readyState && !E.documentElement
+ .doScroll ? C.setTimeout(S.ready) : (E.addEventListener("DOMContentLoaded", B), C.addEventListener("load",
+ B));
+ var $ = function(e, t, n, r, i, o, a) {
+ var s = 0,
+ u = e.length,
+ l = null == n;
+ if ("object" === w(n))
+ for (s in i = !0, n) $(e, t, s, n[s], !0, o, a);
+ else if (void 0 !== r && (i = !0, m(r) || (a = !0), l && (a ? (t.call(e, r), t = null) : (l = t, t =
+ function(e, t, n) {
+ return l.call(S(e), n)
+ })), t))
+ for (; s < u; s++) t(e[s], n, a ? r : r.call(e[s], s, t(e[s], n)));
+ return i ? e : l ? t.call(e) : u ? t(e[0], n) : o
+ },
+ _ = /^-ms-/,
+ z = /-([a-z])/g;
+
+ function U(e, t) {
+ return t.toUpperCase()
+ }
+
+ function X(e) {
+ return e.replace(_, "ms-").replace(z, U)
+ }
+ var V = function(e) {
+ return 1 === e.nodeType || 9 === e.nodeType || !+e.nodeType
+ };
+
+ function G() {
+ this.expando = S.expando + G.uid++
+ }
+ G.uid = 1, G.prototype = {
+ cache: function(e) {
+ var t = e[this.expando];
+ return t || (t = {}, V(e) && (e.nodeType ? e[this.expando] = t : Object.defineProperty(e, this
+ .expando, {
+ value: t,
+ configurable: !0
+ }))), t
+ },
+ set: function(e, t, n) {
+ var r, i = this.cache(e);
+ if ("string" == typeof t) i[X(t)] = n;
+ else
+ for (r in t) i[X(r)] = t[r];
+ return i
+ },
+ get: function(e, t) {
+ return void 0 === t ? this.cache(e) : e[this.expando] && e[this.expando][X(t)]
+ },
+ access: function(e, t, n) {
+ return void 0 === t || t && "string" == typeof t && void 0 === n ? this.get(e, t) : (this.set(e,
+ t, n), void 0 !== n ? n : t)
+ },
+ remove: function(e, t) {
+ var n, r = e[this.expando];
+ if (void 0 !== r) {
+ if (void 0 !== t) {
+ n = (t = Array.isArray(t) ? t.map(X) : (t = X(t)) in r ? [t] : t.match(P) || []).length;
+ while (n--) delete r[t[n]]
+ }(void 0 === t || S.isEmptyObject(r)) && (e.nodeType ? e[this.expando] = void 0 : delete e[
+ this.expando])
+ }
+ },
+ hasData: function(e) {
+ var t = e[this.expando];
+ return void 0 !== t && !S.isEmptyObject(t)
+ }
+ };
+ var Y = new G,
+ Q = new G,
+ J = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,
+ K = /[A-Z]/g;
+
+ function Z(e, t, n) {
+ var r, i;
+ if (void 0 === n && 1 === e.nodeType)
+ if (r = "data-" + t.replace(K, "-$&").toLowerCase(), "string" == typeof(n = e.getAttribute(r))) {
+ try {
+ n = "true" === (i = n) || "false" !== i && ("null" === i ? null : i === +i + "" ? +i : J.test(
+ i) ? JSON.parse(i) : i)
+ } catch (e) {}
+ Q.set(e, t, n)
+ } else n = void 0;
+ return n
+ }
+ S.extend({
+ hasData: function(e) {
+ return Q.hasData(e) || Y.hasData(e)
+ },
+ data: function(e, t, n) {
+ return Q.access(e, t, n)
+ },
+ removeData: function(e, t) {
+ Q.remove(e, t)
+ },
+ _data: function(e, t, n) {
+ return Y.access(e, t, n)
+ },
+ _removeData: function(e, t) {
+ Y.remove(e, t)
+ }
+ }), S.fn.extend({
+ data: function(n, e) {
+ var t, r, i, o = this[0],
+ a = o && o.attributes;
+ if (void 0 === n) {
+ if (this.length && (i = Q.get(o), 1 === o.nodeType && !Y.get(o, "hasDataAttrs"))) {
+ t = a.length;
+ while (t--) a[t] && 0 === (r = a[t].name).indexOf("data-") && (r = X(r.slice(5)), Z(
+ o, r, i[r]));
+ Y.set(o, "hasDataAttrs", !0)
+ }
+ return i
+ }
+ return "object" == typeof n ? this.each(function() {
+ Q.set(this, n)
+ }) : $(this, function(e) {
+ var t;
+ if (o && void 0 === e) return void 0 !== (t = Q.get(o, n)) ? t : void 0 !== (t =
+ Z(o, n)) ? t : void 0;
+ this.each(function() {
+ Q.set(this, n, e)
+ })
+ }, null, e, 1 < arguments.length, null, !0)
+ },
+ removeData: function(e) {
+ return this.each(function() {
+ Q.remove(this, e)
+ })
+ }
+ }), S.extend({
+ queue: function(e, t, n) {
+ var r;
+ if (e) return t = (t || "fx") + "queue", r = Y.get(e, t), n && (!r || Array.isArray(n) ? r =
+ Y.access(e, t, S.makeArray(n)) : r.push(n)), r || []
+ },
+ dequeue: function(e, t) {
+ t = t || "fx";
+ var n = S.queue(e, t),
+ r = n.length,
+ i = n.shift(),
+ o = S._queueHooks(e, t);
+ "inprogress" === i && (i = n.shift(), r--), i && ("fx" === t && n.unshift("inprogress"),
+ delete o.stop, i.call(e, function() {
+ S.dequeue(e, t)
+ }, o)), !r && o && o.empty.fire()
+ },
+ _queueHooks: function(e, t) {
+ var n = t + "queueHooks";
+ return Y.get(e, n) || Y.access(e, n, {
+ empty: S.Callbacks("once memory").add(function() {
+ Y.remove(e, [t + "queue", n])
+ })
+ })
+ }
+ }), S.fn.extend({
+ queue: function(t, n) {
+ var e = 2;
+ return "string" != typeof t && (n = t, t = "fx", e--), arguments.length < e ? S.queue(this[
+ 0], t) : void 0 === n ? this : this.each(function() {
+ var e = S.queue(this, t, n);
+ S._queueHooks(this, t), "fx" === t && "inprogress" !== e[0] && S.dequeue(this,
+ t)
+ })
+ },
+ dequeue: function(e) {
+ return this.each(function() {
+ S.dequeue(this, e)
+ })
+ },
+ clearQueue: function(e) {
+ return this.queue(e || "fx", [])
+ },
+ promise: function(e, t) {
+ var n, r = 1,
+ i = S.Deferred(),
+ o = this,
+ a = this.length,
+ s = function() {
+ --r || i.resolveWith(o, [o])
+ };
+ "string" != typeof e && (t = e, e = void 0), e = e || "fx";
+ while (a--)(n = Y.get(o[a], e + "queueHooks")) && n.empty && (r++, n.empty.add(s));
+ return s(), i.promise(t)
+ }
+ });
+ var ee = /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source,
+ te = new RegExp("^(?:([+-])=|)(" + ee + ")([a-z%]*)$", "i"),
+ ne = ["Top", "Right", "Bottom", "Left"],
+ re = E.documentElement,
+ ie = function(e) {
+ return S.contains(e.ownerDocument, e)
+ },
+ oe = {
+ composed: !0
+ };
+ re.getRootNode && (ie = function(e) {
+ return S.contains(e.ownerDocument, e) || e.getRootNode(oe) === e.ownerDocument
+ });
+ var ae = function(e, t) {
+ return "none" === (e = t || e).style.display || "" === e.style.display && ie(e) && "none" === S.css(e,
+ "display")
+ };
+
+ function se(e, t, n, r) {
+ var i, o, a = 20,
+ s = r ? function() {
+ return r.cur()
+ } : function() {
+ return S.css(e, t, "")
+ },
+ u = s(),
+ l = n && n[3] || (S.cssNumber[t] ? "" : "px"),
+ c = e.nodeType && (S.cssNumber[t] || "px" !== l && +u) && te.exec(S.css(e, t));
+ if (c && c[3] !== l) {
+ u /= 2, l = l || c[3], c = +u || 1;
+ while (a--) S.style(e, t, c + l), (1 - o) * (1 - (o = s() / u || .5)) <= 0 && (a = 0), c /= o;
+ c *= 2, S.style(e, t, c + l), n = n || []
+ }
+ return n && (c = +c || +u || 0, i = n[1] ? c + (n[1] + 1) * n[2] : +n[2], r && (r.unit = l, r.start = c, r
+ .end = i)), i
+ }
+ var ue = {};
+
+ function le(e, t) {
+ for (var n, r, i, o, a, s, u, l = [], c = 0, f = e.length; c < f; c++)(r = e[c]).style && (n = r.style
+ .display, t ? ("none" === n && (l[c] = Y.get(r, "display") || null, l[c] || (r.style.display = "")),
+ "" === r.style.display && ae(r) && (l[c] = (u = a = o = void 0, a = (i = r).ownerDocument, s = i
+ .nodeName, (u = ue[s]) || (o = a.body.appendChild(a.createElement(s)), u = S.css(o,
+ "display"), o.parentNode.removeChild(o), "none" === u && (u = "block"), ue[s] =
+ u)))) : "none" !== n && (l[c] = "none", Y.set(r, "display", n)));
+ for (c = 0; c < f; c++) null != l[c] && (e[c].style.display = l[c]);
+ return e
+ }
+ S.fn.extend({
+ show: function() {
+ return le(this, !0)
+ },
+ hide: function() {
+ return le(this)
+ },
+ toggle: function(e) {
+ return "boolean" == typeof e ? e ? this.show() : this.hide() : this.each(function() {
+ ae(this) ? S(this).show() : S(this).hide()
+ })
+ }
+ });
+ var ce, fe, pe = /^(?:checkbox|radio)$/i,
+ de = /<([a-z][^\/\0>\x20\t\r\n\f]*)/i,
+ he = /^$|^module$|\/(?:java|ecma)script/i;
+ ce = E.createDocumentFragment().appendChild(E.createElement("div")), (fe = E.createElement("input"))
+ .setAttribute("type", "radio"), fe.setAttribute("checked", "checked"), fe.setAttribute("name", "t"), ce
+ .appendChild(fe), y.checkClone = ce.cloneNode(!0).cloneNode(!0).lastChild.checked, ce.innerHTML =
+ "", y.noCloneChecked = !!ce.cloneNode(!0).lastChild.defaultValue, ce.innerHTML =
+ "", y.option = !!ce.lastChild;
+ var ge = {
+ thead: [1, "| "; //窗口内容
+ if (this._pic != ""){infotxt += " | ";
+ if (this._lawfirm !=""){infotxt += "公司：" + this._lawfirm + " |
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+